{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":31,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":31,"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":"4cef4bdf43be","filters":{"venue":"Optimization methods & software"}},"results":[{"id":"W2110069759","doi":"10.1080/10556780902917735","title":"Provably near-optimal solutions for very large single-row facility layout problems","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":true,"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; Princeton University","keywords":"Relaxation (psychology); Semidefinite programming; Mathematical optimization; Facility location problem; Mathematics; Linear programming relaxation; Set (abstract data type); Representation (politics); Linear programming; Matrix (chemical analysis); Quadratic equation; Computer science","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Ginger Yen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03558696854395779,"gpt":0.2940658887160599,"spread":0.2584789201721022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003471294,0.001722211,0.001925471,0.0008122041,0.001017233,0.002372744,0.001871777,0.001823477,0.007597351],"category_scores_gemma":[0.01382411,0.001040937,0.001298957,0.001540853,0.001714359,0.003075042,0.002667937,0.003647262,0.001205974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001406848,"about_ca_system_score_gemma":0.001502251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282603,"about_ca_topic_score_gemma":0.002478989,"domain_scores_codex":[0.9977167,0.0009469275,0.0001077873,0.0004171435,0.0004964293,0.0003150863],"domain_scores_gemma":[0.9900205,0.008128416,0.0005884793,0.000645437,0.0003654666,0.0002516585],"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.0002080583,0.0001510289,0.0003919545,0.000466218,0.00008311064,0.0001480499,0.0001185847,0.9049004,0.001874424,0.05041805,0.007907214,0.03333285],"study_design_scores_gemma":[0.0001090418,0.00009157596,0.0001628613,0.0000428234,0.00002531127,0.00009264942,0.00008622823,0.8704689,0.001133975,0.1248532,0.002917057,0.00001644267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04850624,0.001430795,0.9278346,0.001446904,0.0001313224,0.0001746578,0.0007610451,0.001146392,0.01856803],"genre_scores_gemma":[0.4652223,0.001295488,0.524888,0.0005809285,0.0002811081,0.0005592502,0.001632077,0.0005831933,0.004957565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007597351,"threshold_uncertainty_score":0.02541572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2755905518","doi":"10.1080/10556788.2017.1374385","title":"Computationally relevant generalized derivatives: theory, evaluation and applications","year":2017,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Process Optimization and Integration","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"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; Novartis-MIT Center for Continuous Manufacturing; Science and Engineering Research Council; Statoil","keywords":"Extension (predicate logic); Automatic differentiation; Mathematics; Context (archaeology); Mathematical optimization; Lexicographical order; Inverse; Computer science; Calculus (dental); Algorithm","authors":[{"name":"Paul I. Barton","is_ca":false},{"name":"Kamil A. Khan","is_ca":true},{"name":"Peter Stechlinski","is_ca":false},{"name":"Harry A. J. Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0297338584173605,"gpt":0.3617398478055904,"spread":0.3320059893882299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291643,0.001282352,0.001339272,0.001753457,0.0005649379,0.002703126,0.001065639,0.001175537,0.004430517],"category_scores_gemma":[0.003959666,0.0004747334,0.001073558,0.00211717,0.001695681,0.002521252,0.001724393,0.002134586,0.001205479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009868315,"about_ca_system_score_gemma":0.001221361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001486307,"about_ca_topic_score_gemma":0.001579177,"domain_scores_codex":[0.9990708,0.0002704716,0.00007547589,0.0001167953,0.0004206236,0.0000457441],"domain_scores_gemma":[0.9989043,0.0005910792,0.0001098909,0.0001125091,0.0002337492,0.00004840959],"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.00002773005,0.00003160481,0.0004530372,0.0008719792,0.00006069127,0.0002031569,0.0001274716,0.1085337,0.004006604,0.7256498,0.006497533,0.1535367],"study_design_scores_gemma":[0.000009767363,0.00005167576,0.0003455981,0.0002501346,0.00004590819,0.0003503693,0.00007010732,0.4595919,0.002670135,0.4750264,0.06153236,0.00005565454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002286256,0.01085432,0.973269,0.0005357509,0.0003027579,0.00003686795,0.00008691655,0.0001872543,0.01244077],"genre_scores_gemma":[0.2241875,0.04003131,0.709251,0.0005924287,0.001273597,0.0003006477,0.0003954954,0.0009463797,0.02302148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004430517,"threshold_uncertainty_score":0.01482153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035488027","doi":"10.1080/10556780903420135","title":"Optimal scenario tree reduction for stochastic streamflows in power generation planning problems","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Water resources management and optimization","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Reduction (mathematics); Autoregressive model; Mathematical optimization; Resampling; A priori and a posteriori; Time horizon; Tree (set theory); Mathematics; Stochastic optimization; Set (abstract data type); Computer science; Algorithm; Statistics","authors":[{"name":"Welington Luis de Oliveira","is_ca":false},{"name":"Claudia Sagastizábal","is_ca":false},{"name":"Débora Dias Jardim Penna","is_ca":false},{"name":"Maria Elvira Piñeiro Maceira","is_ca":false},{"name":"Jorge Machado Damázio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02767541781681218,"gpt":0.2891533921802617,"spread":0.2614779743634496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001866181,0.0005132155,0.0008082939,0.0008065543,0.0003365692,0.0004909566,0.0004503497,0.0005478849,0.001040088],"category_scores_gemma":[0.004665548,0.0004389154,0.0008154216,0.0006941583,0.0005543137,0.0008391952,0.0005763986,0.0008315516,0.0001340014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005003039,"about_ca_system_score_gemma":0.000869054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002892679,"about_ca_topic_score_gemma":0.002495143,"domain_scores_codex":[0.9993095,0.0004830725,0.00002048791,0.00004615006,0.00009796894,0.00004282551],"domain_scores_gemma":[0.9981099,0.001643236,0.00007152671,0.00005085551,0.00008396723,0.00004050732],"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.00002215359,0.00001624378,0.0002044061,0.00002132767,0.00001049815,0.00001887258,0.00002157269,0.9840621,0.0003140801,0.00618301,0.0001179475,0.009007876],"study_design_scores_gemma":[0.000002962036,0.00000974518,0.00005214386,0.000002248364,0.000001936491,0.000003510962,0.000003457911,0.9954979,0.0001218858,0.004204419,0.00009799845,0.000001771001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05551082,0.0003290853,0.9427229,0.0001340582,0.00001456848,0.00005426912,0.00007650888,0.0001055686,0.001052232],"genre_scores_gemma":[0.6434442,0.0004853176,0.3543915,0.00005493626,0.00003085412,0.0002553783,0.0004092732,0.0001052823,0.0008232715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002892679,"threshold_uncertainty_score":0.009869397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155945500","doi":"10.1080/10556780903334682","title":"Robust portfolio selection based on a joint ellipsoidal uncertainty set","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Portfolio; Robust optimization; Selection (genetic algorithm); Ellipsoid; Mathematics; Portfolio optimization; Mathematical optimization; Modern portfolio theory; Set (abstract data type); Project portfolio management; Computer science; Artificial intelligence; Economics; Financial economics","authors":[{"name":"Zhaosong Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1339619415614735,"gpt":0.405099374543439,"spread":0.2711374329819656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006457625,0.001467067,0.002247549,0.001965337,0.0005354763,0.002565029,0.001708582,0.001298591,0.002148325],"category_scores_gemma":[0.01351757,0.001031696,0.001897298,0.001825244,0.00161572,0.003273715,0.00315191,0.002115557,0.0003641178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382828,"about_ca_system_score_gemma":0.0009911333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002340218,"about_ca_topic_score_gemma":0.0009793573,"domain_scores_codex":[0.9949267,0.002250569,0.000220456,0.0006729375,0.001581309,0.0003479241],"domain_scores_gemma":[0.9919605,0.005791228,0.0008187787,0.0004042937,0.0007762101,0.0002490194],"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.0001032086,0.00002446194,0.0006496951,0.00007608577,0.0000978529,0.0001488948,0.00007793764,0.8661999,0.0008655734,0.1120565,0.0007385412,0.01896134],"study_design_scores_gemma":[0.00000793893,0.00002808961,0.0001205376,0.00001316423,0.00001184542,0.0000309627,0.000007457629,0.9704481,0.0002592742,0.0287485,0.0003114574,0.00001262616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01378433,0.0003746914,0.9833289,0.0001512169,0.00001380325,0.00002714639,0.0000541073,0.00005049313,0.002215156],"genre_scores_gemma":[0.7957404,0.001460227,0.1977138,0.0002176177,0.0001274773,0.0002916899,0.000475602,0.00007522509,0.003897899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006457625,"threshold_uncertainty_score":0.03415161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1821374938","doi":"10.1080/10556788.2015.1062891","title":"An efficient optimization approach for a cardinality-constrained index tracking problem","year":2015,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":54,"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 Natural Science Foundation of China; National Key Research and Development Program of China; University of Otago","keywords":"Cardinality (data modeling); Mathematical optimization; Computer science; Tracking (education); Tracking error; Portfolio; Regularization (linguistics); Thresholding; Mathematics; Artificial intelligence; Data mining","authors":[{"name":"Fengmin Xu","is_ca":false},{"name":"Zhaosong Lu","is_ca":true},{"name":"Zongben Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05089273698655643,"gpt":0.3335022468907675,"spread":0.2826095099042111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363547,0.001165672,0.001401968,0.0009865364,0.0006073655,0.001350193,0.001364569,0.001979844,0.004115816],"category_scores_gemma":[0.005928713,0.0008771259,0.00104914,0.001238221,0.0008632368,0.001758732,0.001881531,0.002173136,0.0007113799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009945253,"about_ca_system_score_gemma":0.001964298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003616579,"about_ca_topic_score_gemma":0.003207803,"domain_scores_codex":[0.9990683,0.0003383071,0.00005097142,0.0002020615,0.000257448,0.00008291196],"domain_scores_gemma":[0.9980032,0.001346224,0.0001682227,0.0001333752,0.000262455,0.00008659248],"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.00005174601,0.00006926733,0.0004400355,0.0001108573,0.00003492166,0.0001001587,0.00005702929,0.9175522,0.001813506,0.02394473,0.002050478,0.05377506],"study_design_scores_gemma":[0.000007222796,0.00001563375,0.00004389988,0.000005266174,0.000003980067,0.00001651346,0.000004936561,0.9941122,0.0002203585,0.005189801,0.0003768951,0.000003343106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002767616,0.0001030511,0.9958107,0.0001453564,0.00001450673,0.00003785042,0.00002973858,0.00006705919,0.001024053],"genre_scores_gemma":[0.1699278,0.000386085,0.8245601,0.000199904,0.0001058829,0.000408774,0.0002844359,0.0001672202,0.003959757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004115816,"threshold_uncertainty_score":0.01376879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2619018971","doi":"10.1080/10556788.2017.1322080","title":"ARC<sub>q</sub>: a new adaptive regularization by cubics","year":2017,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc (geometry); Corollary; Regularization (linguistics); Convergence (economics); Factorization; Computer science; Algorithm; Key (lock); Mathematics; Discrete mathematics; Geometry; Artificial intelligence","authors":[{"name":"Jean‐Pierre Dussault","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02612210389689576,"gpt":0.2950755303993846,"spread":0.2689534265024888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118401,0.000574878,0.0005725512,0.0005858978,0.0004487121,0.0008621151,0.001339926,0.001100867,0.004945169],"category_scores_gemma":[0.00287073,0.0003807121,0.0007560354,0.0009707994,0.001012487,0.001046665,0.001859699,0.00224519,0.001599001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006597118,"about_ca_system_score_gemma":0.001674646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006155982,"about_ca_topic_score_gemma":0.006214006,"domain_scores_codex":[0.9992746,0.000141577,0.00003028625,0.00009765768,0.0003834474,0.00007255428],"domain_scores_gemma":[0.9989889,0.0003476817,0.00008636923,0.0001768101,0.0003119026,0.00008837561],"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.0003523562,0.0001163873,0.0009473364,0.0004308723,0.00008738886,0.0002036364,0.0002684238,0.3816888,0.043547,0.1250154,0.01921184,0.4281306],"study_design_scores_gemma":[0.00001760923,0.00004693121,0.00007294145,0.000009743657,0.000005815652,0.00008226102,0.00001394573,0.9815665,0.003576078,0.007656818,0.006936251,0.0000150785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001933882,0.00009500008,0.9964046,0.0001188401,0.00004916395,0.00002070017,0.00003197829,0.000224443,0.00112138],"genre_scores_gemma":[0.08159457,0.0002658408,0.9116935,0.0002024627,0.00009086864,0.00009996352,0.000134927,0.0003805709,0.005537425],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006155982,"threshold_uncertainty_score":0.01654321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392808390","doi":"10.1080/10556788.2024.2322095","title":"Decentralized gradient tracking with local steps","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":24,"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":"Tracking (education); Computer science; Psychology","authors":[{"name":"Yue Liu","is_ca":true},{"name":"Tao Lin","is_ca":false},{"name":"Anastasia Koloskova","is_ca":false},{"name":"Sebastian U. Stich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01466445729778756,"gpt":0.2819154832200267,"spread":0.2672510259222392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052745,0.0006392855,0.001107201,0.0003552745,0.0006293425,0.0008297738,0.001588279,0.0009399067,0.002048949],"category_scores_gemma":[0.005117957,0.000450319,0.0004562576,0.0005984349,0.001029641,0.001627248,0.001893893,0.00130302,0.0005636318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007440211,"about_ca_system_score_gemma":0.001396537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991109,"about_ca_topic_score_gemma":0.003397581,"domain_scores_codex":[0.9993278,0.0001605598,0.00003467008,0.0002215224,0.0001815263,0.00007394851],"domain_scores_gemma":[0.997947,0.0008549905,0.0002520219,0.0005324454,0.0003204012,0.00009318846],"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.000206414,0.00006455066,0.0009154209,0.00008401019,0.00004919399,0.0001010821,0.00007987128,0.8845964,0.006441992,0.03314845,0.003199972,0.07111266],"study_design_scores_gemma":[0.00001908405,0.00002760419,0.0000763217,0.000003458178,0.000003924419,0.00001929586,0.000004776215,0.9909143,0.001387671,0.007023224,0.0005153774,0.000004930136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01426886,0.00009562005,0.9829999,0.000135232,0.00003208734,0.00003554208,0.00004276735,0.0006703236,0.00171959],"genre_scores_gemma":[0.7795758,0.0001172815,0.2151025,0.0001754169,0.00005648792,0.0002476072,0.0001955881,0.0001802425,0.004349105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002991109,"threshold_uncertainty_score":0.006854415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077119768","doi":"10.1080/10556780108805808","title":"The Gauss-Newton direction in semidefinite programming","year":2001,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"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":"Gauss; Computer science; Newton's method; Applied mathematics; Scaling; Nonlinear system; Mathematics; Physics","authors":[{"name":"Serge Kruk","is_ca":true},{"name":"Masakazu Muramatsu","is_ca":false},{"name":"Franz Rendl","is_ca":false},{"name":"Robert J. Vanderbei","is_ca":false},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07224147369964559,"gpt":0.4460038399389775,"spread":0.3737623662393319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669888,0.0009040594,0.0006872257,0.0006475503,0.0005233338,0.001455166,0.000748981,0.0008570583,0.003497811],"category_scores_gemma":[0.0033375,0.0006782086,0.0005711717,0.001070468,0.002639923,0.001501376,0.001412041,0.003756916,0.002605384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005030904,"about_ca_system_score_gemma":0.001207334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001096044,"about_ca_topic_score_gemma":0.00149937,"domain_scores_codex":[0.9987866,0.0004687117,0.0000423955,0.0001387045,0.000520686,0.00004287729],"domain_scores_gemma":[0.9990583,0.0004923209,0.00008801912,0.0001019603,0.0002109631,0.0000484915],"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.00005783299,0.0000528465,0.0001952876,0.0003782852,0.00003758882,0.00008776211,0.0001881256,0.07346599,0.002642924,0.7482291,0.01620098,0.1584633],"study_design_scores_gemma":[0.00005075113,0.0000600784,0.0001265467,0.0001309068,0.00001428362,0.0001453971,0.0000370973,0.3455394,0.003316837,0.5922668,0.05827105,0.00004087632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001013614,0.0009684163,0.9891088,0.0003924436,0.0001591239,0.00002650314,0.000043641,0.000155774,0.008131787],"genre_scores_gemma":[0.07352892,0.004344598,0.9078173,0.0005757923,0.0003939976,0.0003221812,0.0002378362,0.0003421829,0.01243717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003497811,"threshold_uncertainty_score":0.01170135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999360615","doi":"10.1080/10556780903239568","title":"Bi-parametric convex quadratic optimization","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"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; Direktion für Entwicklung und Zusammenarbeit","keywords":"Quadratic equation; Parametric statistics; Mathematical optimization; Convex optimization; Quadratic function; Regular polygon; Perturbation (astronomy); Mathematics; Convex function; Function (biology); Optimization problem; Invariant (physics); Parametric equation; Quadratic programming; Computer science; Geometry; Physics","authors":[{"name":"‎Alireza Ghaffari-Hadigheh","is_ca":false},{"name":"Oleksandr Romanko","is_ca":true},{"name":"Tamás Terlaky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07474502751145072,"gpt":0.4498631699427029,"spread":0.3751181424312522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872316,0.001232881,0.001248913,0.0004668062,0.0004207548,0.001493166,0.001219511,0.001173666,0.002586067],"category_scores_gemma":[0.006823057,0.0004462133,0.0007641303,0.0009713984,0.001462643,0.001542193,0.002055583,0.00168523,0.0009289286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006195649,"about_ca_system_score_gemma":0.0006934666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001567782,"about_ca_topic_score_gemma":0.001075964,"domain_scores_codex":[0.99848,0.0006734564,0.0000539987,0.0002931115,0.0003853301,0.00011413],"domain_scores_gemma":[0.9980793,0.001190132,0.0001536516,0.000243966,0.0002620318,0.00007102919],"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.00009085941,0.00003351951,0.0003215727,0.0001394343,0.00004857578,0.0001191142,0.00005686248,0.91654,0.003537239,0.04326419,0.0009943121,0.03485442],"study_design_scores_gemma":[0.000002806057,0.00002227509,0.00006905904,0.000003653902,0.000003780741,0.00003037275,0.000008213795,0.9887602,0.0006547314,0.009766374,0.0006732467,0.000005285115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006247621,0.0002604917,0.9909006,0.0001214667,0.00002144723,0.00001410272,0.00003064074,0.00008629091,0.002317363],"genre_scores_gemma":[0.6327239,0.0007657291,0.355847,0.0001774749,0.000105224,0.0001837939,0.0003029267,0.0003000217,0.009594063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002586067,"threshold_uncertainty_score":0.009901881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131570268","doi":"10.1080/10556780701374633","title":"Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming","year":2007,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Semidefinite programming; Mathematics; Interior point method; Semidefinite embedding; Path (computing); Quadratically constrained quadratic program; Positive-definite matrix; Linear programming; Matrix (chemical analysis); Limit point; Mathematical optimization; Limiting; Applied mathematics; Combinatorics; Quadratic programming; Mathematical analysis; Computer science; Eigenvalues and eigenvectors","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Renato D. C. Monteiro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06043185546229511,"gpt":0.4208278119046966,"spread":0.3603959564424015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003874553,0.001273028,0.0008562355,0.001221634,0.001032803,0.0017714,0.001519366,0.001324459,0.004169832],"category_scores_gemma":[0.02717557,0.000667582,0.0009091093,0.0006159607,0.00343681,0.003676442,0.002332539,0.002639185,0.000378357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001436458,"about_ca_system_score_gemma":0.001034518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001912181,"about_ca_topic_score_gemma":0.001629299,"domain_scores_codex":[0.998845,0.000601703,0.00003477874,0.0001645658,0.0002311122,0.0001228406],"domain_scores_gemma":[0.9876987,0.008814594,0.001285804,0.0005433764,0.001011864,0.0006457067],"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.0002079531,0.0001006621,0.001764869,0.0002098032,0.00006524957,0.0003901251,0.0003997355,0.3505848,0.00396854,0.6275446,0.001624722,0.01313892],"study_design_scores_gemma":[0.00001385025,0.00003827234,0.0001419474,0.00002769576,0.000007214432,0.00007672743,0.00004833419,0.871021,0.001026697,0.1270196,0.000562246,0.00001641204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360799,0.0004274591,0.8539032,0.000534275,0.00003502386,0.0000780305,0.00009215141,0.0001790831,0.008670936],"genre_scores_gemma":[0.820922,0.0006365758,0.1663052,0.0002518985,0.00004529106,0.0004091535,0.0002746956,0.0003469297,0.01080822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004169832,"threshold_uncertainty_score":0.02049083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081215000","doi":"10.1080/1055678021000039175","title":"A dynamic large-update primal‐dual interior-point method for linear optimization","year":2002,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"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":"Duality gap; Duality (order theory); Interior point method; Path (computing); Mathematical optimization; Mathematics; Dual (grammatical number); Function (biology); Simple (philosophy); Optimization problem; Point (geometry); Power (physics); Computer science; Discrete mathematics","authors":[{"name":"Jiming Peng","is_ca":true},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05516734349933614,"gpt":0.4375199633420161,"spread":0.3823526198426799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008748423,0.0006897072,0.0009213116,0.0003800117,0.0003876173,0.0007237224,0.001333854,0.0009620489,0.002382098],"category_scores_gemma":[0.002146911,0.0004373013,0.0006833434,0.0004234581,0.0007265845,0.001034678,0.001690537,0.00176747,0.0004852456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005170758,"about_ca_system_score_gemma":0.0009068944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001110849,"about_ca_topic_score_gemma":0.0008770616,"domain_scores_codex":[0.9996514,0.0001414213,0.00001362528,0.0000675842,0.0001022618,0.00002376051],"domain_scores_gemma":[0.9996316,0.0001937698,0.00004160155,0.00004086181,0.00006163451,0.00003051391],"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.000085539,0.00008960522,0.0004036736,0.0001417,0.0000382685,0.0001008209,0.0001117437,0.849178,0.003961597,0.0774078,0.002839103,0.06564222],"study_design_scores_gemma":[0.000006010862,0.0000147148,0.00001458395,0.000002856144,0.00000190754,0.000008774909,0.000002630891,0.9963415,0.0002396048,0.002747668,0.0006171624,0.000002478819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002740182,0.00009181552,0.9956213,0.00008478074,0.00002726176,0.0000270452,0.00001102818,0.0000813958,0.001315146],"genre_scores_gemma":[0.2735042,0.0003167446,0.7200912,0.0001644634,0.0001159891,0.0004432198,0.0001186102,0.0001647802,0.005080694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002382098,"threshold_uncertainty_score":0.007968903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982277563","doi":"10.1080/1055678021000012480","title":"Discovering the Characteristics of Mathematical Programs via Sampling","year":2002,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Sampling (signal processing); Computer science; Data science; Telecommunications","authors":[{"name":"John W. Chinneck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.266584848467471,"gpt":0.4475238435556824,"spread":0.1809389950882113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007786274,0.0007261384,0.001226463,0.002897453,0.0008396839,0.001951569,0.001296493,0.001043284,0.001476218],"category_scores_gemma":[0.06801482,0.0009399044,0.001434889,0.001742583,0.002530576,0.005645507,0.00187117,0.002437021,0.0002806693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189445,"about_ca_system_score_gemma":0.001887196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001414798,"about_ca_topic_score_gemma":0.001538914,"domain_scores_codex":[0.9950185,0.002522272,0.0002538785,0.0008068893,0.001198776,0.0001997579],"domain_scores_gemma":[0.9347746,0.05424301,0.003630456,0.004685925,0.002108898,0.0005571526],"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.0004000571,0.0002781735,0.02815848,0.0006103556,0.0002141785,0.0003573887,0.001210112,0.3717389,0.006665,0.3899063,0.003219577,0.1972414],"study_design_scores_gemma":[0.00003804937,0.00007105583,0.001129632,0.00003161668,0.00001966489,0.00008961814,0.0000966691,0.810961,0.002283016,0.183597,0.001660476,0.00002233933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05708684,0.0001697588,0.9405275,0.0004762421,0.0000115137,0.0001052686,0.0001301846,0.0003410201,0.001151704],"genre_scores_gemma":[0.4787515,0.0005066848,0.518205,0.0001901788,0.00007729143,0.0005018522,0.0006509653,0.0002065244,0.0009100154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007786274,"threshold_uncertainty_score":0.04117823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162546528","doi":"10.1080/10556788.2014.968158","title":"A derivative-free comirror algorithm for convex optimization","year":2014,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Mathematical optimization; Convex function; Rate of convergence; Interpolation (computer graphics); Convex optimization; Convex combination; Convergence (economics); Algorithm; Regular polygon; Computer science; Key (lock)","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Warren Hare","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02130885474899673,"gpt":0.3018796195636025,"spread":0.2805707648146057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197504,0.0008674105,0.0009647612,0.0004331805,0.0003614126,0.0009040802,0.001486317,0.0014272,0.002551739],"category_scores_gemma":[0.003561854,0.0004212975,0.000701667,0.0005462923,0.000930931,0.001134007,0.001800405,0.002156121,0.0008270544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006080357,"about_ca_system_score_gemma":0.001098031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001311547,"about_ca_topic_score_gemma":0.001819621,"domain_scores_codex":[0.9993466,0.0001603625,0.00003530616,0.000124816,0.0002890825,0.00004388931],"domain_scores_gemma":[0.999298,0.0003642772,0.00005992051,0.0001034131,0.0001299377,0.00004445849],"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.0002320595,0.0001115953,0.0006902816,0.0003406997,0.00007982308,0.0002056745,0.0001712702,0.5973629,0.0185251,0.1168643,0.004664265,0.2607521],"study_design_scores_gemma":[0.00001941396,0.00005110874,0.00004728003,0.00001426233,0.000004237877,0.00006220084,0.000007888245,0.9874326,0.00275766,0.006860238,0.002734037,0.000009008109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00145714,0.0001143168,0.9971936,0.0000898091,0.0000325275,0.00002258736,0.00001272686,0.00008388102,0.0009933858],"genre_scores_gemma":[0.07288168,0.0002866866,0.9230063,0.000156209,0.00007149389,0.0001410169,0.00008692781,0.0001221665,0.003247495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002551739,"threshold_uncertainty_score":0.008536398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055391493","doi":"10.1080/10556780701661393","title":"Mehrotra-type predictor-corrector algorithm revisited","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"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; McMaster University","keywords":"Predictor–corrector method; Perspective (graphical); Mathematics; Algorithm; Type (biology); Point (geometry); Interior point method; Upper and lower bounds; Polynomial; Combinatorics; Discrete mathematics; Mathematical analysis; Geometry","authors":[{"name":"Maziar Salahi","is_ca":false},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09444654323418775,"gpt":0.4244460149172123,"spread":0.3299994716830246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002605377,0.0008880135,0.001401756,0.0006802756,0.001036923,0.00150597,0.002575105,0.001475643,0.006335021],"category_scores_gemma":[0.008908638,0.0005017469,0.0006204294,0.001206216,0.001783668,0.001701586,0.001948173,0.003470593,0.001542704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001279408,"about_ca_system_score_gemma":0.003750179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0075908,"about_ca_topic_score_gemma":0.006454371,"domain_scores_codex":[0.99817,0.0005845002,0.000123617,0.0002213272,0.0006807326,0.0002198066],"domain_scores_gemma":[0.9968956,0.001433731,0.0001857047,0.0006729041,0.0006436827,0.0001683915],"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.001312631,0.000213664,0.0024762,0.0003261024,0.0001303309,0.0004445498,0.0004957494,0.5088878,0.006712336,0.2454674,0.00730878,0.2262245],"study_design_scores_gemma":[0.0000617898,0.00005044117,0.00009257515,0.00001836538,0.000009490432,0.00003853215,0.00001788915,0.9765195,0.002473492,0.018677,0.002028197,0.00001275738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01497698,0.0002795044,0.9788193,0.0005447523,0.0001059606,0.00006956612,0.00004632574,0.001035573,0.004122068],"genre_scores_gemma":[0.3314008,0.0002551657,0.6573755,0.0003261973,0.00008836171,0.0002038884,0.0001335517,0.0002595354,0.009957027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0075908,"threshold_uncertainty_score":0.02119273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127485070","doi":"10.1080/10556780802079958","title":"The smoothed Monte Carlo method in robustness optimization","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Vancouver Island University","keywords":"Robustness (evolution); Monte Carlo method; Mathematical optimization; Classification of discontinuities; Computer science; Nonlinear system; Monte Carlo integration; Robust optimization; Hybrid Monte Carlo; Algorithm; Mathematics; Markov chain Monte Carlo; Statistics; Physics","authors":[{"name":"E.M.T. Hendrix","is_ca":false},{"name":"N.J. Olieman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0963803541285717,"gpt":0.4017757868587589,"spread":0.3053954327301872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851635,0.001085519,0.00157152,0.001825326,0.0005249955,0.001244703,0.001366629,0.001689623,0.003188629],"category_scores_gemma":[0.0101217,0.0007558863,0.001496983,0.00188512,0.002459479,0.001540275,0.001498963,0.002382456,0.0008254703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001323542,"about_ca_system_score_gemma":0.001670643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003341369,"about_ca_topic_score_gemma":0.001797338,"domain_scores_codex":[0.9977163,0.001230602,0.00006194074,0.0002180435,0.0007012483,0.00007184854],"domain_scores_gemma":[0.9956865,0.003306753,0.0002414731,0.0003418371,0.0003436329,0.00007988534],"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.00005507498,0.00002037135,0.000223847,0.000159243,0.00009333825,0.00005850726,0.00004409071,0.7337896,0.001968321,0.2234105,0.001436173,0.0387409],"study_design_scores_gemma":[0.00001124885,0.00003040372,0.00009923182,0.00002608417,0.00001865823,0.00003670328,0.000003690508,0.9299486,0.0007691001,0.06435739,0.004675914,0.00002292902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006475439,0.0006239996,0.9972196,0.00008782547,0.00003666494,0.00001311203,0.00001511087,0.0001118018,0.001244379],"genre_scores_gemma":[0.2015194,0.003348489,0.7865219,0.000407492,0.0004613343,0.0004187949,0.0002147285,0.0004546667,0.006653266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003851635,"threshold_uncertainty_score":0.02036965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098204196","doi":"10.1080/10556788.2014.936438","title":"Penalty decomposition methods for rank minimization","year":2014,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Minification; Mathematical optimization; Penalty method; Mathematics; Low-rank approximation; Matrix (chemical analysis); Sequence (biology); Algorithm; Computer science; Combinatorics; Hankel matrix","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Yong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03348095355379413,"gpt":0.3955012384163833,"spread":0.3620202848625892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825512,0.001256243,0.001033389,0.0006662107,0.0004107978,0.000954102,0.0009302017,0.001347548,0.003627461],"category_scores_gemma":[0.005190806,0.0004343803,0.0006925387,0.0009073638,0.001207341,0.001470716,0.001446499,0.002374095,0.001509143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004341609,"about_ca_system_score_gemma":0.0007585302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007833406,"about_ca_topic_score_gemma":0.0008820473,"domain_scores_codex":[0.9989108,0.0004896824,0.00004653657,0.000141317,0.0003560053,0.00005559022],"domain_scores_gemma":[0.9982713,0.000956916,0.0001632303,0.0002246768,0.0003082628,0.00007551691],"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.0001395513,0.0001047348,0.0005433738,0.0007992348,0.0001234249,0.0002073068,0.0001646105,0.4452574,0.01894074,0.3222463,0.009882045,0.2015912],"study_design_scores_gemma":[0.00001221394,0.00004340073,0.00007947522,0.00003139158,0.000009861224,0.00009788249,0.00001387329,0.9468371,0.002829217,0.0421957,0.007835754,0.00001419599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008896248,0.0002980029,0.9976672,0.00009784562,0.00003121809,0.00001562027,0.00002002028,0.00004792577,0.0009325576],"genre_scores_gemma":[0.07105533,0.001606842,0.9189174,0.0002124562,0.0002421837,0.000212107,0.0002586336,0.0002534271,0.007241612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003627461,"threshold_uncertainty_score":0.01213503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3085334717","doi":"10.1080/10556788.2020.1817447","title":"Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Bounding overwatch; Travelling salesman problem; Morin; Computer science; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence","authors":[{"name":"Ya.V. Salii","is_ca":true},{"name":"Andrey Sheka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02520931664539284,"gpt":0.301731733635452,"spread":0.2765224169900592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001976123,0.001839784,0.001498535,0.001354267,0.0009767867,0.002258452,0.002349821,0.001235431,0.009079669],"category_scores_gemma":[0.007524292,0.0007440835,0.001912468,0.00171086,0.0009920412,0.003370283,0.00319675,0.00341053,0.001811324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002396481,"about_ca_system_score_gemma":0.00270569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01142028,"about_ca_topic_score_gemma":0.01436082,"domain_scores_codex":[0.9981371,0.0004650721,0.00009711341,0.0003714443,0.0005689104,0.0003603635],"domain_scores_gemma":[0.9980081,0.001002298,0.0001495315,0.0004700653,0.0002566096,0.0001134551],"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.0002211452,0.000220229,0.001130009,0.0002494891,0.00009737968,0.0001215945,0.0002786376,0.6783388,0.004549399,0.1017394,0.01191098,0.2011429],"study_design_scores_gemma":[0.00002912737,0.00002679378,0.0001020819,0.00002251344,0.00001139777,0.00001965694,0.00001751778,0.9699555,0.0007663588,0.02398295,0.005056179,0.000009880758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03725672,0.001363049,0.9309194,0.0009758616,0.0002231077,0.0001771526,0.000305923,0.002925811,0.025853],"genre_scores_gemma":[0.1961327,0.0005436771,0.7949846,0.0004555454,0.0001405127,0.000349263,0.0006601299,0.001180962,0.00555243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01142028,"threshold_uncertainty_score":0.03037453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981321991","doi":"10.1080/10556780412331332024","title":"An adaptive self-regular proximity-based large-update IPM for LO","year":2005,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Canada Research Chairs","keywords":"Interior point method; Mathematics; Value (mathematics); Position (finance); Point (geometry); Combinatorics; Degree (music); Class (philosophy); Algorithm; Upper and lower bounds; Power (physics); Discrete mathematics; Mathematical optimization; Computer science; Statistics; Artificial intelligence; Mathematical analysis; Physics","authors":[{"name":"Maziar Salahi","is_ca":true},{"name":"Tamás Terlaky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05297343988889592,"gpt":0.4344821924655114,"spread":0.3815087525766155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00135305,0.0007460762,0.001136823,0.000566167,0.0004811339,0.0008468977,0.002652451,0.001672008,0.003188151],"category_scores_gemma":[0.004932092,0.0005189115,0.0008047267,0.0004681092,0.0009249962,0.001514102,0.00269992,0.002286183,0.0009542084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005993496,"about_ca_system_score_gemma":0.001130876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001204442,"about_ca_topic_score_gemma":0.001313088,"domain_scores_codex":[0.9993426,0.000209533,0.00003368307,0.0001485936,0.0002139972,0.00005155784],"domain_scores_gemma":[0.9988946,0.0005292518,0.0001153814,0.0001684671,0.0002024478,0.00008989823],"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.0002350956,0.0002005538,0.001087116,0.0002559198,0.00006456281,0.0001298085,0.0002375082,0.7304925,0.008941568,0.04314598,0.004935096,0.2102743],"study_design_scores_gemma":[0.00001150188,0.00002710552,0.00002670619,0.000005059317,0.000003125313,0.00001425115,0.000004488111,0.9963083,0.0006015567,0.002305597,0.0006877952,0.000004488269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00306562,0.00008644442,0.9956015,0.00009093627,0.00002658427,0.00003586897,0.00001096701,0.0002751398,0.0008069575],"genre_scores_gemma":[0.1450546,0.0001248201,0.8505851,0.0002720618,0.00009803252,0.0004286916,0.0001031109,0.000233983,0.003099517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003188151,"threshold_uncertainty_score":0.01066548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117753887","doi":"10.1080/10556780802414049","title":"An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Preconditioner; Solver; Mathematics; Path (computing); Iterative method; Interior point method; Regular polygon; Linear programming; Mathematical optimization; Algorithm; Computer science","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Renato D. C. Monteiro","is_ca":false},{"name":"Jerome W. O’Neal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07167003668825579,"gpt":0.4218804857570916,"spread":0.3502104490688359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073612,0.0009417133,0.001030949,0.0005149912,0.0005886932,0.0007456082,0.001368366,0.001321028,0.005621924],"category_scores_gemma":[0.002471337,0.0005308891,0.0007915772,0.0005576655,0.0007646009,0.001091003,0.001610239,0.002928564,0.001714926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000627432,"about_ca_system_score_gemma":0.00212617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002976493,"about_ca_topic_score_gemma":0.003409935,"domain_scores_codex":[0.9994978,0.0001591146,0.00002700187,0.00008759976,0.0001775873,0.00005097165],"domain_scores_gemma":[0.999255,0.0003652684,0.00006730949,0.00009772052,0.0001664825,0.00004815198],"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.0002033308,0.0001527924,0.0006622524,0.0002655198,0.00007067181,0.0001972939,0.0002232143,0.6247709,0.009780877,0.08242561,0.008382579,0.272865],"study_design_scores_gemma":[0.00002462673,0.00003086675,0.00003388366,0.000008843685,0.000004042937,0.00003154147,0.000006195284,0.9918349,0.001134736,0.004478266,0.002403704,0.000008433128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00108349,0.00003518102,0.9977938,0.00005269332,0.00001987411,0.00004292013,0.00001268207,0.0001759143,0.0007833826],"genre_scores_gemma":[0.03528968,0.00008995488,0.9620042,0.00007876405,0.00002383803,0.0002613009,0.00009831104,0.0001291191,0.002024701],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005621924,"threshold_uncertainty_score":0.01880717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4398183091","doi":"10.1080/10556788.2024.2346641","title":"Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Ordinary differential equation; Parametric statistics; Regular polygon; Applied mathematics; Mathematical optimization; Subderivative; Differential (mechanical device); Convex optimization; Mathematical analysis; Differential equation; Statistics; Geometry","authors":[{"name":"Yingkai Song","is_ca":true},{"name":"Kamil A. Khan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1433439350340126,"gpt":0.4705291716964854,"spread":0.3271852366624728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002444088,0.001648945,0.001316825,0.0008198028,0.0004098143,0.001483573,0.00100174,0.0008738472,0.002756975],"category_scores_gemma":[0.006981581,0.0006585126,0.001074119,0.0004546228,0.00103072,0.001303054,0.001832871,0.002345851,0.000837145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001001314,"about_ca_system_score_gemma":0.001703818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862863,"about_ca_topic_score_gemma":0.003042297,"domain_scores_codex":[0.9993019,0.0002647718,0.00003569854,0.00008749987,0.0002302254,0.00007985628],"domain_scores_gemma":[0.998327,0.0009965785,0.0001330017,0.0001276407,0.0003214118,0.00009430053],"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.0000936853,0.00006125661,0.0005198511,0.0002303763,0.00005011462,0.000127553,0.0001760396,0.8529625,0.009562446,0.05353681,0.002174088,0.08050533],"study_design_scores_gemma":[0.000004828153,0.00001691521,0.00004587264,0.00001083341,0.000002895363,0.00001051264,0.000009226418,0.9928858,0.001348679,0.004970596,0.0006892991,0.000004510926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003443033,0.00004781741,0.9952662,0.00004363115,0.00001671962,0.00003457158,0.00001792754,0.0001750275,0.0009551875],"genre_scores_gemma":[0.1946936,0.0002448134,0.8008974,0.0001129534,0.00004112189,0.000248465,0.000192383,0.0006666189,0.002902679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002862863,"threshold_uncertainty_score":0.01292574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152778795","doi":"10.1080/10556788.2012.732074","title":"A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods","year":2012,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chebyshev filter; Newton's method; Convergence (economics); Newton's method in optimization; Chebyshev iteration; Mathematical optimization; Displacement (psychology); Computer science; Acceleration; Order (exchange); Applied mathematics; Mathematics; Iterative method; Algorithm; Local convergence; Nonlinear system; Mathematical analysis","authors":[{"name":"Bilel Kchouk","is_ca":true},{"name":"Jean‐Pierre Dussault","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07117554534218135,"gpt":0.4212679062819079,"spread":0.3500923609397265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210309,0.001045337,0.000850417,0.001239756,0.0006152575,0.001136977,0.001024307,0.001090982,0.002930856],"category_scores_gemma":[0.002196205,0.0004492923,0.001031409,0.001238834,0.001214538,0.001432007,0.001030603,0.002244059,0.001455492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006653829,"about_ca_system_score_gemma":0.001526502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001609346,"about_ca_topic_score_gemma":0.001726505,"domain_scores_codex":[0.9993625,0.0001950255,0.00003659452,0.00007656511,0.0002929554,0.00003642026],"domain_scores_gemma":[0.9992445,0.000275755,0.0000690242,0.00008577863,0.0002735052,0.00005158352],"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.0001030712,0.00007828111,0.0009213228,0.0004193986,0.00006705432,0.0001060527,0.0001899734,0.1407095,0.01870764,0.6099337,0.007512521,0.2212514],"study_design_scores_gemma":[0.00004295352,0.0001268163,0.0004239725,0.00007844513,0.00002007103,0.0001994674,0.00002525616,0.8081008,0.005351968,0.1288655,0.05669289,0.00007187307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00230992,0.0008337909,0.9931,0.0001063366,0.0001257392,0.00004031611,0.00004055744,0.0001077233,0.003335499],"genre_scores_gemma":[0.05572735,0.002124001,0.931721,0.0001860133,0.0002010689,0.0003118549,0.0001837222,0.0002622443,0.009282787],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002930856,"threshold_uncertainty_score":0.009804666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055184420","doi":"10.1080/10556788.2012.693928","title":"Sparse interpolatory reduced-order models for simulation of light-induced molecular transformations","year":2012,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; McMaster University; National Science Foundation","keywords":"Robustness (evolution); Interpolation (computer graphics); Algorithm; Computer science; Relaxation (psychology); Excitation; Biological system; Mathematical optimization; Applied mathematics; Mathematics; Chemistry; Artificial intelligence; Physics","authors":[{"name":"David Mokrauer","is_ca":false},{"name":"C. T. Kelley","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04470793301297124,"gpt":0.3512505846530016,"spread":0.3065426516400304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949996,0.0003814133,0.0006990823,0.0003512701,0.0004748531,0.0005192477,0.001209164,0.0009597985,0.002235851],"category_scores_gemma":[0.002405422,0.0004116795,0.0005857241,0.0006480124,0.0005296082,0.0008994974,0.0006853428,0.001478281,0.0004482643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007926547,"about_ca_system_score_gemma":0.001267672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007596121,"about_ca_topic_score_gemma":0.007499946,"domain_scores_codex":[0.9997891,0.00006303329,0.00000855675,0.00001908443,0.00009887744,0.00002129037],"domain_scores_gemma":[0.9994277,0.0003190905,0.00004886258,0.0000876486,0.00008051929,0.00003612052],"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.00001289002,0.0000112732,0.00008646782,0.00001347222,0.000005305603,0.00001084616,0.00001851807,0.9860004,0.0006964314,0.01040335,0.0002576971,0.002483486],"study_design_scores_gemma":[0.000002052347,0.000001851044,0.000007385923,7.791376e-7,5.070974e-7,0.000001067899,0.000001011902,0.9980304,0.0001766959,0.001596271,0.0001807661,0.00000130179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02254063,0.00009345928,0.9727327,0.0002104345,0.00003617793,0.00003788071,0.000196375,0.0005553682,0.00359704],"genre_scores_gemma":[0.6147447,0.0003421756,0.3769674,0.0001669493,0.00004554187,0.0005059841,0.0006314736,0.0004708628,0.006124864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007596121,"threshold_uncertainty_score":0.01510382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2760492644","doi":"10.1080/10556788.2019.1692344","title":"mts: a light framework for parallelizing tree search codes","year":2019,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science","keywords":"Computer science; Backtracking; Enumeration; Satisfiability; Debugging; Search tree; Parallel computing; Vertex (graph theory); Theoretical computer science; Branch and bound; Search algorithm; Algorithm; Graph; Programming language; Discrete mathematics; Mathematics","authors":[{"name":"David Avis","is_ca":true},{"name":"Charles Jordan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0714005721263264,"gpt":0.401624404560027,"spread":0.3302238324337006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699613,0.001275095,0.001077415,0.001575838,0.001216798,0.002107078,0.003189933,0.001096333,0.01045074],"category_scores_gemma":[0.006123513,0.001008338,0.002078663,0.001968342,0.00248573,0.003269209,0.003059889,0.002937691,0.003594257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781782,"about_ca_system_score_gemma":0.002390055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00464805,"about_ca_topic_score_gemma":0.005282457,"domain_scores_codex":[0.9978325,0.0004988163,0.0002046193,0.0002690596,0.0009171923,0.0002778765],"domain_scores_gemma":[0.9975201,0.0007769004,0.0001960315,0.0008340459,0.0005140143,0.0001586704],"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.0006002251,0.0001775945,0.00133714,0.0006304067,0.0001002143,0.0004084515,0.0006365929,0.1767352,0.02420131,0.4796861,0.02503062,0.2904561],"study_design_scores_gemma":[0.0002135733,0.0001451901,0.0002664249,0.0001125413,0.00005733323,0.0002191002,0.00008906176,0.6332071,0.02504846,0.2494055,0.09116028,0.00007547394],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.002259948,0.00008129245,0.9887335,0.00009955268,0.00004366406,0.0000861366,0.0001139714,0.006415589,0.002166359],"genre_scores_gemma":[0.06005082,0.0002352476,0.9307174,0.0001748933,0.00008642835,0.0006443101,0.0005103126,0.003687494,0.003893217],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.01045074,"threshold_uncertainty_score":0.03496122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414845944","doi":"10.1080/10556788.2025.2545846","title":"Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation","keywords":"Saddle point; Separation (statistics); Point (geometry); Composite number; Computational complexity theory; Separation method","authors":[{"name":"Ekaterina Borodich","is_ca":false},{"name":"G. V. Kormakov","is_ca":true},{"name":"Dmitry Kovalev","is_ca":false},{"name":"Aleksandr Beznosikov","is_ca":false},{"name":"Alexander Gasnikov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02667676483093195,"gpt":0.3373874385405367,"spread":0.3107106737096047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935616,0.001676726,0.001959647,0.0008452028,0.0007400055,0.001632067,0.002143725,0.002070666,0.005897017],"category_scores_gemma":[0.006905578,0.0008927669,0.001204327,0.0007118661,0.001123773,0.002345348,0.002988028,0.003298382,0.002266611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009175281,"about_ca_system_score_gemma":0.002658747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00232248,"about_ca_topic_score_gemma":0.003015501,"domain_scores_codex":[0.99882,0.0003416545,0.00009199436,0.000237151,0.0003516714,0.0001574185],"domain_scores_gemma":[0.9972482,0.001724923,0.0001734256,0.0003430551,0.0003569907,0.000153296],"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.0006290072,0.0002727844,0.001419681,0.0003824104,0.0001177352,0.0002421609,0.0002233484,0.7386155,0.005490141,0.05988596,0.009193918,0.1835273],"study_design_scores_gemma":[0.00004990726,0.00003729805,0.00004507141,0.00001000805,0.000006034452,0.00002485353,0.00001265933,0.9864785,0.0005234035,0.01197106,0.0008346057,0.000006566936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005314281,0.0001968511,0.9919049,0.0002194356,0.00005372646,0.00006333622,0.00002707571,0.0006853698,0.001535144],"genre_scores_gemma":[0.1420737,0.0001952666,0.8533456,0.0003087541,0.0001267561,0.000340499,0.0002815193,0.0004557376,0.002872257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005897017,"threshold_uncertainty_score":0.01972747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020649264","doi":"10.1080/10556788.2020.1751154","title":"Exponential augmented Lagrangian methods for equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lagrangian; Applied mathematics; Augmented Lagrangian method; Exponential function; Mathematics; Mathematical optimization; Mathematical economics; Computer science; Mathematical analysis","authors":[{"name":"Elvis Manuel Rodriguez Torrealba","is_ca":false},{"name":"Luiz Carlos Matioli","is_ca":false},{"name":"Mostafa Nasri","is_ca":true},{"name":"R. A. Castillo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04822957342811716,"gpt":0.3630258536378706,"spread":0.3147962802097534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159083,0.001097515,0.0008315222,0.0008369878,0.0004495684,0.001228484,0.00143813,0.001043524,0.008436607],"category_scores_gemma":[0.002554865,0.0003967499,0.0008337453,0.0006812721,0.001047348,0.001771705,0.002151066,0.001891517,0.001894577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004997287,"about_ca_system_score_gemma":0.001121307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002318594,"about_ca_topic_score_gemma":0.002969152,"domain_scores_codex":[0.9994612,0.0001875279,0.00002971089,0.00005945933,0.0002117318,0.0000503399],"domain_scores_gemma":[0.9992552,0.0003333001,0.0000717165,0.00006945567,0.0002187671,0.00005147581],"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.00005169672,0.00007718275,0.0003705843,0.0003282343,0.00004804558,0.0001088787,0.0001351518,0.547004,0.003051294,0.3407042,0.00581587,0.1023049],"study_design_scores_gemma":[0.00001119811,0.00002295663,0.00004575314,0.00002492456,0.000005147635,0.00002904942,0.00001694446,0.9467046,0.0005319373,0.04281235,0.009784435,0.00001068387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009725522,0.000250567,0.9950914,0.00007964018,0.00004787554,0.00001709112,0.00003212149,0.00009158288,0.003417079],"genre_scores_gemma":[0.1954614,0.002040175,0.7717804,0.0002867762,0.0002208533,0.0004816752,0.0004866766,0.0004391057,0.028803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008436607,"threshold_uncertainty_score":0.02822334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390339149","doi":"10.1080/10556788.2023.2285492","title":"An ADMM based method for underdetermined box-constrained integer least squares problems","year":2023,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Underdetermined system; Solver; Integer (computer science); Mathematical optimization; Computer science; Least-squares function approximation; Integer programming; Algorithm; Tree (set theory); Mathematics; Statistics","authors":[{"name":"Xiao-Wen Chang","is_ca":true},{"name":"Tianchi Ma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03514432945428824,"gpt":0.3567484805105208,"spread":0.3216041510562325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138323,0.001142887,0.0009628453,0.0006033398,0.0004764466,0.000904068,0.001088511,0.001151668,0.004958868],"category_scores_gemma":[0.003515834,0.0005291979,0.0008637955,0.0009634478,0.0006724098,0.001224752,0.001224819,0.002470639,0.001572666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003709309,"about_ca_system_score_gemma":0.001548283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001822991,"about_ca_topic_score_gemma":0.002411942,"domain_scores_codex":[0.9992152,0.0003184895,0.00003659216,0.000128464,0.0002505992,0.00005057608],"domain_scores_gemma":[0.9987922,0.0006792854,0.0001226559,0.000113321,0.0002383832,0.00005416136],"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.0001079253,0.00008088795,0.0005256599,0.0003269969,0.00008628051,0.0001297778,0.0001235572,0.6892266,0.007692087,0.04830401,0.01110402,0.2422922],"study_design_scores_gemma":[0.00001102277,0.00002067298,0.00003283662,0.000011524,0.000004776792,0.00003359164,0.000007326757,0.9919228,0.0008375164,0.004320515,0.002790683,0.000006654916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005527436,0.00006439741,0.9985526,0.00004582488,0.00002470377,0.00001498377,0.00002575305,0.0001240806,0.0005949934],"genre_scores_gemma":[0.02764434,0.0002036691,0.9695632,0.0001477704,0.0000625646,0.0001665047,0.0002183528,0.0001221402,0.00187147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004958868,"threshold_uncertainty_score":0.01658905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413812281","doi":"10.1080/10556788.2025.2531478","title":"A general framework for floating point error analysis of first-order simplex derivatives","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simplex; Order (exchange); Point (geometry); Mathematical optimization; Simplex algorithm; Algorithm; Applied mathematics; Combinatorics; Linear programming; Geometry; Economics","authors":[{"name":"Yiwen Chen","is_ca":true},{"name":"Warren Hare","is_ca":true},{"name":"Amy Wiebe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03531028136834746,"gpt":0.398907407318868,"spread":0.3635971259505206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006010631,0.001548094,0.001358322,0.002285979,0.000921359,0.002522537,0.002845903,0.00170536,0.002968882],"category_scores_gemma":[0.02104017,0.0006077749,0.001954536,0.001854336,0.002746014,0.003972705,0.0031062,0.004629659,0.001164029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733105,"about_ca_system_score_gemma":0.001723624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004849881,"about_ca_topic_score_gemma":0.002540851,"domain_scores_codex":[0.9968432,0.0009661545,0.0002150708,0.0003567926,0.001456148,0.0001625559],"domain_scores_gemma":[0.9943014,0.002887386,0.0003701272,0.0007860243,0.001514245,0.0001407178],"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.00003934113,0.00002309918,0.0004423169,0.0002362414,0.00004912101,0.0001314786,0.000217104,0.2920468,0.004058074,0.6581141,0.002593437,0.04204884],"study_design_scores_gemma":[0.000005866594,0.00002675208,0.00013604,0.00005683607,0.00001446065,0.00007691915,0.00002342637,0.8373291,0.001623376,0.153586,0.007097697,0.00002363584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006797652,0.0003082047,0.9977025,0.0001100709,0.00003822752,0.00001574977,0.00002231025,0.00008458528,0.001038607],"genre_scores_gemma":[0.1347783,0.002442614,0.8553814,0.0004016483,0.0003598004,0.0002931683,0.0002124427,0.0007771025,0.005353653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006010631,"threshold_uncertainty_score":0.03178769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391532996","doi":"10.1080/10556788.2023.2296443","title":"Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Tensor (intrinsic definition); Dual (grammatical number); Norm (philosophy); Regular polygon; Convex function; Mathematical optimization; Applied mathematics; Pure mathematics; Geometry; Political science","authors":[{"name":"Pavel Dvurechensky","is_ca":false},{"name":"Petr Ostroukhov","is_ca":false},{"name":"Alexander Gasnikov","is_ca":true},{"name":"César A. Uribe","is_ca":false},{"name":"Anastasiya Ivanova","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04580557575233771,"gpt":0.371523458295035,"spread":0.3257178825426972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436288,0.002282357,0.001508433,0.001284936,0.0005805179,0.001850094,0.002029341,0.002218964,0.004355402],"category_scores_gemma":[0.007200537,0.0008724141,0.001609006,0.001081892,0.0020454,0.003316931,0.002828822,0.004413743,0.001872742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001417283,"about_ca_system_score_gemma":0.001648502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002244102,"about_ca_topic_score_gemma":0.002056128,"domain_scores_codex":[0.9984464,0.0006435694,0.00007321192,0.0001896808,0.0005203922,0.0001267858],"domain_scores_gemma":[0.9981514,0.0007052183,0.0002010438,0.0003445657,0.000447577,0.0001501406],"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.0002068203,0.0001043731,0.0004445597,0.0004321139,0.00009477411,0.00016241,0.0002261401,0.5143167,0.009858511,0.3779466,0.00662891,0.08957809],"study_design_scores_gemma":[0.00001272582,0.00003150728,0.00004259977,0.00001945708,0.000007650008,0.00004251981,0.00001077993,0.9656092,0.001223017,0.02985891,0.003127766,0.00001380212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001617616,0.0003711576,0.9959202,0.0002097591,0.00008049138,0.00002486585,0.00002703454,0.0001435381,0.001605238],"genre_scores_gemma":[0.08279616,0.001044448,0.908316,0.0002555338,0.0003155156,0.0002688406,0.0002086282,0.000508289,0.006286559],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004355402,"threshold_uncertainty_score":0.0145703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413826392","doi":"10.1080/10556788.2025.2541095","title":"Blackbox optimization for origami-inspired bistable structures","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; McGill University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bistability; Mathematics; Mathematical optimization","authors":[{"name":"Luca Boisneault","is_ca":true},{"name":"Charles Audet","is_ca":true},{"name":"David Melancon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01279029606954109,"gpt":0.3155962837775207,"spread":0.3028059877079796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300678,0.0006971881,0.0007478003,0.0004723158,0.0002996549,0.0007080103,0.0006962224,0.001037291,0.003161425],"category_scores_gemma":[0.001649468,0.0004232744,0.0005281423,0.000318848,0.0006030124,0.0004944635,0.0009001206,0.0006942737,0.0004109543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006491854,"about_ca_system_score_gemma":0.0007563438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288773,"about_ca_topic_score_gemma":0.001433408,"domain_scores_codex":[0.9998552,0.00004988309,0.000005701032,0.00002400126,0.00004600014,0.00001926333],"domain_scores_gemma":[0.9994205,0.0004218481,0.00004862339,0.00003222775,0.0000470832,0.00002975016],"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.00004558102,0.00003106972,0.0003038084,0.00006938051,0.00002283902,0.00006341099,0.00002956702,0.9739647,0.003567224,0.0110623,0.0003999539,0.01044016],"study_design_scores_gemma":[0.00000648394,0.00001106466,0.0000299913,0.000004474023,0.000001734432,0.000003749683,0.000003497336,0.9969587,0.0004722087,0.002249272,0.0002570767,0.000001850409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0753535,0.000741885,0.9113772,0.000335979,0.00006098166,0.00008680138,0.0001557091,0.0005092248,0.01137872],"genre_scores_gemma":[0.7058824,0.0003847358,0.2862334,0.0002814936,0.00002418152,0.0005618268,0.0003738467,0.000383054,0.005875198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003161425,"threshold_uncertainty_score":0.01057601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021430041","doi":"10.1080/10556788.2020.1864370","title":"Sparktope: linear programs from algorithms","year":2021,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; McGill University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Algorithm; Polynomial; Matching (statistics); Bipartite graph; Extension (predicate logic); TRACE (psycholinguistics); Time complexity; Linear programming; Exponential function; Graph; Programming language; Theoretical computer science; Mathematics","authors":[{"name":"David Avis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06472395234384083,"gpt":0.3537934815381213,"spread":0.2890695291942805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033193,0.002005662,0.001301911,0.001585357,0.0007180879,0.00252319,0.002494889,0.001144426,0.02131932],"category_scores_gemma":[0.007973906,0.001395518,0.00241576,0.002151778,0.001675958,0.003354381,0.003174328,0.004503794,0.008823865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001257378,"about_ca_system_score_gemma":0.002069889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685898,"about_ca_topic_score_gemma":0.001871708,"domain_scores_codex":[0.9973623,0.0006589807,0.0001876074,0.0004876302,0.001120404,0.0001830594],"domain_scores_gemma":[0.9969638,0.002080773,0.0001203296,0.0004468307,0.0003026942,0.00008564394],"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.0002182007,0.0001527988,0.0002872613,0.00162904,0.0001115582,0.0002827684,0.0004032842,0.0919589,0.004122002,0.463217,0.09184224,0.3457749],"study_design_scores_gemma":[0.0002175984,0.00008392182,0.0001515177,0.0002467533,0.00002973754,0.0002835566,0.00006259738,0.2730178,0.006598782,0.4812098,0.2380444,0.00005358702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001025088,0.0005772457,0.9772524,0.0004803074,0.000122255,0.0001465789,0.00060277,0.009899721,0.009893642],"genre_scores_gemma":[0.025812,0.001113389,0.9560429,0.0005637796,0.0001856512,0.001068068,0.002741532,0.005127076,0.007345626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02131932,"threshold_uncertainty_score":0.07132024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367182219","doi":"10.1080/10556788.2023.2189716","title":"Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems","year":2023,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"National Natural Science Foundation of China","keywords":"Conjugate gradient method; Orthogonalization; Conjugate; Derivation of the conjugate gradient method; Mathematics; Conjugate residual method; Linear system; Nonlinear conjugate gradient method; Krylov subspace; Positive-definite matrix; Mathematical analysis; Applied mathematics; Algorithm; Computer science; Gradient descent; Physics","authors":[{"name":"Na Huang","is_ca":false},{"name":"Yu‐Hong Dai","is_ca":false},{"name":"Dominique Orban","is_ca":true},{"name":"Michael A. Saunders","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04614607138990487,"gpt":0.3429616212406486,"spread":0.2968155498507437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002711476,0.001007413,0.0007532854,0.0009704022,0.0005448179,0.001150719,0.0008646709,0.00100884,0.004267701],"category_scores_gemma":[0.007434211,0.0005304787,0.00094207,0.0007769127,0.002239388,0.001747786,0.00156121,0.002048871,0.001118451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003717464,"about_ca_system_score_gemma":0.001025815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000954287,"about_ca_topic_score_gemma":0.0008679508,"domain_scores_codex":[0.9990343,0.0003954242,0.00005164399,0.00008004118,0.0003914739,0.00004708597],"domain_scores_gemma":[0.9963575,0.002148762,0.0002747716,0.0002886769,0.0007887426,0.00014148],"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.000290028,0.0001435357,0.002031734,0.0006678007,0.0001411934,0.0002381952,0.0006458282,0.3503745,0.02593035,0.4611349,0.004782991,0.1536189],"study_design_scores_gemma":[0.00001795618,0.00007740449,0.0001690782,0.00002177856,0.000009578916,0.00006653183,0.00002126972,0.9564025,0.003220371,0.03740593,0.002570165,0.00001746685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005957441,0.0003198719,0.9906659,0.0001584274,0.00004528298,0.00004637545,0.00002188813,0.0001189857,0.00266588],"genre_scores_gemma":[0.3455492,0.00171585,0.6430926,0.0003471807,0.0002048532,0.0006588583,0.0002110687,0.000601422,0.007618966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004267701,"threshold_uncertainty_score":0.0143398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}