{"meta":{"query_hash":"c1ca6edec225","filters":{"venue":"Computational Optimization and Applications"},"cohort_total":73,"direct_labels_cover":0,"predictions_cover":73,"exported":73,"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/c1ca6edec225","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Optimization+and+Applications"},"results":[{"id":"W1525133469","doi":"10.1023/a:1008787027641","title":"A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities","year":2000,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","score_opus":0.0379339446005809,"score_gpt":0.33932695613064007,"score_spread":0.30139301153005915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525133469","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.003653321,0.00005106901,0.9940328,0.00008562838,0.00002408906,0.000042654454,0.000028674425,0.00022053326,0.0018611932],"genre_scores_gemma":[0.07338588,0.00010370575,0.9228226,0.00007545373,0.00004097984,0.00016727725,0.00022821761,0.00021804338,0.0029577683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920684,0.00017434734,0.000039350434,0.00016888464,0.00032614986,0.00008452479],"domain_scores_gemma":[0.99825734,0.0010853396,0.00009559024,0.00020672279,0.000279836,0.00007515963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641325,0.0010141901,0.0013418889,0.0013350004,0.0007301989,0.0015579351,0.0021793873,0.0017091946,0.00774025],"category_scores_gemma":[0.0051659,0.0009024724,0.0014023768,0.0017009516,0.0010682172,0.0015090398,0.002614451,0.004075406,0.0013075573],"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.00025887328,0.0002458827,0.00068327616,0.00022046395,0.00007424862,0.00011535582,0.0002328319,0.3169681,0.006837622,0.13947219,0.010141436,0.5247497],"study_design_scores_gemma":[0.00004813532,0.00005112683,0.00011476625,0.000013284841,0.000011668483,0.00003624225,0.000024266456,0.9644319,0.0012468938,0.031161176,0.0028499577,0.000010646417],"about_ca_topic_score_codex":0.003284077,"about_ca_topic_score_gemma":0.003675471,"teacher_disagreement_score":0.00774025,"about_ca_system_score_codex":0.001024753,"about_ca_system_score_gemma":0.0016122544,"threshold_uncertainty_score":0.025893748},"labels":[],"label_agreement":null},{"id":"W1636353766","doi":"10.1023/a:1011219303531","title":"A Cutting Plane Method for Solving Quasimonotone Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":19,"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; Variational inequality; Monotonic function; Applied mathematics; Cutting-plane method; Mathematical optimization; Calculus (dental); Mathematical analysis; Integer programming","score_opus":0.023075093248227378,"score_gpt":0.3029777985616544,"score_spread":0.27990270531342704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636353766","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.0016290343,0.000103942875,0.99640924,0.00004638136,0.00005703737,0.000029658488,0.000030926094,0.0000678597,0.0016259402],"genre_scores_gemma":[0.04413477,0.00028698464,0.95027393,0.00011938318,0.000073278534,0.00025686866,0.00015747387,0.00013757478,0.0045597916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995309,0.00012377105,0.000023724459,0.00007480515,0.00020816736,0.00003860184],"domain_scores_gemma":[0.9996131,0.0002049692,0.000031389427,0.000045084966,0.00008090813,0.000024558834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011712823,0.0011919412,0.0013656404,0.00091084634,0.00074816484,0.0011398346,0.0017208526,0.0018126147,0.0072090784],"category_scores_gemma":[0.001752758,0.0008788339,0.0013277789,0.0010861931,0.0008980086,0.0011188138,0.0016569732,0.0030875702,0.0010856164],"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.0002315661,0.00025229147,0.00046220628,0.00040705627,0.00015332049,0.00015833684,0.00017663286,0.3779835,0.016136995,0.23283072,0.007374563,0.36383274],"study_design_scores_gemma":[0.000028485838,0.00006882777,0.00012216109,0.000020603462,0.000020143465,0.00004498944,0.000013107428,0.9623045,0.0010702957,0.030755315,0.005537325,0.000014296748],"about_ca_topic_score_codex":0.002216709,"about_ca_topic_score_gemma":0.0028251333,"teacher_disagreement_score":0.0072090784,"about_ca_system_score_codex":0.00051985064,"about_ca_system_score_gemma":0.0009472399,"threshold_uncertainty_score":0.024116814},"labels":[],"label_agreement":null},{"id":"W1648726702","doi":"10.1007/s10589-015-9779-8","title":"Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"VLSI and FPGA Design Techniques","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":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Semidefinite programming; Maximum cut; Eigenvalues and eigenvectors; Quadratic programming; Adjacency matrix; Graph partition; Combinatorics; Laplacian matrix; Vertex (graph theory); Quadratic equation; Mathematical optimization; Graph","score_opus":0.02330850243936596,"score_gpt":0.2572272012488267,"score_spread":0.23391869880946073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648726702","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.008420896,0.0004007917,0.9815776,0.0007970717,0.00009892722,0.000049954044,0.000120884695,0.000088645575,0.008445292],"genre_scores_gemma":[0.29076487,0.001335819,0.6862729,0.00071519014,0.00046045912,0.0006143929,0.00060896616,0.00054957846,0.018677816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882525,0.00055224076,0.00004219236,0.00017239281,0.00031576294,0.00009212399],"domain_scores_gemma":[0.9961003,0.0031071897,0.00020389663,0.00014823176,0.00031812218,0.00012232228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025500208,0.0014775243,0.0012414231,0.0009609189,0.00067821535,0.0019920138,0.0013530873,0.0018573285,0.005823901],"category_scores_gemma":[0.0077733765,0.0006978043,0.0009765066,0.0013225948,0.0014615406,0.0021803062,0.0014102719,0.0035427492,0.0006836483],"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.00020992699,0.00029100289,0.00040125378,0.00043555957,0.00006168547,0.00018362024,0.0002094213,0.6729216,0.0029053579,0.2463779,0.013925675,0.062076975],"study_design_scores_gemma":[0.000026107235,0.00004628291,0.000121986224,0.000027477032,0.000010502604,0.00006886998,0.00004311438,0.9142911,0.00034186308,0.083393306,0.0016155463,0.0000137965935],"about_ca_topic_score_codex":0.0021633995,"about_ca_topic_score_gemma":0.0027486219,"teacher_disagreement_score":0.005823901,"about_ca_system_score_codex":0.0009921683,"about_ca_system_score_gemma":0.0012990785,"threshold_uncertainty_score":0.01948291},"labels":[],"label_agreement":null},{"id":"W185892825","doi":"10.1023/a:1021806200854","title":"Portfolio Selection and Transactions Costs","year":2003,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Portfolio; Mathematics; Upper and lower bounds; Selection (genetic algorithm); Asset (computer security); Mathematical optimization; Covariance matrix; Econometrics; Finance; Statistics; Economics; Computer science","score_opus":0.030158023478763972,"score_gpt":0.32938959606335677,"score_spread":0.2992315725845928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185892825","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.14839476,0.012854948,0.7920521,0.0061331564,0.0004333901,0.00005532251,0.00022052972,0.00014411187,0.03971163],"genre_scores_gemma":[0.93721545,0.004136318,0.037008293,0.00018851788,0.00043069245,0.000085824926,0.00019462752,0.0000764431,0.02066382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986578,0.0007573768,0.000050280636,0.00015490437,0.00029066988,0.00008891101],"domain_scores_gemma":[0.98957765,0.008362175,0.00073326926,0.00048951653,0.00057165476,0.00026578028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023381272,0.00071716704,0.0012252267,0.0011230669,0.0003923959,0.0029659125,0.0009203689,0.0016551063,0.007510432],"category_scores_gemma":[0.022822674,0.0005103788,0.0005076484,0.0020112244,0.0013278257,0.0041257036,0.0009880004,0.0017452203,0.0005455293],"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.000091120804,0.000048257847,0.0015613793,0.00009667142,0.00007788551,0.00010066358,0.00004728358,0.37900695,0.00026795894,0.57380027,0.003631975,0.041269604],"study_design_scores_gemma":[0.000014843857,0.000019863595,0.0006079324,0.000026191481,0.000022087583,0.0000580447,0.000019911447,0.47467968,0.00018267226,0.5220705,0.002288662,0.000009564255],"about_ca_topic_score_codex":0.0011248646,"about_ca_topic_score_gemma":0.0008921794,"teacher_disagreement_score":0.007510432,"about_ca_system_score_codex":0.0012549326,"about_ca_system_score_gemma":0.0007373513,"threshold_uncertainty_score":0.025124848},"labels":[],"label_agreement":null},{"id":"W1964916956","doi":"10.1007/s10589-012-9480-0","title":"Strong duality and minimal representations for cone optimization","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":65,"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":"Second-order cone programming; Strong duality; Duality (order theory); Mathematics; Complementarity (molecular biology); Mathematical optimization; Conic optimization; Interior point method; Weak duality; Duality gap; Cone (formal languages); Linear programming; Linear complementarity problem; Preprocessor; Complementarity theory; Semidefinite programming; Wolfe duality; Optimization problem; Algorithm; Discrete mathematics; Convex optimization; Computer science; Convex analysis; Nonlinear system; Geometry","score_opus":0.08166275618822488,"score_gpt":0.4123049513317906,"score_spread":0.33064219514356574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964916956","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.026127648,0.0011281219,0.9391246,0.0019007659,0.00019908794,0.000035098943,0.00020965542,0.00015119475,0.031123918],"genre_scores_gemma":[0.69250244,0.0022307504,0.27247286,0.0010283483,0.00091713795,0.0003296139,0.00080941187,0.00047294592,0.029236492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.0005467509,0.000053334104,0.00016001734,0.00028933838,0.00009583253],"domain_scores_gemma":[0.9978523,0.0011441539,0.00017755231,0.00028672646,0.00030651444,0.00023264633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002456891,0.0011907927,0.001335972,0.001547013,0.0011092615,0.003592515,0.0017377432,0.001217165,0.005703254],"category_scores_gemma":[0.007820705,0.0006900596,0.001269191,0.0014809106,0.0030565131,0.006311529,0.003552136,0.0064619617,0.00064609153],"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.000010260097,0.000012095738,0.00003999197,0.000020317377,0.0000041719395,0.000006586155,0.000033968045,0.0017421129,0.00012763498,0.99305034,0.0008342387,0.004118279],"study_design_scores_gemma":[0.0000035479402,0.0000065920253,0.000022538781,0.000007700269,0.0000026258253,0.000009262132,0.000012016225,0.013633507,0.00006408509,0.98523235,0.0010030209,0.0000028690092],"about_ca_topic_score_codex":0.00076684577,"about_ca_topic_score_gemma":0.0009341261,"teacher_disagreement_score":0.005703254,"about_ca_system_score_codex":0.0012156988,"about_ca_system_score_gemma":0.0010661397,"threshold_uncertainty_score":0.019079268},"labels":[],"label_agreement":null},{"id":"W1969794772","doi":"10.1007/s10589-010-9380-0","title":"Heuristics for a project management problem with incompatibility and assignment costs","year":2010,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Heuristics; Duration (music); Mathematical optimization; Tabu search; Set (abstract data type); Heuristic; Mathematics; Project management; Computer science; Operations research","score_opus":0.039840321685528014,"score_gpt":0.3602183300798796,"score_spread":0.32037800839435154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969794772","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.09833261,0.0009908782,0.88747126,0.000823087,0.00015869223,0.00055757375,0.00039039084,0.0003901186,0.0108854445],"genre_scores_gemma":[0.43935484,0.0006657909,0.5548484,0.00022445632,0.000135387,0.0007072386,0.00045991628,0.00014431676,0.0034597039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801254,0.0011619016,0.00008394254,0.00020875681,0.00025469565,0.0002780422],"domain_scores_gemma":[0.9916319,0.007235248,0.00038650967,0.00020423441,0.00025991444,0.00028209653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038104753,0.0015994004,0.0024647615,0.00309834,0.001247261,0.0027874438,0.0029780508,0.0031161178,0.0047119693],"category_scores_gemma":[0.009884082,0.001810455,0.0017678156,0.004172158,0.0015803131,0.0026966303,0.0017303169,0.0023151482,0.0003040539],"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.00010594114,0.00012492527,0.00030825584,0.000114587594,0.00005578974,0.0000739173,0.00006955347,0.96106356,0.00028550363,0.018887797,0.0012539275,0.017656196],"study_design_scores_gemma":[0.000083672596,0.000051818854,0.0001463136,0.000021822389,0.000034025892,0.000025087564,0.000036528483,0.9813519,0.0001564676,0.01740305,0.0006759922,0.000013284546],"about_ca_topic_score_codex":0.00940188,"about_ca_topic_score_gemma":0.0107120555,"teacher_disagreement_score":0.00940188,"about_ca_system_score_codex":0.0028303703,"about_ca_system_score_gemma":0.0030585944,"threshold_uncertainty_score":0.020535886},"labels":[],"label_agreement":null},{"id":"W1974846298","doi":"10.1007/s10589-012-9473-z","title":"Improved constraint consensus methods for seeking feasibility in nonlinear programs","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"Carleton University","funders":"","keywords":"Solver; Mathematical optimization; Constraint (computer-aided design); Mathematics; Nonlinear system; Trust region; Set (abstract data type); Point (geometry); Quadratic equation; Simple (philosophy); Nonlinear programming; Algorithm; Computer science","score_opus":0.11300995214938463,"score_gpt":0.4626816648866754,"score_spread":0.34967171273729075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974846298","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.0029851508,0.00010112175,0.9949698,0.000079340265,0.000037064274,0.000031162563,0.000020791293,0.00006317931,0.001712438],"genre_scores_gemma":[0.26778996,0.00043689937,0.7226077,0.0001989842,0.00017785445,0.00058072835,0.00025783863,0.00034576503,0.007604344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987697,0.0005015884,0.00006371748,0.0001645388,0.0004182807,0.0000821896],"domain_scores_gemma":[0.9939162,0.004231421,0.00029131412,0.0003855191,0.0009985977,0.00017689023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032700577,0.001346013,0.0016884732,0.0012647604,0.0009395123,0.0013553777,0.0024224077,0.0019623898,0.005680502],"category_scores_gemma":[0.013080163,0.000883045,0.0009470612,0.0015421235,0.0014107615,0.0025404512,0.00287988,0.0030393777,0.00068821345],"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.00011416982,0.000065950706,0.0001849501,0.0001578809,0.00005617725,0.0000602698,0.0001100658,0.8681129,0.0019040877,0.07398104,0.0023445797,0.052907962],"study_design_scores_gemma":[0.000009319045,0.000010403534,0.0000153388,0.0000040433415,0.0000029538392,0.0000032938538,0.0000041816293,0.99214315,0.00016877773,0.007359521,0.0002750263,0.0000040063014],"about_ca_topic_score_codex":0.0045698886,"about_ca_topic_score_gemma":0.00485371,"teacher_disagreement_score":0.005680502,"about_ca_system_score_codex":0.00095154333,"about_ca_system_score_gemma":0.0014673978,"threshold_uncertainty_score":0.019003153},"labels":[],"label_agreement":null},{"id":"W1975786171","doi":"10.1007/s10589-013-9627-7","title":"A smoothing augmented Lagrangian method for solving simple bilevel programs","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"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 Victoria","funders":"","keywords":"Augmented Lagrangian method; Karush–Kuhn–Tucker conditions; Mathematical optimization; Smoothing; Mathematics; Bilevel optimization; Simple (philosophy); Lagrangian relaxation; Penalty method; Optimization problem; Limit point; Bounded function; Constraint (computer-aided design); Bellman equation","score_opus":0.018538081270305245,"score_gpt":0.28482506808871527,"score_spread":0.26628698681841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975786171","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.0025563054,0.00006583516,0.9960181,0.000043241882,0.000038938502,0.000018130326,0.000022045431,0.00016099315,0.0010763372],"genre_scores_gemma":[0.112667486,0.00022537238,0.8794926,0.00009581935,0.000076360775,0.00020908342,0.00016964822,0.00033306703,0.006730617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.00013334454,0.000022854327,0.000045860797,0.0001594553,0.000028634844],"domain_scores_gemma":[0.9990433,0.0005221842,0.00006499657,0.00013146947,0.00017424535,0.00006373287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010834143,0.00082439336,0.0014373761,0.00067546294,0.00061903393,0.0010808052,0.0013165277,0.0013853882,0.0040460746],"category_scores_gemma":[0.003010276,0.00074093585,0.0009826182,0.0012105065,0.0009844857,0.0011727314,0.0017269219,0.0020825684,0.00091665203],"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.000115341936,0.00011195315,0.0003990498,0.00021265187,0.00009029303,0.00009543178,0.00011905855,0.7238091,0.0055155563,0.12827992,0.0036961655,0.13755548],"study_design_scores_gemma":[0.0000068912404,0.000013551145,0.000026007494,0.000004890309,0.0000046646437,0.0000075848334,0.0000036257566,0.98690885,0.00024559596,0.011495287,0.001277248,0.0000058664064],"about_ca_topic_score_codex":0.003167257,"about_ca_topic_score_gemma":0.005007406,"teacher_disagreement_score":0.0040460746,"about_ca_system_score_codex":0.0004140968,"about_ca_system_score_gemma":0.0014293323,"threshold_uncertainty_score":0.0135355},"labels":[],"label_agreement":null},{"id":"W1982566213","doi":"10.1007/s10589-015-9751-7","title":"Scenario generation for stochastic optimization problems via the sparse grid method","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"York University","funders":"Office of Naval Research; U.S. Department of Energy","keywords":"Sparse grid; Mathematics; Mathematical optimization; Discretization; Univariate; Quasi-Monte Carlo method; Grid; Applied mathematics; Monte Carlo method; Markov chain Monte Carlo; Hybrid Monte Carlo; Multivariate statistics; Statistics; Mathematical analysis","score_opus":0.15939405150286576,"score_gpt":0.35937311730166466,"score_spread":0.1999790657987989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982566213","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.004753843,0.000074793,0.99339926,0.00011618331,0.000027610015,0.000033348082,0.000073000534,0.00009389791,0.0014281508],"genre_scores_gemma":[0.5494677,0.00042108353,0.44528937,0.00018011092,0.00009484157,0.0005449465,0.0006654689,0.00024436775,0.0030922042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928916,0.00041737466,0.000024938494,0.00006198752,0.00015683734,0.000049682232],"domain_scores_gemma":[0.9969338,0.002330297,0.00017688394,0.00020630937,0.00024288445,0.00010975801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017582573,0.00065193366,0.001225603,0.0008082603,0.00042557047,0.00084495754,0.0013700246,0.0010262639,0.004466115],"category_scores_gemma":[0.006727468,0.0007314751,0.0009541502,0.0011151041,0.0008278121,0.0015417851,0.001804383,0.0014421332,0.0005561602],"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.000042364354,0.000017244152,0.00018221248,0.00003831515,0.000022239405,0.000038440685,0.000018950015,0.94658524,0.00030528556,0.04320983,0.0007642915,0.0087755285],"study_design_scores_gemma":[0.0000063194766,0.000004393358,0.000014874521,0.0000021467786,0.0000011791725,0.0000045751535,0.0000021194237,0.98663586,0.000036567475,0.013128743,0.00016133387,0.0000019053027],"about_ca_topic_score_codex":0.0028915738,"about_ca_topic_score_gemma":0.002850915,"teacher_disagreement_score":0.004466115,"about_ca_system_score_codex":0.0005974285,"about_ca_system_score_gemma":0.0010506966,"threshold_uncertainty_score":0.0149406195},"labels":[],"label_agreement":null},{"id":"W1987364022","doi":"10.1007/s10589-007-9157-2","title":"A stable primal–dual approach for linear programming under nondegeneracy assumptions","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"University of Waterloo","funders":"","keywords":"Mathematics; Solver; Jacobian matrix and determinant; Interior point method; Applied mathematics; Linearization; Iterated function; Mathematical optimization; Simple (philosophy); Matrix (chemical analysis); Nonlinear system; Mathematical analysis","score_opus":0.07123505202571571,"score_gpt":0.3926121186801358,"score_spread":0.32137706665442006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987364022","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.0032338167,0.00016779572,0.99150014,0.00027206494,0.00007989996,0.00003749435,0.000045634337,0.000044905984,0.0046181954],"genre_scores_gemma":[0.32686418,0.0009412055,0.65195256,0.0004748631,0.00047890455,0.00063125975,0.00033820138,0.00037722578,0.017941564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888235,0.0005863136,0.000039430503,0.00014357055,0.00029362112,0.000054714186],"domain_scores_gemma":[0.99815315,0.0010646726,0.00011768319,0.00021081905,0.0003529767,0.00010070652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034158814,0.001577169,0.0013224777,0.0010399702,0.0010842264,0.0023367817,0.0019674872,0.0017194157,0.006447724],"category_scores_gemma":[0.007605305,0.0010245963,0.0011327417,0.001102264,0.0019663216,0.0024906003,0.003795146,0.0038850375,0.0014654937],"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.00017785878,0.00011224165,0.00023387525,0.00016495843,0.00007899333,0.00014008454,0.00015230488,0.13729727,0.003151686,0.81264305,0.004578123,0.041269433],"study_design_scores_gemma":[0.000029828549,0.000040804596,0.000040695624,0.000019258776,0.000012681486,0.00003618284,0.00001714292,0.71247405,0.0006116622,0.2847018,0.0020047124,0.000011223115],"about_ca_topic_score_codex":0.0008933767,"about_ca_topic_score_gemma":0.0010822528,"teacher_disagreement_score":0.006447724,"about_ca_system_score_codex":0.0009086061,"about_ca_system_score_gemma":0.0014078578,"threshold_uncertainty_score":0.021569788},"labels":[],"label_agreement":null},{"id":"W1999418275","doi":"10.1007/s10589-013-9634-8","title":"Robust least square semidefinite programming with applications","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Robustification; Mathematics; Mathematical optimization; Semidefinite embedding; Rounding; Duality (order theory); Sequence (biology); Interior point method; Cartesian product; Duality gap; Linear programming; Feasible region; Optimization problem; Computer science; Quadratically constrained quadratic program; Discrete mathematics; Quadratic programming","score_opus":0.013506021585064452,"score_gpt":0.20815008141569386,"score_spread":0.1946440598306294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999418275","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.0013152647,0.0004957387,0.9914029,0.00049443136,0.000121657235,0.000020707694,0.00008849031,0.00017945412,0.0058812406],"genre_scores_gemma":[0.16309191,0.0026886961,0.80772585,0.00060433784,0.0007274705,0.00041027385,0.00047347703,0.00092088094,0.023357084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878186,0.0005689538,0.000051917807,0.00018509066,0.000367596,0.000044638127],"domain_scores_gemma":[0.9955871,0.0029107346,0.0003074712,0.0003487675,0.00072547427,0.000120396646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019725526,0.0019944678,0.001393866,0.00072431687,0.0004017638,0.0014675263,0.001134296,0.0015127661,0.007816088],"category_scores_gemma":[0.008613553,0.0007786523,0.0007354887,0.001776384,0.001748301,0.0014402247,0.0022143417,0.0037444704,0.0021673732],"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.00013030673,0.00026326661,0.00021695677,0.0006988569,0.00008677766,0.0001880981,0.00020829936,0.35786203,0.005161465,0.41022864,0.036585405,0.18837005],"study_design_scores_gemma":[0.000015611176,0.00004679668,0.00004919858,0.000033676693,0.000009939017,0.000057023586,0.000023499832,0.8611103,0.0011634226,0.13067211,0.0068015307,0.000016879016],"about_ca_topic_score_codex":0.00089482026,"about_ca_topic_score_gemma":0.0009875374,"teacher_disagreement_score":0.007816088,"about_ca_system_score_codex":0.0004899842,"about_ca_system_score_gemma":0.0009762722,"threshold_uncertainty_score":0.026147366},"labels":[],"label_agreement":null},{"id":"W2007103412","doi":"10.1007/s10589-005-4612-4","title":"A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":160,"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; Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematics; Trust region; Quadratic equation; Nonlinear system; Constraint (computer-aided design); Mathematical optimization; Sequential quadratic programming; Nonlinear programming; Algorithm; Type (biology); Software; Quadratic programming; Applied mathematics; Computer science; Optimization problem; Geometry","score_opus":0.022696821766594384,"score_gpt":0.31365902099926707,"score_spread":0.2909621992326727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007103412","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.002331394,0.00020381327,0.99654984,0.00006071961,0.000018734972,0.000013827285,0.000007429982,0.00008797313,0.0007261526],"genre_scores_gemma":[0.12998375,0.0006571963,0.8659523,0.000046262663,0.000051263512,0.00010953919,0.00004546575,0.00023935757,0.0029149659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.0004527553,0.000040367995,0.000087112334,0.00024328445,0.000039722785],"domain_scores_gemma":[0.99441826,0.0039843847,0.00015445211,0.00034570714,0.0009668906,0.00013032567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032286886,0.00085264747,0.00119854,0.00046342696,0.0005109578,0.0014236226,0.0014031524,0.0015476973,0.0034341344],"category_scores_gemma":[0.011247742,0.0007378855,0.0009197876,0.00070710166,0.0011867739,0.0021617417,0.0016125084,0.0027138032,0.00096551294],"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.00035286858,0.00017728683,0.0005034915,0.00032142596,0.00008291709,0.00013741956,0.00040121193,0.6736961,0.0046596117,0.11917054,0.0031659198,0.19733119],"study_design_scores_gemma":[0.000012534962,0.00003647487,0.000024395647,0.000009196453,0.0000068435697,0.00002470851,0.000008264791,0.99135196,0.00074209,0.006789902,0.0009856028,0.000008031378],"about_ca_topic_score_codex":0.005174519,"about_ca_topic_score_gemma":0.0025334563,"teacher_disagreement_score":0.005174519,"about_ca_system_score_codex":0.00061647873,"about_ca_system_score_gemma":0.0011720369,"threshold_uncertainty_score":0.017075181},"labels":[],"label_agreement":null},{"id":"W2008541170","doi":"10.1007/s10589-014-9670-z","title":"A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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 Windsor","funders":"Deakin University","keywords":"Multileaf collimator; Computer science; Mathematical optimization; Search tree; Focus (optics); Parallel algorithm; Computation; Parallel computing; Algorithm; Mathematics; Search algorithm; Radiation treatment planning","score_opus":0.019811482105355254,"score_gpt":0.2908437563214109,"score_spread":0.27103227421605564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008541170","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.0030491822,0.00040518199,0.99175745,0.000334735,0.000110621215,0.00006104459,0.00004358327,0.0001954299,0.0040426278],"genre_scores_gemma":[0.16364437,0.0006052329,0.8258142,0.00031729255,0.00020845915,0.000449152,0.00017257364,0.00059142197,0.008197287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931014,0.0002692654,0.000032754033,0.00007330062,0.0002616436,0.000052944746],"domain_scores_gemma":[0.9991423,0.0005545739,0.000057046844,0.00005260837,0.0001566693,0.000036865105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013219683,0.0010722552,0.0014511324,0.00061313517,0.0007414306,0.0011938625,0.0020980132,0.0018390663,0.004946751],"category_scores_gemma":[0.0037613628,0.0010266472,0.0013228619,0.0013395591,0.0010246626,0.0011917208,0.001843347,0.0021188173,0.00085723796],"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.000060251572,0.000031177067,0.00008071584,0.000113075075,0.00003139146,0.000046771536,0.000040948977,0.95174026,0.0009429859,0.013605539,0.0015622802,0.031744707],"study_design_scores_gemma":[0.000020795147,0.000012655137,0.000029111241,0.000005936334,0.000005837254,0.000012864322,0.0000048561324,0.9918938,0.00017856639,0.0067964774,0.0010343075,0.0000046767195],"about_ca_topic_score_codex":0.0078036697,"about_ca_topic_score_gemma":0.007050834,"teacher_disagreement_score":0.0078036697,"about_ca_system_score_codex":0.00086449785,"about_ca_system_score_gemma":0.0016023269,"threshold_uncertainty_score":0.016548514},"labels":[],"label_agreement":null},{"id":"W2009009651","doi":"10.1007/s10589-013-9596-x","title":"Lower bounds on the global minimum of a polynomial","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Semidefinite programming; Degree (music); Ball (mathematics); Polynomial; Computation; Discrete mathematics; Mathematical analysis; Algorithm; Mathematical optimization","score_opus":0.030582452357959092,"score_gpt":0.3310471121649883,"score_spread":0.3004646598070292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009009651","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.041557446,0.017146992,0.821028,0.0102129225,0.001337662,0.00014840701,0.0012926144,0.0009989693,0.106276944],"genre_scores_gemma":[0.6624931,0.0175326,0.2661268,0.003714998,0.0039427667,0.0010143714,0.0028570937,0.0025473705,0.03977093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583685,0.0012407938,0.00014928293,0.0008296435,0.001181666,0.0007616806],"domain_scores_gemma":[0.96103674,0.031661697,0.0013152754,0.0027311211,0.002031365,0.0012237555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006999485,0.004715911,0.003173601,0.0040120343,0.0018672176,0.0049893144,0.004366004,0.0037670615,0.016847907],"category_scores_gemma":[0.047617327,0.0012884266,0.0020744978,0.0042074467,0.0047382126,0.0097508365,0.0074972245,0.012930814,0.003882855],"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.0014244568,0.00030732897,0.0017240341,0.0018878051,0.0002860151,0.00027215946,0.0006617924,0.21527177,0.008277164,0.6330923,0.03771308,0.09908209],"study_design_scores_gemma":[0.0001092193,0.0002127288,0.0010392178,0.00045723756,0.00018115391,0.00027246962,0.00015435756,0.34705144,0.0037862246,0.6340952,0.012581638,0.00005917827],"about_ca_topic_score_codex":0.0011243696,"about_ca_topic_score_gemma":0.0023578173,"teacher_disagreement_score":0.016847907,"about_ca_system_score_codex":0.0028665548,"about_ca_system_score_gemma":0.0020770906,"threshold_uncertainty_score":0.056361854},"labels":[],"label_agreement":null},{"id":"W2011612932","doi":"10.1007/s10589-007-9122-0","title":"Benders, metric and cutset inequalities for multicommodity capacitated network design","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"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; Computer Research Institute of Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Metric (unit); Inequality; Context (archaeology); Mathematical optimization; Mathematical analysis","score_opus":0.059124732364864485,"score_gpt":0.325472630503332,"score_spread":0.26634789813846754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011612932","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.005615289,0.0013779649,0.9827088,0.0006809293,0.00019208068,0.00007368125,0.00021884669,0.00009195544,0.009040496],"genre_scores_gemma":[0.2937178,0.004729947,0.6729834,0.00073973223,0.0008199826,0.0007495534,0.0008440393,0.0002702924,0.025145223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815184,0.0008490554,0.00008140564,0.00024550862,0.00055003806,0.00012205118],"domain_scores_gemma":[0.99717015,0.0018280997,0.0002730145,0.00017326193,0.0004088213,0.00014669685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031340267,0.0024575524,0.0014561808,0.0015950241,0.0007670219,0.0023544142,0.0021190604,0.0020827497,0.0062647974],"category_scores_gemma":[0.008454911,0.0011134635,0.0012254805,0.003053726,0.001358568,0.0036951026,0.001537401,0.0038289297,0.00072869007],"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.00017429527,0.00012834629,0.0003642575,0.0003122517,0.00008212854,0.000085825464,0.00011294247,0.53229964,0.0018866537,0.36956412,0.009133499,0.085856125],"study_design_scores_gemma":[0.000020182733,0.00006452552,0.0001665792,0.000048822778,0.000024680767,0.000042318323,0.000027775646,0.74636376,0.00067746197,0.24703997,0.0055024484,0.000021372503],"about_ca_topic_score_codex":0.003643798,"about_ca_topic_score_gemma":0.0042499513,"teacher_disagreement_score":0.0062647974,"about_ca_system_score_codex":0.0021674167,"about_ca_system_score_gemma":0.0017071781,"threshold_uncertainty_score":0.020957887},"labels":[],"label_agreement":null},{"id":"W2013164640","doi":"10.1007/s10589-006-6449-x","title":"Optimizing Preventive Maintenance Models","year":2006,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":42,"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":"Mathematical optimization; Preventive maintenance; Spurious relationship; Minification; Scheduling (production processes); Hazard; Failure rate; Mathematics; Computer science; Function (biology); Reliability engineering; Statistics; Engineering","score_opus":0.0055769508890640114,"score_gpt":0.19736079289617944,"score_spread":0.19178384200711543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013164640","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.113525525,0.0015888804,0.8543527,0.0012933408,0.00020258302,0.0000927812,0.0006040766,0.00076856685,0.027571578],"genre_scores_gemma":[0.92768896,0.0005996082,0.057697643,0.00011919123,0.00008917328,0.00016027436,0.00042064287,0.00015438694,0.013070214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970007,0.00009564007,0.000009498312,0.000073598116,0.00007572804,0.000045478857],"domain_scores_gemma":[0.99924755,0.00046195192,0.00008918956,0.00008652615,0.00008069009,0.00003415604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064147264,0.0008421635,0.0011455291,0.00064696616,0.0003145312,0.0010359348,0.0013138796,0.0015680298,0.0040064477],"category_scores_gemma":[0.0028499314,0.0007231864,0.0007995482,0.00067702064,0.0005362212,0.0010464008,0.0005573632,0.000947848,0.0004163643],"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.000013389631,0.00001498191,0.000090158384,0.000014566736,0.000008049819,0.000010132068,0.0000055250825,0.9877281,0.00012182804,0.0074531776,0.00047039785,0.004069644],"study_design_scores_gemma":[0.0000039019415,0.000005503889,0.00003782073,0.0000022977738,0.0000047252097,0.0000038682765,0.0000015580795,0.9951485,0.000072096445,0.0045085773,0.0002097691,0.0000013988048],"about_ca_topic_score_codex":0.004306784,"about_ca_topic_score_gemma":0.003829928,"teacher_disagreement_score":0.004306784,"about_ca_system_score_codex":0.0011109884,"about_ca_system_score_gemma":0.001090443,"threshold_uncertainty_score":0.013402879},"labels":[],"label_agreement":null},{"id":"W2018727518","doi":"10.1007/s10589-013-9622-z","title":"Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convex conjugate; Conjugate residual method; Derivation of the conjugate gradient method; Conjugate; Piecewise; Convex function; Applied mathematics; Conjugate gradient method; Convex analysis; Regular polygon; Mathematical analysis; Convex optimization; Mathematical optimization; Computer science","score_opus":0.03456162899230268,"score_gpt":0.33283612322275286,"score_spread":0.29827449423045016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018727518","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.09263527,0.00011949647,0.9034584,0.000211273,0.000054423883,0.000023495764,0.00008219886,0.00026243497,0.003153032],"genre_scores_gemma":[0.7865429,0.00018747001,0.20799235,0.000071911796,0.000047586174,0.00004491632,0.0002923572,0.00028399387,0.004536533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994344,0.00021859001,0.000024156296,0.000072592535,0.00018071527,0.00006945872],"domain_scores_gemma":[0.997741,0.0013411014,0.00014466321,0.00024935184,0.00033071137,0.0001932447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017199371,0.00070428546,0.0010176154,0.0008989169,0.00039306862,0.00213303,0.000985241,0.0010252778,0.0050183493],"category_scores_gemma":[0.010376727,0.0005268024,0.00052599405,0.0009504039,0.0012425457,0.0021114713,0.0017632053,0.0015850458,0.00078357913],"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.00042076578,0.00011668859,0.0022325465,0.00019012293,0.000060670292,0.0001887544,0.00017646022,0.71413225,0.0068562175,0.1639729,0.0027572645,0.1088954],"study_design_scores_gemma":[0.000008030519,0.00004176042,0.00020962673,0.000009653631,0.0000067809287,0.000036036552,0.000034812067,0.9723833,0.0025481505,0.024175642,0.00053732755,0.000008915922],"about_ca_topic_score_codex":0.0011912896,"about_ca_topic_score_gemma":0.0013705003,"teacher_disagreement_score":0.0050183493,"about_ca_system_score_codex":0.0008514471,"about_ca_system_score_gemma":0.0011814411,"threshold_uncertainty_score":0.016788065},"labels":[],"label_agreement":null},{"id":"W2024962211","doi":"10.1007/s10589-005-3064-1","title":"The Complexity of Self-Regular Proximity Based Infeasible IPMs","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"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; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Interior point method; Path (computing); Function (biology); Simple (philosophy); Mathematical optimization; Dual (grammatical number); Point (geometry); Current (fluid); Combinatorics; Algorithm; Discrete mathematics; Computer science","score_opus":0.05987156577406685,"score_gpt":0.34935601883539363,"score_spread":0.2894844530613268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024962211","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.3517093,0.00095258537,0.60923654,0.0034543287,0.00014563203,0.00017701586,0.0014446421,0.00054805557,0.0323319],"genre_scores_gemma":[0.925869,0.00044606344,0.06571388,0.00019649847,0.00013045243,0.000181881,0.0008821312,0.0002235202,0.0063565467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733907,0.0008810488,0.0001521587,0.00040601377,0.0009327538,0.0002889798],"domain_scores_gemma":[0.96365786,0.030183202,0.0022961572,0.0019650883,0.0011954163,0.0007023035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029032074,0.00061596156,0.0017849513,0.0011793155,0.0010005364,0.0032478014,0.0020320283,0.0023960639,0.012035945],"category_scores_gemma":[0.042622544,0.00089327374,0.000977471,0.0017541653,0.0018457095,0.0056818915,0.0036103723,0.0022876302,0.00069715554],"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.0004001393,0.00011882206,0.0023635884,0.00036593433,0.000065435175,0.00033029367,0.0002443289,0.6822825,0.0008937793,0.27626017,0.005726,0.030949045],"study_design_scores_gemma":[0.0000336431,0.000039500046,0.0004439018,0.000018967898,0.0000135273485,0.0001426195,0.00008628895,0.78467864,0.00044636716,0.21336406,0.0007159663,0.000016514932],"about_ca_topic_score_codex":0.0012648092,"about_ca_topic_score_gemma":0.0011544323,"teacher_disagreement_score":0.012035945,"about_ca_system_score_codex":0.0014068573,"about_ca_system_score_gemma":0.0012997097,"threshold_uncertainty_score":0.04026419},"labels":[],"label_agreement":null},{"id":"W2041781650","doi":"10.1007/s10589-007-9126-9","title":"Algorithm for cardinality-constrained quadratic optimization","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":255,"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; Quadratic programming; Cardinality (data modeling); Mathematical optimization; Solver; Selection (genetic algorithm); Branch and bound; Quadratic equation; Optimization problem; Integer programming; Limit (mathematics); Integer (computer science); Computer science","score_opus":0.04823591415135936,"score_gpt":0.37538249784272015,"score_spread":0.3271465836913608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041781650","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.0019261024,0.00008295308,0.99555403,0.00015067821,0.00004200952,0.000038008297,0.00004219575,0.0002263368,0.0019376337],"genre_scores_gemma":[0.07663673,0.00014499879,0.9179668,0.0001961321,0.00007663976,0.00037253494,0.0002355988,0.00023982275,0.004130822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999046,0.00030903413,0.000052597432,0.0001326771,0.00036849198,0.000091124435],"domain_scores_gemma":[0.99703395,0.0017521098,0.0001501666,0.00034926107,0.00059224287,0.00012230892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022919648,0.0009578409,0.0015210253,0.0009416263,0.0007302803,0.0013219941,0.0023537602,0.0020499541,0.009780379],"category_scores_gemma":[0.009713081,0.00063291244,0.00077788695,0.0014618678,0.001056782,0.0021565116,0.0034055987,0.0024595838,0.0018766748],"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.00027492596,0.00016911414,0.00064078916,0.00019691595,0.00008488174,0.00006406751,0.00012222714,0.5393988,0.002170397,0.13267575,0.01128273,0.3129194],"study_design_scores_gemma":[0.000069639034,0.00003055904,0.00007597166,0.000014650059,0.000010909906,0.000029855666,0.000009211979,0.9658535,0.0004948752,0.031526837,0.0018761028,0.000007794476],"about_ca_topic_score_codex":0.0026638033,"about_ca_topic_score_gemma":0.0033337956,"teacher_disagreement_score":0.009780379,"about_ca_system_score_codex":0.0010379376,"about_ca_system_score_gemma":0.0022781543,"threshold_uncertainty_score":0.0327186},"labels":[],"label_agreement":null},{"id":"W2043363748","doi":"10.1007/s10589-011-9406-2","title":"Local path-following property of inexact interior methods in nonlinear programming","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","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":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Iterated function; Nonlinear system; Tangent; Interior point method; Newton's method; Applied mathematics; Nonlinear programming; Sequence (biology); Path (computing); Nonlinear complementarity problem; Perturbation (astronomy); Mathematical optimization; Complementarity theory; Mathematical analysis; Geometry; Computer science","score_opus":0.08395092464994196,"score_gpt":0.41112397220285224,"score_spread":0.32717304755291027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043363748","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.012902516,0.0005856396,0.97747654,0.00030160465,0.000075105265,0.00003636019,0.00007415569,0.00017634469,0.008371693],"genre_scores_gemma":[0.52529013,0.0024415425,0.4374537,0.0006025987,0.00022373624,0.00057948707,0.00055111194,0.0012319327,0.031625684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907,0.0003646068,0.000034447006,0.00015376366,0.0003262729,0.000050977585],"domain_scores_gemma":[0.9957194,0.002434318,0.0003835837,0.0005211834,0.0007191666,0.00022226198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021958526,0.0008898871,0.000945279,0.0009194568,0.0010478817,0.0013628082,0.0016261224,0.0012890041,0.0064296196],"category_scores_gemma":[0.012048096,0.0006085621,0.00096071576,0.0010378981,0.0024580902,0.0035566909,0.0035383957,0.004238557,0.0010217323],"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.00027763005,0.00008797601,0.0010064231,0.00054310844,0.00007282445,0.00020075821,0.000523304,0.16558026,0.008056705,0.722277,0.0055481256,0.0958258],"study_design_scores_gemma":[0.000043394637,0.0002120018,0.0003913638,0.00010143816,0.000039409057,0.00021943223,0.0000869789,0.6525861,0.0053708656,0.33138713,0.009526171,0.000035608075],"about_ca_topic_score_codex":0.0010483834,"about_ca_topic_score_gemma":0.0012494398,"teacher_disagreement_score":0.0064296196,"about_ca_system_score_codex":0.0005334764,"about_ca_system_score_gemma":0.0014257744,"threshold_uncertainty_score":0.02150917},"labels":[],"label_agreement":null},{"id":"W2046701389","doi":"10.1007/s10589-007-9024-1","title":"Clustering via minimum volume ellipsoids","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":23,"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":"Cluster analysis; Ellipsoid; Mathematics; Correlation clustering; k-medians clustering; CURE data clustering algorithm; Mathematical optimization; Cluster (spacecraft); Canopy clustering algorithm; Algorithm; Computer science; Statistics","score_opus":0.05582170527538512,"score_gpt":0.38760443783404097,"score_spread":0.33178273255865587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046701389","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.0060468325,0.0004761173,0.9909157,0.0002630222,0.000040289633,0.000057244546,0.000101098776,0.0002406188,0.0018589468],"genre_scores_gemma":[0.31302574,0.0011156378,0.67606395,0.00033053604,0.00020430103,0.00050077727,0.0008991394,0.0007222855,0.00713758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975013,0.0013365063,0.00010340665,0.00038650807,0.00055860775,0.00011360748],"domain_scores_gemma":[0.99184775,0.0054275263,0.0006202998,0.00082667836,0.0009957082,0.0002821251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036034593,0.0013664607,0.0033264759,0.0036609906,0.0013575307,0.003127837,0.0037382338,0.0034990963,0.0040960894],"category_scores_gemma":[0.019176343,0.0016607763,0.0016946758,0.002899618,0.0023520777,0.0036430813,0.0041233064,0.0023753808,0.0014108509],"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.00018301315,0.000034994126,0.00041206327,0.00027675225,0.0001170986,0.00005684767,0.0002311774,0.70665014,0.0017820088,0.21341859,0.0065514003,0.07028594],"study_design_scores_gemma":[0.000012717461,0.000011379026,0.00008103969,0.000020564137,0.000007351758,0.000030613985,0.000018066643,0.8895091,0.0003593545,0.10881397,0.001118353,0.000017344722],"about_ca_topic_score_codex":0.0038741392,"about_ca_topic_score_gemma":0.0025521975,"teacher_disagreement_score":0.0040960894,"about_ca_system_score_codex":0.0019055051,"about_ca_system_score_gemma":0.001197855,"threshold_uncertainty_score":0.019057155},"labels":[],"label_agreement":null},{"id":"W2057565823","doi":"10.1007/s10589-014-9687-3","title":"CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":339,"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","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Modular design; Fortran; MATLAB; Computer science; Parallel computing; Programming language; Algorithm; Computational science","score_opus":0.017438595689403612,"score_gpt":0.24961380206272565,"score_spread":0.23217520637332204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057565823","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.0035774405,0.00016794307,0.9442099,0.00015329427,0.00012795835,0.00010943293,0.00037771248,0.04653558,0.00474081],"genre_scores_gemma":[0.12470104,0.00024948717,0.8358855,0.00041877414,0.00009489687,0.00094965874,0.0016197896,0.028712135,0.0073686684],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968002,0.0010107756,0.00028610442,0.00041232095,0.0011330585,0.00035759233],"domain_scores_gemma":[0.9927291,0.0047155316,0.0003144475,0.0012191907,0.0007301682,0.00029150944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004355189,0.0025843668,0.0017397832,0.0013344384,0.0010980174,0.0030325023,0.0057745306,0.002454899,0.034239862],"category_scores_gemma":[0.015538161,0.002101523,0.002711503,0.0010961212,0.0021893387,0.0040639457,0.0049358234,0.0041870167,0.0072229197],"study_design_candidate":"bench_or_experimental","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.0025471202,0.00062937156,0.0039699003,0.001640475,0.0005153744,0.00080840354,0.0009418541,0.26607114,0.014147939,0.18504153,0.110258564,0.41342825],"study_design_scores_gemma":[0.0005495378,0.00013109793,0.0002747544,0.00011765491,0.000071662,0.0001628212,0.00006174093,0.8204925,0.009502192,0.12830582,0.0402349,0.00009529094],"about_ca_topic_score_codex":0.0020129413,"about_ca_topic_score_gemma":0.0036039592,"teacher_disagreement_score":0.034239862,"about_ca_system_score_codex":0.0007586296,"about_ca_system_score_gemma":0.0026102704,"threshold_uncertainty_score":0.114543736},"labels":[],"label_agreement":null},{"id":"W2057635030","doi":"10.1007/s10589-013-9544-9","title":"A cutting plane algorithm for the Capacitated Connected Facility Location Problem","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Facility location problem; 1-center problem; Integer programming; Mathematical optimization; Network planning and design; Branch and cut; Set (abstract data type); Set cover problem; Integer (computer science); Mathematics; Cutting-plane method; Theory of computation; Cover (algebra); Computer science; Algorithm; Computer network; Engineering","score_opus":0.014384514747038524,"score_gpt":0.2430500121766642,"score_spread":0.22866549742962566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057635030","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.004674876,0.00008236492,0.99234796,0.000076974306,0.00004171178,0.0000496504,0.000060110917,0.00022785905,0.0024385136],"genre_scores_gemma":[0.057999745,0.0001702041,0.9379981,0.000085812346,0.000038205548,0.0002530767,0.0003042814,0.00013353054,0.0030170765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996644,0.00007577244,0.000014853468,0.000060087805,0.0001441327,0.0000407763],"domain_scores_gemma":[0.9993364,0.00036925563,0.000044603406,0.000053764998,0.00015848337,0.000037508646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060953235,0.0010131607,0.0011306691,0.0010638575,0.00063614635,0.0011332451,0.0018844814,0.0019875653,0.0074984804],"category_scores_gemma":[0.002236864,0.00085539394,0.0010218638,0.0019030429,0.0005846262,0.0011036257,0.0013700208,0.0023380038,0.0012152386],"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.00013899281,0.00020020654,0.00039610662,0.00010841249,0.000058039874,0.000087209635,0.00008518529,0.6817281,0.0030528493,0.032306876,0.006277038,0.275561],"study_design_scores_gemma":[0.000033634107,0.000035994257,0.00007146879,0.000011485139,0.000010414105,0.000026211535,0.000011478405,0.9875788,0.0004921706,0.009718505,0.0020024155,0.0000074203153],"about_ca_topic_score_codex":0.005991849,"about_ca_topic_score_gemma":0.0052285367,"teacher_disagreement_score":0.0074984804,"about_ca_system_score_codex":0.00073977065,"about_ca_system_score_gemma":0.001444165,"threshold_uncertainty_score":0.025084913},"labels":[],"label_agreement":null},{"id":"W2061568192","doi":"10.1007/s10589-011-9432-0","title":"An exact method with variable fixing for solving the generalized assignment problem","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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; Simple (philosophy); Variable (mathematics); Weapon target assignment problem; Generalized assignment problem; Sequence (biology); Branch and cut; Branch and bound; Optimization problem; Augmented Lagrangian method; Lagrangian relaxation; Linear programming","score_opus":0.025524929425743054,"score_gpt":0.2797806794497151,"score_spread":0.25425575002397205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061568192","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.0012993349,0.00008274531,0.99687105,0.000047589783,0.00007166619,0.00002179403,0.000021802989,0.00009105119,0.0014930428],"genre_scores_gemma":[0.052609745,0.00022296412,0.94211555,0.00013949971,0.00010176821,0.00024237845,0.000103231425,0.00018720323,0.004277726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936134,0.00025715856,0.000019427727,0.00008031647,0.0002283896,0.00005345115],"domain_scores_gemma":[0.99927884,0.00042725494,0.00003689241,0.000109641325,0.000121253135,0.000026064063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011912431,0.0009988811,0.0010706556,0.00083655654,0.0006266721,0.0006226339,0.0018878902,0.0012946473,0.0057553165],"category_scores_gemma":[0.0037678005,0.0005821954,0.0010492802,0.0013242913,0.0009808864,0.0011344764,0.0014316835,0.0022111603,0.0010483623],"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.0000841859,0.00010390109,0.00024651847,0.0002091044,0.00007271979,0.00009156498,0.00008857618,0.65190214,0.0031149944,0.1440837,0.0060701664,0.19393244],"study_design_scores_gemma":[0.00002571781,0.000028222146,0.00005482292,0.000013231794,0.000011086111,0.000024536763,0.0000096406575,0.9683087,0.00041991827,0.028082209,0.0030111203,0.00001077976],"about_ca_topic_score_codex":0.005086162,"about_ca_topic_score_gemma":0.00510211,"teacher_disagreement_score":0.0057553165,"about_ca_system_score_codex":0.0004775499,"about_ca_system_score_gemma":0.0013499202,"threshold_uncertainty_score":0.019253433},"labels":[],"label_agreement":null},{"id":"W2067314231","doi":"10.1007/s10589-013-9635-7","title":"The generalized trust region subproblem","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":66,"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; Trust region; Bounded function; Parameterized complexity; Quadratic equation; Eigenvalues and eigenvectors; Constraint (computer-aided design); Combinatorics; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.009774008977502658,"score_gpt":0.23106854064144983,"score_spread":0.22129453166394716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067314231","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.0086068595,0.00035800476,0.9864319,0.0005290364,0.00007772575,0.00004590541,0.00010670071,0.00006881623,0.0037750448],"genre_scores_gemma":[0.55716926,0.001319754,0.42185754,0.00042703593,0.0005111348,0.00046417263,0.00063992286,0.00030923026,0.017301984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985247,0.00071690895,0.00004742876,0.00033087487,0.0002781897,0.0001019476],"domain_scores_gemma":[0.99686664,0.002087985,0.00021534061,0.00030825238,0.00038242468,0.000139354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016374984,0.0011626817,0.0018128243,0.00056218693,0.00040868524,0.0018753491,0.001429789,0.0022294724,0.0049374206],"category_scores_gemma":[0.008649843,0.0005864182,0.00074436335,0.0008686256,0.0015844904,0.002250802,0.0023578731,0.0019572712,0.0007847086],"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.00024795908,0.000068528854,0.00047578118,0.00044023426,0.000119287455,0.0003377599,0.00011523605,0.7781707,0.0024503078,0.13266294,0.009483987,0.07542716],"study_design_scores_gemma":[0.000030659587,0.000037552694,0.00008694512,0.000016961892,0.000014340931,0.000082069106,0.000022644075,0.94052434,0.00051085476,0.056958605,0.0017052942,0.000009731454],"about_ca_topic_score_codex":0.0029409612,"about_ca_topic_score_gemma":0.0017664983,"teacher_disagreement_score":0.0049374206,"about_ca_system_score_codex":0.00081732235,"about_ca_system_score_gemma":0.0015639821,"threshold_uncertainty_score":0.016517282},"labels":[],"label_agreement":null},{"id":"W2069942923","doi":"10.1007/s10589-012-9526-3","title":"Regularized robust optimization: the optimal portfolio execution case","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Mathematical optimization; Hessian matrix; Robust optimization; Regularization (linguistics); Mathematics; Optimization problem; Convex optimization; Solution set; Computer science; Portfolio optimization; Stability (learning theory); Portfolio; Set (abstract data type); Regular polygon; Applied mathematics","score_opus":0.04433641405925529,"score_gpt":0.3134835759124052,"score_spread":0.2691471618531499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069942923","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.09742965,0.00080463896,0.88123757,0.0017624091,0.00009789103,0.000068741545,0.00024367179,0.00024184518,0.018113462],"genre_scores_gemma":[0.90835476,0.0003279585,0.08361012,0.0001470985,0.000092822804,0.000082165585,0.00014747903,0.0001327122,0.00710483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986419,0.00066038145,0.000061068335,0.00021735695,0.00025498483,0.0001642865],"domain_scores_gemma":[0.9966066,0.0020458563,0.0005421833,0.00036710105,0.00025610096,0.00018211006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028405748,0.0009371659,0.0013776487,0.0005512344,0.00029471004,0.0020435436,0.0011124663,0.0020829162,0.003268367],"category_scores_gemma":[0.014114696,0.00060027716,0.0007270056,0.00078461546,0.0014121345,0.0022481573,0.0012331329,0.0016359797,0.00035853148],"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.00010811778,0.000047667123,0.00028068956,0.0000415929,0.000041414583,0.00015708974,0.000017745388,0.9318933,0.0005136175,0.059191305,0.00087748584,0.0068300553],"study_design_scores_gemma":[0.000013000081,0.000020531537,0.00006874656,0.0000051188254,0.0000071839636,0.00002260693,0.000004213081,0.9753914,0.00024093185,0.02402388,0.00019688887,0.000005581745],"about_ca_topic_score_codex":0.0021702999,"about_ca_topic_score_gemma":0.0012324513,"teacher_disagreement_score":0.003268367,"about_ca_system_score_codex":0.0007140879,"about_ca_system_score_gemma":0.001333229,"threshold_uncertainty_score":0.015022576},"labels":[],"label_agreement":null},{"id":"W2072726536","doi":"10.1007/s10589-013-9585-0","title":"Mixed-logit network pricing","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Sensitivity (control systems); Mixed logit; Discrete choice; Mathematical optimization; Revenue; Population; Logit; Point (geometry); Smoothing; Contrast (vision); Mathematics; Flow network; Econometrics; Computer science; Logistic regression; Operations research; Statistics; Economics; Artificial intelligence","score_opus":0.018514707159831854,"score_gpt":0.2650374377517137,"score_spread":0.24652273059188182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072726536","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.057725452,0.0007749365,0.89555764,0.0031098193,0.00033101407,0.0002314865,0.0012122665,0.0005662354,0.04049113],"genre_scores_gemma":[0.8504625,0.0006597072,0.099260315,0.00033008962,0.0002715237,0.0004377592,0.00061207305,0.00015320517,0.047812834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979662,0.0013275222,0.000049011614,0.00021972774,0.00025750583,0.00018004703],"domain_scores_gemma":[0.9963296,0.0027151534,0.00016717345,0.0003133498,0.0002853572,0.00018923426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025906307,0.0009895142,0.0017879852,0.0011556784,0.0007513436,0.0031362458,0.0031014846,0.0024936753,0.027415901],"category_scores_gemma":[0.012633749,0.0008629761,0.001294857,0.0018483433,0.0011312201,0.0052275597,0.0017712404,0.0021587692,0.0016323382],"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.00020104465,0.0002012218,0.0010023959,0.00010568128,0.00007574635,0.000120245364,0.00004802849,0.4870298,0.0001709111,0.47079787,0.009208302,0.031038765],"study_design_scores_gemma":[0.000020997519,0.000016003316,0.00009865899,0.0000073287674,0.000012894233,0.00002808198,0.000015537002,0.8793797,0.00005737067,0.11909112,0.001264331,0.000007958739],"about_ca_topic_score_codex":0.0048939623,"about_ca_topic_score_gemma":0.0073935385,"teacher_disagreement_score":0.027415901,"about_ca_system_score_codex":0.001975792,"about_ca_system_score_gemma":0.0013517097,"threshold_uncertainty_score":0.091715336},"labels":[],"label_agreement":null},{"id":"W2074149593","doi":"10.1007/s10589-007-9159-0","title":"Improved convergence order for augmented penalty algorithms","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Convergence (economics); Multiplier (economics); Quadratic equation; Order (exchange); Penalty method; Compact convergence; Mathematical optimization; Normal convergence; Applied mathematics; Convergence tests; Algorithm; Rate of convergence; Computer science; Key (lock)","score_opus":0.060841206311371424,"score_gpt":0.363099416639977,"score_spread":0.3022582103286056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074149593","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.017559612,0.0005717372,0.9708439,0.00038326875,0.00042042506,0.00006290101,0.00011182753,0.00038121696,0.009665084],"genre_scores_gemma":[0.34459507,0.0009568559,0.62244904,0.00040092066,0.0005478943,0.00036550395,0.00055528025,0.0011945379,0.028934946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711955,0.0012481037,0.00015897524,0.00023637619,0.0010034424,0.00023361496],"domain_scores_gemma":[0.9857497,0.007311524,0.00065468735,0.0023611241,0.003218924,0.0007039868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00486415,0.0016898174,0.0015092359,0.0016096124,0.0008740145,0.002500375,0.0021891252,0.0017278016,0.010477279],"category_scores_gemma":[0.02257493,0.00074190734,0.0009622698,0.0012699649,0.0019850035,0.0042868867,0.0030972166,0.004603555,0.0024776622],"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.0009046212,0.00021785616,0.0011689927,0.00045029697,0.00009022213,0.00017771705,0.00025837586,0.34344393,0.010048354,0.49746063,0.012832748,0.13294624],"study_design_scores_gemma":[0.000026633212,0.00008049708,0.00015583975,0.000026236961,0.000011799158,0.000044447755,0.00001472448,0.9420151,0.0018749343,0.05287188,0.0028603529,0.000017402075],"about_ca_topic_score_codex":0.0020538766,"about_ca_topic_score_gemma":0.002539288,"teacher_disagreement_score":0.010477279,"about_ca_system_score_codex":0.0012239564,"about_ca_system_score_gemma":0.0021135472,"threshold_uncertainty_score":0.035049975},"labels":[],"label_agreement":null},{"id":"W2077594413","doi":"10.1007/s10589-009-9266-1","title":"Globalization strategies for Mesh Adaptive Direct Search","year":2009,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":75,"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":"Mathematical optimization; Class (philosophy); Process (computing); Mathematics; Computer science; Artificial intelligence","score_opus":0.024249529158629077,"score_gpt":0.3052450481327324,"score_spread":0.2809955189741033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077594413","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.012072389,0.00091757666,0.9754592,0.00029876185,0.00014743004,0.00005725078,0.000051942287,0.00012219208,0.01087321],"genre_scores_gemma":[0.42422825,0.0016059801,0.54777586,0.0004323684,0.00022006984,0.0007234686,0.00031193646,0.0005626169,0.024139453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997389,0.00014404491,0.000013313598,0.000028272678,0.00005741761,0.000018038018],"domain_scores_gemma":[0.9990338,0.0006008825,0.000056214456,0.000107154294,0.00013782115,0.00006418533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596243,0.0008734934,0.0008240321,0.00086677686,0.0004957089,0.0008996547,0.0010758154,0.0009569862,0.005071982],"category_scores_gemma":[0.0048460304,0.0005421098,0.00070291763,0.0006041753,0.0011897865,0.0012817291,0.002371235,0.0013214609,0.00074489205],"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.0001583017,0.00010150113,0.00089106464,0.000309645,0.00010958593,0.0001439507,0.00025805272,0.4112353,0.004701083,0.42894104,0.008080374,0.14507012],"study_design_scores_gemma":[0.000023760795,0.000041688014,0.00013959681,0.000021130183,0.000012867223,0.000026778876,0.00002185155,0.9102957,0.00041597564,0.08581243,0.0031779057,0.000010287487],"about_ca_topic_score_codex":0.0013853195,"about_ca_topic_score_gemma":0.0016168084,"teacher_disagreement_score":0.005071982,"about_ca_system_score_codex":0.00042680328,"about_ca_system_score_gemma":0.0005062449,"threshold_uncertainty_score":0.016967416},"labels":[],"label_agreement":null},{"id":"W2081084362","doi":"10.1007/s10589-014-9654-z","title":"Solving semi-infinite programs by smoothing projected gradient method","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"University of Victoria","funders":"","keywords":"Mathematics; Smoothing; Mathematical optimization; Optimization problem; Lagrange multiplier; Applied mathematics; Function (biology)","score_opus":0.011142577973631333,"score_gpt":0.26006185511953944,"score_spread":0.2489192771459081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081084362","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.0038922383,0.0000806196,0.9946102,0.00007306185,0.000023672139,0.000018386263,0.00001754185,0.00015153197,0.0011327566],"genre_scores_gemma":[0.22463371,0.00025682227,0.7665942,0.0001770235,0.00008297415,0.0005424249,0.00024019582,0.00059115863,0.0068815285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990866,0.000437936,0.00004078201,0.00011207692,0.0002644044,0.000058192],"domain_scores_gemma":[0.9950782,0.0038042448,0.00018995319,0.00027029836,0.00044255747,0.0002147162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024249305,0.0011316135,0.0019058817,0.0008132217,0.0005901058,0.0014252566,0.0016829572,0.0020758417,0.0031285672],"category_scores_gemma":[0.007224151,0.0012298521,0.001096647,0.0007581334,0.0021335394,0.001950059,0.0028763355,0.0030870084,0.0005831748],"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.000104508596,0.000099580626,0.0002872366,0.0002214051,0.00006678383,0.000062573585,0.00009585328,0.8686655,0.0020543667,0.09449921,0.0016800355,0.032162882],"study_design_scores_gemma":[0.000006353553,0.00000825925,0.000012774987,0.000004354636,0.000002284513,0.000004332408,0.0000034587247,0.9846347,0.00016472173,0.014925173,0.00023065446,0.0000030735032],"about_ca_topic_score_codex":0.002883131,"about_ca_topic_score_gemma":0.003469004,"teacher_disagreement_score":0.0031285672,"about_ca_system_score_codex":0.00075319706,"about_ca_system_score_gemma":0.0019652103,"threshold_uncertainty_score":0.012824357},"labels":[],"label_agreement":null},{"id":"W2086286112","doi":"10.1007/s10589-008-9175-8","title":"Efficient preprocessing for VLSI optimization problems","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"McMaster University","funders":"","keywords":"Preprocessor; Solver; Very-large-scale integration; Computer science; Integer programming; Mathematical optimization; Linear programming; Constraint (computer-aided design); Algorithm; Mathematics; Programming language","score_opus":0.06567202607348327,"score_gpt":0.356399427834244,"score_spread":0.29072740176076073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086286112","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.012848208,0.00068427186,0.96599054,0.00064053165,0.00019527893,0.00012690318,0.00049967144,0.0028418163,0.01617276],"genre_scores_gemma":[0.17907447,0.0008457954,0.8014065,0.00050602836,0.00026154495,0.0004100208,0.003178764,0.0014309479,0.012885978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999223,0.00020382102,0.000056942798,0.0001279528,0.0002508694,0.00013740781],"domain_scores_gemma":[0.99815613,0.0009775606,0.0000909289,0.0004346133,0.00030042004,0.000040332838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006110424,0.001327789,0.0010431285,0.0010985647,0.00072383665,0.0016399745,0.001453204,0.00092199165,0.020210443],"category_scores_gemma":[0.0045596748,0.0007060307,0.0010693973,0.0020491818,0.00059204263,0.0017781139,0.0013691143,0.0021485884,0.005730934],"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.0006440109,0.00024334437,0.00057727715,0.00067590474,0.000079113706,0.0003280536,0.00011510054,0.15713233,0.022069113,0.08932726,0.044783,0.68402547],"study_design_scores_gemma":[0.00019033467,0.00017950422,0.0005716412,0.00008251018,0.000057583264,0.00022553858,0.000092687165,0.73788214,0.026147744,0.20362626,0.030912092,0.000031933825],"about_ca_topic_score_codex":0.0015087331,"about_ca_topic_score_gemma":0.0035725725,"teacher_disagreement_score":0.020210443,"about_ca_system_score_codex":0.00065073156,"about_ca_system_score_gemma":0.0017223164,"threshold_uncertainty_score":0.06761068},"labels":[],"label_agreement":null},{"id":"W2087512052","doi":"10.1007/s10589-008-9192-7","title":"Approximation of low rank solutions for linear quadratic control of partial differential equations","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"University of Waterloo","funders":"","keywords":"Mathematics; Lyapunov function; Algebraic equation; Partial differential equation; Dimension (graph theory); Applied mathematics; Riccati equation; Rank (graph theory); Mathematical analysis; Nonlinear system","score_opus":0.025590054375591652,"score_gpt":0.2592640356635096,"score_spread":0.23367398128791794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087512052","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.025327098,0.00046744704,0.9685277,0.00046087214,0.00010635023,0.00004878327,0.00007271889,0.00018507452,0.0048039895],"genre_scores_gemma":[0.8104771,0.0011094288,0.16536406,0.0002848605,0.00022603948,0.0003491589,0.0004449829,0.00029562783,0.0214487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995813,0.00019557636,0.000019145504,0.000047647685,0.00011252009,0.00004385828],"domain_scores_gemma":[0.9984107,0.0010528049,0.00015490518,0.00009996309,0.00020752179,0.00007400216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012383336,0.0012464396,0.00150421,0.00076835265,0.00050721504,0.0014815002,0.0009403456,0.0014893586,0.0031355529],"category_scores_gemma":[0.006455157,0.0005797968,0.0005957017,0.00058263144,0.0013839476,0.0013101196,0.0015412743,0.0019404441,0.00048022237],"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.00008322813,0.00007657857,0.00029588683,0.00018485231,0.000031536438,0.000043205375,0.000109534936,0.88367397,0.0014800241,0.08745959,0.0018623923,0.024699258],"study_design_scores_gemma":[0.0000024923036,0.000007951872,0.000015830516,0.0000030008894,0.0000011289818,0.000002573562,0.000004797635,0.99132186,0.000081928185,0.008425114,0.00013101405,0.0000022960767],"about_ca_topic_score_codex":0.0066865366,"about_ca_topic_score_gemma":0.0055488697,"teacher_disagreement_score":0.0066865366,"about_ca_system_score_codex":0.00087999017,"about_ca_system_score_gemma":0.0012044453,"threshold_uncertainty_score":0.013295233},"labels":[],"label_agreement":null},{"id":"W2088422447","doi":"10.1007/s10589-007-9095-z","title":"Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":29,"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":"Line search; Interior point method; Mathematical optimization; Nonlinear system; Convergence (economics); Dual (grammatical number); Computer science; Residual; Nonlinear programming; Newton's method; Local convergence; Rate of convergence; Point (geometry); Newton's method in optimization; Algorithm; Function (biology); Linear programming; Mathematics; Iterative method; Key (lock); Path (computing)","score_opus":0.03415400168738806,"score_gpt":0.43124444737366485,"score_spread":0.39709044568627677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088422447","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.009731409,0.000619463,0.9860752,0.00045566325,0.00020396379,0.00003569999,0.00003253405,0.00019674544,0.0026492209],"genre_scores_gemma":[0.51688737,0.0009868646,0.47218826,0.00035810872,0.00023088043,0.0003961032,0.00015767201,0.000792466,0.008002249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.00047734726,0.000033968267,0.000073163865,0.00017228741,0.000054380987],"domain_scores_gemma":[0.9961488,0.0026237238,0.00023799614,0.00032200938,0.0005085947,0.00015890531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003082763,0.001170806,0.0013516647,0.0006989441,0.00063440984,0.0021342663,0.0018893542,0.0020372672,0.0041186432],"category_scores_gemma":[0.019996474,0.0010754808,0.00038207258,0.0007321551,0.0016504697,0.0032900309,0.002450853,0.004217129,0.0009232677],"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.00047336362,0.00020165746,0.00055420643,0.00034132876,0.000070494694,0.00011733501,0.00020609477,0.62620413,0.0042462666,0.27380157,0.0058820923,0.08790141],"study_design_scores_gemma":[0.000032153017,0.000021237951,0.000038827726,0.000020469186,0.000005864968,0.000017310782,0.000010948532,0.974192,0.00059540337,0.023818899,0.0012373324,0.000009536693],"about_ca_topic_score_codex":0.0013692445,"about_ca_topic_score_gemma":0.0016165029,"teacher_disagreement_score":0.0041186432,"about_ca_system_score_codex":0.000823932,"about_ca_system_score_gemma":0.0013223088,"threshold_uncertainty_score":0.01630342},"labels":[],"label_agreement":null},{"id":"W2098024031","doi":"10.1007/s10589-014-9708-2","title":"Linear equalities in blackbox optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"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","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Convergence (economics); Simplex; Optimization problem; Simplex algorithm; Linear programming; Combinatorics","score_opus":0.044976527383543866,"score_gpt":0.3669998117124803,"score_spread":0.32202328432893645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098024031","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.019100169,0.0013470722,0.9380608,0.0013570768,0.00047700564,0.000048814363,0.000108688335,0.00027686488,0.039223503],"genre_scores_gemma":[0.7285581,0.0019542961,0.17506813,0.0009734425,0.00088897196,0.00034182682,0.00028219642,0.0009035673,0.091029465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.0009260058,0.0000566424,0.00026301687,0.00036792047,0.00013801505],"domain_scores_gemma":[0.99658525,0.0024978768,0.0001859818,0.0003328937,0.00023530266,0.00016267509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027683778,0.0011211529,0.0016851624,0.00083360076,0.00076471927,0.0030640503,0.0016869892,0.0014886992,0.018115694],"category_scores_gemma":[0.014234123,0.0005937645,0.00069062016,0.0014141168,0.0025818974,0.00527923,0.0031839968,0.0027127413,0.001737036],"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.00007089346,0.00004804519,0.00010431353,0.000103755745,0.000029840756,0.000037101316,0.00005437322,0.0838751,0.00036573465,0.88185453,0.00513362,0.028322635],"study_design_scores_gemma":[0.000014667541,0.00001680364,0.000036932546,0.000018816492,0.000009667776,0.000016355381,0.0000122181145,0.34015763,0.00039115234,0.6570961,0.0022232323,0.0000064168858],"about_ca_topic_score_codex":0.0010058796,"about_ca_topic_score_gemma":0.000869986,"teacher_disagreement_score":0.018115694,"about_ca_system_score_codex":0.0011866778,"about_ca_system_score_gemma":0.0008107839,"threshold_uncertainty_score":0.060603023},"labels":[],"label_agreement":null},{"id":"W2129835959","doi":"10.1007/s10589-010-9336-4","title":"A secant method for nonlinear least-squares minimization","year":2010,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"Secant method; Nonlinear system; Newton's method; Minification; Mathematics; Non-linear least squares; Quasi-Newton method; Mathematical optimization; Nonlinear programming; Gauss; Applied mathematics; Algorithm; Estimation theory","score_opus":0.03627713515898895,"score_gpt":0.4004326502422642,"score_spread":0.36415551508327526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129835959","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.0008000761,0.00021451594,0.9971554,0.00008156632,0.00015563011,0.00001551909,0.000038090715,0.00013282508,0.0014063317],"genre_scores_gemma":[0.021254895,0.00072230835,0.966345,0.00020600713,0.0001780354,0.00011268575,0.0001902433,0.0005055917,0.0104852235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992593,0.00036223588,0.0000441257,0.000071021605,0.00024369932,0.000019685212],"domain_scores_gemma":[0.99860966,0.0006147401,0.00006787303,0.00025661642,0.00039386086,0.000057197354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016711234,0.0013642268,0.0007075004,0.0007097783,0.00045495643,0.0008939008,0.0008297137,0.0012950129,0.006327087],"category_scores_gemma":[0.0039042616,0.00052070385,0.00093101297,0.00085468026,0.00088618265,0.0012367683,0.0011825062,0.0021037154,0.0045653465],"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.00031390224,0.00009810844,0.0007460448,0.0005864564,0.00014676602,0.0005367702,0.00030573236,0.11547561,0.052882817,0.4257918,0.029034557,0.3740813],"study_design_scores_gemma":[0.000023341609,0.00013773565,0.0002602759,0.000050714785,0.000037875972,0.0005727113,0.000027113458,0.8761762,0.013765989,0.04923519,0.059666142,0.000046761437],"about_ca_topic_score_codex":0.00053105544,"about_ca_topic_score_gemma":0.00085795304,"teacher_disagreement_score":0.006327087,"about_ca_system_score_codex":0.00020963508,"about_ca_system_score_gemma":0.00063326576,"threshold_uncertainty_score":0.021166205},"labels":[],"label_agreement":null},{"id":"W2132943005","doi":"10.1007/s10589-013-9543-x","title":"Stable local volatility function calibration using spline kernel","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of Waterloo","funders":"","keywords":"Local volatility; Volatility (finance); Mathematics; Implied volatility; Mathematical optimization; Kernel method; Stochastic volatility; Support vector machine; Applied mathematics; Econometrics; Computer science; Artificial intelligence","score_opus":0.023345214604791793,"score_gpt":0.2213314967004327,"score_spread":0.1979862820956409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132943005","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.033872478,0.00009965885,0.96479726,0.00006504677,0.0000207526,0.000009902017,0.000025275442,0.00035676494,0.00075290253],"genre_scores_gemma":[0.8559079,0.00015836999,0.14140768,0.000041874115,0.00003058931,0.00004910946,0.00014789324,0.0003952996,0.0018612378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920875,0.0003442166,0.00003056582,0.00017713413,0.00017307093,0.000066253466],"domain_scores_gemma":[0.99679947,0.0016098176,0.00036246103,0.0006909488,0.00041461157,0.00012274481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024132724,0.00054226967,0.0011313548,0.0007691493,0.0004421972,0.0012063776,0.0010634814,0.0014930897,0.0019894056],"category_scores_gemma":[0.0110369725,0.00059812923,0.0009733643,0.0009251372,0.0007865851,0.0021087143,0.0020392148,0.0018601692,0.0006174692],"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.00023080563,0.000077343015,0.0021032968,0.00009790351,0.00009881612,0.00010826611,0.00013222641,0.8260918,0.008197947,0.078616396,0.0011573357,0.08308786],"study_design_scores_gemma":[0.000006545659,0.000008201831,0.0001521185,0.000003623492,0.0000042402485,0.000012531873,0.0000048131915,0.9901856,0.0006390822,0.008790596,0.00018395724,0.000008727058],"about_ca_topic_score_codex":0.0013836068,"about_ca_topic_score_gemma":0.0009358382,"teacher_disagreement_score":0.0024132724,"about_ca_system_score_codex":0.0005695378,"about_ca_system_score_gemma":0.00080717815,"threshold_uncertainty_score":0.012762785},"labels":[],"label_agreement":null},{"id":"W2133898219","doi":"10.1007/s10589-007-9124-y","title":"The piecewise linear-quadratic model for computational convex analysis","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Piecewise; Quadratic equation; Piecewise linear function; Regular polygon; Convex optimization; Convex analysis; Class (philosophy); Mathematical optimization; Convex combination; Applied mathematics; Proper convex function; Convergence (economics); Convex function; Algorithm; Computer science; Mathematical analysis","score_opus":0.05266449761261748,"score_gpt":0.39673410809380244,"score_spread":0.34406961048118495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133898219","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.00095495506,0.00041106885,0.9970216,0.00030190765,0.000045551293,0.00001006832,0.0000613826,0.00008045447,0.0011130845],"genre_scores_gemma":[0.3407569,0.0037206486,0.62857735,0.00066923955,0.0006029693,0.0005309352,0.0009795203,0.0006899927,0.023472425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.0006093797,0.00004377138,0.00014388098,0.00028637573,0.00006300086],"domain_scores_gemma":[0.99699676,0.0019659118,0.00015775386,0.00038607686,0.00034767267,0.0001458819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991612,0.0011835801,0.0013850268,0.0006307548,0.00041960808,0.0014628996,0.0022851077,0.0013709951,0.0056218384],"category_scores_gemma":[0.010224422,0.00072601554,0.0008676978,0.0017440767,0.0013746846,0.0024963168,0.0021932349,0.0042701643,0.0017109319],"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.00006280158,0.000033125903,0.00024095965,0.00023071187,0.000054495405,0.000058747228,0.00004808941,0.5408897,0.0009033153,0.41068798,0.007463351,0.039326716],"study_design_scores_gemma":[0.00000407617,0.000009424977,0.000030937485,0.0000061948235,0.000004928217,0.000010678186,0.0000038995818,0.910771,0.0000909357,0.087531194,0.0015325408,0.000004071089],"about_ca_topic_score_codex":0.0032783225,"about_ca_topic_score_gemma":0.002860356,"teacher_disagreement_score":0.0056218384,"about_ca_system_score_codex":0.0011238691,"about_ca_system_score_gemma":0.0010881004,"threshold_uncertainty_score":0.018806934},"labels":[],"label_agreement":null},{"id":"W2145896656","doi":"10.1007/s10589-013-9547-6","title":"A derivative-free approximate gradient sampling algorithm for finite minimax problems","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"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; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Line search; Minimax; Proximal Gradient Methods; Gradient descent; Gradient method; Stationary point; Directional derivative; Subderivative; Function (biology); Simplex; Descent direction; Mathematical optimization; Applied mathematics; Convergence (economics); Algorithm; Mathematical analysis; Convex function; Combinatorics; Convex optimization; Regular polygon; Geometry; RADIUS; Computer science","score_opus":0.06588151631744103,"score_gpt":0.3432997407118499,"score_spread":0.27741822439440883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145896656","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.0025607855,0.00012330708,0.9959921,0.00007161051,0.00006257487,0.000044410663,0.000020714775,0.00020939748,0.0009151393],"genre_scores_gemma":[0.07945072,0.00016161447,0.91540897,0.00014696793,0.00009458398,0.00030374556,0.00016307103,0.0002318719,0.0040385053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992199,0.0002298524,0.000041837644,0.00008939922,0.0003740856,0.000044857465],"domain_scores_gemma":[0.9983052,0.0009194949,0.00006389487,0.00019423389,0.00039995887,0.00011720088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215558,0.00088605727,0.0017503494,0.0008910381,0.0006018718,0.0011705941,0.0022230812,0.0019794747,0.004699744],"category_scores_gemma":[0.007198816,0.00074320834,0.00072837,0.0010205139,0.0009025404,0.0013856159,0.0019392413,0.0024348986,0.0013958552],"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.00051217584,0.00027544296,0.0006836821,0.00027442968,0.00012473928,0.00013665299,0.00015095713,0.51564366,0.009262834,0.070000544,0.0076849572,0.39524996],"study_design_scores_gemma":[0.00003319477,0.000033304517,0.000048480575,0.000008470792,0.0000070127217,0.000027602438,0.000004468871,0.9916881,0.0006261623,0.006404208,0.0011117691,0.000007224394],"about_ca_topic_score_codex":0.0032664353,"about_ca_topic_score_gemma":0.0047736815,"teacher_disagreement_score":0.004699744,"about_ca_system_score_codex":0.0007585536,"about_ca_system_score_gemma":0.0017954286,"threshold_uncertainty_score":0.015722215},"labels":[],"label_agreement":null},{"id":"W2162835374","doi":"10.1007/s10589-009-9254-5","title":"Maximum utility product pricing models and algorithms based on reservation price","year":2009,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"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":"Heuristics; Reservation; Revenue management; Product (mathematics); Mathematical optimization; Key (lock); Integer programming; Yield management; Revenue; Computer science; Operations research; Mathematics; Economics","score_opus":0.0342869080749606,"score_gpt":0.24980934305952668,"score_spread":0.21552243498456608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162835374","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.010265925,0.0007416578,0.9841816,0.0003198024,0.0000976582,0.000030607087,0.000036263616,0.0002076357,0.0041187913],"genre_scores_gemma":[0.6244737,0.0016535008,0.3617107,0.00017736404,0.00032888717,0.00019431203,0.00022983979,0.0002702875,0.0109614525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891925,0.00063273223,0.00003173606,0.00011241629,0.00021375099,0.00009011924],"domain_scores_gemma":[0.99665844,0.0024671718,0.00014279044,0.0003313793,0.00030931397,0.000090900416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026436637,0.0010359545,0.0018442736,0.0008883795,0.0006842669,0.0027288885,0.003623305,0.0017755808,0.005002424],"category_scores_gemma":[0.011039451,0.0011418386,0.0011882931,0.0024064677,0.0014073103,0.005562516,0.0014109558,0.0031220422,0.0007236335],"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.00009478657,0.00008406094,0.0001487519,0.000059868944,0.000026722855,0.000020382558,0.0000401135,0.81964254,0.00021415822,0.14607465,0.0017430128,0.031850934],"study_design_scores_gemma":[0.0000056436297,0.0000052542237,0.000014629599,0.000003571368,0.0000031018053,0.0000041573376,0.0000025154109,0.97564596,0.000060958937,0.024040997,0.00020969259,0.0000034611653],"about_ca_topic_score_codex":0.003347352,"about_ca_topic_score_gemma":0.002651238,"teacher_disagreement_score":0.005002424,"about_ca_system_score_codex":0.001514697,"about_ca_system_score_gemma":0.0013743888,"threshold_uncertainty_score":0.01673472},"labels":[],"label_agreement":null},{"id":"W2203411556","doi":"10.1007/s10589-016-9867-4","title":"Local nonglobal minima for solving large-scale extended trust-region subproblems","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"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":"University of Guilan","keywords":"Trust region; Mathematics; Maxima and minima; Eigenvalues and eigenvectors; Mathematical optimization; Quadratic equation; Constraint (computer-aided design); Scale (ratio); Duality (order theory); Norm (philosophy); Optimization problem; Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.03189552798021421,"score_gpt":0.3360019964161395,"score_spread":0.30410646843592526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203411556","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.008288935,0.00019616295,0.9900591,0.00012986157,0.000023250459,0.000047073405,0.000020105981,0.00008417246,0.0011514517],"genre_scores_gemma":[0.5606595,0.00045968217,0.43136215,0.00018481683,0.00011661967,0.00091382884,0.00024780072,0.00038221,0.005673408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998887,0.0006381524,0.000049791848,0.00013502648,0.00022189673,0.00006823936],"domain_scores_gemma":[0.9913202,0.0070024966,0.00047630645,0.0003275875,0.00059651607,0.0002768502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039687436,0.0017052239,0.0022988687,0.00090759073,0.0006004511,0.0016450016,0.0022308063,0.0026623176,0.0028385902],"category_scores_gemma":[0.021906577,0.0009332479,0.0009914486,0.00078463345,0.0022893145,0.0021492701,0.003336198,0.002608095,0.0005847051],"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.0001078904,0.00004452156,0.0002482252,0.00013319319,0.00004171515,0.0000627499,0.00009281647,0.9685329,0.0007294826,0.019015532,0.00072677375,0.010264275],"study_design_scores_gemma":[0.00000600324,0.000013103255,0.00001369529,0.0000049993514,0.0000024296073,0.000004202291,0.000005035766,0.996342,0.00009110055,0.0034348364,0.00008020389,0.0000024113713],"about_ca_topic_score_codex":0.0027795052,"about_ca_topic_score_gemma":0.0024750554,"teacher_disagreement_score":0.0039687436,"about_ca_system_score_codex":0.00094513583,"about_ca_system_score_gemma":0.00122693,"threshold_uncertainty_score":0.020989},"labels":[],"label_agreement":null},{"id":"W2345492474","doi":"10.1007/s10589-016-9847-8","title":"On handling indicator constraints in mixed integer programming","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":102,"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":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Integer programming; Context (archaeology); Mathematics; Mathematical optimization; Class (philosophy); Exploit; Integer (computer science); Block (permutation group theory); Linear programming; Upper and lower bounds; Nonlinear programming; IBM; Nonlinear system; Computer science; Artificial intelligence; Combinatorics","score_opus":0.03306497820491706,"score_gpt":0.34590252527156534,"score_spread":0.3128375470666483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345492474","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.0025212115,0.00067253923,0.99097717,0.0005279334,0.00024253632,0.000052593212,0.0000630636,0.000100780926,0.0048421524],"genre_scores_gemma":[0.11016374,0.00226229,0.87648946,0.00086395745,0.00081455987,0.00043717123,0.0004549546,0.0006632346,0.007850639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99331397,0.0041894363,0.00030831274,0.00048712475,0.0012990384,0.00040209302],"domain_scores_gemma":[0.97349733,0.022222219,0.0012094075,0.0012042014,0.0012987112,0.00056816766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011017462,0.0029877082,0.002725654,0.0020696062,0.0014724097,0.0043484,0.003856807,0.002598825,0.0072225877],"category_scores_gemma":[0.052268546,0.0015817168,0.0020296818,0.00464651,0.0034955367,0.010595263,0.005860972,0.010603975,0.0014312691],"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.00026578395,0.00022458847,0.00082293607,0.0006635601,0.00009609291,0.00021896303,0.00033034838,0.22086674,0.0015469479,0.65655416,0.011194251,0.107215576],"study_design_scores_gemma":[0.0000303038,0.000049194437,0.00010002405,0.00012326786,0.000027043465,0.00004042316,0.00004053546,0.63782555,0.0005442211,0.35623783,0.004955631,0.000025967694],"about_ca_topic_score_codex":0.001984281,"about_ca_topic_score_gemma":0.002093635,"teacher_disagreement_score":0.011017462,"about_ca_system_score_codex":0.0012455288,"about_ca_system_score_gemma":0.0019781836,"threshold_uncertainty_score":0.05826658},"labels":[],"label_agreement":null},{"id":"W2429556411","doi":"10.1007/s10589-016-9854-9","title":"Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"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":"Fundamental Research Funds for the Central Universities; Simon Fraser University; Shenzhen University; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Mathematics; Smoothing; Stationary point; Mathematical optimization; Convergence (economics); Convex function; Regular polygon; Applied mathematics; Mathematical analysis","score_opus":0.011287877925320957,"score_gpt":0.26499336771498977,"score_spread":0.25370548978966884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429556411","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.0016757305,0.00035510364,0.9966916,0.00010844187,0.000056882178,0.000015571291,0.000036362988,0.00009673576,0.00096359133],"genre_scores_gemma":[0.09173824,0.0010952037,0.8915283,0.00022193785,0.00014740226,0.00032591933,0.00033120086,0.0004443812,0.014167534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995103,0.00021596029,0.000028770875,0.0000840298,0.00013454804,0.000026485088],"domain_scores_gemma":[0.99870396,0.0008813677,0.0000831812,0.00011455339,0.0001711762,0.000045718538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016337663,0.0010485228,0.0014540636,0.00056623766,0.00040608138,0.0010503773,0.001465505,0.0019535136,0.0049137175],"category_scores_gemma":[0.0045166695,0.00074914616,0.0007589875,0.0008749127,0.001066729,0.0012951004,0.0014744482,0.001833469,0.0013446342],"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.00031463953,0.00009814264,0.00050500117,0.0008008,0.00019566153,0.00016568153,0.00019785659,0.6430733,0.015122796,0.16902675,0.011177532,0.15932181],"study_design_scores_gemma":[0.0000114047125,0.000017277338,0.000051981588,0.000013325236,0.0000071147806,0.000016793623,0.0000060192683,0.9858957,0.0007247956,0.011017072,0.0022260116,0.000012579952],"about_ca_topic_score_codex":0.0027105259,"about_ca_topic_score_gemma":0.0034660264,"teacher_disagreement_score":0.0049137175,"about_ca_system_score_codex":0.0005144954,"about_ca_system_score_gemma":0.0012351742,"threshold_uncertainty_score":0.016438007},"labels":[],"label_agreement":null},{"id":"W2517321039","doi":"10.1007/s10589-018-0020-4","title":"A progressive barrier derivative-free trust-region algorithm for constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Trust region; Mathematical optimization; Mathematics; Quadratic equation; Domain (mathematical analysis); Quadratic programming; Constrained optimization; Constrained optimization problem; Derivative (finance); Software; Optimization problem; Algorithm; Computer science","score_opus":0.038247387429913716,"score_gpt":0.3552282416599088,"score_spread":0.31698085422999506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517321039","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.0012057817,0.00007940757,0.9977302,0.00004199068,0.000028253033,0.000023817887,0.000014378119,0.00019575615,0.00068036554],"genre_scores_gemma":[0.094962984,0.0002095941,0.8994584,0.00010940483,0.000057527235,0.00021775227,0.00012959402,0.0003442579,0.0045104115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912256,0.00022983484,0.000045203422,0.00009996751,0.0004435573,0.00005878525],"domain_scores_gemma":[0.99753916,0.0013348388,0.00011891049,0.00027939666,0.00058497424,0.00014272987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019850773,0.0009312251,0.0015600816,0.00059463806,0.00046166658,0.0011766931,0.0031491718,0.0019583446,0.0044247196],"category_scores_gemma":[0.007698094,0.00067290606,0.0008625162,0.00073781307,0.0010383289,0.0015911305,0.0030690387,0.002855877,0.0018152118],"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.00038870625,0.00014721425,0.00032597088,0.00034570598,0.00009060149,0.00016973141,0.00019923064,0.6945321,0.009346957,0.067976065,0.0062188758,0.22025885],"study_design_scores_gemma":[0.00001805689,0.000028330964,0.000016769956,0.000006861798,0.000005464309,0.000019120718,0.0000029024768,0.9949721,0.00076867983,0.00319216,0.0009636694,0.000005836687],"about_ca_topic_score_codex":0.004068271,"about_ca_topic_score_gemma":0.0035398551,"teacher_disagreement_score":0.0044247196,"about_ca_system_score_codex":0.00067140773,"about_ca_system_score_gemma":0.0021493265,"threshold_uncertainty_score":0.014802158},"labels":[],"label_agreement":null},{"id":"W2580510829","doi":"10.1007/s10589-017-9892-y","title":"Visualization of the $$\\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Subderivative; Mathematics; Piecewise; Piecewise linear function; Convex conjugate; Convex function; Applied mathematics; Quadratic equation; Proper convex function; Univariate; Convex analysis; Function (biology); Regular polygon; Quadratic function; Convex optimization; Mathematical analysis; Multivariate statistics; Geometry","score_opus":0.05253497987322648,"score_gpt":0.38480674944649573,"score_spread":0.33227176957326926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580510829","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.31369,0.0007488878,0.6157955,0.0029916125,0.00076546473,0.0002038331,0.0025719807,0.0061992183,0.057033483],"genre_scores_gemma":[0.7773436,0.00040841065,0.20677985,0.00023010737,0.00008501795,0.000108148364,0.0013084623,0.0012667958,0.012469663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999881,0.000018475168,0.0000069451366,0.000015752048,0.000049427592,0.000028400638],"domain_scores_gemma":[0.9993667,0.00028710492,0.000055356042,0.00005898765,0.00014902365,0.000082840124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043805144,0.000725883,0.00039031685,0.00092699274,0.00024267737,0.0013398322,0.0005699239,0.0007362496,0.01562875],"category_scores_gemma":[0.0014434211,0.00021905742,0.00028123497,0.0006600422,0.00041236807,0.000728839,0.00072798313,0.001287777,0.0006415032],"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.0013523428,0.00039996763,0.0055424483,0.0010270646,0.00005355285,0.0010403529,0.001226048,0.3906404,0.09232579,0.2649166,0.038607527,0.20286787],"study_design_scores_gemma":[0.00005022925,0.00006564494,0.0030333407,0.00008737133,0.000008880874,0.0002393428,0.00018364371,0.9486106,0.0133200865,0.017032092,0.017328372,0.000040456558],"about_ca_topic_score_codex":0.0028515714,"about_ca_topic_score_gemma":0.0024025661,"teacher_disagreement_score":0.01562875,"about_ca_system_score_codex":0.0005386978,"about_ca_system_score_gemma":0.0011645694,"threshold_uncertainty_score":0.052283406},"labels":[],"label_agreement":null},{"id":"W2593994861","doi":"10.1007/s10589-017-9905-x","title":"Two wide neighborhood interior-point methods for symmetric cone optimization","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"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":"School of Mathematics, Institute for Research in Fundamental Sciences; Shahrekord University; York University","keywords":"Mathematics; Interior point method; Cone (formal languages); Dual cone and polar cone; Point (geometry); Optimization problem; Mathematical optimization; Geometry; Tangent cone; Second-order cone programming; Mathematical analysis; Applied mathematics; Algorithm; Convex optimization; Regular polygon","score_opus":0.06638302178571971,"score_gpt":0.45208287204924824,"score_spread":0.38569985026352854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593994861","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.0020742426,0.00022236638,0.99493945,0.00008439166,0.00008069206,0.000034097604,0.000019911218,0.000045397075,0.0024993813],"genre_scores_gemma":[0.073729165,0.00047605016,0.91419345,0.0001764121,0.0001493592,0.00032217926,0.00015346298,0.0003009873,0.01049897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.0005277888,0.000039375278,0.00010568953,0.0003437302,0.000055763983],"domain_scores_gemma":[0.99846715,0.0007522369,0.000079131496,0.00016167693,0.00038525162,0.00015443984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465852,0.0012774196,0.0017503784,0.001127233,0.0006982716,0.0014069993,0.0020697913,0.00167908,0.0051203417],"category_scores_gemma":[0.0059695677,0.0006712951,0.0013897576,0.0009980558,0.0014866854,0.001943346,0.0035285417,0.0035165292,0.0013433076],"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.00032589014,0.00036437795,0.00066103897,0.00049660547,0.000119232216,0.0001582862,0.000334096,0.29122475,0.0060011186,0.43631953,0.009031537,0.25496352],"study_design_scores_gemma":[0.00002759472,0.00007439278,0.00008819681,0.0000291403,0.000016068925,0.000051827214,0.000031789354,0.9369344,0.0007912703,0.05696109,0.0049772803,0.000016999495],"about_ca_topic_score_codex":0.0009551302,"about_ca_topic_score_gemma":0.0015623367,"teacher_disagreement_score":0.0051203417,"about_ca_system_score_codex":0.00052483217,"about_ca_system_score_gemma":0.0011353915,"threshold_uncertainty_score":0.017129242},"labels":[],"label_agreement":null},{"id":"W2755505503","doi":"10.1007/s10589-017-9952-3","title":"A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Numerical Analysis Techniques","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ellipse; Mathematics; Intersection (aeronautics); Polygon (computer graphics); Convex polygon; Combinatorics; Orthogonal convex hull; Regular polygon; Polygon covering; Convex set; Convex hull; Bounded function; Star-shaped polygon; Ellipsoid; Plane (geometry); Geometry; Convex body; Mathematical analysis; Convex optimization; Computer science","score_opus":0.021763194380381334,"score_gpt":0.26079097426604153,"score_spread":0.2390277798856602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755505503","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.0021772317,0.00008325065,0.9961481,0.000022045804,0.00001930922,0.000017884082,0.000016045964,0.000089285095,0.0014268234],"genre_scores_gemma":[0.13039494,0.00040600094,0.86490846,0.000086355576,0.00008518394,0.00014246089,0.00017372106,0.00024767127,0.0035551528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956363,0.000118931115,0.0000228035,0.000071232986,0.0001860267,0.000037458292],"domain_scores_gemma":[0.9994048,0.00018666386,0.000052936633,0.0001026407,0.00020675505,0.000046360157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083729177,0.00079618045,0.00093056215,0.0009797912,0.0005240796,0.0011761457,0.0017520039,0.0010436246,0.0024539104],"category_scores_gemma":[0.0018637815,0.00042047803,0.0010192858,0.00072036864,0.0006040245,0.0010215698,0.0019307376,0.0011240729,0.0009956164],"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.0002497142,0.00014514408,0.0013026877,0.0005426807,0.00009097326,0.0003614385,0.0007254893,0.51909024,0.041536797,0.18857796,0.008406049,0.23897083],"study_design_scores_gemma":[0.0000042690385,0.000014349549,0.000051713807,0.000010375451,0.000006558991,0.000077501274,0.0000193121,0.9903618,0.0015215349,0.0051265196,0.00279619,0.0000097603315],"about_ca_topic_score_codex":0.0018009894,"about_ca_topic_score_gemma":0.0016179988,"teacher_disagreement_score":0.0024539104,"about_ca_system_score_codex":0.0004331797,"about_ca_system_score_gemma":0.00062950025,"threshold_uncertainty_score":0.008209169},"labels":[],"label_agreement":null},{"id":"W2761564338","doi":"10.1007/s10589-019-00078-w","title":"A sub-additive DC approach to the complementarity problem","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"University of Guelph","funders":"Agence Nationale de la Recherche","keywords":"Mixed complementarity problem; Complementarity theory; Mathematics; Linear complementarity problem; Maxima and minima; Monotone polygon; Mathematical optimization; Complementarity (molecular biology); Nonlinear complementarity problem; Optimization problem; Regular polygon; Convex function; Stationary point; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.039618985544971994,"score_gpt":0.3377216631295292,"score_spread":0.2981026775845572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761564338","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.0027848114,0.0005101973,0.96732026,0.00042361516,0.00023786211,0.000027615142,0.000084471314,0.000046994475,0.028564118],"genre_scores_gemma":[0.38767257,0.0030553276,0.52508277,0.0016334577,0.0011087842,0.0003091066,0.00044871194,0.00037600566,0.08031324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956685,0.000126269,0.000016751752,0.00006235152,0.00018983861,0.000037846614],"domain_scores_gemma":[0.99924254,0.00032173787,0.000037855774,0.00007811939,0.00026437154,0.000055460598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005728378,0.00068834896,0.0007761336,0.0013583563,0.00060118467,0.0014932262,0.0013717506,0.0007580554,0.009983076],"category_scores_gemma":[0.0019680096,0.0003694498,0.0007461022,0.0013563572,0.0008302056,0.0011184674,0.0016016954,0.0018578245,0.0011827282],"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.000022687625,0.00005800332,0.00016728464,0.00014013953,0.000036644356,0.000070102076,0.000047620815,0.15789156,0.0015316426,0.7826617,0.006071938,0.051300656],"study_design_scores_gemma":[0.000006190796,0.000022630202,0.00007764683,0.00002877232,0.000018563505,0.000054286767,0.000023625409,0.7934338,0.000554764,0.19424848,0.011521251,0.000010028252],"about_ca_topic_score_codex":0.0035056034,"about_ca_topic_score_gemma":0.0049563837,"teacher_disagreement_score":0.009983076,"about_ca_system_score_codex":0.0008383944,"about_ca_system_score_gemma":0.001015895,"threshold_uncertainty_score":0.03339666},"labels":[],"label_agreement":null},{"id":"W2768763745","doi":"10.1007/s10589-018-0016-0","title":"Mesh-based Nelder–Mead algorithm for inequality constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":36,"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","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":"Convergence (economics); Mathematical optimization; Simplex algorithm; Mathematics; Algorithm; Simplex; Rate of convergence; Point (geometry); Computer science; Linear programming; Key (lock)","score_opus":0.0606054398186082,"score_gpt":0.3863672623675488,"score_spread":0.3257618225489406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768763745","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.0015209771,0.00016802253,0.99542576,0.000057726138,0.00004346992,0.000021994447,0.000038039005,0.00014789043,0.0025761526],"genre_scores_gemma":[0.079491735,0.00030917092,0.9144936,0.000096796495,0.00004995408,0.0002622694,0.0002433264,0.00022304263,0.004830071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.00014211393,0.000024136325,0.000042058422,0.00019488316,0.000024371047],"domain_scores_gemma":[0.9993005,0.00037060727,0.000032198044,0.00007224565,0.00020169564,0.000022852917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296003,0.0006322321,0.0009594566,0.0007852385,0.00051860296,0.00075570366,0.0015817839,0.0016477932,0.006006191],"category_scores_gemma":[0.0029564097,0.00037615045,0.00072877615,0.0010650697,0.00047135315,0.0008741436,0.0011088923,0.0014103007,0.0015403037],"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.0001395852,0.00008333337,0.00042325258,0.0002916004,0.000088370914,0.00008166265,0.00009391034,0.7106813,0.0070525217,0.044534814,0.0076450435,0.22888461],"study_design_scores_gemma":[0.0000064554015,0.000007739098,0.000041341864,0.000008076836,0.00000375874,0.000009312815,0.0000037796929,0.9927449,0.00056361937,0.0043732063,0.0022337644,0.0000041136154],"about_ca_topic_score_codex":0.005634148,"about_ca_topic_score_gemma":0.005432593,"teacher_disagreement_score":0.006006191,"about_ca_system_score_codex":0.0005631265,"about_ca_system_score_gemma":0.0011145528,"threshold_uncertainty_score":0.020092666},"labels":[],"label_agreement":null},{"id":"W2780752111","doi":"10.1007/s10589-020-00220-z","title":"Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods","year":2020,"lang":"en","type":"preprint","venue":"Computational Optimization and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":81,"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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Iterated function; Stochastic gradient descent; Momentum (technical analysis); Mathematics; Rate of convergence; Stochastic optimization; Applied mathematics; Ball (mathematics); Stochastic approximation; Mathematical optimization; Mathematical analysis; Computer science; Finance; Artificial neural network","score_opus":0.033326208747696866,"score_gpt":0.320718223472419,"score_spread":0.28739201472472214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780752111","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.00281172,0.0025330952,0.9902812,0.0006309514,0.0004234188,0.000028208447,0.00006935365,0.0002205072,0.0030016215],"genre_scores_gemma":[0.2095441,0.008262073,0.7348788,0.0007448133,0.002493819,0.0006131019,0.0006736057,0.0013572798,0.041432407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982734,0.0008129227,0.00009223101,0.0002154866,0.0005163687,0.00008958897],"domain_scores_gemma":[0.9974171,0.0014478648,0.00020172042,0.00027205245,0.00049922854,0.0001619749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003263012,0.0017461685,0.0018394189,0.0013706713,0.00089503644,0.0023644194,0.0016399386,0.0029907238,0.003983271],"category_scores_gemma":[0.015929764,0.00074750494,0.0010112349,0.0028907561,0.0030202903,0.0036390782,0.0023453059,0.004955544,0.0014357482],"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.00010776123,0.000094571944,0.00038719995,0.00029406065,0.00007514485,0.00008530503,0.00013583859,0.16017321,0.0017235994,0.74883467,0.012207596,0.07588104],"study_design_scores_gemma":[0.000013171721,0.000026853528,0.00019059384,0.00003322356,0.000017650167,0.00003627708,0.000015406102,0.73620486,0.0005806736,0.25558123,0.00727763,0.000022491336],"about_ca_topic_score_codex":0.004386762,"about_ca_topic_score_gemma":0.0041969274,"teacher_disagreement_score":0.004386762,"about_ca_system_score_codex":0.001375346,"about_ca_system_score_gemma":0.0026449654,"threshold_uncertainty_score":0.017256677},"labels":[],"label_agreement":null},{"id":"W2802936684","doi":"10.1007/s10589-018-0007-1","title":"A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Piecewise linear function; Adjacency matrix; Vertex (graph theory); Bivariate analysis; Time complexity; Graph; Algorithm; Combinatorics; Discrete mathematics","score_opus":0.00804029159818934,"score_gpt":0.25733657941712923,"score_spread":0.2492962878189399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802936684","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.0034739387,0.000052106498,0.9945522,0.000065352884,0.000042100015,0.000036765032,0.00003268453,0.0008433645,0.0009014481],"genre_scores_gemma":[0.11941921,0.00007700582,0.87642765,0.000083263534,0.00005166757,0.00014719198,0.00026848644,0.0004054566,0.003120006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946195,0.00011052277,0.000033452692,0.00011116038,0.00020980097,0.000073102594],"domain_scores_gemma":[0.99861825,0.00063658046,0.000078669924,0.00022555255,0.00032600688,0.00011488281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010448721,0.00120859,0.0011456568,0.0010570005,0.00064872525,0.00161213,0.0016031326,0.0012381485,0.012092568],"category_scores_gemma":[0.0061824573,0.0006626624,0.00073544384,0.0012937981,0.0008618458,0.001616109,0.0028000122,0.0022070128,0.0034001882],"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.00063540763,0.00024321579,0.0011245413,0.0002185787,0.00009122568,0.00017743433,0.00016562942,0.2531411,0.01245373,0.0766845,0.011303981,0.6437607],"study_design_scores_gemma":[0.00006781898,0.000050517363,0.00015379334,0.000008482756,0.000013966185,0.000051212817,0.000027907408,0.97681993,0.002955596,0.01805343,0.0017827236,0.000014590308],"about_ca_topic_score_codex":0.00420136,"about_ca_topic_score_gemma":0.006192174,"teacher_disagreement_score":0.012092568,"about_ca_system_score_codex":0.0011227203,"about_ca_system_score_gemma":0.0024504508,"threshold_uncertainty_score":0.040453672},"labels":[],"label_agreement":null},{"id":"W2889382438","doi":"10.1007/s10589-018-0032-0","title":"Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Université de Montréal; Polytechnique Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Heuristic; Bilevel optimization; Mathematics; Revenue management; Maximization; Piecewise linear function; Nonlinear system; Flow network; Function (biology); Piecewise; Integer programming; Revenue; Optimization problem; Economics","score_opus":0.016547017935155797,"score_gpt":0.29307292499669324,"score_spread":0.27652590706153746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889382438","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.46485013,0.003042258,0.47572094,0.00884657,0.000271388,0.00017114708,0.001120462,0.00016083027,0.04581627],"genre_scores_gemma":[0.97143155,0.001079359,0.01685225,0.00015919587,0.000222723,0.000079312464,0.00017756029,0.00008015865,0.009917855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854326,0.0007684283,0.000040817555,0.00020432616,0.00016190881,0.00028128116],"domain_scores_gemma":[0.9938327,0.004580954,0.0006015082,0.00017535755,0.00035999017,0.00044946276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002625582,0.0013477466,0.0022919755,0.0012468374,0.000985181,0.0031253207,0.0026481836,0.0030827231,0.004872228],"category_scores_gemma":[0.013677708,0.0013137726,0.0012905943,0.0023772537,0.002624983,0.005736183,0.0019031425,0.002519168,0.00038156664],"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.00017236013,0.00010797373,0.00095523865,0.00014863914,0.000050024224,0.0004224115,0.000091124486,0.84174454,0.0004925948,0.14886552,0.0022330217,0.0047165398],"study_design_scores_gemma":[0.000021171354,0.000012527187,0.00022768407,0.000008396635,0.000013234172,0.00005219447,0.000036353096,0.95558524,0.00006621928,0.043694437,0.0002697896,0.000012665561],"about_ca_topic_score_codex":0.014577235,"about_ca_topic_score_gemma":0.008325131,"teacher_disagreement_score":0.014577235,"about_ca_system_score_codex":0.003051391,"about_ca_system_score_gemma":0.0016867443,"threshold_uncertainty_score":0.028984785},"labels":[],"label_agreement":null},{"id":"W2924275034","doi":"10.1007/s10589-019-00088-8","title":"A parameterized Douglas–Rachford algorithm","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Parameterized complexity; Norm (philosophy); Algorithm; Operator norm; Applied mathematics; Pure mathematics; Hilbert space","score_opus":0.0062931027341781515,"score_gpt":0.2275084460021012,"score_spread":0.22121534326792305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924275034","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.0036495908,0.00015806979,0.9918092,0.00012974719,0.000087465676,0.00004841017,0.0000596769,0.00040929488,0.0036484355],"genre_scores_gemma":[0.08949235,0.00020181846,0.8999718,0.00015979442,0.00010259479,0.0001984199,0.00027477244,0.00050822075,0.009090288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990127,0.00039419087,0.00004258605,0.00018841418,0.00027844723,0.00008359824],"domain_scores_gemma":[0.99842215,0.0005529987,0.00007265302,0.00050338474,0.00034382625,0.000105045045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018389401,0.0009183288,0.0015346945,0.0010251387,0.0011433031,0.0014734524,0.00280494,0.002697315,0.010714774],"category_scores_gemma":[0.0056428397,0.0007642679,0.00114667,0.001581506,0.0010169235,0.002025155,0.0022342254,0.0019796847,0.0030601257],"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.00030585116,0.00023660506,0.00070112187,0.00016406801,0.00011894034,0.00010828949,0.00009903182,0.44435528,0.005695408,0.2236539,0.012970025,0.31159148],"study_design_scores_gemma":[0.000041318053,0.000033141692,0.00009688289,0.000012361878,0.000014363612,0.000042032927,0.000008858622,0.96118605,0.0012809066,0.03018596,0.0070805983,0.000017381628],"about_ca_topic_score_codex":0.0036693767,"about_ca_topic_score_gemma":0.00490731,"teacher_disagreement_score":0.010714774,"about_ca_system_score_codex":0.0012705033,"about_ca_system_score_gemma":0.0023420013,"threshold_uncertainty_score":0.035844445},"labels":[],"label_agreement":null},{"id":"W2944992100","doi":"10.1007/s10589-020-00201-2","title":"A regularization method for constrained nonlinear least squares","year":2020,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Regularization (linguistics); Least-squares function approximation; Non-linear least squares; Applied mathematics; Nonlinear system; Mathematical optimization; Computer science; Algorithm; Statistics; Artificial intelligence; Estimation theory; Physics; Estimator","score_opus":0.04757892133108757,"score_gpt":0.3454934963193129,"score_spread":0.2979145749882254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944992100","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.00037875478,0.000054458666,0.9987801,0.00007355964,0.000024462875,0.000013864205,0.00001693762,0.000099311146,0.00055863085],"genre_scores_gemma":[0.02363106,0.00020595263,0.97115797,0.00019417441,0.000086567634,0.00018394779,0.00016028139,0.00027537465,0.0041046455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900824,0.00031543427,0.000039348615,0.00013145873,0.0004573912,0.000048206333],"domain_scores_gemma":[0.9993523,0.000270561,0.000057381723,0.00008906112,0.00019295467,0.000037666177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010676399,0.0009771627,0.0008246008,0.0008030292,0.000555491,0.00085399963,0.0014868022,0.0017959652,0.004079132],"category_scores_gemma":[0.0025350521,0.0005087968,0.0011407884,0.00085878035,0.00095179304,0.0009204184,0.0018707073,0.0026012398,0.0022533701],"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.00008313338,0.00009502427,0.00063116587,0.00035320417,0.00015207587,0.00019277848,0.00016108097,0.56084496,0.03427756,0.1302171,0.012403908,0.26058793],"study_design_scores_gemma":[0.000008816335,0.00002110146,0.00005685963,0.0000150593205,0.0000071424506,0.000044868833,0.0000059003296,0.98162234,0.0017421129,0.008629095,0.00783111,0.000015588561],"about_ca_topic_score_codex":0.0028309464,"about_ca_topic_score_gemma":0.0036807903,"teacher_disagreement_score":0.004079132,"about_ca_system_score_codex":0.0005140952,"about_ca_system_score_gemma":0.0013436159,"threshold_uncertainty_score":0.013646066},"labels":[],"label_agreement":null},{"id":"W2981143387","doi":"10.1007/s10589-019-00142-5","title":"Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"","keywords":"Heuristics; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Integer programming; Computer science; Heuristic; Mathematics; Algorithm; Schedule","score_opus":0.008094846714795557,"score_gpt":0.20937194582739083,"score_spread":0.20127709911259528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981143387","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.089338236,0.0017455599,0.89860636,0.0006699616,0.00040818242,0.0005414064,0.00038037787,0.0012356867,0.007074164],"genre_scores_gemma":[0.52945805,0.00062257133,0.46498454,0.00023026761,0.00018360479,0.00038814533,0.00050384464,0.00027544107,0.003353507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883443,0.0004953858,0.00005479991,0.000181401,0.00020340977,0.00023068611],"domain_scores_gemma":[0.99609476,0.002932947,0.000312302,0.00019496707,0.00023669623,0.00022833842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800241,0.0012519403,0.002046868,0.0013560647,0.000774379,0.0014833326,0.002665959,0.0014058414,0.0032750475],"category_scores_gemma":[0.004880769,0.0010422951,0.0010561459,0.0017426843,0.00071308727,0.0016355693,0.0008263037,0.0017285114,0.0003823841],"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.00024051045,0.00018588647,0.0002137146,0.00015831595,0.00005525698,0.00004843158,0.000043755615,0.9523862,0.0008232351,0.006344038,0.003043489,0.036457192],"study_design_scores_gemma":[0.00007661699,0.00007973276,0.00009354985,0.0000083163195,0.000017397082,0.000016570457,0.000016856622,0.9944722,0.00024121543,0.004457197,0.00051208417,0.000008135564],"about_ca_topic_score_codex":0.0068834615,"about_ca_topic_score_gemma":0.0095104,"teacher_disagreement_score":0.0068834615,"about_ca_system_score_codex":0.0016267945,"about_ca_system_score_gemma":0.003246525,"threshold_uncertainty_score":0.014809251},"labels":[],"label_agreement":null},{"id":"W3043869225","doi":"10.1007/s10589-022-00377-9","title":"Accelerated inexact composite gradient methods for nonconvex spectral optimization problems","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"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":"Office of Naval Research; National Science Foundation of Sri Lanka; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Differentiable function; Composite number; Lipschitz continuity; Gradient method; Singular value; Matrix (chemical analysis); Proximal Gradient Methods; Function (biology); Convex function; Mathematical optimization; Applied mathematics; Optimization problem; Convex optimization; Regular polygon; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors; Geometry","score_opus":0.02793974280159954,"score_gpt":0.3031777671272709,"score_spread":0.27523802432567135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043869225","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.002744227,0.00017171392,0.9951633,0.00011859628,0.00008400653,0.00001650361,0.000019693267,0.00010908111,0.0015727931],"genre_scores_gemma":[0.14554746,0.0006859661,0.8418476,0.0001866593,0.00026782398,0.0002435627,0.00019770091,0.00041656927,0.010606663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00027171336,0.000026519407,0.00005542733,0.00030734917,0.000036585647],"domain_scores_gemma":[0.9977464,0.0013950819,0.00014947435,0.0001932428,0.00040930146,0.00010643534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624687,0.001256049,0.0011661362,0.000743027,0.00039112213,0.0011599648,0.001227239,0.0016790648,0.004259224],"category_scores_gemma":[0.0057288883,0.00060560915,0.0006971223,0.0008140047,0.0012451974,0.001559662,0.0020020725,0.0026672552,0.0010010455],"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.00024926616,0.00012279782,0.00032428038,0.00040210786,0.000077378725,0.00013737065,0.00016919937,0.74680305,0.006813938,0.111262605,0.007642049,0.12599589],"study_design_scores_gemma":[0.0000089085115,0.000017442284,0.000031901323,0.000008518284,0.0000030380324,0.000015727926,0.0000067004016,0.99075085,0.0005092288,0.007367983,0.0012751947,0.0000045088736],"about_ca_topic_score_codex":0.0018954129,"about_ca_topic_score_gemma":0.003122296,"teacher_disagreement_score":0.004259224,"about_ca_system_score_codex":0.00048313953,"about_ca_system_score_gemma":0.0013231555,"threshold_uncertainty_score":0.01424855},"labels":[],"label_agreement":null},{"id":"W3091576739","doi":"10.1007/s10589-022-00448-x","title":"Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition","year":2023,"lang":"en","type":"preprint","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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","funders":"University of British Columbia Graduate School; Natural Sciences and Engineering Research Council of Canada","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Quasi-Newton method; Inverse; Noise (video); Applied mathematics; Mathematics; Inverse problem; Mathematical optimization; Computer science; Newton's method; Mathematical analysis; Artificial intelligence; Nonlinear system; Geometry; Physics","score_opus":0.10201284216496538,"score_gpt":0.41545003704038547,"score_spread":0.3134371948754201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091576739","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.0025549305,0.00010209785,0.99528116,0.00013063321,0.00007299242,0.00003310888,0.00007455163,0.00034450603,0.0014061134],"genre_scores_gemma":[0.06540541,0.00017160957,0.9274655,0.00024049277,0.00007432016,0.00023676701,0.0002924304,0.00075769343,0.0053557362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999065,0.0004580113,0.000036678954,0.000094989475,0.00030071393,0.000044642307],"domain_scores_gemma":[0.998151,0.00093536585,0.00014915469,0.00020839268,0.0004365052,0.00011951679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001914131,0.0012646754,0.001384643,0.00081093464,0.0005450306,0.0013005784,0.001679889,0.0029410224,0.0048416723],"category_scores_gemma":[0.0060830642,0.0007706798,0.0006252257,0.00084784365,0.0011583759,0.0012869616,0.0019277353,0.0022440956,0.0019194119],"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.00045275156,0.00012610981,0.0007008556,0.00039610843,0.00013677448,0.00016377024,0.0001918757,0.74637693,0.011902455,0.11662826,0.012890316,0.1100338],"study_design_scores_gemma":[0.000012288563,0.000016353273,0.000031976466,0.0000121264275,0.00000348833,0.000013695724,0.000003931877,0.99156183,0.0007180654,0.0060154335,0.0016040184,0.000006758713],"about_ca_topic_score_codex":0.0035621754,"about_ca_topic_score_gemma":0.004486668,"teacher_disagreement_score":0.0048416723,"about_ca_system_score_codex":0.0005824299,"about_ca_system_score_gemma":0.0017249705,"threshold_uncertainty_score":0.016197026},"labels":[],"label_agreement":null},{"id":"W3106015846","doi":"10.1007/s10589-016-9844-y","title":"Building an iterative heuristic solver for a quantum annealer","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"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","funders":"Mitacs","keywords":"Quadratic unconstrained binary optimization; Solver; Quantum annealing; Heuristic; Quantum; Quadratic equation; Tabu search; Optimization problem; Quantum computer","score_opus":0.013357220778580144,"score_gpt":0.27697900528041125,"score_spread":0.2636217845018311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106015846","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.030040955,0.00011232826,0.9457898,0.00040653822,0.00014026377,0.00018610734,0.00010812325,0.0008757787,0.022340165],"genre_scores_gemma":[0.24253374,0.00008234855,0.7473279,0.00019987058,0.000043249784,0.00033389256,0.00013505977,0.00032401833,0.00901989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997092,0.00007025264,0.000010985389,0.000046250745,0.00011308595,0.00005024916],"domain_scores_gemma":[0.99947697,0.00029366004,0.000027951535,0.00005769487,0.000102157865,0.000041570085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726297,0.00058630976,0.0009955093,0.00055371964,0.0011322632,0.0010780657,0.0014931102,0.0022430122,0.011429271],"category_scores_gemma":[0.0022747372,0.00063158944,0.0008474297,0.00058251456,0.0008466286,0.00087514124,0.0013446932,0.0012906565,0.0015000562],"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.00007925148,0.00006945066,0.00044316423,0.00009662687,0.000046509987,0.00014872923,0.00008504129,0.90942043,0.0031468703,0.04712066,0.0023541495,0.036989186],"study_design_scores_gemma":[0.000021672076,0.000014143584,0.000029728259,0.000005165504,0.00000543349,0.000011777758,0.00001734856,0.99262005,0.00047101598,0.0056387,0.0011595532,0.0000053347885],"about_ca_topic_score_codex":0.005751165,"about_ca_topic_score_gemma":0.008506894,"teacher_disagreement_score":0.011429271,"about_ca_system_score_codex":0.0009442425,"about_ca_system_score_gemma":0.0023172298,"threshold_uncertainty_score":0.03823477},"labels":[],"label_agreement":null},{"id":"W3125711631","doi":"10.1007/s10589-020-00261-4","title":"A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Mathematics; Bounding overwatch; Iterated function; Maximum cut; Eigenvalues and eigenvectors; Semidefinite programming; Upper and lower bounds; Mathematical optimization; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.021822011724032295,"score_gpt":0.2932571728029479,"score_spread":0.2714351610789156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125711631","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.008778701,0.00013656919,0.9858838,0.00017497926,0.00009380625,0.00006439448,0.000046641133,0.00006889366,0.00475226],"genre_scores_gemma":[0.16491656,0.00027786513,0.8246684,0.00025929557,0.00013212439,0.00030839033,0.0002644622,0.00032317315,0.008849804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952304,0.00017840629,0.000019352774,0.00007211194,0.00016011465,0.0000469672],"domain_scores_gemma":[0.99933016,0.00029359953,0.00004584674,0.00008132091,0.00015207285,0.00009698519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014078136,0.00078899454,0.0009045463,0.00065667316,0.00064753677,0.0009457029,0.0019143313,0.0014016685,0.005684055],"category_scores_gemma":[0.0029410406,0.00049892545,0.0007698928,0.00057425443,0.0009440369,0.0012312193,0.0020908376,0.0027792659,0.00074000726],"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.0003319624,0.00028952202,0.0006327066,0.00034372427,0.000080984595,0.00019356907,0.0003182177,0.37036672,0.018639512,0.36503056,0.009641581,0.23413098],"study_design_scores_gemma":[0.00002474783,0.00004587221,0.000081505415,0.000023371476,0.000008899571,0.0000300971,0.000023133583,0.96390504,0.0006364582,0.033040106,0.0021707735,0.000010010066],"about_ca_topic_score_codex":0.0018769044,"about_ca_topic_score_gemma":0.0026970997,"teacher_disagreement_score":0.005684055,"about_ca_system_score_codex":0.0006154056,"about_ca_system_score_gemma":0.0014982875,"threshold_uncertainty_score":0.019015014},"labels":[],"label_agreement":null},{"id":"W3134041587","doi":"10.1007/s10589-020-00249-0","title":"Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Probabilistic logic; Martingale (probability theory); Convergence (economics); Extension (predicate logic); Stochastic optimization; Convergence of random variables; Algorithm; Random variable; Computer science; Applied mathematics","score_opus":0.04944740018437694,"score_gpt":0.32636244376584844,"score_spread":0.2769150435814715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134041587","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.0068476084,0.00021492672,0.98987305,0.00016515645,0.00005655708,0.000040108298,0.000032293672,0.00013207867,0.00263818],"genre_scores_gemma":[0.54877543,0.00044898814,0.44124222,0.00024344177,0.00014199696,0.00061786553,0.00021134134,0.00033947558,0.007979165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.0003946965,0.000025845618,0.00007966555,0.00018263578,0.000050796232],"domain_scores_gemma":[0.9945628,0.0044461233,0.00029917012,0.00019085543,0.0003744164,0.00012667189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027496414,0.00097356737,0.002150409,0.0012002261,0.00063633674,0.0014223855,0.0017174428,0.0023026743,0.003990265],"category_scores_gemma":[0.010768261,0.0012326444,0.00097205944,0.0009938926,0.0014435077,0.0015701596,0.002168152,0.0017310163,0.0005215115],"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.000041499217,0.000021356815,0.0001161734,0.000040297673,0.000029170264,0.000016270727,0.000012516492,0.9796723,0.00024728934,0.013806958,0.00033329296,0.0056628445],"study_design_scores_gemma":[0.0000038579456,0.0000030920303,0.000008462597,0.0000025786267,0.0000013479344,0.0000010881918,8.071144e-7,0.9979366,0.000031996562,0.0019517407,0.00005753211,0.0000010245385],"about_ca_topic_score_codex":0.0042482726,"about_ca_topic_score_gemma":0.004015544,"teacher_disagreement_score":0.0042482726,"about_ca_system_score_codex":0.0012307685,"about_ca_system_score_gemma":0.0016018159,"threshold_uncertainty_score":0.014541626},"labels":[],"label_agreement":null},{"id":"W3141233211","doi":"10.1007/s10589-021-00272-9","title":"DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":20,"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","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Multi-objective optimization; Iterated local search; Extension (predicate logic); Context (archaeology); Set (abstract data type); Pareto principle; Mathematics; Computer science; Optimization problem; Metaheuristic","score_opus":0.018983299392605023,"score_gpt":0.29188553682389085,"score_spread":0.27290223743128583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141233211","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.0049384944,0.00024921523,0.9867401,0.00012682383,0.0001226978,0.000068524976,0.00013282595,0.002597384,0.0050238855],"genre_scores_gemma":[0.11768229,0.00014299755,0.8746829,0.00030880078,0.000052946143,0.0004766194,0.0003063876,0.0009322131,0.005414862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994956,0.00018467828,0.000017528035,0.0000640241,0.0001856263,0.000052523486],"domain_scores_gemma":[0.99907494,0.0005519617,0.00005149598,0.000117626405,0.00014322322,0.000060772418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010519966,0.0012101273,0.0015571639,0.0010197297,0.0006723057,0.0010582916,0.0020400642,0.002120629,0.012176845],"category_scores_gemma":[0.0033116387,0.0006900596,0.0009196229,0.0009798463,0.0006140507,0.0009130752,0.0023074434,0.0020977876,0.0021866008],"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.0002821243,0.00018621082,0.00045593927,0.00030139682,0.00015211238,0.00008506681,0.00009064284,0.74843323,0.005149997,0.022269867,0.011325085,0.2112683],"study_design_scores_gemma":[0.000024608356,0.00001733418,0.000028198741,0.000010612738,0.0000045201496,0.000009092692,0.000004732353,0.9947699,0.0006858486,0.0029837913,0.0014577396,0.0000036630008],"about_ca_topic_score_codex":0.0023174733,"about_ca_topic_score_gemma":0.004123377,"teacher_disagreement_score":0.012176845,"about_ca_system_score_codex":0.0006717562,"about_ca_system_score_gemma":0.0011703288,"threshold_uncertainty_score":0.040735602},"labels":[],"label_agreement":null},{"id":"W3180164923","doi":"10.1007/s10589-022-00381-z","title":"Quantifying uncertainty with ensembles of surrogates for blackbox optimization","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":5,"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","funders":"Institut de Valorisation des Données","keywords":"Mathematical optimization; Computer science; Stochastic optimization; Context (archaeology); Optimization problem; Metaheuristic; Mathematics","score_opus":0.022842800052946446,"score_gpt":0.28093445588126226,"score_spread":0.25809165582831584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180164923","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.014821826,0.0002492374,0.9832169,0.00011069087,0.000049777882,0.000017212082,0.000039659375,0.00010585379,0.0013888929],"genre_scores_gemma":[0.7911334,0.0004812648,0.20607749,0.00013673624,0.00011589745,0.00013686919,0.00025295702,0.00021313044,0.0014522914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970644,0.001633692,0.00011095234,0.00026575447,0.0007756577,0.00014958973],"domain_scores_gemma":[0.9914562,0.005769517,0.00060791237,0.0011076484,0.0007976171,0.00026103307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061406638,0.0013392187,0.0020376309,0.001075384,0.0006398,0.0022274177,0.0011476321,0.0020501602,0.0012121669],"category_scores_gemma":[0.019961052,0.0008680848,0.0011379513,0.00090637314,0.0016280705,0.002846467,0.0029869345,0.0022074918,0.00023045353],"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.0000486117,0.000018332717,0.00029438,0.000035253666,0.000051405772,0.000017765527,0.000022290915,0.96932113,0.00071808463,0.021565786,0.00024882366,0.007658072],"study_design_scores_gemma":[0.0000015248772,0.000009578758,0.000042124073,0.0000068119607,0.0000036634747,0.0000052947935,0.0000026098362,0.9865567,0.00024522707,0.013003771,0.00011947107,0.0000032558398],"about_ca_topic_score_codex":0.0006912769,"about_ca_topic_score_gemma":0.0006107186,"teacher_disagreement_score":0.0061406638,"about_ca_system_score_codex":0.0007574406,"about_ca_system_score_gemma":0.00080408395,"threshold_uncertainty_score":0.032475352},"labels":[],"label_agreement":null},{"id":"W3212784844","doi":"10.1007/s10589-022-00364-0","title":"Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"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; Monotone polygon; Regularization (linguistics); Stationary point; Minification; Property (philosophy); Quadratic equation; Applied mathematics; Rate of convergence; Convergence (economics); Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.016634547184986328,"score_gpt":0.2905574431592843,"score_spread":0.273922895974298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212784844","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.007115017,0.0006887645,0.98550063,0.00030281907,0.00012071933,0.00007324498,0.00007861539,0.00013925594,0.0059809233],"genre_scores_gemma":[0.1869038,0.00092832395,0.7913823,0.0003240498,0.00012986014,0.0007438308,0.0003976463,0.00036559757,0.018824605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996456,0.00014303412,0.000022358858,0.00004452106,0.00011364147,0.000030809704],"domain_scores_gemma":[0.99958676,0.00019840835,0.000022973438,0.00004045186,0.00011662414,0.000034782137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235591,0.00094645185,0.0013227264,0.0006374257,0.0006666391,0.0008909276,0.0014229971,0.0019364606,0.0039214897],"category_scores_gemma":[0.0016695975,0.0004993865,0.0009830733,0.00052867335,0.000955118,0.0010823775,0.0020630714,0.0021212718,0.0009116864],"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.00036484026,0.00026608718,0.0011416726,0.0011927553,0.00024061232,0.00035344323,0.0004081161,0.5662591,0.02434241,0.22036804,0.011222993,0.17383991],"study_design_scores_gemma":[0.000019736566,0.000026535467,0.00009840494,0.000024596053,0.000013554321,0.000032060063,0.000019062994,0.98436975,0.0009711261,0.0116171185,0.0027974434,0.000010606096],"about_ca_topic_score_codex":0.0033292277,"about_ca_topic_score_gemma":0.0046733487,"teacher_disagreement_score":0.0039214897,"about_ca_system_score_codex":0.00063696963,"about_ca_system_score_gemma":0.0020757606,"threshold_uncertainty_score":0.013118625},"labels":[],"label_agreement":null},{"id":"W356322785","doi":"10.1007/s10589-015-9762-4","title":"A proximal bundle method for nonsmooth nonconvex functions with inexact information","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":91,"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; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Subgradient method; Mathematics; Convergence (economics); Mathematical optimization; Bounded function; Bundle; Limit (mathematics); Class (philosophy); Function (biology); Applied mathematics; Point (geometry); Computer science; Mathematical analysis","score_opus":0.015490618293717917,"score_gpt":0.2657578315025077,"score_spread":0.2502672132087898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W356322785","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.00075435854,0.000066139975,0.9984774,0.000055429653,0.000048734993,0.000015316964,0.000009587744,0.00006087983,0.00051204953],"genre_scores_gemma":[0.04198677,0.00032702382,0.949528,0.0001182712,0.00015335895,0.00015829167,0.00007318059,0.00030135323,0.007353624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914896,0.00031271484,0.000034936416,0.00012192879,0.00033455118,0.0000469396],"domain_scores_gemma":[0.9989936,0.00043606674,0.00006106992,0.00011706737,0.00026008766,0.00013213576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018236005,0.0011488632,0.0020263281,0.0012048183,0.00080889603,0.0014332571,0.0018549724,0.0028248215,0.007424215],"category_scores_gemma":[0.0035451674,0.00095839857,0.0013213961,0.0012002124,0.0017429565,0.0020347782,0.0037689768,0.00276971,0.002267773],"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.00022751659,0.0002894699,0.00044387835,0.0006972473,0.00018240296,0.00033766055,0.00037878338,0.35606906,0.01802622,0.32874742,0.013189991,0.28141046],"study_design_scores_gemma":[0.000027766413,0.00010257993,0.0000708859,0.000026931539,0.00002215364,0.000100285026,0.000025665608,0.94062924,0.0016082287,0.05010099,0.0072610355,0.000024150811],"about_ca_topic_score_codex":0.0015075562,"about_ca_topic_score_gemma":0.0019372652,"teacher_disagreement_score":0.007424215,"about_ca_system_score_codex":0.0006390714,"about_ca_system_score_gemma":0.0015249824,"threshold_uncertainty_score":0.024836421},"labels":[],"label_agreement":null},{"id":"W4393046351","doi":"10.1007/s10589-024-00567-7","title":"Inexact direct-search methods for bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Università degli Studi di Padova","keywords":"Bilevel optimization; Mathematics; Mathematical optimization; Trust region; Optimization problem; Computer science","score_opus":0.09613370230575952,"score_gpt":0.4657332647181794,"score_spread":0.36959956241241987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393046351","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.002963148,0.00034775876,0.99475163,0.00009004125,0.00003369014,0.000021409773,0.000017353213,0.000061370134,0.0017136943],"genre_scores_gemma":[0.24720599,0.00077844714,0.7445102,0.00019267229,0.00008864442,0.0002911195,0.00014264,0.00020098782,0.0065893857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991698,0.0004184339,0.000037556296,0.000069285015,0.00026820047,0.000036694768],"domain_scores_gemma":[0.9978968,0.0013652338,0.00013829474,0.00024338978,0.00028183914,0.0000744149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018451781,0.00095844065,0.0011172242,0.0006258258,0.00031192155,0.001328896,0.0012263814,0.0013972365,0.0030845087],"category_scores_gemma":[0.006413164,0.00048050078,0.0007031719,0.0006233996,0.0015866056,0.0010612169,0.0025013515,0.0024030805,0.0007613334],"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.00006429703,0.00004645177,0.0002723426,0.00023613969,0.000042121246,0.00006545348,0.00009081519,0.8679717,0.0018333638,0.08551264,0.001150448,0.04271422],"study_design_scores_gemma":[0.000008849611,0.000013963095,0.00002008179,0.000016158163,0.0000022625175,0.000010608379,0.0000055608557,0.98836726,0.00031421924,0.010144791,0.0010925509,0.0000036456465],"about_ca_topic_score_codex":0.0013984638,"about_ca_topic_score_gemma":0.0014678248,"teacher_disagreement_score":0.0030845087,"about_ca_system_score_codex":0.0006108505,"about_ca_system_score_gemma":0.00078709645,"threshold_uncertainty_score":0.0103186965},"labels":[],"label_agreement":null},{"id":"W4399858594","doi":"10.1007/s10589-024-00590-8","title":"Q-fully quadratic modeling and its application in a random subspace derivative-free method","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Subspace topology; Derivative (finance); Quadratic equation; Applied mathematics; Quadratic model; Mathematical optimization; Combinatorics; Mathematical analysis; Statistics; Geometry","score_opus":0.01475561811600928,"score_gpt":0.30298641349624533,"score_spread":0.28823079538023605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399858594","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.0016808197,0.00011722615,0.99690574,0.00011818759,0.000034023877,0.000014141582,0.000019900916,0.00013354441,0.0009764115],"genre_scores_gemma":[0.22921355,0.00050027116,0.75734913,0.00033614773,0.00012552935,0.00022189123,0.00022425069,0.0005516477,0.011477617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00038385976,0.00002489337,0.000075739445,0.0001735099,0.00003290434],"domain_scores_gemma":[0.9986106,0.0007773334,0.00007899432,0.00016661063,0.00029093598,0.00007541056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022723414,0.0007147023,0.0010065425,0.00040433847,0.00047131634,0.000780014,0.0016616422,0.0015563472,0.0035518087],"category_scores_gemma":[0.0042124866,0.0005367602,0.0007185586,0.0006639017,0.0009754614,0.0014384846,0.0018000493,0.00134785,0.0010680477],"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.00010518201,0.000100601304,0.00025575384,0.00020077603,0.000056818004,0.000078764984,0.00008176317,0.78249526,0.004690867,0.15486845,0.003411424,0.05365434],"study_design_scores_gemma":[0.000002621294,0.000008572854,0.000015986474,0.000002748319,0.0000018735294,0.000005851294,0.0000012839216,0.99462295,0.00020415128,0.0046085087,0.00052121363,0.0000042725615],"about_ca_topic_score_codex":0.0031976723,"about_ca_topic_score_gemma":0.0028752882,"teacher_disagreement_score":0.0035518087,"about_ca_system_score_codex":0.0003851949,"about_ca_system_score_gemma":0.0012273133,"threshold_uncertainty_score":0.012017429},"labels":[],"label_agreement":null},{"id":"W4400689395","doi":"10.1007/s10589-024-00588-2","title":"Handling of constraints in multiobjective blackbox optimization","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"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; HEC Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Universidade Nova de Lisboa; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Multi-objective optimization","score_opus":0.00938289075054676,"score_gpt":0.27438086545607177,"score_spread":0.264997974705525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400689395","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.012888791,0.00029378087,0.9831836,0.00015120323,0.00008014437,0.00003780185,0.00002796005,0.00010670208,0.0032299215],"genre_scores_gemma":[0.62029684,0.00044312855,0.37115404,0.00024064525,0.000106805834,0.0002753289,0.00009057788,0.00032653814,0.00706612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.00043027854,0.000024476592,0.00007921777,0.00016974965,0.000060937262],"domain_scores_gemma":[0.9980313,0.0014297744,0.00014997488,0.00013357807,0.00015728,0.000097985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022800842,0.0008957496,0.0014760147,0.00044297666,0.0006864223,0.0015587921,0.0011652047,0.0014295242,0.004775952],"category_scores_gemma":[0.007327109,0.0006773043,0.0005456819,0.00057440856,0.0007668702,0.0019183935,0.0017268971,0.0015042716,0.00037703718],"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.000104066814,0.00005801749,0.0002101029,0.0001488451,0.000047448197,0.000121021396,0.000053268028,0.92458916,0.0019670276,0.041689858,0.0013002951,0.029710835],"study_design_scores_gemma":[0.000007794959,0.000013128083,0.000030538817,0.000010678145,0.000003890852,0.0000107044325,0.000005954539,0.9858279,0.000470228,0.013176996,0.00043902211,0.0000030366266],"about_ca_topic_score_codex":0.0010291792,"about_ca_topic_score_gemma":0.0009295935,"teacher_disagreement_score":0.004775952,"about_ca_system_score_codex":0.00038789373,"about_ca_system_score_gemma":0.000645056,"threshold_uncertainty_score":0.015977144},"labels":[],"label_agreement":null},{"id":"W4403191597","doi":"10.1007/s10589-024-00604-5","title":"The indefinite proximal gradient method","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical methods in inverse problems","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Proximal Gradient Methods; Applied mathematics; Mathematical optimization; Geometry; Regular polygon; Convex function","score_opus":0.05465722513684081,"score_gpt":0.3806338186845009,"score_spread":0.3259765935476601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403191597","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.001212625,0.0004797374,0.99310535,0.00020327137,0.00010150904,0.000016592181,0.000021999982,0.0001075626,0.0047512804],"genre_scores_gemma":[0.15791525,0.0021339513,0.8083663,0.00048204587,0.00049143576,0.000195707,0.0001785927,0.00035976345,0.029876994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993218,0.00029563182,0.000020590312,0.00008381804,0.00024587565,0.00003224015],"domain_scores_gemma":[0.9991775,0.00042431557,0.000049134,0.0000979502,0.00018545082,0.000065593544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012745017,0.0007653109,0.0010607297,0.0008291194,0.00044288186,0.0013019813,0.0011789931,0.0014320217,0.0042332355],"category_scores_gemma":[0.0036800697,0.00051086163,0.00055864017,0.0006547437,0.0015369108,0.0015208182,0.00174736,0.0021592171,0.0018451472],"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.0001353905,0.00008546052,0.00029824043,0.00038523434,0.000071504284,0.00012696002,0.00013604193,0.19129972,0.006712922,0.6066744,0.0096729295,0.18440118],"study_design_scores_gemma":[0.000029510145,0.00006621116,0.00015050711,0.000047526843,0.000025138736,0.00015568153,0.00002054023,0.7889286,0.0023579248,0.18319528,0.024989244,0.000033739205],"about_ca_topic_score_codex":0.0008799046,"about_ca_topic_score_gemma":0.00076307263,"teacher_disagreement_score":0.0042332355,"about_ca_system_score_codex":0.00042357654,"about_ca_system_score_gemma":0.0012044901,"threshold_uncertainty_score":0.014161587},"labels":[],"label_agreement":null},{"id":"W4406214684","doi":"10.1007/s10589-024-00645-w","title":"Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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; Hydro-Québec; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"Solver; Computer science; Fidelity; Mathematical optimization; Bridging (networking); Point (geometry); Algorithm; Mathematics","score_opus":0.019205981593508156,"score_gpt":0.3145895859890645,"score_spread":0.29538360439555633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406214684","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.0027702127,0.000097305485,0.99274194,0.00008528539,0.00009603684,0.000038912603,0.00005402387,0.0010760879,0.0030401328],"genre_scores_gemma":[0.12157807,0.00012630202,0.86851424,0.00021695641,0.000073774536,0.00025986202,0.00025309753,0.0012424486,0.007735145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955326,0.00012608871,0.000016593445,0.00005629316,0.00020340811,0.000044336375],"domain_scores_gemma":[0.999243,0.0003402998,0.000043385244,0.00014724271,0.0001426649,0.0000833651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326628,0.0011633697,0.0013064625,0.00077322207,0.00057216524,0.0010918191,0.0021615648,0.0014778423,0.013579154],"category_scores_gemma":[0.0026494786,0.00057129905,0.00070169417,0.00064795447,0.0007188178,0.0013311736,0.0027374132,0.00229066,0.0024060488],"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.0003027582,0.0001669914,0.00038518268,0.00017458109,0.00010539622,0.00008976351,0.000070132264,0.65194404,0.0054008737,0.059379447,0.014329515,0.26765123],"study_design_scores_gemma":[0.00001685981,0.000016037255,0.000023059754,0.0000058398678,0.000004193842,0.000010883955,0.000003637597,0.9918224,0.0009743854,0.0051538744,0.0019645023,0.0000042861],"about_ca_topic_score_codex":0.0021525514,"about_ca_topic_score_gemma":0.0033964608,"teacher_disagreement_score":0.013579154,"about_ca_system_score_codex":0.00071666937,"about_ca_system_score_gemma":0.0012241919,"threshold_uncertainty_score":0.045426786},"labels":[],"label_agreement":null},{"id":"W4408247203","doi":"10.1007/s10589-025-00669-w","title":"The $$\\omega $$-condition number: applications to preconditioning and low rank generalized Jacobian updating","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Omega; Jacobian matrix and determinant; Rank (graph theory); Applied mathematics; Combinatorics","score_opus":0.006169767764634903,"score_gpt":0.26954499492120315,"score_spread":0.26337522715656825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408247203","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.009024049,0.0009861212,0.9680655,0.0019202074,0.0011458074,0.000059605627,0.00015603077,0.00049171643,0.018150885],"genre_scores_gemma":[0.3004705,0.0022048492,0.6497877,0.0013177029,0.001707204,0.00041759186,0.00039199225,0.0013930997,0.04230928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887663,0.00050587754,0.00005170571,0.00015278968,0.00033931088,0.00007370536],"domain_scores_gemma":[0.99342984,0.004190674,0.00041971717,0.000637609,0.0010061719,0.0003160092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035083331,0.0010830851,0.0012311161,0.0012827946,0.0009153033,0.002028854,0.0016126704,0.0020594804,0.017995546],"category_scores_gemma":[0.021031007,0.0004176033,0.00045579617,0.0015694966,0.0034772207,0.00417151,0.0022057856,0.0037549338,0.0025298102],"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.00028641557,0.00015538278,0.00056105264,0.00036355393,0.000028737275,0.00012324232,0.000155285,0.072984815,0.0040653916,0.7285883,0.026696736,0.16599113],"study_design_scores_gemma":[0.000031601692,0.000046293066,0.00021233871,0.000053249463,0.000011447667,0.0000566776,0.000028235925,0.6471805,0.0024122417,0.34200406,0.0079227835,0.000040547086],"about_ca_topic_score_codex":0.001591135,"about_ca_topic_score_gemma":0.0032898227,"teacher_disagreement_score":0.017995546,"about_ca_system_score_codex":0.0008240509,"about_ca_system_score_gemma":0.0016381682,"threshold_uncertainty_score":0.06020105},"labels":[],"label_agreement":null},{"id":"W4408959881","doi":"10.1007/s10589-025-00676-x","title":"A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Rounding; Regularization (linguistics); Round-off error; Mathematical optimization; Quadratic equation; Error analysis; Algorithm; Applied mathematics; Computer science","score_opus":0.021428376056036993,"score_gpt":0.3476668886019623,"score_spread":0.32623851254592534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408959881","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.00075576134,0.00010209207,0.99740064,0.00006390233,0.00008827027,0.000023499342,0.000022478513,0.00019325268,0.0013501256],"genre_scores_gemma":[0.027934708,0.0001565723,0.9668237,0.00011422077,0.00009349253,0.00013793219,0.00009798167,0.00036078613,0.004280564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987332,0.00043068573,0.000060192062,0.00012623603,0.00059227145,0.000057261583],"domain_scores_gemma":[0.9985207,0.00061933097,0.00009635904,0.00024925795,0.00043408386,0.000080262456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019622815,0.0010220235,0.0013113237,0.00081912224,0.0008084968,0.0012928359,0.0018894695,0.0020099576,0.0058125923],"category_scores_gemma":[0.005056118,0.0006440332,0.0011350396,0.00093956874,0.0008871919,0.0012458088,0.0019916196,0.0026891911,0.002218696],"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.00023402584,0.00020411774,0.0003291125,0.00043322623,0.00012571679,0.0001507901,0.00015139297,0.5624136,0.015102684,0.11367134,0.014793269,0.2923907],"study_design_scores_gemma":[0.000012378378,0.000023278799,0.000027943137,0.000016292359,0.000006750139,0.000023155226,0.000005335045,0.9907933,0.0010480676,0.0051631304,0.002867276,0.000013073],"about_ca_topic_score_codex":0.0027147194,"about_ca_topic_score_gemma":0.0035434242,"teacher_disagreement_score":0.0058125923,"about_ca_system_score_codex":0.00050780375,"about_ca_system_score_gemma":0.0014250083,"threshold_uncertainty_score":0.019445062},"labels":[],"label_agreement":null},{"id":"W4411090176","doi":"10.1007/s10589-025-00701-z","title":"The cosine measure relative to a subspace","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Mount Royal University; University of British Columbia, Okanagan Campus; University of British Columbia; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Measure (data warehouse); Subspace topology; Trigonometric functions; Statistics; Mathematical analysis; Geometry; Data mining; Computer science","score_opus":0.027199923112818897,"score_gpt":0.3709157982805363,"score_spread":0.3437158751677174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411090176","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.039085113,0.002085562,0.9448483,0.00077644625,0.0007466762,0.00005359633,0.0004914921,0.00023692235,0.011675777],"genre_scores_gemma":[0.6453608,0.0058909315,0.32616755,0.00066811615,0.0023490062,0.00024070713,0.0023721294,0.000520588,0.016430149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719775,0.0008231903,0.00019389762,0.0007020689,0.00095131615,0.00013168344],"domain_scores_gemma":[0.99519616,0.0017122658,0.0004982343,0.0009183314,0.001304272,0.00037063076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077581,0.0006462036,0.0011083278,0.0037895828,0.0006960638,0.003293593,0.0009825418,0.0012788445,0.0049443715],"category_scores_gemma":[0.0139137525,0.0002859312,0.0005892731,0.0032451255,0.0021305094,0.004685397,0.0020127946,0.0017658822,0.0017729627],"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.00038949624,0.00009122399,0.002640923,0.00045400174,0.00014265242,0.0001629765,0.00031662092,0.027718764,0.033034887,0.6708583,0.01106524,0.25312474],"study_design_scores_gemma":[0.000046250854,0.0003742771,0.006628848,0.00017000912,0.00009486937,0.0015902334,0.000500597,0.3291599,0.012554812,0.60377806,0.044945125,0.00015699583],"about_ca_topic_score_codex":0.0010524853,"about_ca_topic_score_gemma":0.0006335806,"teacher_disagreement_score":0.0049443715,"about_ca_system_score_codex":0.00064789364,"about_ca_system_score_gemma":0.0009475115,"threshold_uncertainty_score":0.016540587},"labels":[],"label_agreement":null},{"id":"W4413237434","doi":"10.1007/s10589-025-00704-w","title":"Risk-averse constrained blackbox optimization under mixed aleatory/epistemic uncertainties","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Uncertainty quantification; Mathematics; Mathematical optimization; Robust optimization; Mathematical economics; Epistemology; Applied mathematics; Statistics; Philosophy","score_opus":0.027412392189510863,"score_gpt":0.3305064136275489,"score_spread":0.30309402143803804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413237434","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.0758533,0.0004673422,0.9145647,0.0007511973,0.00007228373,0.000040230727,0.00011834148,0.00011789698,0.008014728],"genre_scores_gemma":[0.9487049,0.00025799905,0.04477322,0.00013149947,0.000051955434,0.00008763472,0.00008783042,0.0000721943,0.0058328314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880266,0.0005938358,0.000044661963,0.00020392385,0.00021007509,0.00014487641],"domain_scores_gemma":[0.99435765,0.0041897204,0.0006098525,0.0002260122,0.00033564493,0.00028103328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003967831,0.0014696677,0.0023727054,0.00077116163,0.0005942233,0.003567957,0.0011022893,0.002620557,0.0028994996],"category_scores_gemma":[0.015251958,0.0010813485,0.0010294357,0.0007754018,0.0023218233,0.0028717713,0.0032078945,0.0015928107,0.0002104562],"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.00007729356,0.000020532618,0.00024067883,0.00004689281,0.000049438353,0.00006411804,0.000021344498,0.9620772,0.00040693438,0.03449574,0.00019619857,0.0023035314],"study_design_scores_gemma":[0.000007646946,0.0000111264,0.00005015102,0.000007709832,0.0000080438385,0.00000766895,0.0000054661937,0.9837213,0.00018170939,0.015929835,0.00006499067,0.000004194747],"about_ca_topic_score_codex":0.0024818291,"about_ca_topic_score_gemma":0.0015078319,"teacher_disagreement_score":0.003967831,"about_ca_system_score_codex":0.001082213,"about_ca_system_score_gemma":0.00126849,"threshold_uncertainty_score":0.020984173},"labels":[],"label_agreement":null},{"id":"W61549919","doi":"10.1023/a:1011220302800","title":"On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","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":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Extrapolation; Convergence (economics); Rate of convergence; Context (archaeology); Asymptotically optimal algorithm; Applied mathematics; Mathematical optimization; Nonlinear system; Penalty method; Newton's method; Interior point method; Algorithm; Mathematical analysis; Computer science; Key (lock)","score_opus":0.029885781864656596,"score_gpt":0.3180605713322898,"score_spread":0.2881747894676332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61549919","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.051876634,0.005668923,0.8549022,0.006817537,0.0010503713,0.000117383235,0.00030854836,0.0009269375,0.07833145],"genre_scores_gemma":[0.765513,0.0050589764,0.17130537,0.002788842,0.0013826679,0.00051539263,0.00061384024,0.0021583615,0.05066355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732554,0.0012971167,0.00009666925,0.00022464702,0.00072724855,0.00032881164],"domain_scores_gemma":[0.96759117,0.025378823,0.0010275508,0.0018562941,0.0029982862,0.0011478653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075435457,0.0012505762,0.0013663156,0.0017201573,0.0010252753,0.0026315239,0.0022065886,0.0016137918,0.011345278],"category_scores_gemma":[0.044600166,0.0006678143,0.00095827447,0.0013302072,0.0037260358,0.0065809935,0.0036684163,0.0065695876,0.0025250341],"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.00060563354,0.00009532274,0.0009980068,0.00031060228,0.00003512213,0.00012864613,0.00023917924,0.056226056,0.0035278772,0.8999589,0.010657266,0.027217332],"study_design_scores_gemma":[0.000061383944,0.00008398172,0.00035766084,0.00007392993,0.000021851683,0.00009072037,0.000054740063,0.593713,0.0020397878,0.39869374,0.0047787293,0.000030481555],"about_ca_topic_score_codex":0.0023702856,"about_ca_topic_score_gemma":0.0016702454,"teacher_disagreement_score":0.011345278,"about_ca_system_score_codex":0.0018634514,"about_ca_system_score_gemma":0.0024500182,"threshold_uncertainty_score":0.03989458},"labels":[],"label_agreement":null}]}