{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":604,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":604,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"324c8f9817be","filters":{"topic":"Advanced Optimization Algorithms Research"}},"results":[{"id":"W1509803206","doi":"10.1007/978-1-4757-9859-3","title":"Convex analysis and nonlinear optimization : theory and examples","year":2000,"lang":"en","type":"book","venue":"University of Maribor digital library (University of Maribor)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":852,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Convex analysis; Duality (order theory); Mathematics; Notation; Nonlinear programming; Convex optimization; Karush–Kuhn–Tucker conditions; Regular polygon; Nonlinear system; Applied mathematics; Mathematical optimization; Pure mathematics; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01060076422029102,"gpt":0.1986446728322179,"spread":0.1880439086119269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001967663,0.0003735316,0.0009783701,0.001085743,0.000256752,0.00007410488,0.0006019566,0.0004625227,0.004099611],"category_scores_gemma":[0.00007134902,0.0005112383,0.000284517,0.0006155703,0.001247438,0.001971644,0.0009940943,0.0003677379,0.000008388245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007358906,"about_ca_system_score_gemma":0.0003561137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004099982,"about_ca_topic_score_gemma":0.00002282046,"domain_scores_codex":[0.9982116,0.0001587321,0.0002590107,0.0006205781,0.0004666001,0.0002835072],"domain_scores_gemma":[0.997446,0.001086119,0.0005192318,0.0004994465,0.0001883635,0.0002608493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.02084193,0.003932137,0.02820537,0.01012508,0.03700393,0.002449389,0.0158194,0.03805193,0.00001150568,0.3526778,0.1615332,0.3293484],"study_design_scores_gemma":[0.01204524,0.001234395,0.004442176,0.00131708,0.0107284,0.00008083285,0.01600348,0.1318528,0.0000384702,0.1738323,0.6433118,0.005113005],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005044286,0.0007167108,0.3789543,0.0005856548,0.0000664965,0.001545837,0.01703229,0.0004887956,0.5955657],"genre_scores_gemma":[0.0004490284,0.003899717,0.2243329,0.00002358399,0.00003197104,5.306542e-8,0.004378618,0.00008378078,0.7668003],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4817786,"threshold_uncertainty_score":0.9997339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980450998","doi":"10.1007/s10107-002-0349-3","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":664,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Conic section; Conic optimization; Quadratic equation; Mathematics; Quadratic programming; Mathematical optimization; Dual (grammatical number); Quadratic unconstrained binary optimization; Optimization problem; Extension (predicate logic); Algorithm; Computer science; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06817259144325699,"gpt":0.4259764846376932,"spread":0.3578038931944362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002623479,0.0003263585,0.0005258485,0.0001821098,0.000330141,0.0002258598,0.0001981624,0.0001252366,0.0009750154],"category_scores_gemma":[0.009862697,0.0002876878,0.0001909774,0.0003807051,0.00008004856,0.0002154226,0.00009735654,0.000280267,0.00003969335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001972795,"about_ca_system_score_gemma":0.00008399964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.467291e-7,"about_ca_topic_score_gemma":0.000001691176,"domain_scores_codex":[0.9968729,0.0002757161,0.0009211889,0.0005104379,0.0005358256,0.0008839234],"domain_scores_gemma":[0.9956991,0.003062261,0.0002977216,0.0004594033,0.0002914919,0.0001900442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004935411,0.0004465581,0.000002622029,0.0009043054,0.00010024,0.000007095843,0.00104694,0.006106818,0.0001422867,0.9629189,0.000211545,0.02806336],"study_design_scores_gemma":[0.001302806,0.0003399625,1.003146e-7,0.0001889427,0.0000648549,0.00003823508,0.0009470081,0.570731,0.002146063,0.4224487,0.001435737,0.0003565649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003155732,0.00001597285,0.9935948,0.0001994984,0.00005851876,0.002490191,0.000006099114,0.0002685842,0.003050805],"genre_scores_gemma":[0.006132347,0.000001909328,0.9921215,0.00008715472,0.00004111009,0.0008436703,0.00001759741,0.0001141634,0.0006406112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5646242,"threshold_uncertainty_score":0.9999575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094132822","doi":"10.1145/1916461.1916468","title":"Algorithm 909","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":627,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Software; Mathematical optimization; Algorithm; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1198276313203575,"gpt":0.3502867428089378,"spread":0.2304591114885803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002886584,0.0002854252,0.0003601114,0.0001960584,0.0002721433,0.00003449159,0.0006331673,0.0001793382,0.009935072],"category_scores_gemma":[0.001257513,0.0002482624,0.0001924172,0.0004679725,0.0001636724,0.0002418476,0.00002356071,0.000489202,0.001311008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009476496,"about_ca_system_score_gemma":0.00004633758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000033689,"about_ca_topic_score_gemma":0.00000184235,"domain_scores_codex":[0.9979106,0.00008550988,0.0004823522,0.0004066282,0.0006167218,0.0004982363],"domain_scores_gemma":[0.9971861,0.001113619,0.00008662282,0.001142176,0.000192423,0.0002791214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003935643,0.001571897,0.000007545175,0.0001655577,0.0001182865,0.00003886136,0.001235429,0.0001018539,0.000007863947,0.00533995,0.00010659,0.9912668],"study_design_scores_gemma":[0.0004593733,0.0001419208,0.00001722535,0.00006946546,0.000047271,0.00003984444,0.000196855,0.001340786,0.001708678,0.9953488,0.0003365692,0.0002931744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001727926,0.00001188857,0.9972354,0.0001436544,0.00009306479,0.0004669061,0.00004283361,0.0006989336,0.001134554],"genre_scores_gemma":[0.0005609176,0.00002060417,0.9951409,0.0001157667,0.00003286445,0.0001690457,0.000004329772,0.00009060906,0.003865012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9909737,"threshold_uncertainty_score":0.999997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166798101","doi":"10.1137/050623802","title":"Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":462,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Semidefinite programming; Mathematics; Explained sum of squares; Polynomial; Graph; Constraint (computer-aided design); Mathematical optimization; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02864254912039413,"gpt":0.3143879728623788,"spread":0.2857454237419847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494784,0.0002402592,0.0003332198,0.0003873615,0.0003896499,0.0001533778,0.0001436272,0.0001516016,0.00006354244],"category_scores_gemma":[0.0004502451,0.0002007855,0.00007282021,0.0005159615,0.0001360099,0.0004721509,0.00003043688,0.0002663988,4.124326e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251003,"about_ca_system_score_gemma":0.0001303554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007377095,"about_ca_topic_score_gemma":0.00001615433,"domain_scores_codex":[0.9981179,0.0001105865,0.0006494523,0.0002880708,0.0005134164,0.00032056],"domain_scores_gemma":[0.9975785,0.0003320273,0.00080496,0.0002163777,0.0009509992,0.0001171285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002741349,0.000196544,0.0003426814,0.00009307396,0.00004095961,0.000001588798,0.0001123535,0.9942642,0.0000563715,0.002772247,0.0005000164,0.001345772],"study_design_scores_gemma":[0.002934299,0.001063088,0.0001859411,0.0001756123,0.00007929809,0.00007252345,0.00009641839,0.9884124,0.0006645985,0.00574602,0.0002819985,0.0002878333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0049658,0.00006505015,0.99243,0.0002915305,0.00008784881,0.001555155,0.00005083159,0.0001052066,0.00044855],"genre_scores_gemma":[0.04071095,0.0001508193,0.9582954,0.00001908062,0.0001641935,0.00008418834,0.0001740874,0.00007462774,0.0003266751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03574515,"threshold_uncertainty_score":0.8187795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W91728630","doi":"10.1007/978-1-4614-0769-0","title":"Handbook on Semidefinite, Conic and Polynomial Optimization","year":2011,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":323,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Conic optimization; Conic section; Semidefinite programming; Semidefinite embedding; Thriving; Mathematical optimization; Mathematics; Quadratically constrained quadratic program; Computer science; Convex optimization; Regular polygon; Quadratic programming; Sociology; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1113105285699546,"gpt":0.442183815253248,"spread":0.3308732866832934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.01784525,0.0008469857,0.0006910182,0.01777929,0.003776357,0.004535385,0.007546738,0.0003320958,0.003647481],"category_scores_gemma":[0.004184849,0.0008841449,0.0001348527,0.006999392,0.01247581,0.007929158,0.006873775,0.002653973,0.0003384292],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008226146,"about_ca_system_score_gemma":0.00182848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003452652,"about_ca_topic_score_gemma":0.002655518,"domain_scores_codex":[0.9797885,0.0007111963,0.0019904,0.003315342,0.01180805,0.002386533],"domain_scores_gemma":[0.9922372,0.0006628068,0.0001662274,0.00193191,0.0044366,0.0005652683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000386809,0.0005886304,0.00007524563,0.000129585,0.0001261793,0.0002508322,0.00103924,0.2682423,0.00009404898,0.72062,0.005867459,0.002579727],"study_design_scores_gemma":[0.006129406,0.001285877,0.001516648,0.004491813,0.00006079001,0.0001530559,0.00938713,0.6130552,0.0009721713,0.1473705,0.2122097,0.003367751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0009218873,0.0001954897,0.01267373,0.007257761,0.002627747,0.00715166,0.0002698706,0.000227565,0.9686743],"genre_scores_gemma":[0.01096771,0.0148516,0.1468692,0.0002150233,0.0004800472,0.003209277,0.000523782,0.0002009637,0.8226824],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5732495,"threshold_uncertainty_score":0.999647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1592751003","doi":"10.1090/surv/146/02","title":"Positive polynomials and sums of squares","year":2008,"lang":"en","type":"book-chapter","venue":"Mathematical surveys and monographs","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":274,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Algebraic number; Pure mathematics; Semidefinite programming; Explained sum of squares; Moment (physics); Algebra over a field; Isotropy; Real algebraic geometry; Quadratic equation; Discrete mathematics; Combinatorics; Mathematical analysis; Physics; Mathematical optimization; Quantum mechanics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05852086305204175,"gpt":0.3177076905527647,"spread":0.2591868275007229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001145984,0.0003995658,0.0009875454,0.0003152109,0.0001184831,0.00003675674,0.0001443464,0.0003527232,0.0003510815],"category_scores_gemma":[0.0004274407,0.0003364048,0.0001670498,0.00007537245,0.0007261036,0.00008252994,0.0001991224,0.000314649,0.000009135596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001771277,"about_ca_system_score_gemma":0.00003429932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009079934,"about_ca_topic_score_gemma":0.000007650639,"domain_scores_codex":[0.9979489,0.0001903109,0.0007026541,0.0004090924,0.0004522456,0.0002967528],"domain_scores_gemma":[0.9968463,0.002020584,0.0003129831,0.0003660572,0.0002274464,0.0002266752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007668995,0.0003029805,0.0002053451,0.002438199,0.0009086681,0.00009288877,0.002068587,0.00000466519,0.00008721825,0.9238131,0.004583255,0.06541838],"study_design_scores_gemma":[0.0008937852,0.0003254792,0.0004142152,0.0008023717,0.0001558605,0.0001041698,0.00008245108,0.0007811054,0.0004328116,0.9931419,0.002037667,0.0008281334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.007376033,0.008907424,0.3815655,0.0003450419,0.0001660705,0.004202819,0.001994477,0.0003484822,0.5950941],"genre_scores_gemma":[0.0390182,0.04199374,0.4728407,0.0001562657,0.0003576675,0.0001901837,0.0004155168,0.001021968,0.4440057],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1510884,"threshold_uncertainty_score":0.9999088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4293258886","doi":"10.1090/surv/146","title":"Positive Polynomials and Sums of Squares","year":2008,"lang":"en","type":"book","venue":"Mathematical surveys and monographs","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":255,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05006270308788904,"gpt":0.3235253086362659,"spread":0.2734626055483769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00147827,0.0004074356,0.001093017,0.000345671,0.0001275028,0.00004394979,0.0001749241,0.000384509,0.0001498502],"category_scores_gemma":[0.0007234339,0.0003418793,0.0001683294,0.0001623928,0.0007770808,0.00009370299,0.0002228996,0.0003536282,0.000007465496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003215722,"about_ca_system_score_gemma":0.00009504503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008871287,"about_ca_topic_score_gemma":0.000007319466,"domain_scores_codex":[0.9975273,0.0004351909,0.000747193,0.0004344757,0.0005004568,0.0003553797],"domain_scores_gemma":[0.9958875,0.00289905,0.0003359441,0.0003907291,0.0002428931,0.0002438394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000151422,0.001091566,0.0006888534,0.008716056,0.001895834,0.0001822851,0.005212006,0.00001112694,0.0001579057,0.8540013,0.04292004,0.08497164],"study_design_scores_gemma":[0.00103317,0.0003446743,0.0006099973,0.0009138294,0.0001641627,0.0001024959,0.0001179852,0.001075946,0.0004248372,0.9924209,0.001943034,0.0008490089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.009174401,0.008157345,0.5572439,0.000284089,0.0001961196,0.004916099,0.002332294,0.0003895678,0.4173062],"genre_scores_gemma":[0.008048155,0.01759158,0.3574299,0.0001084562,0.0003199775,0.0002306937,0.0005185712,0.0006665556,0.6150861],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.199814,"threshold_uncertainty_score":0.9999033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112079301","doi":"10.1007/s101070200296","title":"Self-regular functions and new search directions for linear and semidefinite optimization","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":210,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Function (biology); Upper and lower bounds; Kernel (algebra); Interior point method; Polynomial; Semidefinite programming; Discrete mathematics; Algorithm; Mathematical analysis; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.1030337261159072,"gpt":0.3484202648766631,"spread":0.2453865387607559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187114,0.0001941862,0.0002780098,0.0001683892,0.0004182046,0.0001564103,0.00008692866,0.0001221892,0.0002245133],"category_scores_gemma":[0.001334383,0.0001806973,0.00006037919,0.0004012708,0.0001190408,0.0002365466,0.0001024839,0.0002046383,0.00002267207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004960578,"about_ca_system_score_gemma":0.000019889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002063917,"about_ca_topic_score_gemma":0.0000015437,"domain_scores_codex":[0.9984905,0.00005697416,0.0003718527,0.0003602676,0.0003044927,0.0004159144],"domain_scores_gemma":[0.9981171,0.001076155,0.00006808392,0.0002547448,0.0001857457,0.0002981515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008024943,0.002674767,0.0002055082,0.005426398,0.0006427486,0.00001662041,0.008944921,0.01947155,0.00009166916,0.2821529,0.004407222,0.6758854],"study_design_scores_gemma":[0.0007230125,0.0001200228,0.000001193155,0.00006615144,0.00008007888,0.00004846415,0.0003688966,0.9571442,0.00005175818,0.03140854,0.009768886,0.0002187872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004592836,0.0003483673,0.9955627,0.0008115657,0.0000318594,0.001211439,0.00000678283,0.0004124869,0.00115555],"genre_scores_gemma":[0.0008771002,0.0001737842,0.9927822,0.0000207012,0.0001132561,0.0001901202,0.00001028937,0.00006683824,0.005765684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9376727,"threshold_uncertainty_score":0.7368624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153235257","doi":"10.4086/toc.2009.v005a011","title":"","year":2009,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":198,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematical proof; TRACE (psycholinguistics); Bounded function; Mathematics; Semidefinite programming; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06200837786253834,"gpt":0.3889094610674776,"spread":0.3269010832049393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586117,0.0001740565,0.0004063231,0.000189124,0.0001911092,0.000019971,0.0004539578,0.00005830068,0.00002341109],"category_scores_gemma":[0.002367985,0.0001672352,0.00009906424,0.0004741068,0.0001488887,0.00018585,0.0001098117,0.0002352595,0.000001496408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003842685,"about_ca_system_score_gemma":0.00003534556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.303733e-7,"about_ca_topic_score_gemma":1.656518e-7,"domain_scores_codex":[0.9977635,0.0004100126,0.0006338414,0.0002552506,0.0004916137,0.0004457709],"domain_scores_gemma":[0.9960346,0.002733673,0.0003329938,0.0004684133,0.0003214676,0.0001088068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001203119,0.0002119797,0.00007097495,0.00004024189,0.00002192388,0.000006616761,0.003529433,0.02830519,0.002516919,0.8173894,0.00001131916,0.1477758],"study_design_scores_gemma":[0.0007650985,0.0001896271,0.00127055,0.00009173111,0.000009682896,0.00001478288,0.0008345613,0.0684809,0.01222209,0.9159558,0.000003560387,0.00016165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3823706,0.00002886765,0.6161327,0.0001589128,0.00002345745,0.0001803825,6.121637e-7,0.0001513214,0.0009531329],"genre_scores_gemma":[0.6156945,0.000002514289,0.3840981,0.00008792955,0.0000486284,4.652337e-7,8.092049e-7,0.0000128072,0.00005426327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2333239,"threshold_uncertainty_score":0.6819655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549791526","doi":"10.1023/a:1026583532263","title":"On Copositive Programming and Standard Quadratic Optimization Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":197,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Orthant; Positive-definite matrix; Semidefinite programming; Conic optimization; Cone (formal languages); Quadratically constrained quadratic program; Affine transformation; Scaling; Simplex; Relaxation (psychology); Combinatorics; Matrix (chemical analysis); Quadratic programming; Applied mathematics; Mathematical optimization; Convex optimization; Regular polygon; Pure mathematics; Algorithm; Convex set; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01776061782903075,"gpt":0.3325683721105566,"spread":0.3148077542815259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514227,0.0002053333,0.0003581433,0.0001123933,0.000174764,0.0001682376,0.0001495757,0.0001155085,0.0005223536],"category_scores_gemma":[0.000539711,0.0001788624,0.00007398469,0.0005967731,0.00009341521,0.0006484823,0.00002356752,0.0002194891,0.000004212012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003578758,"about_ca_system_score_gemma":0.0001366666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002130761,"about_ca_topic_score_gemma":0.000002098073,"domain_scores_codex":[0.9978933,0.0001697478,0.0007126672,0.0002062928,0.0007471355,0.0002708159],"domain_scores_gemma":[0.9981384,0.0002000501,0.0004900561,0.0001537564,0.0008334114,0.0001843244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003222683,0.0001430642,0.00006329432,0.00003764547,0.00005467686,0.00001439428,0.000185094,0.980352,0.000001222014,0.003274034,0.000271184,0.01528115],"study_design_scores_gemma":[0.002428594,0.001430254,0.00003102061,0.0003448621,0.0001042844,0.0002204329,0.0002120939,0.983952,0.00003702317,0.01071918,0.0002420315,0.0002782111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003441901,0.0001592791,0.9932499,0.0004376343,0.00008417278,0.0005357256,0.00001743586,0.00004971533,0.00202423],"genre_scores_gemma":[0.0321202,0.0005030433,0.9669111,0.00009396052,0.00008824911,0.0000103606,0.00001302303,0.00003697937,0.0002230687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0286783,"threshold_uncertainty_score":0.7293797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004906124","doi":"10.1016/j.advengsoft.2013.03.001","title":"A survey of non-gradient optimization methods in structural engineering","year":2013,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":192,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Heuristic; Computer science; Mathematical optimization; Convergence (economics); Engineering optimization; Optimization problem; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02112243520440125,"gpt":0.3640855014981272,"spread":0.3429630662937259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000479937,0.0002119006,0.0003815086,0.0004624606,0.00001569296,0.00001716701,0.0002428401,0.00009011872,0.00006783479],"category_scores_gemma":[0.004425834,0.0002210645,0.00003644675,0.001092558,0.00002516186,0.0006576302,0.00008331698,0.0002831893,0.000001782119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001673229,"about_ca_system_score_gemma":0.00002532925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008788654,"about_ca_topic_score_gemma":0.00003580806,"domain_scores_codex":[0.9985003,0.00006367264,0.000550528,0.0002660589,0.0002294636,0.0003900153],"domain_scores_gemma":[0.9980658,0.001277277,0.0001045981,0.0002899539,0.0001903797,0.00007196457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000369211,0.00001870934,0.006247879,0.000248169,0.000006205677,0.000002120306,0.0001591332,0.9840254,0.00007748493,0.0001288275,0.000002061623,0.009080272],"study_design_scores_gemma":[0.0003934783,0.00002367268,0.02130841,0.0001642321,0.00000193828,0.000002266764,0.00002056553,0.9770166,0.0004185828,0.0004225231,0.00001580647,0.0002119828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01341314,0.0007052703,0.9851131,0.000005631854,0.0001891922,0.0004410696,0.000009321658,0.0001073024,0.00001593143],"genre_scores_gemma":[0.07401407,0.0001297735,0.9256344,0.000002786848,0.00001350772,0.000110914,0.00001926106,0.00005637379,0.00001895425],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06060093,"threshold_uncertainty_score":0.9014748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1632219083","doi":"10.1090/s0002-9947-02-03088-x","title":"The radius of metric regularity","year":2002,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":186,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Parameterized complexity; Metric (unit); Constraint (computer-aided design); Variational inequality; RADIUS; Mathematical analysis; Applied mathematics; Pure mathematics; Geometry; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04377922803604589,"gpt":0.3291177231930503,"spread":0.2853384951570044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509851,0.000135573,0.000386733,0.00003355066,0.0003446779,0.00001490874,0.0006368072,0.00004408328,0.0003752185],"category_scores_gemma":[0.0006463961,0.00007711329,0.0005516845,0.001544186,0.001626417,0.0000710117,0.00003387708,0.0003134036,0.00001002256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006995344,"about_ca_system_score_gemma":0.00002279666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001512691,"about_ca_topic_score_gemma":0.000002075906,"domain_scores_codex":[0.9982367,0.0001569902,0.0005195442,0.0001525246,0.0006643253,0.000269942],"domain_scores_gemma":[0.9962277,0.002279658,0.0004027869,0.0008241568,0.0001948413,0.00007084134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002613548,0.01236396,0.0003801657,0.003550802,0.00526389,0.000003161628,0.0237249,0.0203078,0.007406499,0.4970424,0.04246476,0.3872303],"study_design_scores_gemma":[0.001205446,0.000323238,0.0004049387,0.0001326082,0.0004627428,0.00004044539,0.005082844,0.3939842,0.01616316,0.5800249,0.001671657,0.000503852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008398124,0.0001242857,0.9869364,0.002024863,0.00004230004,0.0004554653,0.00002438459,0.0000571063,0.001937077],"genre_scores_gemma":[0.4924384,0.0005723569,0.5019571,0.00006496151,0.00002513493,0.00005537949,3.720201e-7,0.00005079564,0.004835501],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4849793,"threshold_uncertainty_score":0.59926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1530501119","doi":"10.1007/s101079900106","title":"A branch and cut algorithm for nonconvex quadratically constrained quadratic programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":183,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Mathematics; Tree (set theory); Linearization; Mathematical optimization; Quadratic programming; Quadratic equation; Node (physics); Quadratically constrained quadratic program; Branch and cut; Second-order cone programming; Algorithm; Linear programming; Combinatorics; Convex optimization; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.03949063608831347,"gpt":0.3537206788466457,"spread":0.3142300427583322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001177344,0.0004796871,0.0008136349,0.0001516895,0.0004260847,0.0004104083,0.0003278076,0.0002453231,0.001113571],"category_scores_gemma":[0.001676718,0.000424037,0.0001995947,0.000474088,0.0006075249,0.0003512242,0.00008820053,0.0003993522,0.00009663561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008257894,"about_ca_system_score_gemma":0.0001117782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000294683,"about_ca_topic_score_gemma":0.000005720246,"domain_scores_codex":[0.9962547,0.0001335864,0.001078495,0.0007126952,0.0007012106,0.001119287],"domain_scores_gemma":[0.9962541,0.002292949,0.000170611,0.0005170277,0.0002853466,0.0004800093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000294063,0.0004987181,0.000006698116,0.000754262,0.00008259348,0.00001537597,0.0008869472,0.00001089999,0.00002972481,0.03719576,0.00006663286,0.960423],"study_design_scores_gemma":[0.003291147,0.0006803828,0.000004071868,0.0004351522,0.0001789818,0.0002556017,0.0008975644,0.5156506,0.0003629132,0.4657559,0.01147906,0.001008672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002803241,0.00009282822,0.9903378,0.0005767021,0.00003932335,0.003673022,0.00001656797,0.0005348636,0.00192564],"genre_scores_gemma":[0.009373119,0.00001600879,0.9863354,0.00009788556,0.0001528887,0.001222635,0.00002262293,0.0001353418,0.00264409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9594143,"threshold_uncertainty_score":0.9998211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150116987","doi":"10.1017/s0962492904000248","title":"Numerical methods for large-scale nonlinear optimization","year":2005,"lang":"en","type":"article","venue":"Acta Numerica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Differentiable function; Mathematical optimization; Nonlinear system; Constrained optimization; Nonlinear programming; Optimization problem; Software; Scale (ratio); Algorithm; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04505452329796039,"gpt":0.4372005856818338,"spread":0.3921460623838734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005501451,0.0002016181,0.0003418057,0.0001177678,0.0002088717,0.00005066483,0.0003127126,0.0001188577,0.0009177076],"category_scores_gemma":[0.001531769,0.0001970644,0.0001306174,0.0005215316,0.00003868403,0.0003259585,0.00008290813,0.0002017046,0.00004529826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000129025,"about_ca_system_score_gemma":0.00006717029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001585064,"about_ca_topic_score_gemma":7.199594e-7,"domain_scores_codex":[0.9982293,0.0001497482,0.0004140413,0.0003954105,0.0002698112,0.0005416994],"domain_scores_gemma":[0.9979228,0.0009668723,0.0001669444,0.0004656765,0.0002964532,0.0001812767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003614058,0.002656502,0.00009256475,0.0002257524,0.0002498482,0.000003608433,0.0025719,0.4931754,0.001034526,0.005168633,0.03516271,0.4592972],"study_design_scores_gemma":[0.0006082638,0.00005684517,0.000003082644,0.000006162681,0.00001749531,0.000005292573,0.00007727568,0.7958038,0.001082853,0.001413685,0.2007313,0.0001938753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002795057,0.00005397994,0.9945726,0.002120982,0.00009789922,0.000617085,0.00002648059,0.0002413682,0.002241611],"genre_scores_gemma":[0.0007523468,0.00006106674,0.9959157,0.0003980536,0.0003277372,0.0001681872,0.0000652005,0.00009593338,0.002215768],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4591033,"threshold_uncertainty_score":0.9999956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965094948","doi":"10.1007/s10107-006-0039-7","title":"Reduction of symmetric semidefinite programs using the regular $$\\ast$$ -representation","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":129,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Semidefinite programming; Centralizer and normalizer; Bipartite graph; Matrix (chemical analysis); Order (exchange); Permutation (music); Permutation matrix; Permutation group; Upper and lower bounds; Discrete mathematics; Physics; Graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.09965246932807036,"gpt":0.3762481850279963,"spread":0.276595715699926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694235,0.0002095321,0.0003604454,0.0002435317,0.0002246101,0.0001150669,0.0002783136,0.0001128709,0.00005489793],"category_scores_gemma":[0.001050553,0.0001524412,0.0001590073,0.001806416,0.0003232237,0.0002357194,0.0001238929,0.0002537466,0.00001315495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001058104,"about_ca_system_score_gemma":0.00003964121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003381208,"about_ca_topic_score_gemma":0.000001810894,"domain_scores_codex":[0.9973404,0.0001809101,0.0008238308,0.0003171311,0.0008791568,0.0004585976],"domain_scores_gemma":[0.9980587,0.0005634695,0.0003942322,0.0005544813,0.0003588941,0.00007025279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000459567,0.001540637,0.0002962991,0.001049828,0.0001155104,0.00001163366,0.0008769238,0.004844458,0.003333939,0.8266974,0.0001620254,0.1610254],"study_design_scores_gemma":[0.0005133846,0.00009133584,0.00001721472,0.0002160128,0.0001134825,0.000112686,0.001283815,0.147995,0.006270287,0.8427826,0.0003397434,0.00026442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07573354,0.0001448623,0.9199219,0.0002037068,0.00007750762,0.001764658,0.000002043119,0.0002488295,0.001902894],"genre_scores_gemma":[0.2485753,0.000004417847,0.7505432,0.000003485541,0.0001397392,0.0001259554,0.00001605857,0.00006224291,0.0005295938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1728418,"threshold_uncertainty_score":0.6216373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964191135","doi":"10.1007/s10107-005-0578-3","title":"Cuts for mixed 0-1 conic programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Conic section; Semidefinite programming; Mathematics; Conic optimization; Linear programming; Mathematical optimization; Convex optimization; Rank (graph theory); Regular polygon; Travelling salesman problem; Quadratic programming; Combinatorics; Convex analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07451220809616238,"gpt":0.3946342440206426,"spread":0.3201220359244802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001098025,0.0003265296,0.0005138793,0.000151737,0.0003002736,0.00021396,0.0004046592,0.0001718318,0.0002764963],"category_scores_gemma":[0.003233358,0.0002897106,0.0002326179,0.0003994654,0.0001895966,0.000311622,0.000152627,0.0003030912,0.0001998764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000173066,"about_ca_system_score_gemma":0.00006980983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.302417e-7,"about_ca_topic_score_gemma":0.000005954297,"domain_scores_codex":[0.9970057,0.0000713531,0.000784331,0.0004963445,0.0006166788,0.001025586],"domain_scores_gemma":[0.9971573,0.001499133,0.0002010776,0.0005315829,0.0003157696,0.0002951045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003514439,0.0007814572,0.00001057661,0.0007734984,0.00007887822,0.000005711976,0.0006329665,0.0001268925,0.00007196245,0.2450929,0.00128172,0.7511083],"study_design_scores_gemma":[0.002871394,0.000379227,0.000003077397,0.0003190445,0.0001399836,0.00008555839,0.0009038004,0.1814797,0.003101933,0.4314977,0.3782022,0.001016436],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001692112,0.0001027844,0.9917245,0.001056002,0.00007200777,0.002863476,0.000005982484,0.0007029061,0.00178025],"genre_scores_gemma":[0.01914071,0.000004692783,0.9756967,0.00006195719,0.0002874973,0.001320111,0.00001678548,0.0001268683,0.003344632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7500919,"threshold_uncertainty_score":0.9999555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2917843279","doi":"","title":"The SCIP Optimization Suite 3.2","year":2016,"lang":"en","type":"article","venue":"TUbilio (Technical University of Darmstadt)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Integer programming; Heuristics; Suite; Linear programming; Mathematical optimization; Branch and bound; Nonlinear programming; Quadratic programming; Optimization problem; Constraint programming; Parallel computing; Algorithm; Programming language; Nonlinear system; Mathematics; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.03001465655743017,"gpt":0.2930303341303065,"spread":0.2630156775728764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005832537,0.0001160725,0.000191171,0.0001056607,0.0003327312,0.00001520462,0.0006156683,0.0001065768,0.0004484942],"category_scores_gemma":[0.001188998,0.00007577103,0.0001001361,0.0004506249,0.0006536814,0.0002394829,0.0003072831,0.0001429512,0.00003482081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001680095,"about_ca_system_score_gemma":0.00009295862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006330668,"about_ca_topic_score_gemma":0.00003140698,"domain_scores_codex":[0.9986633,0.0001188066,0.0002180994,0.0002550487,0.0004521167,0.0002926106],"domain_scores_gemma":[0.9974483,0.001363747,0.0001478886,0.0005885518,0.0003371269,0.0001144076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002145578,0.001762177,0.001343383,0.0003240654,0.0004073956,0.0001542288,0.0009663851,0.03695714,0.02882852,0.6451963,0.05944415,0.2224707],"study_design_scores_gemma":[0.0248434,0.002536622,0.003099786,0.001300174,0.0005878715,0.0001559822,0.00498151,0.1248241,0.02712309,0.4736944,0.3327925,0.004060581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002470955,0.00003319273,0.9892319,0.002289656,0.00004197883,0.0003860421,0.00002347822,0.0002099589,0.005312839],"genre_scores_gemma":[0.2537363,0.001433724,0.72148,0.00004310641,0.00006761347,0.000002814027,0.000009605877,0.00007315893,0.02315374],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2733483,"threshold_uncertainty_score":0.4910697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W121557243","doi":"10.1007/0-387-25570-2_2","title":"Monotonic Optimization: Branch and Cut Methods","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Monotonic function; Partition (number theory); Mathematics; Mathematical optimization; Property (philosophy); Regular polygon; Algorithm; Applied mathematics; Combinatorics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07730229124715568,"gpt":0.4151627299745477,"spread":0.337860438727392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000410716,0.0004073971,0.0005597282,0.0002694923,0.0001214213,0.00007810192,0.0002336074,0.0004578,0.01204741],"category_scores_gemma":[0.0002511019,0.0003848405,0.0001053416,0.00006063583,0.0001490306,0.0001833174,0.0002341939,0.0005163918,0.00008753469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001283588,"about_ca_system_score_gemma":0.0001032549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.766507e-7,"about_ca_topic_score_gemma":0.000006173479,"domain_scores_codex":[0.9981777,0.00005406262,0.0005161446,0.0005411995,0.0004105212,0.000300378],"domain_scores_gemma":[0.998045,0.0006559343,0.0002137718,0.0006033932,0.0002983173,0.0001835999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001835979,0.00003241895,4.081966e-7,0.0001601322,0.00016745,0.000008877805,0.0001001583,0.03422963,0.000002789594,0.8086156,0.00496013,0.1517041],"study_design_scores_gemma":[0.0007337959,0.00006064022,2.6796e-7,0.0001201699,0.0001013164,0.00006215712,0.00001170778,0.3048807,0.0001247748,0.3736411,0.3194206,0.0008427608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[4.286619e-8,0.0004994925,0.5321881,0.0001973351,0.00004220953,0.0003537601,0.00000776401,0.0001298571,0.4665815],"genre_scores_gemma":[4.837811e-7,0.001591221,0.5134654,0.00007824646,0.0001221913,0.0000151719,0.00001378002,0.00009709234,0.4846164],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4349745,"threshold_uncertainty_score":0.9998603,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03306497820491706,"gpt":0.3459025252715653,"spread":0.3128375470666483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002148054,0.0001288605,0.0001462705,0.000285695,0.0001475739,0.00004686991,0.0001101839,0.00006795514,0.0002188541],"category_scores_gemma":[0.0003279097,0.000103455,0.00002622433,0.0003866524,0.0002080773,0.0001398698,0.00004415666,0.0001020824,0.00003136487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008560547,"about_ca_system_score_gemma":0.00007377089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.544719e-7,"about_ca_topic_score_gemma":0.000002051144,"domain_scores_codex":[0.9988411,0.00005596606,0.0003444257,0.0003183093,0.0002521602,0.000188039],"domain_scores_gemma":[0.9983525,0.001108402,0.0001262045,0.0001415627,0.0001639288,0.0001074302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001349128,0.0002015905,0.0002665833,0.00001827725,0.00001302839,0.000001102637,0.0000791522,0.5523328,0.00001420858,0.360581,0.0001066286,0.08637206],"study_design_scores_gemma":[0.002540103,0.00006055827,0.0005121885,0.0001596178,0.00001146962,0.0000149785,0.0001580163,0.7599111,0.00008266255,0.234542,0.001621265,0.0003860102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005907861,0.00001810055,0.9971275,0.0008571249,0.00002019636,0.00068807,0.00002041238,0.00009849873,0.000579341],"genre_scores_gemma":[0.3431274,0.00003874454,0.655776,0.0001495384,0.00004448863,0.000547043,0.00006393085,0.00003317403,0.0002197005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3425366,"threshold_uncertainty_score":0.4218774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162995463","doi":"10.1016/j.dam.2008.06.021","title":"On the choice of explicit stabilizing terms in column generation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Kronos (Canada)","funders":"","keywords":"Column generation; Mathematical optimization; Mathematics; Term (time); Quadratic equation; Flexibility (engineering); Limit (mathematics); Scheduling (production processes); Column (typography); Crew scheduling; Augmented Lagrangian method; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1374153424586914,"gpt":0.3559697696159796,"spread":0.2185544271572882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496624,0.0001995318,0.0003538345,0.0001333682,0.0001561603,0.00002101119,0.000332178,0.0000873246,0.0001616905],"category_scores_gemma":[0.0009625753,0.000145852,0.00006340796,0.0004465153,0.0001298403,0.00008460433,0.00009932942,0.0002565381,0.00002510783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008851462,"about_ca_system_score_gemma":0.00004091631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005270149,"about_ca_topic_score_gemma":0.00002198698,"domain_scores_codex":[0.9981664,0.0000425934,0.000629204,0.0002523435,0.0006081505,0.000301252],"domain_scores_gemma":[0.9972613,0.00165908,0.0002708835,0.0006708602,0.00008200054,0.00005582211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002011211,0.0004564234,0.00008636881,0.0002601393,0.00003271992,0.000005404337,0.006065526,0.004042412,0.01753077,0.9699774,0.001082238,0.000440529],"study_design_scores_gemma":[0.002369722,0.0001771044,0.0002291446,0.0002661823,0.00004185066,0.00001717061,0.003846312,0.3397158,0.08376182,0.5684635,0.0002654078,0.0008459456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6783593,0.00001704129,0.2956317,0.0002478846,0.000048626,0.001967299,0.00002193202,0.0001017314,0.02360449],"genre_scores_gemma":[0.7851156,0.00004259573,0.2138976,0.00008962114,0.0000641353,0.000335923,0.00001554374,0.00007655851,0.0003623929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4015138,"threshold_uncertainty_score":0.5947673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100210445","doi":"10.1287/moor.27.3.567.317","title":"Approximating Subdifferentials by Random Sampling of Gradients","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Almost everywhere; Subderivative; Convex hull; Euclidean space; Function (biology); Euclidean geometry; Applied mathematics; Convex function; Point (geometry); Mathematical analysis; Regular polygon; Pure mathematics; Mathematical optimization; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.3146180574641937,"gpt":0.465711267282209,"spread":0.1510932098180153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002582384,0.0001814631,0.0005947209,0.0005239467,0.0003396499,0.00008390332,0.0005783876,0.0001104521,0.00129912],"category_scores_gemma":[0.007311989,0.0001621131,0.0001125165,0.0009758056,0.0003548115,0.0002449708,0.0002364823,0.0003888319,0.0000365999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007864443,"about_ca_system_score_gemma":0.00004050921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001984293,"about_ca_topic_score_gemma":0.000009122879,"domain_scores_codex":[0.9960477,0.000324881,0.001252926,0.0002901189,0.001580692,0.0005037149],"domain_scores_gemma":[0.9953815,0.002165482,0.0001655062,0.00071985,0.001437449,0.0001302115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001511382,0.01699024,0.0003462413,0.01039734,0.001003232,0.000009919021,0.04934205,0.03623422,0.3446092,0.5003008,0.02158114,0.01903445],"study_design_scores_gemma":[0.002080507,0.0001567599,0.000004495143,0.0003290809,0.00002736775,0.000007772808,0.00197785,0.8807395,0.06961699,0.04470382,0.00009475474,0.0002611315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1960595,0.0002958442,0.7964155,0.0001980299,0.00004569768,0.001689947,0.0001110394,0.00006320276,0.005121211],"genre_scores_gemma":[0.348828,0.0001606193,0.6476347,0.000002916111,0.0000282513,0.0001518056,0.00002465645,0.00006248232,0.003106537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8445053,"threshold_uncertainty_score":0.9996138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114650657","doi":"10.1016/j.tcs.2006.05.011","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05602989794902363,"gpt":0.3618705996515992,"spread":0.3058407017025756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001327144,0.00008869352,0.0001689354,0.00007039626,0.0002237569,0.00004122682,0.0008499746,0.0000312244,0.00009707497],"category_scores_gemma":[0.0008657702,0.00004658186,0.00006630485,0.0006256764,0.003189959,0.0001019694,0.000245182,0.00007005074,0.000001203966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002351396,"about_ca_system_score_gemma":0.00008803463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006129443,"about_ca_topic_score_gemma":0.000001642464,"domain_scores_codex":[0.9985664,0.00008351357,0.0003551216,0.000193163,0.0005475067,0.0002542252],"domain_scores_gemma":[0.9953566,0.003581025,0.0001582405,0.0004795907,0.0003882837,0.00003621896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002515033,0.00004934711,0.00001497424,0.00001721657,0.000004782074,1.154916e-7,0.0001352489,0.00578152,0.0003378857,0.9842334,0.0003765687,0.0090238],"study_design_scores_gemma":[0.0002602187,0.00005849629,0.0006397481,0.00001125171,0.00001119327,0.000001578906,0.00001684653,0.6617353,0.008867264,0.3282425,0.0001018266,0.00005384593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009720004,0.00002097003,0.988537,0.0005623112,0.00007528468,0.000528699,0.0000145999,0.00001776703,0.0005233869],"genre_scores_gemma":[0.6948952,0.000002552563,0.3049225,0.00005256787,0.00007393103,0.00001459659,0.000001143035,0.000008907412,0.00002856926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6851752,"threshold_uncertainty_score":0.9995228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544526981","doi":"10.1007/s101079900111","title":"A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Predictor–corrector method; Interior point method; Monotone polygon; Monotonic function; Quadratic growth; Path (computing); Smoothing; Linear complementarity problem; Mathematical optimization; Convergence (economics); Complementarity (molecular biology); Applied mathematics; Algorithm; Nonlinear system; Mathematical analysis; Computer science; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04868698048524479,"gpt":0.3654539087922773,"spread":0.3167669283070325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001276621,0.000383014,0.0005782642,0.00007482631,0.0005927723,0.000209015,0.0006018306,0.0001245217,0.001281462],"category_scores_gemma":[0.0004772807,0.00027015,0.0003894983,0.0003776315,0.0001668413,0.0002406592,0.0001682297,0.000418915,0.0001071289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001619221,"about_ca_system_score_gemma":0.00006378335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001849306,"about_ca_topic_score_gemma":0.000007201785,"domain_scores_codex":[0.9968186,0.00007732702,0.0008893271,0.0005246667,0.0007669138,0.0009231594],"domain_scores_gemma":[0.9971061,0.001695305,0.0001607023,0.0006418905,0.0001637768,0.0002322052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007629034,0.0009511423,0.00008596038,0.0006495397,0.0004267285,0.00002464097,0.002623022,0.0002262124,0.00005086999,0.004367486,0.0009826835,0.9895355],"study_design_scores_gemma":[0.001620414,0.0002747042,0.000007754514,0.0002583215,0.0001637034,0.00002171262,0.0006106462,0.9246994,0.0002506126,0.05691045,0.01478411,0.0003981241],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003397505,0.0000546473,0.9901375,0.0003616452,0.0001111114,0.004967909,0.00004184861,0.0003631265,0.0005647326],"genre_scores_gemma":[0.006687519,0.00001056042,0.9882898,0.00008140346,0.000246909,0.002246091,0.0000345566,0.0001261135,0.002276995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9891373,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141538908","doi":"10.1109/tip.2005.864173","title":"On global and local convergence of half-quadratic algorithms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Rate of convergence; Iterated function; Convergence (economics); Quadratic equation; Algorithm; Compact convergence; Mathematics; Convergence tests; Computer science; Mathematical optimization; Applied mathematics; Mathematical analysis; Channel (broadcasting); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02327523305287105,"gpt":0.3350893941397017,"spread":0.3118141610868307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001455069,0.0001800857,0.0002286486,0.0001132877,0.0002138016,0.00005690241,0.0001180679,0.00007745474,0.0001075016],"category_scores_gemma":[0.00003108104,0.0001732947,0.00005068525,0.0004568399,0.0003216365,0.0003250543,0.000001897354,0.0002104183,0.00001511999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001075284,"about_ca_system_score_gemma":0.00009142011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003769166,"about_ca_topic_score_gemma":0.00002327226,"domain_scores_codex":[0.998612,0.00004896479,0.0003589415,0.0002987979,0.000422511,0.0002587158],"domain_scores_gemma":[0.9991822,0.0001919022,0.0001206117,0.0001910866,0.0002374272,0.00007673596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005145038,0.003387744,0.00003899075,0.002520872,0.0001198881,0.0001002751,0.0008230529,0.1564273,0.009612696,0.008762577,0.0004216776,0.8172704],"study_design_scores_gemma":[0.001638613,0.0002882151,0.00005250537,0.00039553,0.00007309557,0.00006410514,0.0003921745,0.8213909,0.1002633,0.0749449,0.00003239756,0.0004642245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003597056,0.00006885884,0.9947889,0.0001276018,0.00007651644,0.0002181747,0.0000271443,0.0001001602,0.0009955815],"genre_scores_gemma":[0.7405344,0.0000163253,0.2589512,0.000029158,0.00001863756,0.00002562873,0.000001436557,0.00002618234,0.0003970838],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8168062,"threshold_uncertainty_score":0.7066752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033477411","doi":"10.1007/s12532-012-0035-2","title":"A primal–dual regularized interior-point method for convex quadratic programs","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; University of British Columbia","funders":"","keywords":"Interior point method; Regularization (linguistics); Mathematics; Theory of computation; Quadratic programming; Mathematical optimization; Regular polygon; Rank (graph theory); Linear programming; Applied mathematics; Quadratic equation; Convex optimization; Dual (grammatical number); Algorithm; Computer science; Combinatorics; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.09562827335959624,"gpt":0.4280854122017906,"spread":0.3324571388421944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002594527,0.0003547596,0.0006601395,0.0001882527,0.0002721062,0.0002410334,0.0002122011,0.0001835067,0.0001010796],"category_scores_gemma":[0.002643682,0.0003134595,0.000227899,0.000461097,0.0001551593,0.0004788875,0.0001501294,0.0002847281,0.00007183749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001962738,"about_ca_system_score_gemma":0.00006338169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001863629,"about_ca_topic_score_gemma":9.289905e-7,"domain_scores_codex":[0.9967003,0.000310319,0.0009704152,0.0004221429,0.0006755339,0.0009212752],"domain_scores_gemma":[0.9968646,0.001620623,0.0003694081,0.0003604587,0.0004530569,0.000331896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002048951,0.002142065,0.00004797123,0.003050341,0.0002615548,0.000005675303,0.008425599,0.0002644344,0.0006582281,0.358044,0.0004931227,0.6264021],"study_design_scores_gemma":[0.00147139,0.0003241865,0.000005993871,0.0001917892,0.0001100802,0.00007356144,0.0008541739,0.5836284,0.000610851,0.4113083,0.001007793,0.0004134533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002009174,0.00003591812,0.9925333,0.0004090253,0.0001736288,0.003891138,0.000003409795,0.0005866286,0.0003577556],"genre_scores_gemma":[0.04447594,8.329831e-7,0.9534963,0.00005201012,0.0002146022,0.001185344,0.00007797664,0.0001131575,0.0003837745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6259887,"threshold_uncertainty_score":0.9999318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W148192211","doi":"10.1007/b135610","title":"Essays and Surveys in Global Optimization","year":2005,"lang":"en","type":"book","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Global optimization; Nonlinear programming; Mathematical optimization; Multivariate statistics; Computer science; Optimization problem; Nonlinear system; Function (biology); Mathematics; Machine learning; Physics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.04168914641320891,"gpt":0.3574620360211724,"spread":0.3157728896079635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009932878,0.0002550279,0.0003813726,0.0001678936,0.0000396025,0.00005413851,0.0001698871,0.0003676953,0.001666994],"category_scores_gemma":[0.0004171374,0.0002525,0.00003675263,0.0001891167,0.00008191606,0.0001635557,0.0001566068,0.0002983277,0.00003324971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005750454,"about_ca_system_score_gemma":0.0002648995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008633585,"about_ca_topic_score_gemma":0.0002547573,"domain_scores_codex":[0.9982893,0.0002392343,0.000405751,0.0003818467,0.0004083046,0.0002755642],"domain_scores_gemma":[0.9989833,0.0003209825,0.0001271439,0.0002995526,0.0001683727,0.0001006402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002049076,0.000289212,0.0002602332,0.0005424483,0.000103277,0.00007349861,0.0001409632,0.4227266,1.613595e-7,0.3591564,0.08458761,0.132099],"study_design_scores_gemma":[0.001849094,0.00006231888,0.00008111065,0.000252951,0.00003185858,0.00003404953,0.00003338052,0.615859,0.00000231631,0.3640456,0.01678567,0.0009626736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[3.946066e-7,0.0001029375,0.5130219,0.00006335889,0.00002720385,0.0002746825,0.00003157999,0.00006433512,0.4864136],"genre_scores_gemma":[0.000003202712,0.0003990407,0.4054283,0.00002586387,0.00007903226,0.00002262214,0.00009582555,0.00004133534,0.5939048],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1931324,"threshold_uncertainty_score":0.9999927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3010739339","doi":"10.1287/opre.2019.1892","title":"The Benders Dual Decomposition Method","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Decomposition; Dual (grammatical number); Decomposition method (queueing theory); Exploit; Integer programming; Integer (computer science); Computer science; Node (physics); Mathematics; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3165010738985468,"gpt":0.5717275746829251,"spread":0.2552265007843783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001917319,0.00009480476,0.0001123003,0.000102623,0.001873685,0.0003946575,0.0003492363,0.00006138848,0.0004227235],"category_scores_gemma":[0.003754456,0.0000694077,0.00004621831,0.001004901,0.0001798862,0.0002526306,0.0002205773,0.0006270118,0.00030495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001089417,"about_ca_system_score_gemma":0.0002171538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002084672,"about_ca_topic_score_gemma":0.0000918602,"domain_scores_codex":[0.9970662,0.0009136587,0.0002682405,0.0002931269,0.00100992,0.0004488637],"domain_scores_gemma":[0.9967252,0.00182256,0.00001387196,0.0003562278,0.0008647038,0.0002174125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001391044,0.0002316998,0.00002136486,0.00005856635,0.0001266828,0.00003558447,0.004662341,0.1215586,0.01035461,0.7445323,0.06459861,0.05368051],"study_design_scores_gemma":[0.0004597894,0.000149093,0.00001751729,0.0000082908,0.000005443528,0.00001140791,0.002331761,0.9522358,0.005059614,0.01610908,0.02346638,0.0001457815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001086716,0.00008704791,0.9475144,0.04189381,0.0000489226,0.0008611252,0.00001527664,0.0001066504,0.008386078],"genre_scores_gemma":[0.04576785,0.0002436712,0.9461685,0.0003410425,0.0003877156,0.0003805606,0.00004473569,0.00006935805,0.006596521],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8306773,"threshold_uncertainty_score":0.9994258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153170581","doi":"10.4153/cjm-2009-010-4","title":"Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Degree (music); Set (abstract data type); Polynomial; Point (geometry); Explained sum of squares; Section (typography); Discrete mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Statistics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0592822340303602,"gpt":0.3639287664330567,"spread":0.3046465324026965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331172,0.0001252795,0.0003304725,0.0005560288,0.0001493344,0.00005997996,0.0002550563,0.0000691339,0.00007649109],"category_scores_gemma":[0.001719757,0.0001214252,0.00006090323,0.0005502119,0.0001024675,0.0002076813,0.00001555985,0.0001600018,0.000003554392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001315945,"about_ca_system_score_gemma":0.0006004793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008188467,"about_ca_topic_score_gemma":0.0006067437,"domain_scores_codex":[0.9986472,0.00003708755,0.0007016344,0.0001186844,0.0002718943,0.0002235327],"domain_scores_gemma":[0.9974494,0.000420371,0.0004765166,0.0002843737,0.000818468,0.0005508742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001071049,0.001452638,0.00115838,0.001141944,0.0007353922,0.0001392765,0.04473715,0.563192,0.002607121,0.2621208,0.02882469,0.09378353],"study_design_scores_gemma":[0.005110906,0.001878699,0.00367325,0.001434753,0.0005968448,0.001010873,0.01910044,0.2142477,0.01114953,0.7362507,0.003916262,0.001630044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004620082,0.00006610147,0.9909447,0.0009361618,0.00003624068,0.0005328972,0.00003336461,0.000007710497,0.002822764],"genre_scores_gemma":[0.07207745,0.00003406821,0.9273343,0.00008427489,0.00008893224,0.00001197615,0.00000272655,0.00002395296,0.0003423005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4741299,"threshold_uncertainty_score":0.4951575,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08166275618822488,"gpt":0.4123049513317906,"spread":0.3306421951435657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562793,0.0001765682,0.0002004598,0.0001655286,0.000542738,0.0001009419,0.00008910635,0.00008962782,0.0001157098],"category_scores_gemma":[0.0003304138,0.0001933436,0.00004044565,0.0003665897,0.0001790415,0.0005480417,0.00007766639,0.00009693805,0.000003284146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000498548,"about_ca_system_score_gemma":0.00005420281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001979896,"about_ca_topic_score_gemma":6.578516e-7,"domain_scores_codex":[0.9985927,0.00007403491,0.0004463624,0.0003427954,0.0002582129,0.0002858674],"domain_scores_gemma":[0.9978057,0.001039947,0.000206673,0.0001922238,0.0005200482,0.000235402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001164274,0.0001299965,0.0003655537,0.00005169181,0.00001880862,3.859481e-8,0.000152161,0.776034,0.000003791635,0.2216693,0.0003308926,0.001232116],"study_design_scores_gemma":[0.000910181,0.00002397487,0.0004033731,0.000009218244,0.00004544483,0.00001330899,0.0002990612,0.9798628,0.00001785408,0.01705299,0.001144048,0.0002177219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000228979,0.0001862237,0.9960946,0.0008065303,0.00003918543,0.001498668,0.0001508072,0.0001360933,0.0008588812],"genre_scores_gemma":[0.03397584,0.00009443433,0.9634091,0.0001356558,0.0001908967,0.0009706763,0.0007519138,0.00004213939,0.0004293688],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2046163,"threshold_uncertainty_score":0.7884323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070922270","doi":"10.1023/b:opte.0000033370.66768.a9","title":"Convergence Results for Generalized Pattern Search Algorithms are Tight","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Differentiable function; Limit (mathematics); Mathematics; Convergence (economics); Limit point; Stationary point; Zero (linguistics); Mathematical optimization; Algorithm; Mathematical proof; Function (biology); Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04541959430167648,"gpt":0.3163414863592779,"spread":0.2709218920576015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002230444,0.0001539302,0.0001817722,0.0001362478,0.0001148283,0.00005834829,0.0001042236,0.00008209331,0.00003647373],"category_scores_gemma":[0.0003430686,0.0001559994,0.00003787777,0.0002427997,0.00002505817,0.000184059,0.00004738156,0.0001096251,0.000003773004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007354008,"about_ca_system_score_gemma":0.00002818282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006346571,"about_ca_topic_score_gemma":0.000001847801,"domain_scores_codex":[0.9989218,0.00001391288,0.0002788483,0.0002771434,0.0002157425,0.0002925495],"domain_scores_gemma":[0.9992874,0.0001230055,0.00006047389,0.0001871499,0.0002077664,0.0001341886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001434576,0.00002356195,0.00001227843,0.00009480005,0.00001521309,0.000002980441,0.0001945424,0.9975712,0.00008133607,0.001228548,0.0001112592,0.000649931],"study_design_scores_gemma":[0.002197601,0.00003056462,0.00003497909,0.00005498089,0.000009537885,0.000007158299,0.00005285625,0.995323,0.001368982,0.0002662197,0.0004591423,0.0001949993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001357034,0.00005357379,0.9972914,0.000468481,0.0001306657,0.0004026519,0.00004788912,0.0001675516,0.00008073193],"genre_scores_gemma":[0.01223052,0.0003273994,0.9864584,0.00005072495,0.0001094947,0.00007645491,0.00007568598,0.000058943,0.0006123317],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01087348,"threshold_uncertainty_score":0.6361472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2971476396","doi":"10.1109/focs.2019.00055","title":"Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Geodesic; Polytope; Moment (physics); Commutative property; Order (exchange); Mathematics; Algebra over a field; Computer science; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Classical mechanics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.07921382801214945,"gpt":0.4478247454359489,"spread":0.3686109174237995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001735983,0.0003754966,0.0008355147,0.0002801326,0.00009417838,0.00008595767,0.0002848668,0.0002889624,0.0003200879],"category_scores_gemma":[0.001002951,0.0003168139,0.00008557022,0.0001959046,0.0002707681,0.0001280911,0.001156703,0.0003634813,8.727927e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008420546,"about_ca_system_score_gemma":0.0002602947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000182216,"about_ca_topic_score_gemma":0.000002493913,"domain_scores_codex":[0.9978509,0.0003997227,0.0005852118,0.0005745714,0.000286218,0.000303369],"domain_scores_gemma":[0.9959589,0.002104168,0.0003831307,0.0006009511,0.0008351619,0.000117689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005913762,0.0004978293,0.0000461564,0.007186218,0.00138531,0.000002767675,0.009887649,0.6394511,0.0001297318,0.1486043,0.001023771,0.1911938],"study_design_scores_gemma":[0.001304055,0.0001531721,0.00001776465,0.0001933263,0.0001217984,0.000005598409,0.001405468,0.7229882,0.001694883,0.2713737,0.0003339117,0.0004080114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001019268,0.0005814935,0.9915119,0.0004093912,0.000106972,0.002703263,0.0001573342,0.00004974499,0.004377961],"genre_scores_gemma":[0.0003790878,0.0007846463,0.9923522,0.0000651739,0.00003260529,0.0003527678,0.00008900645,0.00008600481,0.005858438],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1907858,"threshold_uncertainty_score":0.9999284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030072108","doi":"10.4153/cmb-2003-054-7","title":"Optimization of Polynomial Functions","year":2003,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Semidefinite programming; Polynomial; Set (abstract data type); Duality (order theory); Stability (learning theory); Duality gap; Mathematical optimization; Algebra over a field; Optimization problem; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03292077975358874,"gpt":0.2937928326217608,"spread":0.2608720528681721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004091169,0.0001446303,0.000262567,0.0002488264,0.0001250237,0.00002550173,0.0001598691,0.0001182312,0.05314523],"category_scores_gemma":[0.004093951,0.0001431653,0.00007932732,0.0003370098,0.0001338462,0.0000403243,0.00001629999,0.0001653017,0.001704424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000166113,"about_ca_system_score_gemma":0.0003181603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008626017,"about_ca_topic_score_gemma":0.0001359059,"domain_scores_codex":[0.9985875,0.0001110009,0.0004229047,0.000206552,0.0002739646,0.0003980302],"domain_scores_gemma":[0.9984038,0.0004544831,0.00009376447,0.0003665582,0.0002161517,0.0004651735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003476635,0.0005776481,0.0001036296,0.0005630668,0.0001630697,0.00004806684,0.0008485548,0.0661919,0.00009646229,0.5151935,0.4143266,0.001852706],"study_design_scores_gemma":[0.004346679,0.000400002,0.00003503649,0.0004153746,0.0002349079,0.0002779978,0.003000484,0.1163399,0.003379284,0.1990615,0.6704652,0.002043633],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001159165,0.00003171874,0.8685191,0.001209359,0.00009422477,0.0004695542,0.00003806517,0.00006688303,0.1284119],"genre_scores_gemma":[0.07443989,0.00001107572,0.8996361,0.0002192066,0.00006686436,0.00007824474,0.00002056234,0.00009738538,0.02543061],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.316132,"threshold_uncertainty_score":0.9990728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965523840","doi":"10.1007/s10732-007-9021-7","title":"Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Intersection (aeronautics); Integer programming; Convexity; Heuristic; Integer (computer science); Mathematical optimization; Linear programming; Software; Computer science; Mathematics; Function (biology); Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05059042372315479,"gpt":0.4014260918634955,"spread":0.3508356681403407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532537,0.0001540312,0.0003511905,0.0002400796,0.000128048,0.00006545747,0.0001877297,0.00008548622,0.00001618033],"category_scores_gemma":[0.00725344,0.0001277858,0.00009778499,0.0001948895,0.0001163321,0.0001272249,0.00007407343,0.00035826,0.000001871958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008780206,"about_ca_system_score_gemma":0.00007844516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.495773e-7,"about_ca_topic_score_gemma":0.000005728346,"domain_scores_codex":[0.9982325,0.0000427229,0.0007711756,0.0001352721,0.0004481557,0.0003701043],"domain_scores_gemma":[0.9961174,0.001985945,0.0005069796,0.0001533394,0.00100641,0.0002299714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004617183,0.004732873,0.007360408,0.005326252,0.001630413,0.002849807,0.008662695,0.002653894,0.001199152,0.1628124,0.1105971,0.6875578],"study_design_scores_gemma":[0.01664748,0.005751271,0.002037618,0.001457624,0.001168932,0.004603512,0.00717671,0.09180707,0.005537021,0.5702987,0.2912451,0.002268991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006391054,0.0003146431,0.9922851,0.0001747683,0.0003165479,0.0003234788,0.00001169089,0.00002263613,0.0001600725],"genre_scores_gemma":[0.1103338,0.0001390999,0.8882363,0.00004871054,0.0004655911,0.000005820544,0.00000256897,0.00005766206,0.0007104848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6852888,"threshold_uncertainty_score":0.8683569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971200627","doi":"10.1007/s10107-003-0484-5","title":"Generalized pattern searches with derivative information","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Iterated function; Polling; Function (biology); Mathematics; Convergence (economics); Mathematical optimization; Derivative (finance); Pattern search; Global Positioning System; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0657266595787926,"gpt":0.3467628791557739,"spread":0.2810362195769813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871289,0.0002213084,0.0003023349,0.0001377848,0.0001799628,0.0001851936,0.0001801757,0.00008317879,0.0005179042],"category_scores_gemma":[0.001982334,0.0001628446,0.0000589482,0.0004656611,0.0001621037,0.0006109377,0.00005694834,0.000265785,0.0001694099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009140364,"about_ca_system_score_gemma":0.00006778796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002157676,"about_ca_topic_score_gemma":0.000002015626,"domain_scores_codex":[0.9979704,0.0001634455,0.0004442249,0.0002006756,0.0006942889,0.0005269893],"domain_scores_gemma":[0.9985056,0.000528342,0.0001440507,0.0003469824,0.0002929737,0.000182051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005258745,0.0005959594,0.000353567,0.001067922,0.0001780286,0.00003580231,0.005432541,0.0004121399,0.00004204351,0.7731363,0.0003353254,0.2183578],"study_design_scores_gemma":[0.00505612,0.0006384497,0.00004308496,0.0004818107,0.0001048439,0.0002957761,0.005803439,0.06094715,0.009215861,0.8853449,0.03057486,0.001493697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008693698,0.00001098452,0.9841135,0.0001768871,0.00001572356,0.0008946836,0.000002442356,0.0002407065,0.005851415],"genre_scores_gemma":[0.06997479,0.000003440896,0.9291537,0.00008321377,0.00001962883,0.0002730833,0.0000121649,0.00004582504,0.0004341683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2168641,"threshold_uncertainty_score":0.6640609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030389346","doi":"10.1016/j.compchemeng.2011.01.031","title":"Convex/concave relaxations of parametric ODEs using Taylor models","year":2011,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Mathematics; Regular polygon; Pointwise; Effective domain; Parametric statistics; Remainder; Interval (graph theory); Discretization; Nonlinear system; Concave function; Applied mathematics; Mathematical optimization; Convex combination; Convex optimization; Mathematical analysis; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1498321808931704,"gpt":0.3118079012449519,"spread":0.1619757203517815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001047187,0.000145591,0.0002698023,0.0002128304,0.00002485822,0.00001082031,0.0002337371,0.00009072103,0.0000255029],"category_scores_gemma":[0.0003990704,0.0001549395,0.00007626099,0.0005455998,0.00005520082,0.0001820161,0.0001299696,0.0002017073,0.000002631961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009519065,"about_ca_system_score_gemma":0.000018962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005193452,"about_ca_topic_score_gemma":2.64002e-8,"domain_scores_codex":[0.9989647,0.00001164136,0.0003447981,0.0002001587,0.0002230512,0.0002556106],"domain_scores_gemma":[0.9989631,0.000406281,0.0001032657,0.0002628381,0.0001485451,0.0001159674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001375104,0.0001673545,0.00002129714,0.0002685127,0.0001133095,0.000009991367,0.001091521,0.9357275,0.02331048,0.03655605,0.00005546986,0.002664805],"study_design_scores_gemma":[0.0002516877,0.00001122484,0.000003559825,0.00004302532,0.00001457977,0.000008028434,0.00001750795,0.9409853,0.05130095,0.007212562,0.000006808649,0.0001447233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03744494,0.00004812511,0.9618372,0.000006892772,0.00009145458,0.0001525861,0.000003865897,0.0001352138,0.0002797683],"genre_scores_gemma":[0.434907,0.000003149244,0.5650201,0.000005865601,0.00002383252,0.000005574426,0.000002313191,0.00002553847,0.00000658526],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3974621,"threshold_uncertainty_score":0.6318249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097828930","doi":"10.1287/ijoc.1100.0425","title":"An Improved Primal Simplex Algorithm for Degenerate Linear Programs","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Degeneracy (biology); Simplex algorithm; Simplex; Linear programming; Degenerate energy levels; Criss-cross algorithm; Algorithm; Mathematics; Mathematical optimization; Linear-fractional programming; Function (biology); Sequence (biology); Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05516187897734527,"gpt":0.3963921387197743,"spread":0.341230259742429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331261,0.0002451277,0.0002966353,0.0002037717,0.0006130948,0.0003845265,0.000470171,0.0001532488,0.0000508902],"category_scores_gemma":[0.0005783301,0.0001896004,0.0001455925,0.0002529596,0.00006784635,0.0005708247,0.00008389934,0.001120747,0.00001229278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007947529,"about_ca_system_score_gemma":0.0002004042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001576443,"about_ca_topic_score_gemma":0.000004369429,"domain_scores_codex":[0.9978646,0.00003050018,0.0007328673,0.0002287538,0.0004614056,0.0006818913],"domain_scores_gemma":[0.9976534,0.0003246852,0.0004712474,0.000323575,0.0008471218,0.0003799967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003746594,0.0001744955,0.00002482217,0.00002189117,0.00003439861,0.000008760821,0.000242298,0.00446562,0.0008930521,0.001675323,0.00007058669,0.9923513],"study_design_scores_gemma":[0.001377279,0.0006987337,0.00001318157,0.00002946576,0.000008925023,0.0001800031,0.000100469,0.9828557,0.00356805,0.005255381,0.005649528,0.0002632459],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07247016,0.000003822595,0.9258223,0.00008789045,0.0005707641,0.0006559177,0.00000802819,0.000162488,0.0002185835],"genre_scores_gemma":[0.03008123,0.000003418473,0.9677952,0.0001796657,0.001667434,0.00001362094,0.00002465461,0.00007096705,0.0001638059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.992088,"threshold_uncertainty_score":0.7731678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1537384856","doi":"10.21236/ada445031","title":"Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems","year":2004,"lang":"en","type":"report","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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":"Algorithm; Filter (signal processing); Variable (mathematics); Computer science; Mathematics; Mathematical optimization; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.1399736156155783,"gpt":0.3943367954417163,"spread":0.254363179826138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002211938,0.0007405125,0.001124801,0.0005764864,0.0002978726,0.0002627621,0.0006366988,0.0009428225,0.004629956],"category_scores_gemma":[0.002254916,0.0006835139,0.0003072995,0.0006545245,0.0002108373,0.0003040955,0.0002835678,0.0008461068,0.00004499255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001314371,"about_ca_system_score_gemma":0.004416318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001969157,"about_ca_topic_score_gemma":0.00003320789,"domain_scores_codex":[0.993878,0.0001459528,0.001379191,0.00116007,0.002278616,0.001158172],"domain_scores_gemma":[0.9927044,0.001042027,0.00052245,0.001004412,0.004399423,0.0003273092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003068415,0.0006080475,0.000009250466,0.005051501,0.0005794041,0.00002651615,0.0002049345,0.9214031,0.00001962374,0.002644282,0.04257958,0.02684305],"study_design_scores_gemma":[0.003995912,0.0003648707,0.000001427564,0.001092266,0.0002284075,0.0001800844,0.0001766233,0.9333164,0.0004726814,0.0215382,0.03704688,0.001586227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[8.867443e-7,0.0001023945,0.9501565,0.0002726657,0.0007676717,0.004722952,0.0008560849,0.0004580179,0.04266289],"genre_scores_gemma":[0.00002948006,0.0005173922,0.905859,0.00006629608,0.000652709,0.00115994,0.002599725,0.0003759055,0.08873957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04607668,"threshold_uncertainty_score":0.9995616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068133968","doi":"10.1007/s10107-006-0009-0","title":"Active-constraint variable ordering for faster feasibility of mixed integer linear programs","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Mathematics; Integer (computer science); Integer programming; Variable (mathematics); Constraint (computer-aided design); Linear programming; Mathematical optimization; Numerical analysis; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08992158410743467,"gpt":0.371748535160172,"spread":0.2818269510527374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006602,0.0002740508,0.0005788704,0.0001113543,0.0001227527,0.00007034266,0.0002777682,0.0001598488,0.0001757349],"category_scores_gemma":[0.002031428,0.0002335526,0.0001886148,0.0004289681,0.0003126922,0.0002013527,0.0001458963,0.0002630383,0.00001209433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116992,"about_ca_system_score_gemma":0.00007511998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000742199,"about_ca_topic_score_gemma":0.000006363201,"domain_scores_codex":[0.9974672,0.00007997391,0.0008903231,0.0004313203,0.0004797538,0.0006513847],"domain_scores_gemma":[0.9975967,0.001014704,0.0002665027,0.0004830195,0.0005166691,0.0001223388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003237754,0.006051296,0.0005668802,0.007083346,0.0002303924,0.0000095991,0.0009911726,0.001277151,0.001978174,0.6930682,0.0001346193,0.2882854],"study_design_scores_gemma":[0.002043607,0.000375162,0.00001700182,0.000468419,0.00009457608,0.00002584555,0.001027749,0.156991,0.006721255,0.8297562,0.001930078,0.0005491379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0134672,0.00001240716,0.9815734,0.00007628508,0.00005071482,0.002704216,0.00001401188,0.0002252254,0.001876536],"genre_scores_gemma":[0.09557659,3.899252e-7,0.9031565,0.000004679875,0.00008118602,0.0004717448,0.0000270677,0.00007016152,0.0006117441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2877363,"threshold_uncertainty_score":0.9523998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006905759","doi":"10.1137/s1052623401398120","title":"A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Quadratic growth; Mathematics; Quadratically constrained quadratic program; Quadratic programming; Second-order cone programming; Mathematical optimization; Rate of convergence; Quadratic equation; Differentiable function; Convex optimization; Interior point method; Sequential quadratic programming; Quadratic function; Function (biology); Convergence (economics); Regular polygon; Algorithm; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06237039632763324,"gpt":0.3968067002934668,"spread":0.3344363039658335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00140771,0.0003585924,0.0005197202,0.0003975611,0.0006028433,0.0004288937,0.0002302231,0.0002218416,0.0009127372],"category_scores_gemma":[0.005221777,0.0003272874,0.0002069382,0.0005739118,0.0001017493,0.0004902036,0.00002307723,0.0004290356,0.000009784073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002533767,"about_ca_system_score_gemma":0.0003810527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.427288e-7,"about_ca_topic_score_gemma":0.000001519907,"domain_scores_codex":[0.996449,0.0006982617,0.00102506,0.0004339788,0.0007558551,0.0006378402],"domain_scores_gemma":[0.9964651,0.001168602,0.0006197946,0.0003141898,0.001115785,0.0003165027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000205572,0.0005395979,0.00001323107,0.0001542093,0.0001568802,0.00001206493,0.0003526223,0.805012,0.0002486906,0.1878788,0.0008337981,0.004592501],"study_design_scores_gemma":[0.003225451,0.0005456461,0.000001004851,0.0001231875,0.0001110717,0.0001584041,0.000370603,0.9454376,0.001824562,0.04564778,0.002148906,0.0004058471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009010021,0.00003252706,0.9955232,0.0005175121,0.0003368575,0.001498899,0.00001315121,0.0001357726,0.001852054],"genre_scores_gemma":[0.003791364,0.00004196803,0.9939225,0.0001954715,0.0001684344,0.0001554123,0.00007259583,0.0001133743,0.001538836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.142231,"threshold_uncertainty_score":0.9999179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096331293","doi":"10.1080/03081080701336545","title":"Geometry of higher-rank numerical ranges","year":2007,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; University of Waterloo; University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Geometry; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04091341204955833,"gpt":0.3800972396740898,"spread":0.3391838276245314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060287,0.0001625625,0.0003205762,0.0001827994,0.00006905251,0.00001115291,0.0001458812,0.0001314339,0.0003331221],"category_scores_gemma":[0.0006228953,0.0001413052,0.00007562059,0.0004037036,0.0001450286,0.00009556697,0.0001008138,0.0002379845,0.00002567836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001757214,"about_ca_system_score_gemma":0.00002183007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001604001,"about_ca_topic_score_gemma":0.000003120526,"domain_scores_codex":[0.9985802,0.00003917756,0.0004166248,0.0002615706,0.0003652589,0.0003372152],"domain_scores_gemma":[0.9985061,0.0007246816,0.0001067058,0.0002864343,0.0002005504,0.0001755558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00290648,0.004589059,0.02162289,0.002800432,0.001001355,0.0003426347,0.005405886,0.001993752,0.02775128,0.09119286,0.00631201,0.8340814],"study_design_scores_gemma":[0.01819464,0.001284859,0.02812307,0.0003253396,0.0003080391,0.0001292579,0.001672851,0.4038856,0.3441145,0.02573051,0.1735314,0.002699966],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2175747,0.0007699996,0.7783238,0.0002869637,0.0002624961,0.0005291363,0.00003868073,0.0002214461,0.001992724],"genre_scores_gemma":[0.4083477,0.000172338,0.5857733,0.0001157537,0.0003373219,0.000006620531,0.00001778488,0.00006720473,0.005161939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8313814,"threshold_uncertainty_score":0.5762257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2559883687","doi":"10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of the Secretary of Defense; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Bounded function; Quadratically constrained quadratic program; Mathematical optimization; Quadratic growth; Quadratic programming; Hermitian matrix; Rank (graph theory); Feasible region; Second-order cone programming; Trust region; Constraint (computer-aided design); Convex optimization; Regular polygon; Algorithm; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07666032763318521,"gpt":0.3906559550134406,"spread":0.3139956273802554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100253,0.0002860677,0.0005503048,0.000106162,0.0002385087,0.0001494473,0.0002320683,0.0001232981,0.0003863254],"category_scores_gemma":[0.00201505,0.0001715902,0.00008710234,0.0002082617,0.0002778554,0.0002026685,0.0001319893,0.0001367044,0.00002655768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008189345,"about_ca_system_score_gemma":0.00006869569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006897086,"about_ca_topic_score_gemma":0.00001742593,"domain_scores_codex":[0.9977649,0.0001129738,0.0005058868,0.0004686632,0.0004931022,0.0006544621],"domain_scores_gemma":[0.9952734,0.003644354,0.0001731231,0.000404818,0.0002677842,0.0002365563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002109666,0.0004876335,0.00005055996,0.001322033,0.0001984817,0.00001030193,0.0006970474,0.000008991032,0.001395908,0.4816242,0.0002653472,0.5137285],"study_design_scores_gemma":[0.003343964,0.0004150762,0.000009517919,0.0003695532,0.0001045502,0.00009350951,0.0001631946,0.0747885,0.002111548,0.9091142,0.009032388,0.0004539516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004314515,0.00001336025,0.9955583,0.001050325,0.00002362547,0.001687851,0.0000157689,0.0002633854,0.0009559781],"genre_scores_gemma":[0.01475369,0.000003723262,0.9832174,0.0000595903,0.0001071476,0.0005638541,0.000006024205,0.00009522614,0.001193401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5132746,"threshold_uncertainty_score":0.6997246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W644136860","doi":"10.1017/cbo9781107282094","title":"A Gentle Introduction to Optimization","year":2014,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reading (process); Section (typography); Focus (optics); Point (geometry); Selection (genetic algorithm); Computer science; Mathematics education; Range (aeronautics); Management science; Engineering; Mathematics; Artificial intelligence; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03125914174418862,"gpt":0.2665371823380287,"spread":0.2352780405938401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002140998,0.0003404305,0.0004321656,0.0004225137,0.0002065758,0.00005771509,0.0005156739,0.0003454978,0.0000304766],"category_scores_gemma":[0.0002344393,0.0004249708,0.0001332384,0.00005162699,0.0001052635,0.000115001,0.0004285001,0.0004586212,0.00005143406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008574931,"about_ca_system_score_gemma":0.0002237319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007588854,"about_ca_topic_score_gemma":8.865927e-7,"domain_scores_codex":[0.9980705,0.0001330653,0.0002528142,0.0006707662,0.0005096142,0.0003631938],"domain_scores_gemma":[0.9979662,0.0001482029,0.0002343148,0.000825321,0.0005539985,0.0002719561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000621785,0.0000185735,6.264602e-8,0.0001328843,0.0000627253,0.00001953609,0.00003877586,0.01939751,0.00000713746,0.2957808,0.6837234,0.0007564553],"study_design_scores_gemma":[0.0004595312,0.00006321699,1.722825e-7,0.0000660071,0.0001001016,0.00000943276,0.00001783302,0.01833783,0.0001523226,0.00005172022,0.9803286,0.0004132092],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000001145206,0.000006860983,0.4763946,0.00006814807,0.0001877391,0.0005741066,0.00005726598,0.0001711493,0.522539],"genre_scores_gemma":[9.130933e-7,0.00002119046,0.1017852,0.0000528929,0.0009677877,0.000004103578,0.0001732773,0.00009444915,0.8969002],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3746094,"threshold_uncertainty_score":0.9998202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069154666","doi":"10.1007/s10107-012-0594-z","title":"Improved semidefinite bounding procedure for solving Max-Cut problems to optimality","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Semidefinite programming; Mathematics; Embedding; Maximum cut; Quadratic programming; Semidefinite embedding; Quadratic equation; Regularization (linguistics); Relaxation (psychology); Mathematical optimization; Upper and lower bounds; Algorithm; Quadratically constrained quadratic program; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.09471068804463127,"gpt":0.3899677218371838,"spread":0.2952570337925525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002467118,0.0003955696,0.0005901487,0.0001940235,0.0004448335,0.0003001126,0.0004001509,0.0001947262,0.0001387017],"category_scores_gemma":[0.007827175,0.0003509865,0.0001967003,0.0005944418,0.000105838,0.0005654493,0.0003054445,0.0003666904,0.00008647138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002486975,"about_ca_system_score_gemma":0.00007044718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001919817,"about_ca_topic_score_gemma":0.000003232586,"domain_scores_codex":[0.9963607,0.00005655469,0.000865771,0.0005088685,0.000594804,0.001613357],"domain_scores_gemma":[0.9969068,0.001326149,0.0002328677,0.0005543115,0.0003414631,0.0006384629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003538223,0.005985353,0.001188678,0.02772163,0.0005726495,0.00001152085,0.02946118,0.001542064,0.01161148,0.7369493,0.003077412,0.1815248],"study_design_scores_gemma":[0.003229363,0.0008467011,0.00003053527,0.00191922,0.0003352988,0.0001859439,0.003938606,0.4026566,0.0119849,0.5407906,0.03118405,0.00289813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00631804,0.00008319323,0.9867674,0.0004846555,0.0001208933,0.004555604,0.00001203982,0.0005449929,0.001113145],"genre_scores_gemma":[0.06719346,0.000002506818,0.9288529,0.00009858086,0.0002708996,0.00212052,0.00001455827,0.0001565471,0.001289995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4011146,"threshold_uncertainty_score":0.9998942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142847239","doi":"10.1007/s10288-005-0065-y","title":"Sensitivity of trust-region algorithms to their parameters","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Sensitivity (control systems); Trust region; Context (archaeology); Algorithm; Computer science; Basis (linear algebra); Mathematics; Engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.07648040350217998,"gpt":0.3576830103733677,"spread":0.2812026068711877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003623712,0.000117805,0.0002182312,0.0001180302,0.00004459876,0.00001253288,0.0001069595,0.00005830286,0.00005417483],"category_scores_gemma":[0.0007195105,0.0001012011,0.00006670739,0.0002787277,0.00005546161,0.0001187254,0.00007407666,0.0001123171,0.00005817181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007119999,"about_ca_system_score_gemma":0.00002859157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001222964,"about_ca_topic_score_gemma":0.00001556561,"domain_scores_codex":[0.99897,0.0001032649,0.0002276684,0.0002000315,0.0002540614,0.0002449219],"domain_scores_gemma":[0.9988359,0.0004605864,0.00007677323,0.0003498006,0.0001592377,0.0001177311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001465404,0.0006976979,0.0003763608,0.0001460064,0.0001199051,0.0000442213,0.004543606,0.04252972,0.004586124,0.006447425,0.007219581,0.9331428],"study_design_scores_gemma":[0.001974046,0.0003560292,0.000790151,0.0001535875,0.00004088809,0.000104279,0.001457188,0.7511777,0.2005791,0.01904519,0.02346187,0.0008599488],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.100813,0.00001910608,0.8961936,0.001336181,0.00006168592,0.0004510718,0.00002036324,0.00009944393,0.001005588],"genre_scores_gemma":[0.2118249,0.00001645758,0.7857874,0.0002096055,0.0000959988,0.00002364089,0.000004013697,0.00003772266,0.002000285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9322829,"threshold_uncertainty_score":0.4126862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075893026","doi":"10.1016/j.laa.2005.03.021","title":"Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Semidefinite programming; Distance matrix; Matrix norm; Matrix (chemical analysis); Euclidean geometry; Matrix completion; Large margin nearest neighbor; Diagonal; Mathematical optimization; Combinatorics; Applied mathematics; k-nearest neighbors algorithm; Computer science; Eigenvalues and eigenvectors; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07301771218730009,"gpt":0.3652212376610858,"spread":0.2922035254737858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312758,0.0001400171,0.0001814285,0.00008420064,0.0003673739,0.00008721185,0.00009337895,0.00005938067,0.00001203534],"category_scores_gemma":[0.0001012785,0.000133369,0.00002846291,0.0002701054,0.00006248055,0.0002344832,0.00005934989,0.0001037312,0.000004575791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003148125,"about_ca_system_score_gemma":0.00001759791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001790092,"about_ca_topic_score_gemma":0.000006259411,"domain_scores_codex":[0.9989609,0.000021009,0.000304289,0.0003118579,0.0001515945,0.0002504252],"domain_scores_gemma":[0.9991054,0.000290167,0.000148939,0.0001793564,0.0001737293,0.0001023908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005445025,0.0006043729,0.0005708682,0.002383465,0.0001055112,6.042231e-7,0.001410026,0.005644402,0.003918587,0.7837479,0.0002266023,0.2013332],"study_design_scores_gemma":[0.0005991286,0.00003754332,0.00003210973,0.00006031579,0.00004490849,0.000014362,0.0001290804,0.898268,0.0004528241,0.02415434,0.07594686,0.0002604956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0118476,0.0009352426,0.9844614,0.0003945955,0.000007410668,0.0020298,0.00006742324,0.0001337224,0.0001228083],"genre_scores_gemma":[0.0499477,0.0005115562,0.9479952,0.00004952112,0.0001910424,0.0008187499,0.00008486923,0.0000534156,0.0003479001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8926236,"threshold_uncertainty_score":0.5438632,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06588151631744103,"gpt":0.3432997407118499,"spread":0.2774182243944088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001838594,0.0002126698,0.0002275384,0.0002008246,0.0004880342,0.0001783803,0.0002476233,0.00008095853,0.0001511155],"category_scores_gemma":[0.0003012079,0.0002159019,0.00006159822,0.0005055596,0.0001376976,0.0003329583,0.0001257211,0.0001133126,0.00001559553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006403444,"about_ca_system_score_gemma":0.00006504853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003103951,"about_ca_topic_score_gemma":6.587551e-7,"domain_scores_codex":[0.9984316,0.00003973916,0.0004927842,0.0004465431,0.0002938352,0.0002954634],"domain_scores_gemma":[0.997183,0.001181594,0.0002277312,0.000297443,0.0009383827,0.0001718071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002272397,0.000146931,0.00001280702,0.00006767759,0.00003054473,5.87246e-8,0.000150136,0.9034006,0.000007811922,0.06301945,0.000673446,0.03248828],"study_design_scores_gemma":[0.0007338643,0.00002768086,0.00003021342,0.00001618038,0.00001307993,0.000004065199,0.00008892521,0.7446274,0.00001178186,0.2525297,0.001738565,0.0001785777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003297755,0.00007112358,0.9949391,0.0009620431,0.00002554289,0.003247157,0.0001392612,0.0001933651,0.0003894177],"genre_scores_gemma":[0.00064205,0.00005398237,0.9927946,0.0001963676,0.00009200583,0.005120901,0.0005945203,0.00005505732,0.0004504616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1895102,"threshold_uncertainty_score":0.8804225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143375247","doi":"10.1109/tpwrs.2003.811006","title":"Medium-term hydrothermal coordination by semidefinite programming","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Power Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Arizona State University","keywords":"Semidefinite programming; Mathematical optimization; Relaxation (psychology); Mathematics; Integer programming; Integer (computer science); Convex optimization; Lagrangian relaxation; Polynomial; Regular polygon; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03044916406546083,"gpt":0.3128030320301395,"spread":0.2823538679646787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330958,0.0002501004,0.0002902586,0.0002359312,0.0002665183,0.0001162348,0.0001773514,0.0001681661,0.0003307718],"category_scores_gemma":[0.0000639652,0.0002440051,0.0001050857,0.0004883085,0.00007279907,0.0002890439,8.780809e-7,0.0003511016,0.0001369628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002056151,"about_ca_system_score_gemma":0.00006922481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000121985,"about_ca_topic_score_gemma":0.000005876775,"domain_scores_codex":[0.997779,0.0002718421,0.0004923143,0.0003706143,0.000649048,0.0004371798],"domain_scores_gemma":[0.9986807,0.0003643185,0.0001529835,0.0004259214,0.0002040504,0.0001720697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001264677,0.02470065,0.0005940435,0.005955598,0.004977099,0.0005284984,0.0307381,0.531109,0.08024996,0.1464573,0.1009595,0.07246564],"study_design_scores_gemma":[0.02098784,0.003331131,0.0000349988,0.002335844,0.0006032269,0.001263522,0.008307425,0.1991161,0.3498035,0.005274222,0.401662,0.007280198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001435715,0.0001169093,0.9926364,0.00008555997,0.001014029,0.0009748843,0.00004796591,0.0003018186,0.003386751],"genre_scores_gemma":[0.9758068,0.00002019258,0.01207512,0.00003279073,0.00001215191,0.0004407706,0.000006992606,0.0001028138,0.01150242],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9805613,"threshold_uncertainty_score":0.9950238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010057117","doi":"10.1021/ie071316j","title":"Global Optimization of Reverse Osmosis Network for Wastewater Treatment and Minimization","year":2008,"lang":"en","type":"article","venue":"Industrial & Engineering Chemistry Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Global optimization; Nonlinear programming; Computer science; Integer programming; Linear programming; Simplex algorithm; Tree (set theory); Piecewise; Branch and bound; Convergence (economics); Minification; Node (physics); Nonlinear system; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1713253907406894,"gpt":0.3795481335498377,"spread":0.2082227428091483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004531002,0.0001719472,0.0002853814,0.00006344094,0.0001605116,0.00002490074,0.0001529017,0.0002565256,0.00007877504],"category_scores_gemma":[0.001739369,0.0001687074,0.00005970494,0.0006543508,0.000117226,0.0001100011,0.00008402112,0.0001791757,6.988442e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003453833,"about_ca_system_score_gemma":0.0001692634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001792247,"about_ca_topic_score_gemma":5.068829e-7,"domain_scores_codex":[0.9983861,0.00004963422,0.0003696225,0.0003061272,0.000411429,0.0004771097],"domain_scores_gemma":[0.9984913,0.0005887732,0.00007625989,0.0002853959,0.0004014431,0.0001567639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001611844,0.0001006055,0.0004029585,0.0001366022,0.00007133157,0.000005307488,0.00009716802,0.9908269,0.004333502,0.0001328543,0.003228773,0.0005028303],"study_design_scores_gemma":[0.005369629,0.0003507791,0.0000216734,0.0002224462,0.00004748139,0.00005776343,0.0001425874,0.8369215,0.1507516,0.0006215195,0.005053984,0.0004391269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7777403,0.000550715,0.2114916,0.001161373,0.0005681968,0.005945219,0.0006174138,0.0005342559,0.001390931],"genre_scores_gemma":[0.4320831,0.001377384,0.5526068,0.00001005541,0.003521607,0.001139428,0.0006049506,0.000304974,0.008351771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3456572,"threshold_uncertainty_score":0.6879689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2469729643","doi":"","title":"A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs","year":2012,"lang":"en","type":"article","venue":"Pacific Journal of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Complementarity (molecular biology); Smoothing; Mathematical optimization; Complementarity theory; Residual; Mathematics; Regular polygon; Applied mathematics; Computer science; Mixed complementarity problem; Convex function; Algorithm; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1889772870255407,"gpt":0.4656161804154899,"spread":0.2766388933899492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324022,0.000126691,0.0002507709,0.0001992584,0.0002860982,0.00005726679,0.00005975717,0.00007325873,0.00007091813],"category_scores_gemma":[0.001565466,0.0001143044,0.00004986721,0.0001831611,0.00008008127,0.0004520885,0.0000363494,0.0001879675,7.81556e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000105447,"about_ca_system_score_gemma":0.00004295964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004321455,"about_ca_topic_score_gemma":0.000003801266,"domain_scores_codex":[0.9985465,0.0004138182,0.0004435684,0.0001232211,0.0002164247,0.0002564346],"domain_scores_gemma":[0.9973817,0.001414235,0.0003833214,0.0001100179,0.0005509447,0.00015978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003569352,0.004957316,0.06835394,0.001051557,0.001816928,0.000003856309,0.0134699,0.3666011,0.001991889,0.04548973,0.05470362,0.4379908],"study_design_scores_gemma":[0.004344461,0.0008553328,0.007406524,0.00009914052,0.0002242779,0.0001029912,0.002515279,0.9675485,0.0004847119,0.01291696,0.002991592,0.0005101959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008513097,0.0002846308,0.9977195,0.0002940224,0.000233111,0.0003347206,0.00003896171,0.00001524604,0.000228512],"genre_scores_gemma":[0.04016823,0.000298947,0.9590173,0.00002042748,0.0001303918,0.00001181305,0.00005266284,0.00002799382,0.0002722611],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6009474,"threshold_uncertainty_score":0.46612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021428356","doi":"10.1007/s002080010009","title":"Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form","year":2001,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interior point method; Conic optimization; Mathematics; Mathematical optimization; Linear programming; Second-order cone programming; Convex optimization; Regular polygon; Convex analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08016735234894054,"gpt":0.430702327804027,"spread":0.3505349754550865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071055,0.0002124612,0.0005210856,0.0007459983,0.00008026481,0.00004272721,0.0002675608,0.00009820248,0.0005095163],"category_scores_gemma":[0.001954213,0.0002242059,0.00008958062,0.001374478,0.0001349087,0.0004123819,0.0001452447,0.0001332536,0.00001256268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002056253,"about_ca_system_score_gemma":0.000233827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009499914,"about_ca_topic_score_gemma":0.0000167033,"domain_scores_codex":[0.9972228,0.0001573131,0.00148104,0.0002692162,0.0006098835,0.0002597461],"domain_scores_gemma":[0.9963158,0.001246361,0.0006612478,0.0003432212,0.001335571,0.00009779234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001533434,0.000339465,0.0001139802,0.0002849323,0.00003908078,6.377704e-7,0.002090601,0.8869051,0.0002093051,0.1085049,0.00005500872,0.00144158],"study_design_scores_gemma":[0.0006006573,0.0000998401,0.00009166342,0.0001691281,0.00001884258,0.00001643208,0.0002843362,0.7013593,0.0004433556,0.2966616,0.00009857276,0.0001561855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01088747,0.00002149467,0.986303,0.0003115805,0.00007947024,0.001159397,0.00002383937,0.00005815875,0.001155621],"genre_scores_gemma":[0.05020292,0.00002721514,0.9491859,0.00003806554,0.00002061539,0.000109407,0.0001614028,0.00004939171,0.0002050974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1881567,"threshold_uncertainty_score":0.9142853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}