{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Adrian S. Lewis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004140674,0.001638777,0.001336767,0.001030395,0.000512699,0.001862263,0.0009890962,0.001022161,0.008103172],"category_scores_gemma":[0.001553835,0.0005989327,0.0006817241,0.003568369,0.001765456,0.001981171,0.001045059,0.00300652,0.003663505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008861029,"about_ca_system_score_gemma":0.0005552179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00146803,"about_ca_topic_score_gemma":0.001949555,"domain_scores_codex":[0.9997284,0.00006646041,0.0000116332,0.00003971232,0.0001382558,0.00001556568],"domain_scores_gemma":[0.9996287,0.000248661,0.00001890079,0.00003684452,0.00005293284,0.00001398984],"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.00002848436,0.00006135162,0.0001443448,0.0006687127,0.00003176506,0.0001612545,0.0001688808,0.01058893,0.001181271,0.7110754,0.1141266,0.161763],"study_design_scores_gemma":[0.00001435524,0.00002723039,0.0005536232,0.0001767366,0.00002159565,0.0003996218,0.00006305358,0.02011762,0.0003919029,0.8233391,0.1548743,0.00002084701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.004898162,0.2087886,0.3131487,0.003592179,0.001291656,0.00006461924,0.0002879666,0.0005782857,0.4673498],"genre_scores_gemma":[0.1663279,0.2475465,0.2777587,0.002728597,0.004906721,0.0005715482,0.0007530043,0.0006892051,0.2987177],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.008103172,"threshold_uncertainty_score":0.02710778,"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","authors":[{"name":"Erling D. Andersen","is_ca":false},{"name":"C. Roos","is_ca":false},{"name":"Tamás Terlaky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647343,0.0009196089,0.001129623,0.0006030529,0.0009454465,0.001004325,0.001469717,0.001141672,0.005782886],"category_scores_gemma":[0.00397144,0.0005163309,0.0005911663,0.0009830217,0.0009133318,0.0013338,0.001679185,0.002169607,0.001601113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004510003,"about_ca_system_score_gemma":0.001029473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003599539,"about_ca_topic_score_gemma":0.004360995,"domain_scores_codex":[0.999325,0.0002575829,0.00002562631,0.0000585743,0.0002734227,0.00005978691],"domain_scores_gemma":[0.9991633,0.0003726352,0.00003918948,0.000138869,0.0002448451,0.00004114973],"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.0003927441,0.0002574052,0.0005477981,0.000193993,0.000048468,0.0001066731,0.0001964427,0.5582108,0.008008554,0.1044054,0.005999732,0.321632],"study_design_scores_gemma":[0.00002367819,0.0000275489,0.00003244132,0.000008724744,0.000004496264,0.00001725532,0.00001158262,0.9873077,0.001383116,0.009405501,0.001772692,0.000005165731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004728652,0.00005141807,0.9913799,0.00007696392,0.00004698263,0.00003660281,0.00001350398,0.0003639069,0.003302027],"genre_scores_gemma":[0.08223605,0.0001019741,0.9137229,0.00009546362,0.00003080988,0.0001351567,0.00007347453,0.0002420419,0.003362083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005782886,"threshold_uncertainty_score":0.01934564,"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","authors":[{"name":"Sébastien Le Digabel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008058125,0.001564267,0.001025952,0.001618585,0.001224234,0.002727811,0.001969854,0.001629376,0.14048],"category_scores_gemma":[0.00479359,0.0004772514,0.00102055,0.001350725,0.000649113,0.001782649,0.002253531,0.001436959,0.05902037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001066888,"about_ca_system_score_gemma":0.002387622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002198145,"about_ca_topic_score_gemma":0.00315898,"domain_scores_codex":[0.9989937,0.0001812,0.00006948379,0.000350913,0.00027306,0.0001317249],"domain_scores_gemma":[0.9991224,0.0002914139,0.00003951249,0.000225315,0.0002749503,0.00004639248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005176357,0.0002174686,0.001309817,0.000535977,0.0001130179,0.0001635617,0.0001101638,0.06983475,0.002765755,0.1116306,0.1760689,0.6367323],"study_design_scores_gemma":[0.0004801636,0.000164948,0.0005432781,0.0002041013,0.00006901682,0.0005190118,0.0001525297,0.4642634,0.008370041,0.2062138,0.3189529,0.00006679892],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006680702,0.0006188774,0.8823811,0.0009035416,0.0006526979,0.0006981609,0.004425729,0.01394539,0.08969387],"genre_scores_gemma":[0.09019469,0.0006330929,0.7772565,0.0009673074,0.0002320817,0.001687615,0.01440564,0.005739038,0.1088842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.14048,"threshold_uncertainty_score":0.4699523,"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","authors":[{"name":"Hayato Waki","is_ca":false},{"name":"Sunyoung Kim","is_ca":true},{"name":"Masakazu Kojima","is_ca":false},{"name":"Masakazu Muramatsu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001880349,0.0017984,0.001158945,0.0005734209,0.000370211,0.001151419,0.0008847834,0.001088254,0.003151695],"category_scores_gemma":[0.006836253,0.0006157194,0.0009632789,0.001306131,0.001160896,0.001256072,0.001358935,0.002866464,0.0006281416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006542478,"about_ca_system_score_gemma":0.001280517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002024155,"about_ca_topic_score_gemma":0.002654685,"domain_scores_codex":[0.9988159,0.0006157755,0.00004380639,0.0001572974,0.0002690827,0.00009817319],"domain_scores_gemma":[0.9953209,0.003817387,0.0003223111,0.0001487656,0.0002874601,0.0001032163],"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.00008178137,0.00007864853,0.0002192107,0.0002032701,0.00003688348,0.00008681497,0.00006732659,0.9149042,0.001053659,0.05395184,0.00227667,0.02703978],"study_design_scores_gemma":[0.00001173785,0.0000278221,0.00003475767,0.000008785886,0.000003801078,0.00001411219,0.00001815678,0.9810386,0.0002605637,0.01803641,0.0005412002,0.000004056093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009499181,0.0003835252,0.9852158,0.0003240333,0.00004017671,0.00005353077,0.0001434167,0.0001111392,0.00422918],"genre_scores_gemma":[0.4234152,0.00173331,0.5637295,0.0002738244,0.0002890138,0.0006874799,0.000985209,0.0003281621,0.008558245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003151695,"threshold_uncertainty_score":0.01054347,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561904,0.001744376,0.001603794,0.001738478,0.0005704108,0.002308717,0.001286763,0.0009268739,0.06426337],"category_scores_gemma":[0.001852008,0.0009092491,0.0006837418,0.005059571,0.0008217393,0.002410387,0.0008163607,0.004202683,0.03529444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008523494,"about_ca_system_score_gemma":0.001872778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001166633,"about_ca_topic_score_gemma":0.003468038,"domain_scores_codex":[0.9995089,0.00004684124,0.00003123676,0.00006675769,0.0003235161,0.00002279829],"domain_scores_gemma":[0.9990067,0.0005034528,0.00004487742,0.0001266553,0.0002641375,0.00005418389],"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.00001831835,0.00007795548,0.00005634319,0.0008162442,0.00001842396,0.00003320165,0.00004882006,0.007383198,0.0008790641,0.1307676,0.6252108,0.23469],"study_design_scores_gemma":[0.00001341875,0.00002466169,0.0002830578,0.0002547052,0.00001193305,0.0002315474,0.00002016246,0.008382971,0.0004594201,0.1247005,0.8655884,0.00002922114],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001218437,0.1059277,0.2747982,0.003926869,0.007186496,0.0001410026,0.004455963,0.003183215,0.5991622],"genre_scores_gemma":[0.02316345,0.1610049,0.23138,0.003729491,0.007981847,0.0006025833,0.008226901,0.003587766,0.5603232],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.06426337,"threshold_uncertainty_score":0.2149824,"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","authors":[{"name":"Murray Marshall","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004852287,0.0005742624,0.000396585,0.001319574,0.0008417492,0.001948474,0.0006278666,0.0006361224,0.01674403],"category_scores_gemma":[0.001758605,0.0003024237,0.0003668226,0.00178248,0.002680824,0.003460395,0.001085655,0.003004057,0.002660533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000988361,"about_ca_system_score_gemma":0.0005320523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007222648,"about_ca_topic_score_gemma":0.0005013472,"domain_scores_codex":[0.9996641,0.00007423142,0.00001520475,0.00007249823,0.000137424,0.00003660221],"domain_scores_gemma":[0.9993867,0.000355525,0.00004883471,0.0000556401,0.000106932,0.00004633779],"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.000004070771,0.000004533255,0.00002237116,0.00003355969,0.000001084343,0.00001696908,0.00007954664,0.000194115,0.0001976625,0.9899724,0.004066813,0.005406858],"study_design_scores_gemma":[0.000002522245,0.00001210744,0.0001403569,0.00002205319,0.000001924408,0.0001036802,0.00005460056,0.0005846554,0.0001778576,0.9483377,0.05055689,0.000005742341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03686388,0.02573934,0.1338252,0.01059722,0.002421614,0.00005906539,0.0006679414,0.0003774294,0.7894484],"genre_scores_gemma":[0.7080525,0.02266075,0.0410687,0.002965238,0.005210775,0.0001338898,0.0007125009,0.0002578498,0.2189379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01674403,"threshold_uncertainty_score":0.0560143,"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","authors":[{"name":"Murray Marshall","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512096,0.001328611,0.0008893158,0.001448063,0.0006626709,0.002478237,0.0008181203,0.0006641947,0.02005649],"category_scores_gemma":[0.002517784,0.0005996036,0.0004020191,0.002946373,0.002001182,0.003442456,0.001085972,0.002837085,0.008965909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008680464,"about_ca_system_score_gemma":0.0006978774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005526775,"about_ca_topic_score_gemma":0.000872637,"domain_scores_codex":[0.9995049,0.0001055545,0.00001530255,0.00007356179,0.0002705102,0.00003020657],"domain_scores_gemma":[0.9994391,0.000290808,0.00004372705,0.00007563092,0.0001179676,0.00003277507],"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.00002095074,0.00001919364,0.00008182639,0.0002301743,0.0000131483,0.00004012013,0.00009201217,0.002397,0.0007468091,0.7767076,0.08345443,0.1361967],"study_design_scores_gemma":[0.000007615451,0.00001391457,0.0001872176,0.00005640273,0.000008806496,0.0002283032,0.00002975057,0.002901013,0.0003363228,0.8027723,0.1934459,0.00001249465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.005494362,0.08742797,0.2437735,0.005615655,0.006752473,0.00005420647,0.0003901998,0.001031623,0.6494599],"genre_scores_gemma":[0.1568339,0.08326957,0.1674245,0.003690163,0.01056369,0.0001876147,0.000721453,0.001342778,0.5759663],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02005649,"threshold_uncertainty_score":0.06709564,"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","authors":[{"name":"Jiming Peng","is_ca":true},{"name":"C. Roos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002241482,0.00118356,0.0009643128,0.001221795,0.0005803807,0.001391944,0.001215729,0.001545905,0.003254542],"category_scores_gemma":[0.005989776,0.0007603865,0.0008562706,0.0007592816,0.00182569,0.002956893,0.001437837,0.00282768,0.00074273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005788018,"about_ca_system_score_gemma":0.000657821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005278587,"about_ca_topic_score_gemma":0.001023022,"domain_scores_codex":[0.9995106,0.0002597993,0.0000253236,0.00006303257,0.0001174638,0.00002371855],"domain_scores_gemma":[0.9982563,0.0009019821,0.0001613043,0.000157486,0.000386953,0.0001359705],"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.0001276415,0.0001150842,0.0002604884,0.0002246805,0.00004418219,0.00006717757,0.0001583319,0.09089096,0.002731304,0.8342783,0.007497545,0.0636043],"study_design_scores_gemma":[0.00003857623,0.00006829792,0.00009260232,0.00004491454,0.00001544494,0.00005374583,0.00003883095,0.5026067,0.0006879062,0.4894374,0.006889701,0.00002581228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01326203,0.001457128,0.9750857,0.000948915,0.000258536,0.00003267916,0.00005641296,0.0001240229,0.008774552],"genre_scores_gemma":[0.2724754,0.003893733,0.6922397,0.001047841,0.0009300672,0.0003837307,0.0003707681,0.0005141636,0.02814451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003254542,"threshold_uncertainty_score":0.01185423,"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","authors":[{"name":"John Watrous","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001272702,0.0008818018,0.000529317,0.0007284196,0.0007870402,0.002545336,0.0009444882,0.0007206138,0.008133202],"category_scores_gemma":[0.007941908,0.0002899805,0.0006527895,0.0007275735,0.003520018,0.003568235,0.001864679,0.002379941,0.001896515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007861861,"about_ca_system_score_gemma":0.001002745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009155615,"about_ca_topic_score_gemma":0.001160707,"domain_scores_codex":[0.998769,0.000419473,0.00006056943,0.0002396708,0.0004137366,0.00009750853],"domain_scores_gemma":[0.9976135,0.001034575,0.0002368352,0.0003754507,0.0005797842,0.0001599348],"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.000009258077,0.000009326987,0.00003841837,0.00002100188,0.000003248397,0.0000183032,0.00003921262,0.002677544,0.0003893588,0.9890939,0.001253955,0.006446507],"study_design_scores_gemma":[0.000002845868,0.00001111535,0.00003861198,0.00001177698,0.00000213178,0.0000467616,0.00002528486,0.03712454,0.000485423,0.9599034,0.002340213,0.000007980285],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0177581,0.0003790722,0.9194877,0.0007668212,0.0002905264,0.00004226902,0.0002531722,0.0002424318,0.06077987],"genre_scores_gemma":[0.7090273,0.001284511,0.2537674,0.0007804355,0.0005348281,0.0003325615,0.0006959154,0.0004416851,0.0331353],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9918668,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549791526","doi":"10.1023/a:1026583532263","title":"On Copositive Programming and Standard Quadratic Optimization Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":197,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Orthant; Positive-definite matrix; Semidefinite programming; Conic optimization; Cone (formal languages); Quadratically constrained quadratic program; Affine transformation; Scaling; Simplex; Relaxation (psychology); Combinatorics; Matrix (chemical analysis); Quadratic programming; Applied mathematics; Mathematical optimization; Convex optimization; Regular polygon; Pure mathematics; Algorithm; Convex set; Geometry","authors":[{"name":"Immanuel M. Bomze","is_ca":false},{"name":"Mirjam Dür","is_ca":false},{"name":"Etienne de Klerk","is_ca":false},{"name":"C. Roos","is_ca":false},{"name":"A.J. Quist","is_ca":false},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01776061782903075,"gpt":0.3325683721105566,"spread":0.3148077542815259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004931242,0.002209862,0.002211079,0.002304913,0.001547636,0.003634071,0.002335731,0.002698562,0.006877935],"category_scores_gemma":[0.02077449,0.001254152,0.00146234,0.005417899,0.006352723,0.00771416,0.003316865,0.008195143,0.0009576803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002092012,"about_ca_system_score_gemma":0.001280523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003511312,"about_ca_topic_score_gemma":0.003015154,"domain_scores_codex":[0.9973646,0.001432941,0.00009829435,0.0003297692,0.0006220961,0.0001523017],"domain_scores_gemma":[0.9898866,0.007768923,0.000584822,0.00048899,0.0009071148,0.0003635615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002412035,0.00004992332,0.000172052,0.0001093868,0.00002491216,0.0000628083,0.0001062412,0.02298855,0.0001778234,0.9608889,0.004695298,0.01070007],"study_design_scores_gemma":[0.000007242367,0.00001527313,0.0001232162,0.00003212061,0.000008488036,0.00003440974,0.00002806299,0.06689209,0.00004845938,0.9290331,0.003765486,0.00001190091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02381614,0.008747508,0.8806474,0.004928158,0.0008065071,0.00006781046,0.0002044828,0.00008624147,0.08069579],"genre_scores_gemma":[0.5571395,0.02891649,0.3187331,0.004153074,0.006432278,0.0007544902,0.0015584,0.0005816021,0.08173109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006877935,"threshold_uncertainty_score":0.02607924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Julie Nutini","is_ca":true},{"name":"Solomon Tesfamariam","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461166,0.001209658,0.002162809,0.001923144,0.0005600789,0.00170615,0.001614655,0.001444531,0.003911307],"category_scores_gemma":[0.003489219,0.0008060402,0.001139866,0.004086525,0.0008635243,0.00214608,0.001270319,0.002012543,0.002907878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005297284,"about_ca_system_score_gemma":0.001133905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001418205,"about_ca_topic_score_gemma":0.001999807,"domain_scores_codex":[0.9990224,0.0002776186,0.0001038381,0.0001404659,0.000425575,0.00003016701],"domain_scores_gemma":[0.9985861,0.0008762045,0.00005896901,0.0001212155,0.0003201557,0.0000375048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007747016,0.0001886949,0.001005894,0.004053141,0.0001601626,0.0000818625,0.00009995894,0.06476736,0.002884963,0.1682103,0.01962171,0.7388486],"study_design_scores_gemma":[0.0000491794,0.0001771971,0.001538011,0.0008408771,0.0001039247,0.0003991653,0.00006873079,0.514043,0.002433485,0.2539721,0.2262974,0.00007687462],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002012378,0.1157533,0.8696635,0.0009701643,0.0006434052,0.00004764407,0.0001493152,0.000234513,0.01052583],"genre_scores_gemma":[0.05151573,0.2178401,0.7079349,0.001120707,0.002728819,0.0002994347,0.000842016,0.000596721,0.01712161],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003911307,"threshold_uncertainty_score":0.01308465,"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","authors":[{"name":"Asen L. Dontchev","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"R. T. Rockafellar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003063203,0.0006892909,0.001215372,0.002302534,0.0009303258,0.002858345,0.001311745,0.001562191,0.002875819],"category_scores_gemma":[0.01906593,0.0004012542,0.0006762159,0.001258429,0.005096302,0.004883477,0.00399068,0.002462234,0.0007799489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244823,"about_ca_system_score_gemma":0.0005822073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006254382,"about_ca_topic_score_gemma":0.000280647,"domain_scores_codex":[0.9970044,0.001050942,0.0002184574,0.0006694786,0.0007989246,0.000257713],"domain_scores_gemma":[0.9908801,0.004711406,0.001088027,0.00149101,0.001114698,0.0007147462],"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.00006427799,0.00001238201,0.001029905,0.0001438442,0.00004495551,0.0001300105,0.000217923,0.0132826,0.003011397,0.9651683,0.002738249,0.01415604],"study_design_scores_gemma":[0.00001337047,0.00007885147,0.001828883,0.00006302771,0.00002228779,0.000373727,0.0001524078,0.04223469,0.001898733,0.9319496,0.02133975,0.00004462617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2053854,0.01251696,0.6964899,0.006899166,0.0007356746,0.0001738546,0.001312132,0.0006568114,0.07583011],"genre_scores_gemma":[0.9310809,0.006053579,0.04866042,0.0007006266,0.0009841885,0.0002619749,0.0007790953,0.0003360143,0.01114323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003063203,"threshold_uncertainty_score":0.01619995,"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","authors":[{"name":"Charles Audet","is_ca":false},{"name":"Pierre Hansen","is_ca":false},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144356,0.001212079,0.001778485,0.001206032,0.0009482417,0.001234931,0.001765559,0.002258352,0.007754014],"category_scores_gemma":[0.004658587,0.001009384,0.0007664801,0.001959278,0.0009093366,0.001513507,0.001865227,0.003522258,0.001608102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007934156,"about_ca_system_score_gemma":0.001783268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003748431,"about_ca_topic_score_gemma":0.005178853,"domain_scores_codex":[0.9992907,0.0002074557,0.00002862278,0.00009681411,0.0003129761,0.00006350636],"domain_scores_gemma":[0.9983032,0.001096781,0.00006838516,0.00009839737,0.0003421851,0.00009101101],"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.0003292231,0.0002578297,0.0003733341,0.0002246974,0.0000833788,0.0001087442,0.000111895,0.4169171,0.004449695,0.06466906,0.01577404,0.496701],"study_design_scores_gemma":[0.00005032679,0.00003601056,0.00006467827,0.00001574259,0.000009746008,0.00002209772,0.000008438965,0.9774302,0.0005657231,0.01964753,0.00214192,0.000007607512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002301384,0.0001586696,0.9951733,0.0001328611,0.0000629458,0.00005095738,0.0000451497,0.0002609335,0.001813794],"genre_scores_gemma":[0.03269897,0.0001704469,0.9636718,0.00009115249,0.00006700198,0.0002048171,0.0001824531,0.0002095059,0.002703794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007754014,"threshold_uncertainty_score":0.02593982,"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","authors":[{"name":"Dominique Orban","is_ca":true},{"name":"Philippe L. Toint","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00182394,0.001361521,0.00166193,0.001195777,0.0008500378,0.001595472,0.001710343,0.002009413,0.008678374],"category_scores_gemma":[0.006886676,0.0005063733,0.001038713,0.001948414,0.00157709,0.00163656,0.002362943,0.003984915,0.004705546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008933882,"about_ca_system_score_gemma":0.001783497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00190942,"about_ca_topic_score_gemma":0.001931837,"domain_scores_codex":[0.9985291,0.0005649353,0.0000915347,0.0001002343,0.0006662391,0.00004801175],"domain_scores_gemma":[0.9977043,0.00130914,0.0001882766,0.000246555,0.0004623145,0.00008939073],"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.00003877268,0.00004781372,0.00031139,0.001380375,0.0001201381,0.0001319698,0.000120664,0.3070225,0.003627918,0.5034757,0.02631854,0.1574042],"study_design_scores_gemma":[0.00003731854,0.00002284084,0.0001653634,0.0002194253,0.00002537812,0.0001264019,0.00002464705,0.6448018,0.0009098006,0.2657416,0.08789113,0.00003423158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000431065,0.01132002,0.976799,0.0006746503,0.0006460461,0.00005795874,0.00008826207,0.000380147,0.009602835],"genre_scores_gemma":[0.05652672,0.0258397,0.8909951,0.0006398007,0.001623894,0.001209881,0.0005222703,0.0008741012,0.0217684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008678374,"threshold_uncertainty_score":0.02903205,"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","authors":[{"name":"Etienne de Klerk","is_ca":false},{"name":"Dmitrii V. Ṗasechnik","is_ca":false},{"name":"Alexander Schrijver","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007477133,0.000862722,0.0009486733,0.0006531193,0.0005938904,0.001813699,0.001225897,0.0006126325,0.008577839],"category_scores_gemma":[0.001808953,0.0003313709,0.001661551,0.0006098037,0.001141054,0.001960834,0.002059993,0.003028314,0.00191705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006811877,"about_ca_system_score_gemma":0.001084412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006621523,"about_ca_topic_score_gemma":0.0008974432,"domain_scores_codex":[0.9992762,0.0002043498,0.00002891376,0.0001144819,0.0002707544,0.0001052589],"domain_scores_gemma":[0.999562,0.0001544049,0.0000347645,0.0001046968,0.00009530547,0.00004876086],"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.00007531278,0.0001855953,0.00008349494,0.00009300349,0.00002495097,0.00008419877,0.0001140452,0.0214873,0.002204006,0.9156582,0.01127409,0.04871596],"study_design_scores_gemma":[0.00002943379,0.0000556184,0.00006297379,0.00001364284,0.00001409301,0.00006768433,0.00004060442,0.11218,0.002078866,0.8792875,0.006153877,0.00001560673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04503731,0.0002148139,0.8838515,0.0009562363,0.0004430604,0.0001555635,0.0004238788,0.0006482268,0.0682694],"genre_scores_gemma":[0.5921814,0.0006164794,0.3425891,0.0008668072,0.000553234,0.0003904127,0.001427395,0.001385835,0.0599893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008577839,"threshold_uncertainty_score":0.02869576,"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","authors":[{"name":"Mehmet Tolga Cezik","is_ca":true},{"name":"Garud Iyengar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384134,0.001780634,0.001263398,0.002006775,0.001462884,0.003370384,0.001882965,0.001529153,0.008260891],"category_scores_gemma":[0.007855499,0.0009684708,0.0009459588,0.002250969,0.002402697,0.003473814,0.002206924,0.005295396,0.0009087261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002131881,"about_ca_system_score_gemma":0.0009717473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133038,"about_ca_topic_score_gemma":0.002995015,"domain_scores_codex":[0.9986205,0.0005855392,0.0000519217,0.0001854852,0.0004149719,0.0001415938],"domain_scores_gemma":[0.9978492,0.001371582,0.0001879436,0.0001543166,0.0002568231,0.0001801457],"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.00008053933,0.000034317,0.000164778,0.0001121331,0.00002138821,0.00003404144,0.00008830857,0.02145333,0.000638295,0.9395847,0.004360306,0.03342786],"study_design_scores_gemma":[0.00001703415,0.00002601104,0.0001194794,0.00003416329,0.0000110366,0.00003885889,0.0000277081,0.06315036,0.0002795394,0.9316743,0.004611312,0.00001029871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0294543,0.00146441,0.9180783,0.001033976,0.0003357121,0.0001078295,0.0003085595,0.0002751518,0.04894189],"genre_scores_gemma":[0.3488433,0.001699496,0.5943332,0.0008293212,0.0006826866,0.0005993256,0.001144672,0.0005879787,0.05127991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008260891,"threshold_uncertainty_score":0.0276354,"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","authors":[{"name":"Gerald Gamrath","is_ca":false},{"name":"Gregor Hendel","is_ca":false},{"name":"Thorsten Koch","is_ca":false},{"name":"Felipe Serrano","is_ca":false},{"name":"Yuji Shinano","is_ca":false},{"name":"Stefan Vigerske","is_ca":false},{"name":"Jakob Witzig","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002674515,0.002353118,0.001807464,0.001997425,0.000627635,0.002647035,0.002873106,0.001284225,0.07880018],"category_scores_gemma":[0.009249188,0.001251873,0.002407773,0.002497435,0.0004510664,0.001414192,0.001835749,0.00336743,0.05217941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007876633,"about_ca_system_score_gemma":0.003418278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003800499,"about_ca_topic_score_gemma":0.004169132,"domain_scores_codex":[0.9982256,0.0005389459,0.0001549734,0.0001935721,0.0006699689,0.0002169903],"domain_scores_gemma":[0.9964336,0.00183134,0.0002198741,0.000446533,0.0009300442,0.0001385423],"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.000359206,0.0002397965,0.00187561,0.002915151,0.0003740751,0.0003899185,0.0001120623,0.07003202,0.003367489,0.03996858,0.7078909,0.1724752],"study_design_scores_gemma":[0.0003938982,0.0001336545,0.001546305,0.0004330121,0.0001583084,0.0004308351,0.00008046169,0.2251622,0.008448356,0.04450142,0.7185656,0.0001459593],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004817981,0.003124603,0.547985,0.001370929,0.0007999708,0.001006844,0.07476336,0.2863003,0.07983097],"genre_scores_gemma":[0.04200236,0.006030254,0.6352809,0.001808883,0.0003604495,0.005466397,0.1578779,0.1102606,0.04091229],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.07880018,"threshold_uncertainty_score":0.2636128,"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","authors":[{"name":"Hoàng Tụy","is_ca":true},{"name":"Faiz Al‐Khayyal","is_ca":true},{"name":"Phan Thiên Thach","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005885442,0.001558605,0.001093703,0.001040944,0.0005262372,0.002152519,0.001468487,0.001117919,0.02814571],"category_scores_gemma":[0.001926437,0.0009327364,0.0006357376,0.002859177,0.001030883,0.002854609,0.0008658225,0.003038011,0.01308186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00090882,"about_ca_system_score_gemma":0.001179475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009230065,"about_ca_topic_score_gemma":0.00212598,"domain_scores_codex":[0.999594,0.00007110171,0.00001467853,0.00006368291,0.0002377655,0.00001883994],"domain_scores_gemma":[0.9995884,0.0002235298,0.00001783576,0.000067623,0.00008856224,0.00001403686],"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.00002918024,0.00005812217,0.0000663001,0.0004755935,0.00002837109,0.00003306488,0.00006692616,0.02565256,0.001299586,0.3474584,0.1063332,0.5184987],"study_design_scores_gemma":[0.00002110453,0.00002657477,0.0002304136,0.0003188695,0.00003339032,0.0001788745,0.00003399305,0.07396635,0.002191587,0.5904649,0.3325064,0.00002756666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001169162,0.02337904,0.7091895,0.001199958,0.0008107462,0.00006502117,0.0002803873,0.0009352741,0.2629709],"genre_scores_gemma":[0.03551307,0.03554081,0.6464558,0.0006918285,0.001358712,0.0003653691,0.0006921024,0.001693939,0.2776883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02814571,"threshold_uncertainty_score":0.09415674,"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","authors":[{"name":"Pietro Belotti","is_ca":false},{"name":"Pierre Bonami","is_ca":false},{"name":"Matteo Fischetti","is_ca":false},{"name":"Andrea Lodi","is_ca":true},{"name":"Michele Monaci","is_ca":false},{"name":"Amaya Nogales-Gómez","is_ca":false},{"name":"Domenico Salvagnin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01101746,0.002987708,0.002725654,0.002069606,0.00147241,0.0043484,0.003856807,0.002598825,0.007222588],"category_scores_gemma":[0.05226855,0.001581717,0.002029682,0.00464651,0.003495537,0.01059526,0.005860972,0.01060397,0.001431269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245529,"about_ca_system_score_gemma":0.001978184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001984281,"about_ca_topic_score_gemma":0.002093635,"domain_scores_codex":[0.993314,0.004189436,0.0003083127,0.0004871248,0.001299038,0.000402093],"domain_scores_gemma":[0.9734973,0.02222222,0.001209407,0.001204201,0.001298711,0.0005681677],"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.000265784,0.0002245885,0.0008229361,0.0006635601,0.00009609291,0.000218963,0.0003303484,0.2208667,0.001546948,0.6565542,0.01119425,0.1072156],"study_design_scores_gemma":[0.0000303038,0.00004919444,0.0001000241,0.0001232679,0.00002704346,0.00004042316,0.00004053546,0.6378255,0.0005442211,0.3562378,0.004955631,0.00002596769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002521212,0.0006725392,0.9909772,0.0005279334,0.0002425363,0.00005259321,0.0000630636,0.0001007809,0.004842152],"genre_scores_gemma":[0.1101637,0.00226229,0.8764895,0.0008639575,0.0008145599,0.0004371712,0.0004549546,0.0006632346,0.007850639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01101746,"threshold_uncertainty_score":0.05826658,"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","authors":[{"name":"Hatem M.T. Ben Amor","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Antonio Frangioni","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857177,0.0007744156,0.0005489154,0.0004563246,0.0006591487,0.001230892,0.0007508709,0.001253757,0.003375752],"category_scores_gemma":[0.01151648,0.0003993157,0.0002667008,0.0006048679,0.001425126,0.001941612,0.00145315,0.001811348,0.0005765255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004065212,"about_ca_system_score_gemma":0.0005268676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004051056,"about_ca_topic_score_gemma":0.001107796,"domain_scores_codex":[0.9991841,0.0004525833,0.00003791874,0.00008184864,0.0001742418,0.00006931522],"domain_scores_gemma":[0.9955243,0.00341734,0.0001961757,0.0004479139,0.0003061279,0.0001081071],"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.0003817464,0.0001054573,0.0003552079,0.0002248438,0.00002895711,0.0001004251,0.0001275594,0.1806892,0.01272887,0.7199139,0.0038113,0.08153253],"study_design_scores_gemma":[0.00005064886,0.00008781929,0.000107698,0.00007329226,0.00002011004,0.00005800439,0.00002878433,0.6922331,0.006446955,0.2985352,0.002330892,0.0000273621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0252533,0.0007227792,0.958538,0.0006017155,0.0001717365,0.00004989036,0.00005769616,0.0002078761,0.01439696],"genre_scores_gemma":[0.7752602,0.0009747666,0.21529,0.0005224249,0.0001800396,0.0001409949,0.00009430385,0.0002359759,0.007301303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003375752,"threshold_uncertainty_score":0.01129299,"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3146180574641937,"gpt":0.465711267282209,"spread":0.1510932098180153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003598436,0.0007843247,0.0009869152,0.001110876,0.0003089198,0.001023124,0.001281263,0.001041371,0.0008510643],"category_scores_gemma":[0.01705385,0.0008030185,0.0006995365,0.0006914921,0.00155202,0.002109365,0.001175653,0.001281061,0.0002069254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001067458,"about_ca_system_score_gemma":0.0006345575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003160495,"about_ca_topic_score_gemma":0.003041555,"domain_scores_codex":[0.9992342,0.000353624,0.0000427241,0.0001130536,0.0001885083,0.00006780631],"domain_scores_gemma":[0.9949802,0.003214004,0.0005039994,0.0006162534,0.0005088594,0.0001767261],"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.0002427986,0.00005485698,0.004236578,0.00009122299,0.0000624038,0.0001628106,0.0001208411,0.8979159,0.004225353,0.07286747,0.0006169433,0.01940282],"study_design_scores_gemma":[0.000008450054,0.0000169227,0.0001823636,0.000004676605,0.000002889483,0.00001528268,0.00000594682,0.9922935,0.0007117636,0.006617018,0.0001368682,0.000004317603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115101,0.000299271,0.8834149,0.0001604294,0.00003724339,0.00004699908,0.00003985543,0.0001983205,0.000702048],"genre_scores_gemma":[0.8024139,0.0003929941,0.1950228,0.00009639081,0.00004817135,0.00009517919,0.0002212174,0.0001179329,0.001591312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003598436,"threshold_uncertainty_score":0.01903057,"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","authors":[{"name":"Etienne de Klerk","is_ca":true},{"name":"Monique Laurent","is_ca":false},{"name":"Pablo A. Parrilo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469187,0.001180546,0.001103933,0.0007235842,0.0005892172,0.001381742,0.001726278,0.001419503,0.01462688],"category_scores_gemma":[0.003678152,0.0004182822,0.001339627,0.001175561,0.001050165,0.001703928,0.002478021,0.003177544,0.003206528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008996444,"about_ca_system_score_gemma":0.001139114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001622012,"about_ca_topic_score_gemma":0.002206514,"domain_scores_codex":[0.9992085,0.0002539079,0.00003109753,0.0001644154,0.0002759105,0.00006621215],"domain_scores_gemma":[0.9994214,0.0002450737,0.00003948392,0.0001078532,0.0001148774,0.00007150358],"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.0002743711,0.0001540028,0.0003940194,0.0004152607,0.00009989532,0.0001401126,0.0001571306,0.1504178,0.007209299,0.6311409,0.02475117,0.1848461],"study_design_scores_gemma":[0.00005635156,0.0001386753,0.0001498479,0.00005702005,0.00003347471,0.0001353403,0.00005834775,0.643398,0.001734999,0.3388901,0.01532304,0.00002482347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006729953,0.00025719,0.9763463,0.0005108336,0.0002257406,0.00007255332,0.0001875794,0.0003234946,0.01534631],"genre_scores_gemma":[0.2351114,0.0009587191,0.7109519,0.0005338066,0.0004833005,0.0004558319,0.000623218,0.0009657037,0.04991623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01462688,"threshold_uncertainty_score":0.04893184,"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","authors":[{"name":"Jim Burke","is_ca":false},{"name":"Song Xu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009038067,0.0006565271,0.001073663,0.0005881896,0.0008811674,0.0007877771,0.001553517,0.001708224,0.007511001],"category_scores_gemma":[0.002895418,0.0005854548,0.0004771118,0.0007162874,0.0007027377,0.0009598534,0.001615858,0.002065524,0.001316739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006938319,"about_ca_system_score_gemma":0.002818306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004042245,"about_ca_topic_score_gemma":0.00585579,"domain_scores_codex":[0.99962,0.00009146698,0.00001906335,0.00008558734,0.0001419327,0.00004201648],"domain_scores_gemma":[0.9991193,0.000408479,0.00006720286,0.0000914332,0.0002471571,0.00006647754],"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.0003767984,0.0002796399,0.000861666,0.000181509,0.00007273691,0.0001479786,0.000169561,0.443638,0.008781691,0.06004815,0.007967577,0.4774747],"study_design_scores_gemma":[0.00004706957,0.00004361543,0.00007744956,0.0000112598,0.00000641127,0.00003112616,0.000007851553,0.9903543,0.0009475935,0.006930633,0.001532161,0.00001052068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003803048,0.00005773833,0.9941208,0.0001026203,0.00005293508,0.00005363328,0.00002525296,0.0003736579,0.001410307],"genre_scores_gemma":[0.08809227,0.00007961877,0.9065218,0.0001162249,0.00003058707,0.0002659941,0.0001226572,0.0001461205,0.004624764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007511001,"threshold_uncertainty_score":0.02512676,"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","authors":[{"name":"Marc Allain","is_ca":false},{"name":"Jérôme Idier","is_ca":false},{"name":"Yves Goussard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007479434,0.001181532,0.001219925,0.001473285,0.0006693422,0.00143223,0.001453303,0.001148756,0.005592762],"category_scores_gemma":[0.02034569,0.0004399157,0.001132368,0.0009959072,0.002939764,0.003555782,0.00419069,0.003420418,0.001311392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007569686,"about_ca_system_score_gemma":0.0008272664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007552343,"about_ca_topic_score_gemma":0.0005402564,"domain_scores_codex":[0.9976143,0.001165964,0.00008435772,0.0002980977,0.0006444653,0.0001929712],"domain_scores_gemma":[0.9912038,0.005055141,0.0005026758,0.0009586743,0.001892842,0.0003869909],"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.0004581943,0.0000837619,0.00133183,0.0004521289,0.00008465491,0.000171143,0.0004833913,0.2896514,0.008103437,0.594081,0.003783308,0.1013157],"study_design_scores_gemma":[0.00003165613,0.0001596941,0.0003403264,0.0000552864,0.00001449799,0.00009411559,0.00006686275,0.8704669,0.003027987,0.1229189,0.002800964,0.00002271264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01649549,0.001054736,0.9733222,0.0003001049,0.00006485924,0.00004615352,0.000043856,0.0001785926,0.008494025],"genre_scores_gemma":[0.6401466,0.002276528,0.3345203,0.0006017449,0.0003411143,0.0004380642,0.0003400804,0.00102085,0.02031487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007479434,"threshold_uncertainty_score":0.03955549,"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","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Dominique Orban","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045682,0.001076211,0.0018059,0.0007545344,0.0005982835,0.001152967,0.001953959,0.00193656,0.006875933],"category_scores_gemma":[0.003852877,0.0008132763,0.001159287,0.0007958148,0.001120039,0.001129228,0.002319866,0.003071892,0.001702664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005819777,"about_ca_system_score_gemma":0.001634848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001728837,"about_ca_topic_score_gemma":0.001703093,"domain_scores_codex":[0.999235,0.0003535913,0.00002708311,0.00008982849,0.0002522575,0.00004218697],"domain_scores_gemma":[0.9991133,0.0004305991,0.00004902866,0.00008597284,0.0002478535,0.00007317828],"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.0002554488,0.0003154348,0.0003170259,0.0004454388,0.0001049038,0.0001497619,0.0001571441,0.6974571,0.007610157,0.1123079,0.008498156,0.1723814],"study_design_scores_gemma":[0.00001769354,0.00002193728,0.0000187637,0.000009360253,0.000005131966,0.00001386399,0.000004469159,0.9916319,0.0003665757,0.00648827,0.001416779,0.000005179922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001261765,0.00007208517,0.9972016,0.00007453551,0.00006470824,0.00003193234,0.00001770171,0.00007759794,0.00119811],"genre_scores_gemma":[0.05999633,0.0001734029,0.9343708,0.000127952,0.0001311864,0.0002854409,0.0001327563,0.0002601372,0.004521925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006875933,"threshold_uncertainty_score":0.02300227,"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","authors":[{"name":"Charles Audet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014622,0.001432891,0.001467587,0.002996028,0.001378374,0.003721527,0.0007204222,0.001246078,0.02971523],"category_scores_gemma":[0.004189602,0.0005352821,0.0004677327,0.005376889,0.002133251,0.004734542,0.001370072,0.00296547,0.01399159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001882722,"about_ca_system_score_gemma":0.00144234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001307181,"about_ca_topic_score_gemma":0.003348518,"domain_scores_codex":[0.9993615,0.0001731828,0.00002985954,0.00007229831,0.0003312776,0.00003185639],"domain_scores_gemma":[0.9984148,0.0008273245,0.00008249825,0.000196048,0.0003544754,0.0001249084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001670933,0.00002239263,0.0001003407,0.0002153176,0.00001224067,0.00001449695,0.000128557,0.001181548,0.0001420964,0.1938247,0.6634498,0.1408917],"study_design_scores_gemma":[0.000005273712,0.00001393424,0.0003681132,0.0002726378,0.00001084455,0.00005363609,0.00007860652,0.001003403,0.0001019607,0.1691056,0.8289768,0.000009343871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001653598,0.2896804,0.04115943,0.02642498,0.01878498,0.00004866407,0.0003809065,0.0004450956,0.6214219],"genre_scores_gemma":[0.02278595,0.1460444,0.0174857,0.005575668,0.02341491,0.0001782376,0.0004747014,0.0007668335,0.7832736],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02971523,"threshold_uncertainty_score":0.09940737,"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","authors":[{"name":"Ragheb Rahmaniani","is_ca":false},{"name":"Shabbir Ahmed","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Walter Rei","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786039,0.001613562,0.001158644,0.001196984,0.0005970499,0.001749783,0.001347904,0.001343375,0.01085819],"category_scores_gemma":[0.002574943,0.0007430175,0.001372943,0.001068882,0.0008024934,0.001404331,0.001654423,0.003027245,0.002716369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008209375,"about_ca_system_score_gemma":0.001893748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001933389,"about_ca_topic_score_gemma":0.001324047,"domain_scores_codex":[0.9987049,0.00049256,0.00006460617,0.0001800196,0.0004459884,0.0001118255],"domain_scores_gemma":[0.9993621,0.0002765739,0.00005028117,0.000077841,0.0001937995,0.00003940928],"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.0001173757,0.000112573,0.0004825132,0.0004351209,0.0001479428,0.0001220105,0.0001158257,0.46113,0.004025216,0.2760178,0.01759007,0.2397036],"study_design_scores_gemma":[0.00004482567,0.00005091125,0.0001045142,0.00006292021,0.0000309049,0.00009727018,0.0000259558,0.9178144,0.002303072,0.04938286,0.03005882,0.00002349489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008493969,0.0003380306,0.9900208,0.0001524088,0.000108995,0.00008525139,0.00007292397,0.0001504053,0.008221947],"genre_scores_gemma":[0.08145145,0.001867778,0.8971795,0.0003984136,0.0002578334,0.0005403769,0.0004792177,0.0002637832,0.0175616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01085819,"threshold_uncertainty_score":0.0363242,"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","authors":[{"name":"M. Marshall","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327128,0.0009457701,0.0007764287,0.001670224,0.0007158857,0.002298051,0.0008594507,0.0008747173,0.004837594],"category_scores_gemma":[0.01374738,0.0003243193,0.0006555286,0.001814666,0.00364899,0.004164982,0.002525538,0.003215512,0.0006347207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416022,"about_ca_system_score_gemma":0.0005463741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008767471,"about_ca_topic_score_gemma":0.0008615338,"domain_scores_codex":[0.9988463,0.0004412084,0.00005387322,0.0001530515,0.0003597844,0.0001457257],"domain_scores_gemma":[0.9958059,0.002462774,0.0005986766,0.0003689761,0.0004403976,0.0003233624],"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.00002293776,0.000008880903,0.0001245816,0.00004056015,0.000003764085,0.00003378298,0.00009012713,0.01059538,0.000523751,0.9800354,0.0006769705,0.007843878],"study_design_scores_gemma":[0.000007394369,0.00002049988,0.0001258141,0.00002264024,0.000004316896,0.00006910657,0.0000498402,0.05849407,0.0003372614,0.9383637,0.002492938,0.0000124661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07053979,0.003817319,0.8798984,0.002374505,0.00032416,0.00003781906,0.0001580684,0.0001622516,0.04268763],"genre_scores_gemma":[0.9068617,0.002818171,0.07860877,0.0003153545,0.0005361667,0.000072424,0.0001567202,0.0001160664,0.01051456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004837594,"threshold_uncertainty_score":0.01618338,"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","authors":[{"name":"Levent Tunçel","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002456891,0.001190793,0.001335972,0.001547013,0.001109262,0.003592515,0.001737743,0.001217165,0.005703254],"category_scores_gemma":[0.007820705,0.0006900596,0.001269191,0.001480911,0.003056513,0.006311529,0.003552136,0.006461962,0.0006460915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215699,"about_ca_system_score_gemma":0.00106614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007668458,"about_ca_topic_score_gemma":0.0009341261,"domain_scores_codex":[0.9988548,0.0005467509,0.0000533341,0.0001600173,0.0002893384,0.00009583253],"domain_scores_gemma":[0.9978523,0.001144154,0.0001775523,0.0002867265,0.0003065144,0.0002326463],"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.0000102601,0.00001209574,0.00003999197,0.00002031738,0.00000417194,0.000006586155,0.00003396804,0.001742113,0.000127635,0.9930503,0.0008342387,0.004118279],"study_design_scores_gemma":[0.00000354794,0.000006592025,0.00002253878,0.000007700269,0.000002625825,0.000009262132,0.00001201622,0.01363351,0.00006408509,0.9852324,0.001003021,0.000002869009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02612765,0.001128122,0.9391246,0.001900766,0.0001990879,0.00003509894,0.0002096554,0.0001511947,0.03112392],"genre_scores_gemma":[0.6925024,0.00223075,0.2724729,0.001028348,0.0009171379,0.0003296139,0.0008094119,0.0004729459,0.02923649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005703254,"threshold_uncertainty_score":0.01907927,"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","authors":[{"name":"Charles Audet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01147498,0.004311215,0.004115544,0.003649595,0.00211931,0.003893815,0.004865117,0.004488924,0.01658156],"category_scores_gemma":[0.09300482,0.001933516,0.002983528,0.004660276,0.005508608,0.01177875,0.008526991,0.009889324,0.004986238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001904351,"about_ca_system_score_gemma":0.002817588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002356089,"about_ca_topic_score_gemma":0.00254243,"domain_scores_codex":[0.9936886,0.002398256,0.0003467804,0.001312746,0.001601043,0.0006526492],"domain_scores_gemma":[0.9589997,0.02793758,0.001586446,0.00487879,0.005592323,0.001005269],"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.0004900065,0.0001770361,0.001170627,0.001295681,0.0003216106,0.0002034011,0.0005289945,0.2705772,0.003156488,0.6074097,0.02033515,0.09433416],"study_design_scores_gemma":[0.00006715931,0.0001198753,0.0003599765,0.0001689741,0.00007634251,0.000157406,0.0001132216,0.4315772,0.001465055,0.5602399,0.00561401,0.00004087575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01085438,0.002179679,0.9647374,0.001521901,0.0004263388,0.0001446542,0.0002311223,0.0005931906,0.01931121],"genre_scores_gemma":[0.4591739,0.008337473,0.4728565,0.005258527,0.001403891,0.002252852,0.001891115,0.00393573,0.04489003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01658156,"threshold_uncertainty_score":0.06068623,"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","authors":[{"name":"Peter Bürgisser","is_ca":false},{"name":"Cole Franks","is_ca":false},{"name":"Ankit Garg","is_ca":false},{"name":"Rafael Oliveira","is_ca":true},{"name":"Michael Walter","is_ca":false},{"name":"Avi Wigderson","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003445364,0.001177225,0.001138916,0.001707143,0.0009803744,0.00263884,0.001866753,0.001535397,0.004698611],"category_scores_gemma":[0.007464804,0.0007581324,0.001561171,0.001185091,0.004602873,0.005348492,0.003479803,0.005266647,0.001298741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002184052,"about_ca_system_score_gemma":0.001692363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001916272,"about_ca_topic_score_gemma":0.002043039,"domain_scores_codex":[0.9982209,0.0007918917,0.00007540989,0.0002471157,0.0005663417,0.00009839478],"domain_scores_gemma":[0.9976867,0.001286642,0.0001981285,0.0003394207,0.0003223906,0.000166564],"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.000006411469,0.000008940357,0.00007699977,0.00004049218,0.00000743082,0.00001966283,0.00008900344,0.01483711,0.0003672536,0.9764404,0.0008559986,0.007250321],"study_design_scores_gemma":[0.000007232762,0.00002194019,0.00008219295,0.00002555702,0.000005442919,0.00002930342,0.00003145552,0.1777552,0.0003558877,0.8122687,0.00940353,0.00001356684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002366967,0.0006542772,0.9903432,0.000534662,0.0001159884,0.00001664492,0.00003334882,0.00007580966,0.005859162],"genre_scores_gemma":[0.1585469,0.002454517,0.8194704,0.0008214157,0.0009711531,0.0002402233,0.0001798417,0.0006806124,0.01663497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004698611,"threshold_uncertainty_score":0.01822102,"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","authors":[{"name":"M. Marshall","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001450232,0.0005798747,0.001119669,0.0003584941,0.0002627719,0.0007208274,0.0007625304,0.0006481422,0.002158961],"category_scores_gemma":[0.003409216,0.0002111217,0.0004256277,0.0005342527,0.001190081,0.001048819,0.0009504759,0.001442722,0.0003487021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008229563,"about_ca_system_score_gemma":0.000621343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001076784,"about_ca_topic_score_gemma":0.0009148546,"domain_scores_codex":[0.9993473,0.0002685391,0.00001844721,0.0001036625,0.000192753,0.00006929487],"domain_scores_gemma":[0.9991162,0.0005693237,0.00005324601,0.0001015223,0.0001131959,0.00004656453],"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.0001373904,0.0001056939,0.0002560783,0.0001223706,0.00002578905,0.00004118596,0.00007337452,0.5872785,0.004364182,0.3489224,0.002226211,0.05644677],"study_design_scores_gemma":[0.000008775673,0.00002663587,0.00003801628,0.000004567336,0.000001773068,0.000007156295,0.000005182201,0.9433497,0.0007267456,0.05509107,0.0007374524,0.000002971577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03041609,0.0001884252,0.9619928,0.0002836761,0.00002659045,0.00002713453,0.00005776727,0.0001471782,0.006860293],"genre_scores_gemma":[0.795422,0.0003360772,0.1963732,0.0001126727,0.00007261182,0.00007759503,0.0001508044,0.0001104992,0.007344585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002158961,"threshold_uncertainty_score":0.007669628,"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","authors":[{"name":"Jonathan Eckstein","is_ca":false},{"name":"Mikhail Nediak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181615,0.001083356,0.00182762,0.001809431,0.001360014,0.00117772,0.002459974,0.001714485,0.006017327],"category_scores_gemma":[0.003796506,0.001112125,0.001207854,0.001847493,0.001384025,0.002013664,0.003390271,0.002113256,0.0007236949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016216,"about_ca_system_score_gemma":0.00238339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005582447,"about_ca_topic_score_gemma":0.01207092,"domain_scores_codex":[0.9990373,0.0004131407,0.00003424164,0.00009166386,0.0001913061,0.0002323763],"domain_scores_gemma":[0.9988128,0.0006831145,0.00007990553,0.000117957,0.0001471093,0.0001590423],"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.001294256,0.0007697489,0.002542857,0.0003367813,0.0001308312,0.0002941946,0.0003949039,0.4701544,0.005682565,0.0611758,0.01277942,0.4444443],"study_design_scores_gemma":[0.0002328672,0.0003149479,0.000362906,0.00004670598,0.00005041709,0.00008674045,0.0001183779,0.967886,0.00209773,0.02495303,0.00380855,0.00004167679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07344269,0.0007278159,0.9115822,0.0005680374,0.0003643064,0.0005596005,0.0001738111,0.001325588,0.01125594],"genre_scores_gemma":[0.2084979,0.0002030729,0.7867105,0.0003234177,0.00006617277,0.0002789678,0.0002665237,0.0002307591,0.003422679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006017327,"threshold_uncertainty_score":0.02012998,"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","authors":[{"name":"Mark A. Abramson","is_ca":false},{"name":"Charles Audet","is_ca":true},{"name":"J. E. Dennis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274249,0.0006014835,0.001718979,0.001223765,0.0005567162,0.001351387,0.001806788,0.001763613,0.008337486],"category_scores_gemma":[0.007807274,0.0007206959,0.0007577546,0.002142467,0.001009183,0.003471123,0.002364271,0.001255098,0.001151953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000391501,"about_ca_system_score_gemma":0.0007611818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005658096,"about_ca_topic_score_gemma":0.001035546,"domain_scores_codex":[0.9992798,0.000282819,0.0000394404,0.0001152153,0.0002194256,0.00006336554],"domain_scores_gemma":[0.9982224,0.0008588628,0.0001129138,0.0005310194,0.0002005504,0.00007429627],"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.000730239,0.0001954885,0.001771742,0.0004769965,0.0002211137,0.0003219886,0.0001577962,0.2203289,0.007434571,0.3728541,0.01022586,0.3852812],"study_design_scores_gemma":[0.00009066155,0.00007070668,0.0002105762,0.00002059152,0.00003017416,0.0001341241,0.00002355901,0.7653481,0.001740418,0.2301252,0.002190422,0.00001546369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04240591,0.0004360541,0.9478039,0.0004096338,0.0001240493,0.00007052707,0.0001043865,0.0004934053,0.008152175],"genre_scores_gemma":[0.4313684,0.0003320815,0.554927,0.0003685525,0.0001088155,0.0002214483,0.0002850873,0.0003954357,0.01199325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008337486,"threshold_uncertainty_score":0.0278917,"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","authors":[{"name":"Ali M. Sahlodin","is_ca":true},{"name":"Benoît Chachuat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377887,0.001530604,0.001489347,0.0009854584,0.0006369331,0.002305634,0.001490817,0.001778197,0.005370693],"category_scores_gemma":[0.009745372,0.001189499,0.001947343,0.0008468324,0.002020747,0.002549701,0.003125857,0.003743999,0.0007344004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546533,"about_ca_system_score_gemma":0.001642399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004938489,"about_ca_topic_score_gemma":0.004666456,"domain_scores_codex":[0.9991197,0.0004114792,0.00003954193,0.0001069811,0.0002160612,0.0001062616],"domain_scores_gemma":[0.997313,0.001831666,0.0002528463,0.0001586099,0.0002561332,0.0001877377],"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.00005468981,0.00007571207,0.0002512049,0.0001594027,0.00003439087,0.0001321506,0.0001778888,0.556029,0.001562078,0.421823,0.004130831,0.01556968],"study_design_scores_gemma":[0.000006474412,0.00001503435,0.0000436442,0.00001358194,0.000006398544,0.00001832419,0.00002616709,0.9358043,0.0002396579,0.0624195,0.001397808,0.000009088797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01308405,0.0005383121,0.9645839,0.0009231263,0.0001510143,0.00006439843,0.0001562464,0.00008240779,0.0204165],"genre_scores_gemma":[0.5462987,0.002509532,0.3713719,0.0007909655,0.0006375197,0.0005425844,0.0007351945,0.0009254797,0.07618804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005370693,"threshold_uncertainty_score":0.01796681,"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","authors":[{"name":"Issmail Elhallaoui","is_ca":true},{"name":"Abdelmoutalib Metrane","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"François Soumis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002062008,0.001281618,0.001948314,0.001284359,0.0009279993,0.001469349,0.001898437,0.001735276,0.007459051],"category_scores_gemma":[0.005127673,0.0009349764,0.001197079,0.001453431,0.001084678,0.001665281,0.002659737,0.003216568,0.002135441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000908025,"about_ca_system_score_gemma":0.002266169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002391039,"about_ca_topic_score_gemma":0.002175996,"domain_scores_codex":[0.9985265,0.0006031845,0.00006865304,0.0001853837,0.0004738853,0.0001423883],"domain_scores_gemma":[0.9987323,0.0005765576,0.00009056206,0.0001726927,0.0003356049,0.00009220515],"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.0002825693,0.0001759771,0.0005436665,0.0002218028,0.00006821665,0.0001754394,0.0001840178,0.7099596,0.004136184,0.09786025,0.006582755,0.1798095],"study_design_scores_gemma":[0.00003400828,0.00003110243,0.00003388788,0.00001220536,0.000005322906,0.00004105885,0.000009070627,0.9818287,0.0006736441,0.01444063,0.002881123,0.000009215032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003065781,0.0001430876,0.9935638,0.00007714318,0.00003917622,0.000067091,0.00003935746,0.0003921964,0.002612342],"genre_scores_gemma":[0.06784378,0.0002145357,0.9275963,0.00009656021,0.00006092136,0.0003156994,0.0002199284,0.0003128888,0.003339343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007459051,"threshold_uncertainty_score":0.02495301,"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","authors":[{"name":"Mark A. Abramson","is_ca":true},{"name":"Charles Audet","is_ca":true},{"name":"J. E. Dennis","is_ca":true},{"name":"José A. Morales Escalante","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122577,0.0009776563,0.0009227172,0.0007665363,0.0004735637,0.001207082,0.001120867,0.001261694,0.003597388],"category_scores_gemma":[0.00454694,0.0004907491,0.0006119098,0.001110068,0.0008870824,0.001640295,0.001305248,0.001634425,0.0008511256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004894006,"about_ca_system_score_gemma":0.0008420961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001616457,"about_ca_topic_score_gemma":0.001920492,"domain_scores_codex":[0.9994457,0.0001652178,0.0000317675,0.0000800359,0.000231548,0.00004574246],"domain_scores_gemma":[0.9990776,0.0006006313,0.00006772039,0.0000821477,0.0001414662,0.00003039352],"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.0001040703,0.00005853424,0.0006475929,0.0002236019,0.00009102104,0.0000780582,0.0001037122,0.399081,0.003666188,0.2580662,0.004819363,0.3330606],"study_design_scores_gemma":[0.00002233921,0.00002986074,0.00005653182,0.00001428866,0.000007042282,0.00003328438,0.000008356061,0.9514448,0.0008353619,0.04360573,0.003935789,0.000006559235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001157769,0.0001113552,0.9976554,0.00005054491,0.00001924079,0.00001301506,0.000009318118,0.00006748683,0.0009159164],"genre_scores_gemma":[0.1182239,0.0007657263,0.8725739,0.0001745721,0.0001243283,0.0004484054,0.000161317,0.0001742376,0.007353563],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003597388,"threshold_uncertainty_score":0.01203442,"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","authors":[{"name":"Jagat Patel","is_ca":true},{"name":"John W. Chinneck","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003335945,0.001839431,0.001462028,0.001823661,0.001067649,0.002319151,0.001771274,0.0008499766,0.01817049],"category_scores_gemma":[0.01129321,0.0009590348,0.001003411,0.002649366,0.0009168049,0.00387679,0.001694523,0.004581421,0.00252767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008259097,"about_ca_system_score_gemma":0.002370088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00304759,"about_ca_topic_score_gemma":0.006433477,"domain_scores_codex":[0.9978359,0.001047639,0.0001228312,0.0001702862,0.000566888,0.0002563183],"domain_scores_gemma":[0.992587,0.004881821,0.0003168339,0.000912926,0.001084929,0.0002164522],"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.00134621,0.0005433627,0.0006827036,0.0006531673,0.00007207945,0.0001855345,0.0002584045,0.1942118,0.01331434,0.2493811,0.01673098,0.5226204],"study_design_scores_gemma":[0.0002004719,0.0001456629,0.0001581178,0.00008712922,0.00003331394,0.00005212095,0.00006013393,0.8603231,0.00897588,0.1196122,0.01032036,0.00003152194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009736371,0.0002775861,0.9808624,0.0002267206,0.0001628766,0.0001417367,0.000214105,0.0009310725,0.00744707],"genre_scores_gemma":[0.1103197,0.0002411142,0.8843786,0.000190822,0.0001074229,0.0002659439,0.000612238,0.0006291262,0.003254977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01817049,"threshold_uncertainty_score":0.06078643,"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","authors":[{"name":"Masao Fukushima","is_ca":false},{"name":"Zhi‐Quan Luo","is_ca":true},{"name":"Paul Tseng","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235641,0.0008771059,0.000862314,0.0004543902,0.0004603156,0.0005793858,0.001095336,0.0006857889,0.006374431],"category_scores_gemma":[0.001425082,0.000409328,0.0007863538,0.0007251799,0.000640763,0.0007699497,0.001184165,0.001519266,0.002316313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004022424,"about_ca_system_score_gemma":0.001434763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326051,"about_ca_topic_score_gemma":0.002995639,"domain_scores_codex":[0.9993938,0.000160034,0.00002207979,0.00007663852,0.0003176739,0.0000297782],"domain_scores_gemma":[0.9996114,0.0001597225,0.00003078997,0.00004358341,0.0001196729,0.00003485323],"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.0001404962,0.0001392813,0.00039979,0.0005016678,0.00009873048,0.0001935056,0.0001239376,0.4868859,0.01840137,0.09194363,0.01449517,0.3866765],"study_design_scores_gemma":[0.00002170866,0.0000671344,0.00005579422,0.00001047814,0.000008680659,0.00006400654,0.000004963731,0.9792595,0.001346911,0.009056599,0.01009485,0.000009370175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005078146,0.00007616133,0.9980085,0.00004838772,0.00003387751,0.00002133614,0.00001637712,0.0001206822,0.001166747],"genre_scores_gemma":[0.04090634,0.0003030977,0.9517169,0.0001101907,0.0001046166,0.0002248919,0.0001599697,0.0002483481,0.006225582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006374431,"threshold_uncertainty_score":0.02132457,"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","authors":[{"name":"Man-Duen Choi","is_ca":true},{"name":"Michael Giesinger","is_ca":true},{"name":"John Holbrook","is_ca":true},{"name":"David W. Kribs","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173089,0.0005101555,0.0004586791,0.001492798,0.001129666,0.003772523,0.0007302608,0.000649315,0.008794483],"category_scores_gemma":[0.005199466,0.0002367858,0.0007905489,0.001130301,0.003546817,0.004779843,0.00224157,0.001462731,0.001485176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000797091,"about_ca_system_score_gemma":0.0003626649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005447327,"about_ca_topic_score_gemma":0.0004060761,"domain_scores_codex":[0.998487,0.0004233332,0.00009558279,0.0002789084,0.0004774218,0.0002376939],"domain_scores_gemma":[0.9962906,0.001316748,0.0009112304,0.0005275299,0.0005869101,0.0003670025],"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.00003669185,0.00001022679,0.0005862091,0.00003441241,0.000005072254,0.0001361259,0.0001931752,0.00506298,0.001337449,0.9866071,0.00051047,0.005480102],"study_design_scores_gemma":[0.00001521994,0.00006909623,0.0008307311,0.00002795081,0.00001050431,0.0005386008,0.0002855053,0.02575816,0.003558471,0.9602088,0.008661201,0.00003575392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3435898,0.001209322,0.5348756,0.001131291,0.0001325333,0.0001051851,0.0006626389,0.000373893,0.1179198],"genre_scores_gemma":[0.9514908,0.000394902,0.0387377,0.0001408563,0.000101829,0.0000674518,0.0002762427,0.00009846438,0.008691707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008794483,"threshold_uncertainty_score":0.0294205,"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","authors":[{"name":"Chen Chen","is_ca":false},{"name":"Alper Atamtürk","is_ca":false},{"name":"Shmuel S. Oren","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156788,0.0009260689,0.001266848,0.0006241198,0.0004856694,0.001139453,0.001327663,0.001851209,0.007971744],"category_scores_gemma":[0.002256212,0.0005418904,0.0007476755,0.0009352468,0.0007844599,0.001095489,0.001679891,0.002048513,0.0008446428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000692546,"about_ca_system_score_gemma":0.00166104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003191205,"about_ca_topic_score_gemma":0.003796482,"domain_scores_codex":[0.9997109,0.0001010754,0.00001084556,0.00003718843,0.0001140847,0.0000259091],"domain_scores_gemma":[0.9992119,0.0004697334,0.00003681539,0.00003914761,0.0001881829,0.00005419977],"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.0001635027,0.0001054491,0.0002347005,0.000348671,0.00006301174,0.0001310965,0.00008086533,0.7698966,0.004163825,0.1009257,0.01063819,0.1132483],"study_design_scores_gemma":[0.000008760125,0.00001260869,0.00001486926,0.000008983983,0.000004041424,0.000009471646,0.000004589196,0.9928365,0.0001525909,0.005986508,0.0009578782,0.000003156241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001480859,0.0001930138,0.9949222,0.0001667163,0.00007443432,0.00003228441,0.0000438253,0.00006297856,0.003023595],"genre_scores_gemma":[0.1202794,0.0007058608,0.8672884,0.0004075528,0.0002229358,0.0004197641,0.0002801649,0.0002818059,0.01011418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007971744,"threshold_uncertainty_score":0.02666813,"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","authors":[{"name":"Bertrand Guenin","is_ca":true},{"name":"Jochen Könemann","is_ca":true},{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003397331,0.001566061,0.001066326,0.001341874,0.000871965,0.002870797,0.001158062,0.001319941,0.08555285],"category_scores_gemma":[0.001707339,0.0007402555,0.0009500482,0.001967583,0.00122673,0.003068331,0.001645136,0.004077923,0.06780718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009215574,"about_ca_system_score_gemma":0.001003031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007060216,"about_ca_topic_score_gemma":0.001211313,"domain_scores_codex":[0.9995121,0.00006062034,0.00002358013,0.00009730044,0.0002730337,0.00003342844],"domain_scores_gemma":[0.9995342,0.0002231595,0.0000240783,0.00005735474,0.0001225193,0.00003868851],"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.00002206662,0.00004609001,0.00008685734,0.0005280632,0.00001459121,0.0001133321,0.0001840504,0.002685598,0.001166799,0.1738794,0.640952,0.180321],"study_design_scores_gemma":[0.000002901376,0.00001426968,0.0001221686,0.0001526649,0.000002749397,0.0001542232,0.00002021279,0.0006284082,0.0001099433,0.0397072,0.9590782,0.000006978469],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.000975697,0.05510873,0.09335654,0.008146545,0.007106875,0.0001560471,0.001415216,0.002242935,0.8314915],"genre_scores_gemma":[0.01087353,0.05200197,0.06118786,0.005082341,0.005594397,0.0002583683,0.001589759,0.001761383,0.8616505],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.08555285,"threshold_uncertainty_score":0.2862028,"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","authors":[{"name":"Nathan Krislock","is_ca":true},{"name":"Jérôme Malick","is_ca":false},{"name":"Frédéric Roupin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722232,0.002163315,0.001769435,0.00136658,0.0008913675,0.0020076,0.002434095,0.001797755,0.01124417],"category_scores_gemma":[0.009795479,0.0009685825,0.001392371,0.001669814,0.001325775,0.00219952,0.002520617,0.005889762,0.002520187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172161,"about_ca_system_score_gemma":0.002060988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002664533,"about_ca_topic_score_gemma":0.003432945,"domain_scores_codex":[0.9981256,0.0007705016,0.00007103844,0.0002125832,0.0006781365,0.0001421931],"domain_scores_gemma":[0.9957234,0.002574342,0.0001693201,0.0005620272,0.0008259808,0.0001450134],"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.0003042732,0.0003663121,0.0003168531,0.0004769668,0.0001038693,0.0001993604,0.0002581218,0.5417978,0.01092601,0.2481619,0.02043219,0.1766565],"study_design_scores_gemma":[0.00001724258,0.00002284046,0.00005444592,0.00002521383,0.000009603112,0.0000293309,0.000008559466,0.9594752,0.001481811,0.0367714,0.002093699,0.00001067215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001089299,0.00008139182,0.9958642,0.00007541906,0.00004250174,0.00003148372,0.00005242787,0.0002144546,0.002548747],"genre_scores_gemma":[0.09317889,0.0003063093,0.8963793,0.0002836417,0.0001159453,0.0005403737,0.0004408465,0.0006538008,0.008100918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01124417,"threshold_uncertainty_score":0.03761554,"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","authors":[{"name":"Nicholas I. M. Gould","is_ca":false},{"name":"Dominique Orban","is_ca":true},{"name":"Annick Sartenaer","is_ca":false},{"name":"Philippe L. Toint","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02747599,0.002295046,0.002808618,0.002749449,0.00139143,0.004559305,0.003027193,0.004749334,0.004005685],"category_scores_gemma":[0.3209106,0.001739512,0.001478957,0.001944263,0.005080184,0.008487429,0.006247529,0.005681639,0.0009846434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003705851,"about_ca_system_score_gemma":0.002912087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003705472,"about_ca_topic_score_gemma":0.001583933,"domain_scores_codex":[0.9800698,0.01255262,0.0008051647,0.002050567,0.003539186,0.0009826156],"domain_scores_gemma":[0.6236502,0.3366373,0.01036859,0.01371927,0.01283482,0.002789835],"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.000786257,0.0001167027,0.001777877,0.0004396696,0.0001787941,0.00009371386,0.0002720637,0.8782306,0.002211513,0.07477852,0.002750772,0.03836348],"study_design_scores_gemma":[0.00004810029,0.0001304558,0.0004414426,0.00008036767,0.00003746015,0.0001003696,0.00005530885,0.9597586,0.002461665,0.03599607,0.0008559893,0.00003415629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03850332,0.00205089,0.951912,0.001168217,0.0001857475,0.0002218582,0.000282426,0.000621062,0.005054445],"genre_scores_gemma":[0.7269403,0.001759056,0.265028,0.000429235,0.0002106352,0.0005735082,0.0005207845,0.0007960585,0.003742415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02747599,"threshold_uncertainty_score":0.1453087,"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","authors":[{"name":"Suliman Al‐Homidan","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051052,0.001759894,0.002840591,0.001215694,0.0009445053,0.004093579,0.003581364,0.002703696,0.006610396],"category_scores_gemma":[0.02723219,0.001254632,0.001259112,0.002445058,0.003862022,0.01005806,0.003895986,0.005825934,0.001056175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001842211,"about_ca_system_score_gemma":0.002551598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0032211,"about_ca_topic_score_gemma":0.003390144,"domain_scores_codex":[0.9958848,0.001664474,0.0001900256,0.0008009885,0.001189866,0.0002696647],"domain_scores_gemma":[0.9859638,0.009049001,0.000969444,0.001935333,0.001485686,0.0005967442],"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.0003050146,0.0003161046,0.0004586043,0.000458715,0.00008734547,0.00009588176,0.0002418785,0.5199913,0.001253732,0.3861409,0.00825537,0.08239514],"study_design_scores_gemma":[0.00002721637,0.00004480583,0.00008138015,0.00001765734,0.000006996063,0.00003869218,0.00005378648,0.7496986,0.0004567275,0.2486266,0.0009263483,0.0000212026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009857042,0.0003275872,0.9870184,0.0004272984,0.00006647123,0.0000497398,0.0001986401,0.0001366849,0.001918183],"genre_scores_gemma":[0.3749588,0.001261363,0.6112893,0.0003610254,0.0004198663,0.000404018,0.001404867,0.0004310025,0.009469747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006610396,"threshold_uncertainty_score":0.02671283,"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Julie Nutini","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215558,0.0008860573,0.001750349,0.0008910381,0.0006018718,0.001170594,0.002223081,0.001979475,0.004699744],"category_scores_gemma":[0.007198816,0.0007432083,0.00072837,0.001020514,0.0009025404,0.001385616,0.001939241,0.002434899,0.001395855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007585536,"about_ca_system_score_gemma":0.001795429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003266435,"about_ca_topic_score_gemma":0.004773682,"domain_scores_codex":[0.9992199,0.0002298524,0.00004183764,0.00008939922,0.0003740856,0.00004485746],"domain_scores_gemma":[0.9983052,0.0009194949,0.00006389487,0.0001942339,0.0003999589,0.0001172009],"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.0005121758,0.000275443,0.0006836821,0.0002744297,0.0001247393,0.000136653,0.0001509571,0.5156437,0.009262834,0.07000054,0.007684957,0.39525],"study_design_scores_gemma":[0.00003319477,0.00003330452,0.00004848058,0.000008470792,0.000007012722,0.00002760244,0.000004468871,0.9916881,0.0006261623,0.006404208,0.001111769,0.000007224394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002560786,0.0001233071,0.9959921,0.00007161051,0.00006257487,0.00004441066,0.00002071478,0.0002093975,0.0009151393],"genre_scores_gemma":[0.07945072,0.0001616145,0.915409,0.0001469679,0.00009458398,0.0003037456,0.000163071,0.0002318719,0.004038505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004699744,"threshold_uncertainty_score":0.01572222,"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","authors":[{"name":"R. Fuentes-Loyola","is_ca":false},{"name":"V.H. Quintana","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166473,0.001142718,0.001054174,0.0003792766,0.0004893731,0.001826826,0.0009627958,0.0009730161,0.004119834],"category_scores_gemma":[0.002517496,0.0005450156,0.0007963683,0.0008528527,0.001316874,0.001257854,0.001023954,0.001624021,0.0006442346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000837131,"about_ca_system_score_gemma":0.001425105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003308098,"about_ca_topic_score_gemma":0.003868165,"domain_scores_codex":[0.9992808,0.0003179368,0.00002860007,0.0001272206,0.0001839643,0.0000616298],"domain_scores_gemma":[0.9977791,0.001581412,0.0002288109,0.0001284163,0.0002082717,0.00007399083],"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.0000691813,0.00005850431,0.0001783244,0.000106701,0.00002068074,0.00006421699,0.00004519897,0.9484116,0.001471159,0.02487146,0.001215011,0.02348795],"study_design_scores_gemma":[0.00001678527,0.00004249414,0.00002563339,0.000006359205,0.00000445354,0.00001430037,0.00001914563,0.9904327,0.000726569,0.007628333,0.001078198,0.000005037406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008229136,0.0001271417,0.9862824,0.0001385444,0.00002909368,0.00005604659,0.000079285,0.0001712971,0.004887091],"genre_scores_gemma":[0.423145,0.0005930783,0.565295,0.0001198169,0.00007881338,0.0005419862,0.0004119413,0.0002113106,0.009603032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004119834,"threshold_uncertainty_score":0.01378226,"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","authors":[{"name":"Yousef Saif","is_ca":true},{"name":"Ali Elkamel","is_ca":true},{"name":"Mark Pritzker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005320982,0.0009275506,0.0008266561,0.000469387,0.0003351484,0.0008151353,0.0005290368,0.0006688696,0.002018961],"category_scores_gemma":[0.000819077,0.0003743273,0.0005563821,0.0004852877,0.0004795417,0.0007940983,0.0006954094,0.0006100284,0.0002208052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009005762,"about_ca_system_score_gemma":0.0009794015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002829553,"about_ca_topic_score_gemma":0.003573374,"domain_scores_codex":[0.9997717,0.00007281779,0.000006060703,0.0000539647,0.00005901375,0.00003647919],"domain_scores_gemma":[0.9997469,0.0001418341,0.00004350799,0.00001178784,0.00004483338,0.00001121843],"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.00001490899,0.000008926359,0.0001195706,0.00002981816,0.000007705489,0.00001409068,0.00001077951,0.9863941,0.001106209,0.003858076,0.0002076349,0.008228259],"study_design_scores_gemma":[0.000003856415,0.00002455928,0.00004958997,0.000003887655,0.00000438308,0.000005733797,0.000006556437,0.9966889,0.0006680889,0.002003919,0.0005381193,0.000002359224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03306725,0.0003772548,0.9590105,0.0001461176,0.00002485742,0.00005516106,0.0000798869,0.0001986115,0.007040333],"genre_scores_gemma":[0.7083273,0.0006297652,0.283607,0.00007089638,0.00001870426,0.0003125739,0.000247096,0.0001232193,0.006663418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002829553,"threshold_uncertainty_score":0.0067541,"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","authors":[{"name":"Jein-Shan Chen","is_ca":true},{"name":"Shaohua Pan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001347265,0.001157366,0.0009803468,0.002031114,0.0006611455,0.001255931,0.0008012169,0.001096055,0.003693836],"category_scores_gemma":[0.002435443,0.0004754914,0.001388408,0.002545034,0.0008860278,0.001591276,0.001101622,0.001588956,0.001011177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008809768,"about_ca_system_score_gemma":0.001748129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003561888,"about_ca_topic_score_gemma":0.002787763,"domain_scores_codex":[0.9994054,0.000170752,0.00004789609,0.00007673477,0.0002613907,0.0000378513],"domain_scores_gemma":[0.99918,0.0004399399,0.00005105633,0.00004569939,0.0002553501,0.0000278668],"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.00005766569,0.00009663053,0.001117965,0.00192139,0.00007091701,0.0001338052,0.0002982937,0.1719274,0.004038346,0.4651438,0.01045098,0.3447426],"study_design_scores_gemma":[0.00001106585,0.00008372305,0.0005298025,0.000326075,0.00003181578,0.000218947,0.0001035076,0.7919133,0.002248927,0.1349706,0.06951118,0.00005110411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.003546501,0.01236135,0.9674494,0.0003126189,0.0001616206,0.00003816086,0.00009527301,0.0001434717,0.01589155],"genre_scores_gemma":[0.173266,0.05835212,0.7414531,0.0007058893,0.001181323,0.0004817946,0.0007555239,0.0007047219,0.02309957],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003693836,"threshold_uncertainty_score":0.01235718,"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","authors":[{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541789,0.001515242,0.001730516,0.001300278,0.0008052883,0.001618981,0.001760823,0.001048495,0.00526614],"category_scores_gemma":[0.006101771,0.0007634083,0.001451791,0.001570141,0.001754939,0.002040717,0.003399215,0.005257589,0.001527481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006670455,"about_ca_system_score_gemma":0.001309777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001654879,"about_ca_topic_score_gemma":0.001819364,"domain_scores_codex":[0.9990267,0.000471258,0.00005273725,0.0001278091,0.0002669992,0.0000545179],"domain_scores_gemma":[0.9987619,0.0005152098,0.00008342181,0.0002580845,0.0002948239,0.00008654912],"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.00008582255,0.0001550292,0.0003673187,0.0002923873,0.00007955954,0.0001251092,0.0001930254,0.1854661,0.002530218,0.6541227,0.00842423,0.1481585],"study_design_scores_gemma":[0.00002324848,0.00003723255,0.00008346478,0.00003454118,0.00001650402,0.00006558897,0.00002139448,0.7887757,0.0007152761,0.2002777,0.009938589,0.00001079692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001675948,0.0002804288,0.9916967,0.0002009957,0.0001211175,0.00003895847,0.00002903083,0.00006985899,0.005886898],"genre_scores_gemma":[0.1559546,0.001995052,0.8241858,0.0004069556,0.0005704257,0.0003924814,0.0003037643,0.0005486424,0.01564224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00526614,"threshold_uncertainty_score":0.01761699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}