{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006279285,0.0003159185,0.0003199889,0.000100007,0.0004972761,0.0001498598,0.0001758972,0.0002227802,0.0000699523],"category_scores_gemma":[0.0008533333,0.0003419558,0.0001263242,0.0002912564,0.00005378114,0.0004097713,0.00003585389,0.000216195,0.00000787039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001620866,"about_ca_system_score_gemma":0.00004490839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001803557,"about_ca_topic_score_gemma":0.000002275378,"domain_scores_codex":[0.9982231,0.0001032991,0.0004369816,0.0004075945,0.0001656283,0.0006634078],"domain_scores_gemma":[0.9989021,0.000235562,0.0001032796,0.0003839259,0.000244301,0.0001307987],"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.00001887459,0.0000888763,0.00001790181,0.00008558109,0.0000220213,5.281802e-7,0.0002125919,0.972196,0.0000916922,0.0001644922,0.0005361253,0.02656536],"study_design_scores_gemma":[0.0006398862,0.0001352985,0.00007561198,0.00002949684,0.00005526558,0.000003835806,0.0000355847,0.9868034,0.0007794669,0.001075319,0.009939649,0.0004272426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008996957,0.0003035402,0.9962637,0.00009224273,0.0003932875,0.0007749408,0.0002473888,0.001549006,0.0002859062],"genre_scores_gemma":[0.009804926,0.00004337253,0.9887816,0.0001111679,0.00008246363,0.0001117901,0.0007494231,0.00005076377,0.0002644687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02613812,"threshold_uncertainty_score":0.9999033,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097956,0.0001995037,0.000199196,0.0001219321,0.0006616403,0.0003438346,0.0002302626,0.0001183575,0.000323149],"category_scores_gemma":[0.001213564,0.000200267,0.0000417684,0.0001374923,0.000110864,0.0006898617,0.00004620764,0.0001193274,0.000008847194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007417895,"about_ca_system_score_gemma":0.00005961075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002602929,"about_ca_topic_score_gemma":0.000002182349,"domain_scores_codex":[0.9987075,0.0002637797,0.000336312,0.0002874741,0.000244972,0.0001599078],"domain_scores_gemma":[0.9985051,0.0002245543,0.0001893435,0.0004080712,0.0005830002,0.00008992299],"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.000007211429,0.00001188629,0.0001293785,0.00002951794,0.0000295108,1.019547e-7,0.0001812472,0.8273765,0.0001339745,0.006399236,0.0001363079,0.1655651],"study_design_scores_gemma":[0.0005700568,0.0000123062,0.001116852,0.00002498229,0.00005623165,0.000003660167,0.00006225093,0.9815185,0.0006640231,0.01335797,0.002374589,0.00023859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001358144,0.0006481282,0.9948254,0.0001294406,0.0001465745,0.0006390884,0.00001829597,0.0004118852,0.003045387],"genre_scores_gemma":[0.006844117,0.0005523664,0.9914325,0.00013765,0.00009535395,0.0003935317,0.0003140908,0.00005060618,0.0001797585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1653265,"threshold_uncertainty_score":0.8166651,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004482295,0.0002454352,0.0002331613,0.0003519567,0.0001204542,0.0001411969,0.0001281332,0.0001466619,0.00004787911],"category_scores_gemma":[0.0001148043,0.0002666796,0.00006558938,0.000434002,0.00001499877,0.0004715679,0.00001537728,0.0001336585,0.000002285923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001391234,"about_ca_system_score_gemma":0.00001258738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002526244,"about_ca_topic_score_gemma":0.000002179938,"domain_scores_codex":[0.9986901,0.000090366,0.0004187714,0.0003295672,0.0001510458,0.0003201971],"domain_scores_gemma":[0.9995099,0.00004605194,0.0000869584,0.000203754,0.00008978901,0.00006350125],"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.00002270137,0.00003296234,0.0000338672,0.00002328983,0.00001490392,6.250663e-7,0.0009374671,0.9747776,0.000490661,0.00004230896,0.0003747037,0.02324894],"study_design_scores_gemma":[0.0006874116,0.0001050271,0.0001143454,0.00005841046,0.00003201383,0.000002736245,0.00007607125,0.9975478,0.0005002491,0.00009623706,0.0004852107,0.0002944734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004139343,0.0002457751,0.9934961,0.00007504794,0.0003664031,0.000880294,0.000005372712,0.0005080194,0.0002836521],"genre_scores_gemma":[0.03772178,0.00002034559,0.9612364,0.00003038666,0.0001612796,0.00010965,0.000444254,0.00005704753,0.0002188718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03358243,"threshold_uncertainty_score":0.9999785,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005777348,0.0004324448,0.0006002192,0.0009938475,0.0005500369,0.0005183629,0.0005299623,0.00033454,0.002588355],"category_scores_gemma":[0.007013357,0.0003592756,0.0003049128,0.003311968,0.00007387428,0.0006159252,0.00003932953,0.0003663658,0.0001193171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001837339,"about_ca_system_score_gemma":0.0003084163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002502524,"about_ca_topic_score_gemma":0.000005174709,"domain_scores_codex":[0.9939399,0.00156858,0.00127151,0.001090186,0.001602667,0.0005271522],"domain_scores_gemma":[0.9957004,0.001134661,0.0007768781,0.0008892422,0.001187985,0.0003108146],"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.0001010292,0.0001003217,0.001121036,0.000001596108,0.000007039869,0.0000039249,0.000092615,0.8478164,0.0000224309,0.0001676868,0.009294136,0.1412718],"study_design_scores_gemma":[0.0006592015,0.0003472464,0.001824288,0.00002438279,0.00003705552,0.00001259818,0.00007878304,0.9820532,0.0003917558,0.003178595,0.01096846,0.000424487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004812476,0.00005412141,0.9932135,0.000879578,0.0005629333,0.0004957172,0.00002989219,0.0004524531,0.00383061],"genre_scores_gemma":[0.01117112,0.0001309273,0.9835339,0.002294883,0.0002257857,0.00002855269,0.0002291771,0.00004475894,0.002340874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1408473,"threshold_uncertainty_score":0.9998859,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000980817,0.0002528442,0.0003129496,0.0001691653,0.0001216561,0.0001482379,0.0001956143,0.0001940723,0.00001058504],"category_scores_gemma":[0.0002644707,0.0002654906,0.00009213643,0.000379877,0.00004774842,0.0002343707,0.00002518462,0.0001450924,2.484282e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133415,"about_ca_system_score_gemma":0.00005858307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008423132,"about_ca_topic_score_gemma":2.881496e-7,"domain_scores_codex":[0.9985307,0.0002491287,0.0003539313,0.000358823,0.0002074613,0.0002999304],"domain_scores_gemma":[0.9987561,0.0001086492,0.00009621532,0.0003788681,0.0004894407,0.0001707668],"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.00002167332,0.00004771943,0.00009647052,0.00003769207,0.00003055766,6.755374e-7,0.0003761653,0.9806594,0.0001036278,0.00008577888,0.0001423163,0.01839792],"study_design_scores_gemma":[0.0004838249,0.00005963191,0.000008605908,0.00003212327,0.00005087345,0.00001138587,0.0001804201,0.9963667,0.002140719,0.0002069065,0.0001425431,0.0003162422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001553539,0.0001514613,0.9958096,0.00001153761,0.0001659866,0.0007844079,0.00002249198,0.002059645,0.0008395395],"genre_scores_gemma":[0.03068599,0.0000097043,0.9686418,0.00004013366,0.0001062917,0.000150655,0.0002611887,0.00009067967,0.00001354505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03053063,"threshold_uncertainty_score":0.9999797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002226645,0.0002357824,0.0002457402,0.00008632646,0.000331952,0.0002179279,0.0003157358,0.0001993249,0.00003595254],"category_scores_gemma":[0.0004016778,0.0002612557,0.0000743077,0.0001278254,0.00005968378,0.000409079,0.00008485427,0.0001820021,0.000008792294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006466404,"about_ca_system_score_gemma":0.00003770443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001456858,"about_ca_topic_score_gemma":0.000002208409,"domain_scores_codex":[0.9989417,0.0001170683,0.0002425928,0.0002840828,0.0001718684,0.0002426587],"domain_scores_gemma":[0.9987485,0.00009297591,0.0001567337,0.0007215695,0.0001576539,0.0001225048],"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.00001452303,0.0000154659,0.00008866432,0.000009392312,0.00005239295,0.000003549051,0.0001292249,0.7246254,0.02111776,0.0003365362,0.02021768,0.2333894],"study_design_scores_gemma":[0.0002783459,0.00003230129,0.00009888022,0.00008814092,0.00005030686,0.000005982625,0.00001292976,0.6613482,0.3304077,0.004488491,0.002813945,0.0003748523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003144442,0.0003516766,0.9960309,0.00006209393,0.0003356735,0.0002252702,0.00001271033,0.001367311,0.001299914],"genre_scores_gemma":[0.01038312,0.0003761269,0.9886206,0.00008548171,0.0001289269,0.00001613795,0.0000814622,0.00008944453,0.0002186448],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3092899,"threshold_uncertainty_score":0.999984,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002659902,0.0002056351,0.0001960386,0.0001410408,0.00008316756,0.0001880884,0.00008858065,0.0001045584,0.0002064179],"category_scores_gemma":[0.00006383169,0.0001797294,0.00006086499,0.0005821345,0.00004202515,0.0002077679,0.00001083712,0.0001553167,0.00001153583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001207255,"about_ca_system_score_gemma":0.00003394401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004835241,"about_ca_topic_score_gemma":0.000003519515,"domain_scores_codex":[0.998896,0.0001201875,0.0002617509,0.0002617034,0.0001888313,0.0002715331],"domain_scores_gemma":[0.9993973,0.0001779209,0.0000227775,0.0001955531,0.00009546132,0.0001109331],"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.000008291304,0.000009587888,0.00007354576,0.0001190708,0.00004412156,0.0000149906,0.0002085177,0.9038365,0.00005120305,0.0005678511,0.0002356046,0.09483068],"study_design_scores_gemma":[0.0002375562,0.00003085665,0.00003733993,0.0001356896,0.00006239975,0.00001591671,0.00005935656,0.992247,0.001586003,0.0001214799,0.005219753,0.0002466919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002231413,0.001394959,0.996113,0.00004828533,0.0005367023,0.0001988076,0.00000814625,0.001258786,0.0002181725],"genre_scores_gemma":[0.01939241,0.0003329946,0.979849,0.00005500984,0.00005168776,0.00001814235,0.0001152533,0.0001050207,0.00008046069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09458399,"threshold_uncertainty_score":0.7329153,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002533545,0.0002430784,0.0002801167,0.0002510989,0.0005185401,0.0001949946,0.0003054194,0.000167063,0.0001973036],"category_scores_gemma":[0.009757185,0.0001973621,0.00008683981,0.001808754,0.0001134912,0.0003936291,0.000119039,0.0003934339,0.0000133814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002295448,"about_ca_system_score_gemma":0.0000789213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002333924,"about_ca_topic_score_gemma":0.0000473204,"domain_scores_codex":[0.9969694,0.0009593792,0.000624803,0.0004329015,0.0004621311,0.0005514107],"domain_scores_gemma":[0.9955047,0.003186987,0.0002523793,0.000531977,0.0004037396,0.0001201546],"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.00005600652,0.0001032976,0.001642093,0.00003088016,0.00001977728,0.000009898356,0.0002954819,0.5525414,0.00001728995,0.001841629,0.0003723993,0.4430699],"study_design_scores_gemma":[0.001517604,0.0001019481,0.0004369312,0.0001563388,0.00004207587,0.000068585,0.0006821993,0.8269869,0.0003858767,0.0351138,0.1337838,0.0007239009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007958763,0.0003080866,0.9964914,0.0007756292,0.0002719641,0.0007169906,0.000002569032,0.0004303605,0.0009233649],"genre_scores_gemma":[0.00004357234,0.001216453,0.993541,0.00005827316,0.0000930574,0.0002472664,0.00002967488,0.00008485532,0.004685863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.442346,"threshold_uncertainty_score":0.998584,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001682163,0.0005081104,0.0007300391,0.0009247267,0.0004592127,0.0002552343,0.0005644381,0.0003625104,0.002466094],"category_scores_gemma":[0.01474533,0.0005120591,0.000193348,0.00366064,0.0001334296,0.0008403445,0.0001026736,0.0004829693,0.000048704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002765805,"about_ca_system_score_gemma":0.0002013907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003609633,"about_ca_topic_score_gemma":5.701334e-7,"domain_scores_codex":[0.9954437,0.00106673,0.001053734,0.0008275134,0.0008770941,0.0007312485],"domain_scores_gemma":[0.9952214,0.001795385,0.0005388715,0.0009848033,0.001101503,0.0003580179],"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.00003393718,0.0002103727,0.00006553362,0.00004498368,0.00003152575,0.000006577193,0.0001576925,0.950918,0.00001618726,0.002610016,0.0008369786,0.04506821],"study_design_scores_gemma":[0.001017746,0.000173448,0.00004253106,0.00005269652,0.00007341918,0.00001829011,0.0001035913,0.9768386,0.000446534,0.0200475,0.0005929729,0.0005926182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002854737,0.0002779533,0.9950861,0.0005792566,0.0002882247,0.001067759,0.00001695115,0.001061662,0.001593512],"genre_scores_gemma":[0.0003220895,0.000327604,0.9961283,0.0005464302,0.0001352545,0.00008113391,0.0001687466,0.0001269327,0.002163499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04447559,"threshold_uncertainty_score":0.9997331,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003334256,0.0002896701,0.0004450865,0.0003590896,0.000209921,0.00005204214,0.0004579277,0.000258905,0.0002042283],"category_scores_gemma":[0.007005816,0.0002431985,0.0001589485,0.002147951,0.000157295,0.0003145857,0.0002463714,0.0004671688,0.000002139916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002071542,"about_ca_system_score_gemma":0.0001170175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002398944,"about_ca_topic_score_gemma":0.00003058839,"domain_scores_codex":[0.9964453,0.0007253576,0.001091065,0.0004528727,0.0006858975,0.000599502],"domain_scores_gemma":[0.995392,0.002630873,0.0006029648,0.0006652965,0.0005835079,0.0001253451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001124965,0.000888061,0.04337154,0.0004010096,0.0000619855,0.00003763855,0.002897547,0.2904308,0.0006818136,0.005445399,0.0000909386,0.6555808],"study_design_scores_gemma":[0.007975701,0.0004362784,0.009022817,0.002006768,0.0005318376,0.0001498553,0.004438774,0.8573525,0.07819389,0.02915901,0.00766582,0.003066734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002210422,0.0001580931,0.9956643,0.0000697243,0.0001873385,0.001118348,0.00001427337,0.0001986383,0.0003788886],"genre_scores_gemma":[0.001154783,0.00005690417,0.9980004,0.00007980609,0.00004352875,0.0001058386,0.00003354839,0.0001038379,0.0004213025],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.652514,"threshold_uncertainty_score":0.9917349,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002931423,0.0006057702,0.0008412175,0.0005590385,0.0005812924,0.0001974483,0.0005256149,0.0004137915,0.005531531],"category_scores_gemma":[0.01097087,0.0006214057,0.0003233975,0.001298862,0.0001098704,0.0008643472,0.0003340516,0.0004878135,0.00004267502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000376858,"about_ca_system_score_gemma":0.00009119398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002098364,"about_ca_topic_score_gemma":0.000003353567,"domain_scores_codex":[0.9948543,0.001207839,0.00124187,0.001076944,0.0006486574,0.0009703327],"domain_scores_gemma":[0.9941136,0.002483214,0.0006571896,0.0009941986,0.001421861,0.000329927],"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.00007902721,0.0002200969,0.000009373057,0.0001982409,0.00009790347,0.000005136492,0.0005348093,0.9578587,0.00004258921,0.001358374,0.001285441,0.03831035],"study_design_scores_gemma":[0.002045983,0.0001485482,0.000001214955,0.0000804583,0.0001204699,0.00002892282,0.0001748216,0.9863851,0.0004496338,0.005472664,0.004442617,0.0006495508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004101797,0.0002752852,0.9950382,0.0008083044,0.000384866,0.002047033,0.0002271901,0.0009429613,0.0002720844],"genre_scores_gemma":[0.00001117293,0.0004947693,0.994334,0.0004998015,0.0001244152,0.0005564055,0.0005032714,0.0003190659,0.003157084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0376608,"threshold_uncertainty_score":0.9996237,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001522792,0.0001786534,0.0003656546,0.00006474733,0.0001574793,0.00006614114,0.000255573,0.00009337159,0.001038703],"category_scores_gemma":[0.01333997,0.0001268858,0.00009686704,0.0003011167,0.0001507014,0.00008430178,0.00008186537,0.0001644889,0.0000113515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003164338,"about_ca_system_score_gemma":0.00001955147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001915069,"about_ca_topic_score_gemma":2.810699e-7,"domain_scores_codex":[0.99816,0.0005683327,0.0005979578,0.0002130436,0.0002328013,0.0002278426],"domain_scores_gemma":[0.9936662,0.00519249,0.0003947502,0.0004654104,0.0002183144,0.0000627859],"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.00002709384,0.0007156114,0.001745727,0.0009686269,0.000160453,0.000002072109,0.009185581,0.00672223,0.0002719444,0.07304434,0.001239942,0.9059164],"study_design_scores_gemma":[0.001038339,0.0002369203,0.001244337,0.0005857059,0.0006993534,0.0001026207,0.003279691,0.3836352,0.003042089,0.5980958,0.006772167,0.001267827],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006498502,0.00007139386,0.9977897,0.0001625715,0.0004051118,0.0003613441,0.00002084983,0.0001604892,0.000378716],"genre_scores_gemma":[0.001309449,0.00007398741,0.9976541,0.00005761531,0.00007529866,0.00006438161,0.00002387814,0.00004235244,0.0006989613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9046485,"threshold_uncertainty_score":0.9998745,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004300859,0.0002484363,0.0003268048,0.0001370408,0.0001519385,0.00008119379,0.0002758582,0.0001748207,0.0001206165],"category_scores_gemma":[0.0007753563,0.0002656216,0.00009433501,0.0002766034,0.00004977751,0.0001987773,0.00006217173,0.0001209383,0.0000025735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005280679,"about_ca_system_score_gemma":0.00001625436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003966532,"about_ca_topic_score_gemma":6.652116e-7,"domain_scores_codex":[0.9988048,0.0001906076,0.0003174798,0.000282586,0.0001338734,0.0002706196],"domain_scores_gemma":[0.9984784,0.00052765,0.00009594431,0.000503614,0.0003087057,0.000085705],"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.000004893187,0.00001158111,0.00001330465,0.00001763501,0.00002744295,2.566782e-7,0.00006143774,0.8534173,0.0001443688,0.0001333461,0.002954914,0.1432135],"study_design_scores_gemma":[0.0005518179,0.00005187711,0.0000144277,0.00004477379,0.00003947371,0.000003084187,0.00001619174,0.9801378,0.01075483,0.001621127,0.006453482,0.0003111013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001358665,0.000124751,0.9963741,0.00005712953,0.000370396,0.000481239,0.00002849195,0.002031208,0.0005191214],"genre_scores_gemma":[0.0002224273,0.00005830525,0.9988843,0.0002349246,0.0001183631,0.0001301397,0.0001565019,0.0001071157,0.00008793565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1429024,"threshold_uncertainty_score":0.9999796,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001216867,0.0004416592,0.0006473447,0.0003788721,0.0005776031,0.00007131897,0.000499803,0.0003101179,0.00327686],"category_scores_gemma":[0.01066294,0.0004355565,0.0001690688,0.001603566,0.0002205362,0.0005756698,0.0001827094,0.0004994698,0.0000706811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000234389,"about_ca_system_score_gemma":0.0002619933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005864567,"about_ca_topic_score_gemma":5.332043e-7,"domain_scores_codex":[0.9958532,0.00107339,0.0008283785,0.0007562451,0.0008461762,0.0006425904],"domain_scores_gemma":[0.9950588,0.001823912,0.0003639845,0.0009230621,0.001475048,0.0003552173],"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.00019508,0.0007568407,0.001829028,0.0003455489,0.0003544713,0.0001544252,0.002467129,0.701538,0.0001838308,0.001174391,0.031582,0.2594193],"study_design_scores_gemma":[0.001624137,0.0002055038,0.0001392372,0.0001239636,0.00009691691,0.0002101768,0.0001059729,0.9763507,0.001666722,0.007279507,0.01124952,0.0009476262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005073875,0.0003965585,0.9960336,0.00007792659,0.0005370307,0.0009105882,0.00005684949,0.001139291,0.0007973994],"genre_scores_gemma":[0.00001723645,0.0008628267,0.9919701,0.000175196,0.0002704274,0.00009272228,0.0002359302,0.0001833444,0.006192172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2748128,"threshold_uncertainty_score":0.9998096,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008893084,0.0002969971,0.000485332,0.0003515653,0.0006896232,0.0002232144,0.001014672,0.000222992,0.0002358139],"category_scores_gemma":[0.02335863,0.0001968269,0.0001519291,0.002305554,0.0001827858,0.0004294939,0.000151485,0.0003032825,0.00001183265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001312324,"about_ca_system_score_gemma":0.0002008121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003295477,"about_ca_topic_score_gemma":0.000008369197,"domain_scores_codex":[0.9945592,0.002215176,0.001089646,0.0007159464,0.0009532604,0.000466796],"domain_scores_gemma":[0.9897303,0.008017059,0.0003595146,0.001015559,0.0007238888,0.0001536572],"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.00003090048,0.00002978969,0.0005201395,0.000003722791,0.00001044383,0.000008290699,0.0003399069,0.9739764,0.000002922869,0.0002101156,0.0007451137,0.02412223],"study_design_scores_gemma":[0.00041723,0.00002448324,0.0005233664,0.00001701429,0.00001435263,0.00002457218,0.0001451445,0.9960717,0.00003634334,0.0007278969,0.001740454,0.0002574664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008193107,0.0006193863,0.9972782,0.0003905,0.0006661892,0.0004450478,0.000006990039,0.0002172001,0.0002945619],"genre_scores_gemma":[0.0009932366,0.0002655431,0.9961724,0.0001012884,0.00007528697,0.00008857934,0.000007059319,0.00004985821,0.002246789],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02386476,"threshold_uncertainty_score":0.984868,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00131417,0.0005662245,0.000771329,0.0003416247,0.000188491,0.0002145062,0.0004076559,0.0007596329,0.0001065211],"category_scores_gemma":[0.0008537099,0.0006345143,0.0003419416,0.0002368807,0.00004897196,0.0001463719,0.0002184369,0.0004796984,0.000003489459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657584,"about_ca_system_score_gemma":0.00005930028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006916818,"about_ca_topic_score_gemma":7.707638e-7,"domain_scores_codex":[0.9971055,0.0009648149,0.0007189937,0.0006623805,0.0001710913,0.0003771977],"domain_scores_gemma":[0.9970335,0.001131601,0.0003198041,0.0008244444,0.0005638808,0.0001267189],"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.00002178785,0.00001629278,0.000007430539,0.0002299102,0.00008781582,3.563497e-7,0.00008522924,0.8555194,0.0005204073,0.00006038181,0.004025195,0.1394258],"study_design_scores_gemma":[0.0003243251,0.00003439874,0.00001579512,0.0002918908,0.000235675,0.000006124566,0.000007074763,0.9556706,0.02487843,0.007884298,0.01000363,0.0006477725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003195244,0.001063108,0.9925906,0.0000625619,0.001438273,0.001217777,0.00004955072,0.003121834,0.0004243518],"genre_scores_gemma":[0.0003623054,0.0005149355,0.9962417,0.0001746499,0.0003737672,0.0004422501,0.001565383,0.0002330098,0.00009202774],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.138778,"threshold_uncertainty_score":0.9996106,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001215709,0.0004667733,0.0005298492,0.0001487771,0.0003665403,0.0003017331,0.0003655123,0.0002256769,0.00006535485],"category_scores_gemma":[0.001505348,0.000488814,0.000129232,0.0008074144,0.0001499834,0.0005140295,0.00005690551,0.0003729117,0.000003107051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001748725,"about_ca_system_score_gemma":0.0001048576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002760497,"about_ca_topic_score_gemma":0.000002103689,"domain_scores_codex":[0.9973738,0.0003096477,0.000681359,0.0006810733,0.0002843524,0.0006697482],"domain_scores_gemma":[0.997986,0.0008214994,0.0002546147,0.0003351253,0.0002941051,0.0003087053],"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.00003732831,0.00001184586,0.0003075939,0.0003833586,0.00006461933,0.000002622287,0.0008769117,0.8145658,0.0005142229,0.00006773654,0.000007505503,0.1831605],"study_design_scores_gemma":[0.0009590742,0.0001268706,0.00002870076,0.0001415727,0.0001213104,0.00001929875,0.000411862,0.9963295,0.0008795582,0.0000445353,0.0003346601,0.0006030009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002943512,0.0002121103,0.9956567,0.0001363113,0.0002542092,0.00129486,0.0000299675,0.002005277,0.0001161895],"genre_scores_gemma":[0.005610716,0.00006187521,0.9934047,0.0001242073,0.0001167353,0.0002664947,0.0001319662,0.0002398658,0.0000434774],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1825575,"threshold_uncertainty_score":0.9997563,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00250982,0.000434551,0.0005398259,0.0003384595,0.0005286961,0.000180116,0.0005404846,0.000306066,0.0007303428],"category_scores_gemma":[0.003006023,0.0004406175,0.0001901382,0.0008185055,0.00008618709,0.001139055,0.00009202155,0.0003181179,0.00002265819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002979167,"about_ca_system_score_gemma":0.0003085209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001051654,"about_ca_topic_score_gemma":0.00000418136,"domain_scores_codex":[0.9961162,0.0009986964,0.0007043676,0.0008168182,0.0005951596,0.0007687425],"domain_scores_gemma":[0.9954405,0.001430716,0.0003928904,0.0009662298,0.001428964,0.000340662],"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.0001566711,0.0006490239,0.00003293123,0.000112242,0.00007048604,0.000001870161,0.0002739959,0.9537587,0.00002740732,0.007692714,0.0006567577,0.03656723],"study_design_scores_gemma":[0.002082641,0.0002208349,0.000003333939,0.00003386303,0.00009590383,0.000003637615,0.0001077663,0.9675146,0.002721121,0.01212796,0.01457782,0.0005104929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002576441,0.0001028441,0.9957147,0.0005131098,0.0001192473,0.002034446,0.0001744867,0.001221974,0.00009341665],"genre_scores_gemma":[0.00009275493,0.00003476158,0.997288,0.0006039022,0.0002594668,0.000574208,0.0004177498,0.000217736,0.0005114218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03605673,"threshold_uncertainty_score":0.9998046,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001415604,0.0004679926,0.0007809319,0.0005398953,0.000463509,0.00007755374,0.0003272926,0.0002750202,0.0005198866],"category_scores_gemma":[0.003687893,0.0004814629,0.0003372623,0.0009253292,0.0002324463,0.0007074991,0.00004282608,0.0003272812,0.000004070125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002805637,"about_ca_system_score_gemma":0.0006730363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004250589,"about_ca_topic_score_gemma":0.000001479788,"domain_scores_codex":[0.9958552,0.00107287,0.0009161038,0.0007674808,0.0008283692,0.000559947],"domain_scores_gemma":[0.9932221,0.003731583,0.0006192742,0.000764984,0.001377244,0.0002848429],"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.0001338146,0.000672259,0.0007061585,0.0001604084,0.00008109023,0.00001494194,0.0004020517,0.9773657,0.00007525196,0.0002005331,0.0002459076,0.01994186],"study_design_scores_gemma":[0.003731409,0.0006368198,0.00008712736,0.0001547319,0.00008399872,0.000005629958,0.0001170119,0.9858537,0.008077078,0.0006907855,0.00009880348,0.0004629471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002718376,0.0000306775,0.9964653,0.00007750423,0.0002243958,0.001994731,0.0004141072,0.0003860465,0.0001354408],"genre_scores_gemma":[0.0009247708,0.0000128598,0.9965219,0.0002762908,0.00008024527,0.0005330462,0.001174266,0.0001703152,0.0003062749],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01947891,"threshold_uncertainty_score":0.9997637,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001011778,0.0002100018,0.0004729964,0.0008343852,0.0002799593,0.00003982211,0.0002571897,0.0001624356,0.0003118963],"category_scores_gemma":[0.01410209,0.0002131878,0.0002365351,0.002313763,0.0001818862,0.0002856335,0.0001380916,0.0002080797,0.000002576039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001165101,"about_ca_system_score_gemma":0.0002154894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007273466,"about_ca_topic_score_gemma":0.000001210683,"domain_scores_codex":[0.9974609,0.0004439059,0.0009456314,0.0003946682,0.0004053425,0.0003495412],"domain_scores_gemma":[0.9886378,0.009308412,0.0004141952,0.0004121539,0.001123722,0.0001037049],"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.00003008191,0.0003182926,0.00007961413,0.0008367103,0.0001969941,8.227919e-7,0.0006288207,0.9080796,0.0002076647,0.05655523,0.0007463348,0.0323198],"study_design_scores_gemma":[0.0004755427,0.00009940121,0.00002858773,0.0001705481,0.0001588628,0.000003150629,0.0001203819,0.9741687,0.0008169558,0.02359662,0.0001747198,0.0001866045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000166585,0.0004173312,0.9972161,0.00008442465,0.0004183762,0.0009841162,0.0003714152,0.0002728882,0.00006876578],"genre_scores_gemma":[0.01007242,0.00006998765,0.9887226,0.000006644984,0.00005715628,0.00009931327,0.0002789763,0.00007751795,0.0006153434],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.066089,"threshold_uncertainty_score":0.9942026,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003557493,0.0004157764,0.0007416049,0.0003266188,0.0003468497,0.00007775055,0.0001983491,0.0003102167,0.0003742145],"category_scores_gemma":[0.01136838,0.0004134654,0.0001667213,0.001119992,0.000151051,0.0006456324,0.00009353038,0.0002021418,9.400264e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009662998,"about_ca_system_score_gemma":0.0001823157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006048831,"about_ca_topic_score_gemma":0.000004149562,"domain_scores_codex":[0.996125,0.001711092,0.000957955,0.0004760756,0.0002589348,0.0004708715],"domain_scores_gemma":[0.9930121,0.004758814,0.0006221485,0.0004910613,0.0008424345,0.0002734577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001597826,0.0008163994,0.0007414838,0.0005027482,0.0006190724,2.883826e-7,0.005325571,0.2518337,0.008607098,0.02804951,0.003809167,0.6995352],"study_design_scores_gemma":[0.007750436,0.0006158291,0.0003611156,0.0003538766,0.002126215,0.00003459166,0.001212005,0.7869993,0.05658568,0.119376,0.02202765,0.002557351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001454879,0.0009662751,0.9960501,0.000211147,0.000538313,0.001261138,0.0002330769,0.0003081639,0.0002863185],"genre_scores_gemma":[0.00006794634,0.0001179418,0.9973997,0.0001116749,0.0001869421,0.0002128742,0.0004113948,0.0001364737,0.001355087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6969778,"threshold_uncertainty_score":0.9998317,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000353875,0.0001665197,0.0002236868,0.0001051011,0.0001195957,0.00002138221,0.00009571927,0.00008575653,0.0002577619],"category_scores_gemma":[0.00004271008,0.0001659972,0.0001542937,0.000271387,0.00001770286,0.0006477245,0.00001711371,0.0001099715,0.000001850549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002075293,"about_ca_system_score_gemma":0.00004090073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004745876,"about_ca_topic_score_gemma":6.510745e-8,"domain_scores_codex":[0.9988865,0.0001723156,0.0004046571,0.000172439,0.0001211321,0.0002429394],"domain_scores_gemma":[0.9990115,0.0001719915,0.0001991436,0.000217135,0.0002855244,0.000114747],"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.00002181975,0.00008131094,0.0000382166,0.00001718974,0.00003786075,1.074693e-8,0.0006223306,0.9580732,0.00235629,0.004157565,0.00005636798,0.03453786],"study_design_scores_gemma":[0.0003651897,0.0000243655,0.000004764715,0.00002164775,0.00006806023,3.126843e-7,0.0001387042,0.9704713,0.02561286,0.002574898,0.0005408365,0.0001770925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004187705,0.00009100464,0.9938701,0.00007659612,0.0003560755,0.0004947689,0.00002469154,0.00006557672,0.0008334297],"genre_scores_gemma":[0.4710598,0.000002819196,0.5285839,0.00003322919,0.0001045775,0.00005738127,0.0000831358,0.00002336374,0.000051739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4668721,"threshold_uncertainty_score":0.6769171,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002995308,0.000606189,0.0008696755,0.0004352722,0.0003388022,0.0008831605,0.002476663,0.00095633,0.00002613996],"category_scores_gemma":[0.008078913,0.0006074924,0.0003819655,0.0006342307,0.0000617115,0.0003193469,0.002069744,0.001056823,0.00001379239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001883518,"about_ca_system_score_gemma":0.0004910196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000339855,"about_ca_topic_score_gemma":8.953987e-7,"domain_scores_codex":[0.9956126,0.0008915589,0.0007199845,0.001553693,0.0005376637,0.0006844703],"domain_scores_gemma":[0.9903144,0.005696697,0.000513336,0.00243562,0.0008486949,0.0001913066],"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.00002637981,0.0000922617,0.0009452505,0.0006665416,0.0001031594,0.000005601584,0.001300597,0.7556555,0.000006975278,0.007537734,0.009641236,0.2240188],"study_design_scores_gemma":[0.0002233925,0.0001025472,0.0000436391,0.0009603516,0.00005097028,0.000009673669,0.000009206802,0.7527859,0.0005723734,0.2427087,0.001782337,0.0007508867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006544094,0.00117293,0.9787992,0.001056001,0.00140877,0.001398806,0.00003323817,0.01593336,0.0001911907],"genre_scores_gemma":[0.0001489026,0.0001878294,0.9976665,0.0006285423,0.0002687142,0.0005451979,0.0001421818,0.0001200047,0.0002921782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.235171,"threshold_uncertainty_score":0.9996377,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007802424,0.0003418242,0.0004958263,0.0002719198,0.0006037888,0.0005975144,0.000561661,0.000151042,0.000128707],"category_scores_gemma":[0.0001554069,0.0003192572,0.0001549743,0.001312807,0.0001654747,0.0007993724,0.0001630377,0.0001595081,0.000006102866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345199,"about_ca_system_score_gemma":0.0003201025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005807124,"about_ca_topic_score_gemma":0.00001399436,"domain_scores_codex":[0.99748,0.0004371112,0.000576328,0.0007615262,0.0003574652,0.0003875629],"domain_scores_gemma":[0.9975109,0.000441494,0.0004031511,0.0005696308,0.0009257347,0.0001491114],"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.00003248642,0.0001095373,0.0004918662,0.0000407203,0.000168045,6.501029e-7,0.0002400101,0.9707047,0.00001668295,0.01878915,0.0009871909,0.008418981],"study_design_scores_gemma":[0.001532635,0.0001513911,0.0002737537,0.00004920115,0.0001146881,0.000004642807,0.00004946433,0.9936942,0.0002418113,0.0008624662,0.002677372,0.0003483341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000177696,0.00008888775,0.9961523,0.001091772,0.0001975489,0.0009683821,0.00008484699,0.0006740179,0.0007245002],"genre_scores_gemma":[0.0004287802,0.00001211975,0.9959012,0.0004584301,0.00004326015,0.0002000717,0.000632296,0.00004312029,0.002280667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02298956,"threshold_uncertainty_score":0.999926,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001267151,0.0002638126,0.000383753,0.0001786699,0.0002396886,0.0003489545,0.0007930374,0.0001404528,0.0003943435],"category_scores_gemma":[0.00157418,0.0002593888,0.0002719926,0.001569419,0.00003412991,0.0008542847,0.0002531487,0.0001226363,0.00001612245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004659566,"about_ca_system_score_gemma":0.0001173643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006058372,"about_ca_topic_score_gemma":4.070077e-7,"domain_scores_codex":[0.9971769,0.0008832981,0.0005824039,0.0007406526,0.0002694801,0.0003472563],"domain_scores_gemma":[0.9977443,0.0006565867,0.0003138903,0.0004254555,0.0005715029,0.0002882232],"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.00001814402,0.00005507745,0.00004173625,0.00004973355,0.00008586983,4.055838e-7,0.0006511068,0.918205,0.001078221,0.004691908,0.0007473518,0.07437549],"study_design_scores_gemma":[0.0007095484,0.00007950629,0.0000210819,0.000009896809,0.00007363155,0.000001768534,0.00001996751,0.9805081,0.001681397,0.001235399,0.01535356,0.0003060971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000202412,0.0001705048,0.9923205,0.005685453,0.0003533113,0.0005848153,0.00001846814,0.0006737874,0.0001911201],"genre_scores_gemma":[0.00006566908,0.000025819,0.9966614,0.002364989,0.0001544787,0.0001382853,0.0002300486,0.00003850892,0.0003208398],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0740694,"threshold_uncertainty_score":0.9999858,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008066623,0.000290082,0.0003397823,0.0003203457,0.0001487809,0.0001171414,0.0002463218,0.0001955079,0.00009836109],"category_scores_gemma":[0.0004229557,0.0002941785,0.0001341567,0.0006080022,0.00004507672,0.00022399,0.00002815474,0.0001506087,0.000005341772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005232317,"about_ca_system_score_gemma":0.00005100032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007837021,"about_ca_topic_score_gemma":0.000004624756,"domain_scores_codex":[0.9984225,0.0003067867,0.0003628759,0.0003837103,0.0001496039,0.0003745448],"domain_scores_gemma":[0.9983961,0.000703151,0.0000810442,0.0004697233,0.0002286271,0.0001213844],"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.00001523281,0.00001744011,0.00003220286,0.0000693022,0.00002816727,0.000002376239,0.0001268822,0.9148369,0.005447207,0.00007112125,0.001052588,0.07830055],"study_design_scores_gemma":[0.0004001507,0.00009551016,0.00002499185,0.00009477406,0.00004540219,0.000004473323,0.00007565718,0.9651379,0.03045714,0.001570971,0.001744492,0.000348513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001090169,0.00005515866,0.9931631,0.00008802578,0.0002870296,0.0006340793,0.00004898501,0.005447711,0.0001668731],"genre_scores_gemma":[0.006083064,0.00001632407,0.9928643,0.0001510323,0.00008773359,0.000233292,0.0003399353,0.000134034,0.00009032888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07795204,"threshold_uncertainty_score":0.9999511,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196444,0.0002048832,0.0005829681,0.0004408618,0.0002559896,0.0001089764,0.0005922957,0.0001321249,0.00008196735],"category_scores_gemma":[0.006647006,0.0001866419,0.0002827577,0.00495326,0.00006374895,0.0002785792,0.0002482252,0.0001308767,2.836585e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004120396,"about_ca_system_score_gemma":0.00007412476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002275914,"about_ca_topic_score_gemma":0.000001670962,"domain_scores_codex":[0.9978712,0.0005430434,0.0005625377,0.0005416143,0.0001840374,0.0002975763],"domain_scores_gemma":[0.9949033,0.003544923,0.0003251129,0.0005935407,0.0005547314,0.00007842811],"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.000009488794,0.00005757515,0.0009857024,0.00005249131,0.0003902139,3.498028e-7,0.000493608,0.6747333,0.00005664668,0.02572961,0.00004992065,0.297441],"study_design_scores_gemma":[0.0001924359,0.00004210415,0.0005900576,0.00004124698,0.0002180875,2.038167e-7,0.00006539712,0.9586518,0.001170443,0.03777865,0.001060936,0.0001886217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005298055,0.000159477,0.9980407,0.0009035685,0.0002908363,0.0003109029,0.00001834061,0.0001676136,0.00005555049],"genre_scores_gemma":[0.00007576203,0.00001857084,0.999065,0.0005678532,0.00003875234,0.00006200405,0.00002134186,0.00001552594,0.0001351372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2972524,"threshold_uncertainty_score":0.7957568,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001866698,0.0003626838,0.0005333358,0.0002117392,0.0003125479,0.0002608827,0.0001918543,0.0002257173,0.0001005038],"category_scores_gemma":[0.0009898377,0.0002862217,0.0001935187,0.0006990114,0.0002003737,0.0002435072,0.0001029956,0.0003298096,0.000001221047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000658816,"about_ca_system_score_gemma":0.00006844648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001549267,"about_ca_topic_score_gemma":8.583255e-7,"domain_scores_codex":[0.9976907,0.0007370501,0.0005897029,0.0004674473,0.0001380399,0.0003770225],"domain_scores_gemma":[0.9960876,0.002847552,0.0001154416,0.0004430341,0.0004008322,0.0001055645],"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.00004739274,0.00002653679,0.00004319092,0.0001975779,0.0003109206,0.000002645112,0.0009192933,0.6028715,0.01261674,0.0002964906,0.001761171,0.3809066],"study_design_scores_gemma":[0.0002433511,0.0001025519,0.00008541126,0.0001226624,0.0003139259,0.00004123151,0.0002576541,0.9271029,0.04948189,0.0004016055,0.02151621,0.0003306452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009361084,0.00365075,0.9920572,0.0001629488,0.0007658335,0.0007548053,0.00004656991,0.00140373,0.0002220407],"genre_scores_gemma":[0.00119282,0.0002852747,0.9977149,0.00008878136,0.0001095908,0.0001841032,0.00005812643,0.0001299997,0.000236442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3805759,"threshold_uncertainty_score":0.999959,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002714735,0.0002189342,0.0002837866,0.0001397674,0.0001584511,0.00008508522,0.0001464727,0.0001709587,0.0002367303],"category_scores_gemma":[0.0004492177,0.000226542,0.00006765163,0.0003823256,0.00001796608,0.00022651,0.00003347465,0.00007280627,0.000001194731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009271751,"about_ca_system_score_gemma":0.00004481162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001885138,"about_ca_topic_score_gemma":8.065209e-7,"domain_scores_codex":[0.9989808,0.00006306425,0.0003371844,0.0002623336,0.00008424067,0.0002724315],"domain_scores_gemma":[0.9992363,0.0001626421,0.00006831488,0.0002783381,0.0001966698,0.00005772733],"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.00002053343,0.00000753267,0.000003043491,0.0001995805,0.00002924741,2.467918e-7,0.00003878836,0.9743863,0.001512868,0.003503757,0.0006041611,0.01969394],"study_design_scores_gemma":[0.0005526068,0.00002017781,0.000002457497,0.00003897148,0.00005825971,7.796861e-7,0.00003358122,0.9453872,0.032475,0.005945203,0.01524337,0.0002423419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006495909,0.0004020294,0.9960144,0.00002849431,0.001643354,0.0005256538,0.00006478406,0.0008791182,0.0003772334],"genre_scores_gemma":[0.0003235259,0.0002960079,0.9982076,0.0001220746,0.0000799628,0.0001322153,0.0002396106,0.00006938346,0.0005296284],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03096213,"threshold_uncertainty_score":0.9238116,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001153813,0.0006436518,0.0008534903,0.0002394739,0.0003338582,0.00134913,0.002606049,0.0006620169,0.0003591493],"category_scores_gemma":[0.0006768039,0.0006916993,0.0004756084,0.001102594,0.0001373508,0.0005435194,0.004349287,0.001216142,0.00001619333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001121104,"about_ca_system_score_gemma":0.0004511882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002455628,"about_ca_topic_score_gemma":0.00001099303,"domain_scores_codex":[0.9948321,0.001255433,0.0007949201,0.001866139,0.0006899954,0.0005614193],"domain_scores_gemma":[0.9954471,0.0005629772,0.0005163986,0.002449766,0.0007432008,0.0002805842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003303016,0.0001695498,0.0001574316,0.00006641261,0.00012265,0.00004136776,0.0007042774,0.2696024,0.000004122311,0.0002929191,0.0001839492,0.7286516],"study_design_scores_gemma":[0.0002960733,0.00003913993,0.0001111327,0.0003012327,0.00006692334,0.0000114058,0.00005606351,0.9799572,0.0004038063,0.0117802,0.006143112,0.0008337041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003913335,0.002141033,0.9910559,0.0005355574,0.003973543,0.0006137078,0.00006244987,0.001371957,0.0002067069],"genre_scores_gemma":[0.00001906723,0.000512813,0.9965581,0.0003920518,0.0005387972,0.0001812656,0.001455976,0.00007122213,0.0002707131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.727818,"threshold_uncertainty_score":0.9996876,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004907103,0.0002463439,0.0004714418,0.0005860605,0.0003010341,0.0001476056,0.0006495969,0.0001297223,0.000006101759],"category_scores_gemma":[0.002703608,0.0002140597,0.0001779681,0.002194047,0.00007058319,0.0004706755,0.0002796085,0.0001337338,0.000007971228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005061307,"about_ca_system_score_gemma":0.00009642467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002420484,"about_ca_topic_score_gemma":1.855701e-7,"domain_scores_codex":[0.9969994,0.001223938,0.0006067002,0.0005381891,0.0002190659,0.0004126607],"domain_scores_gemma":[0.9966099,0.001769583,0.0003742708,0.0005353213,0.0005936052,0.0001173133],"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.00003142166,0.00005086456,0.00003871225,0.0004115155,0.00008973294,0.000002578613,0.001668563,0.8217518,0.001783971,0.01272422,0.00006455518,0.1613821],"study_design_scores_gemma":[0.0003344243,0.0001125393,0.00001804876,0.0001597676,0.00003492507,0.00000917886,0.0001162405,0.9661632,0.03014738,0.002123326,0.0005154969,0.0002654695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001483542,0.001253679,0.9961274,0.00008745614,0.000999282,0.0007213042,0.00002780696,0.0005627833,0.00007192065],"genre_scores_gemma":[0.0007669631,0.000149055,0.9981841,0.00006745084,0.00008075211,0.0001545996,0.00003343218,0.00003889493,0.0005247729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1611166,"threshold_uncertainty_score":0.8729103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}