{"meta":{"query_hash":"324c8f9817be","filters":{"topic":"Advanced Optimization Algorithms Research"},"cohort_total":604,"direct_labels_cover":1,"predictions_cover":604,"exported":604,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/324c8f9817be","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Optimization+Algorithms+Research"},"results":[{"id":"W1016831914","doi":"10.1007/978-1-4615-0011-7_7","title":"Introduction to Stability","year":2001,"lang":"en","type":"book-chapter","venue":"Applied optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Physics; Crystallography; Analytical Chemistry (journal); Chemistry","score_opus":0.04614653097349839,"score_gpt":0.3077272352504287,"score_spread":0.2615807042769303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1016831914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.6668273e-7,0.000011532788,0.5736281,0.0006328637,0.0001457595,0.0010791592,0.000019727513,0.00024228051,0.42424],"genre_scores_gemma":[0.000029281842,0.00016871032,0.6310399,0.00014980088,0.0017266304,0.00015373452,0.00050975336,0.0002621397,0.36596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724555,0.000023359557,0.00066964305,0.00092724257,0.00075224927,0.00038196915],"domain_scores_gemma":[0.99772394,0.00017670916,0.0003150997,0.0010288095,0.0005319034,0.00022353388],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004108642,0.00046776806,0.0005232205,0.00038890808,0.00017414376,0.000077064695,0.0002953319,0.00046481763,0.012330986],"category_scores_gemma":[0.0003383813,0.0005171219,0.00009637573,0.00023877478,0.0000875907,0.00013730986,0.00018190613,0.0004930408,0.0005800749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009101972,0.000059443373,3.351025e-7,0.000078407764,0.000053819516,0.0000029689309,0.00012430061,0.4767917,0.000027768589,0.48654708,0.026914664,0.0093084695],"study_design_scores_gemma":[0.001004374,0.00014735959,7.5580795e-7,0.00007669651,0.00016478823,0.000018390998,0.00007352912,0.059007388,0.0006672174,0.31969503,0.6174865,0.001657984],"about_ca_topic_score_codex":0.0000013342583,"about_ca_topic_score_gemma":0.000004515804,"teacher_disagreement_score":0.5905718,"about_ca_system_score_codex":0.00053379557,"about_ca_system_score_gemma":0.000097911274,"threshold_uncertainty_score":0.999728},"labels":[],"label_agreement":null},{"id":"W1117774183","doi":"10.1007/s10957-015-0790-0","title":"A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Theory of computation; Mathematics; Convergence (economics); Mathematical optimization; Regular polygon; Rate of convergence; Applied mathematics; Computer science; Algorithm","score_opus":0.06317282710001523,"score_gpt":0.3707044478296285,"score_spread":0.30753162072961326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1117774183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009949778,0.00015043587,0.9967195,0.0004980381,0.000056629047,0.0015086555,0.000016162916,0.000050838426,0.0009898219],"genre_scores_gemma":[0.0012448075,0.00014493839,0.9968225,0.000060325605,0.00029917987,0.00018589824,0.000022194392,0.000050235452,0.0011699192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819684,0.00027041303,0.0007154875,0.00026828086,0.0003364777,0.00021247467],"domain_scores_gemma":[0.995893,0.0008048304,0.0009172964,0.00024114075,0.0018122558,0.00033145622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019024636,0.00019958481,0.00038667253,0.00029683058,0.00021148266,0.00008110803,0.000211209,0.00013768143,0.000048054557],"category_scores_gemma":[0.0013841348,0.00018066424,0.00010251364,0.0006288527,0.00010387576,0.0005542501,0.000042817574,0.0002262698,0.0000010309699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032368882,0.00009890635,0.00001518413,0.000018232256,0.00006807145,7.993192e-7,0.000465453,0.7901361,0.000010903346,0.20168027,0.0006186526,0.006563731],"study_design_scores_gemma":[0.0024029762,0.00034174853,0.000002893537,0.000046404453,0.000119806085,0.00013099582,0.0012596073,0.62246776,0.00016886745,0.3720401,0.00082098175,0.00019785938],"about_ca_topic_score_codex":0.0000020467537,"about_ca_topic_score_gemma":0.0000013077921,"teacher_disagreement_score":0.17035982,"about_ca_system_score_codex":0.0002115641,"about_ca_system_score_gemma":0.00035586985,"threshold_uncertainty_score":0.7367274},"labels":[],"label_agreement":null},{"id":"W121557243","doi":"10.1007/0-387-25570-2_2","title":"Monotonic Optimization: Branch and Cut Methods","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Monotonic function; Partition (number theory); Mathematics; Mathematical optimization; Property (philosophy); Regular polygon; Algorithm; Applied mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.07730229124715568,"score_gpt":0.4151627299745477,"score_spread":0.337860438727392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121557243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.2866187e-8,0.00049949245,0.53218806,0.00019733509,0.00004220953,0.00035376006,0.00000776401,0.00012985712,0.4665815],"genre_scores_gemma":[4.837811e-7,0.001591221,0.5134654,0.00007824646,0.00012219134,0.000015171897,0.000013780021,0.00009709234,0.4846164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981777,0.00005406262,0.0005161446,0.0005411995,0.00041052123,0.00030037796],"domain_scores_gemma":[0.99804497,0.00065593433,0.00021377177,0.00060339324,0.00029831732,0.0001835999],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041071602,0.00040739714,0.00055972824,0.00026949227,0.00012142132,0.00007810192,0.0002336074,0.00045779996,0.01204741],"category_scores_gemma":[0.00025110188,0.00038484047,0.00010534156,0.000060635826,0.00014903056,0.00018331742,0.00023419387,0.0005163918,0.00008753469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018359786,0.000032418946,4.0819663e-7,0.0001601322,0.00016745002,0.000008877805,0.00010015826,0.034229625,0.0000027895942,0.80861557,0.0049601304,0.1517041],"study_design_scores_gemma":[0.0007337959,0.000060640225,2.6796002e-7,0.00012016989,0.000101316444,0.00006215712,0.000011707776,0.3048807,0.00012477483,0.37364107,0.31942064,0.00084276084],"about_ca_topic_score_codex":9.766507e-7,"about_ca_topic_score_gemma":0.0000061734786,"teacher_disagreement_score":0.43497446,"about_ca_system_score_codex":0.00012835885,"about_ca_system_score_gemma":0.00010325485,"threshold_uncertainty_score":0.99986035},"labels":[],"label_agreement":null},{"id":"W1263475093","doi":"","title":"LQP based interior prediction-correction method for nonlinear complementarity problems","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Complementarity (molecular biology); Nonlinear system; Convergence (economics); Mathematics; Mathematical optimization; Computer science; Economics; Physics","score_opus":0.05390316261298996,"score_gpt":0.3905185049449124,"score_spread":0.3366153423319225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1263475093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016037327,0.000015968615,0.99651,0.00048794187,0.00042358603,0.0006001219,0.000100820354,0.000045909383,0.00021189783],"genre_scores_gemma":[0.0032093194,0.0000016448226,0.9958887,0.000060299364,0.00037924582,0.000028942593,0.00007482367,0.000043394066,0.000313616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974834,0.00009198258,0.0012912616,0.00014478994,0.00077585643,0.00021273919],"domain_scores_gemma":[0.9944675,0.0026112078,0.0010167599,0.00013396742,0.001690293,0.00008029021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013006548,0.00017658484,0.00040708637,0.00030760525,0.00015935567,0.000077199664,0.0002140658,0.000069252805,0.00012279817],"category_scores_gemma":[0.0007259918,0.00015753468,0.0002129957,0.00026962537,0.000047645124,0.00024598886,0.00003306563,0.00024310414,0.000004023524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008799128,0.0010438494,0.00011583342,0.0005521296,0.00012719378,0.000003863324,0.0002918278,0.96450895,0.00019432609,0.0142046865,0.015880724,0.0029886302],"study_design_scores_gemma":[0.0011413976,0.0001901158,0.000050538452,0.00012370331,0.000048751288,0.00007749322,0.00009429973,0.69546294,0.0003621839,0.3006244,0.001731491,0.00009270294],"about_ca_topic_score_codex":0.000004533792,"about_ca_topic_score_gemma":0.000009009092,"teacher_disagreement_score":0.28641972,"about_ca_system_score_codex":0.00021843576,"about_ca_system_score_gemma":0.00021386721,"threshold_uncertainty_score":0.6424078},"labels":[],"label_agreement":null},{"id":"W135379586","doi":"10.1007/978-94-017-0399-4_5","title":"Symmetric Polynomial Means","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Inequality; Algebra over a field; Polynomial; Symmetric polynomial; Pure mathematics; Arithmetic; Calculus (dental); Matrix polynomial; Mathematical analysis","score_opus":0.07273858579000286,"score_gpt":0.3374682595560152,"score_spread":0.26472967376601236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135379586","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.125481e-8,0.00015317998,0.1260937,0.0001618304,0.00018602608,0.00039133636,0.000025557765,0.0001574137,0.87283087],"genre_scores_gemma":[0.0000013630444,0.00022317143,0.22046544,0.00018302497,0.0001439096,0.000008495752,0.000016647486,0.0001394034,0.77881855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981436,0.000021210395,0.00042834447,0.00040842989,0.0006638645,0.00033452682],"domain_scores_gemma":[0.9983876,0.00042014627,0.00017317716,0.0006002151,0.00024981325,0.00016904892],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020967494,0.00034913962,0.000456677,0.00061002705,0.000082682614,0.000042233212,0.0002836052,0.00041243204,0.012106546],"category_scores_gemma":[0.0004783826,0.00032157952,0.00017643574,0.00012065699,0.00008432589,0.00007492332,0.00010267738,0.0005421062,0.0009325991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055747237,0.000021123242,2.3702653e-7,0.000044490247,0.00006981693,0.000019037041,0.000012692139,0.000030825126,7.8718426e-7,0.8645081,0.12891944,0.006367871],"study_design_scores_gemma":[0.00037743885,0.000042092874,1.0479355e-7,0.00003565496,0.0000419574,0.000019637126,0.0000069886983,0.0009816168,0.00004478159,0.25892785,0.7390641,0.00045774432],"about_ca_topic_score_codex":0.0000019281558,"about_ca_topic_score_gemma":0.000006263199,"teacher_disagreement_score":0.6101447,"about_ca_system_score_codex":0.00022496413,"about_ca_system_score_gemma":0.000099813115,"threshold_uncertainty_score":0.99992365},"labels":[],"label_agreement":null},{"id":"W148192211","doi":"10.1007/b135610","title":"Essays and Surveys in Global Optimization","year":2005,"lang":"en","type":"book","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Global optimization; Nonlinear programming; Mathematical optimization; Multivariate statistics; Computer science; Optimization problem; Nonlinear system; Function (biology); Mathematics; Machine learning; Physics; Biology","score_opus":0.041689146413208915,"score_gpt":0.3574620360211724,"score_spread":0.31577288960796346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148192211","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.9460662e-7,0.000102937454,0.5130219,0.000063358886,0.000027203854,0.00027468248,0.000031579988,0.000064335116,0.48641363],"genre_scores_gemma":[0.0000032027122,0.00039904073,0.4054283,0.000025863867,0.00007903226,0.00002262214,0.00009582555,0.000041335337,0.5939048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982893,0.00023923434,0.00040575102,0.00038184674,0.00040830462,0.00027556423],"domain_scores_gemma":[0.9989833,0.0003209825,0.0001271439,0.00029955263,0.00016837266,0.00010064017],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009932878,0.00025502793,0.00038137264,0.0001678936,0.0000396025,0.00005413851,0.00016988713,0.00036769532,0.0016669944],"category_scores_gemma":[0.0004171374,0.00025249997,0.00003675263,0.00018911673,0.000081916056,0.00016355567,0.00015660675,0.00029832774,0.000033249707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020490765,0.000289212,0.00026023315,0.00054244825,0.00010327695,0.00007349861,0.00014096315,0.42272663,1.6135951e-7,0.35915643,0.08458761,0.13209903],"study_design_scores_gemma":[0.0018490942,0.00006231888,0.00008111065,0.000252951,0.000031858584,0.000034049528,0.00003338052,0.615859,0.0000023163102,0.3640456,0.016785666,0.0009626736],"about_ca_topic_score_codex":0.000008633585,"about_ca_topic_score_gemma":0.00025475732,"teacher_disagreement_score":0.19313236,"about_ca_system_score_codex":0.0005750454,"about_ca_system_score_gemma":0.00026489946,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W1505732277","doi":"10.1023/a:1013838625301","title":"A note on reduction of quadratic and bilinear programs with equality constraints","year":2002,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; University of Prince Edward Island","funders":"","keywords":"Mathematics; Bilinear interpolation; Mathematical optimization; Graph; Reduction (mathematics); Quadratic equation; Discrete mathematics; Statistics","score_opus":0.05982993377738271,"score_gpt":0.3607467880512986,"score_spread":0.3009168542739159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505732277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03274729,0.00005864707,0.96525574,0.00045321166,0.00007639576,0.00035896967,0.000008688764,0.000021467662,0.0010196065],"genre_scores_gemma":[0.39361125,0.00010565049,0.6061625,0.000012182595,0.000047836358,0.000002071991,0.000002204727,0.000011904627,0.000044412463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984813,0.00012422931,0.00057424314,0.00012674126,0.0005485308,0.00014498652],"domain_scores_gemma":[0.9982212,0.000088628745,0.00069728045,0.00014030357,0.00074748474,0.00010509874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034377532,0.00011993455,0.00027809842,0.00008042575,0.000052311025,0.0000349722,0.00008734306,0.00007349253,0.00009217844],"category_scores_gemma":[0.0005420053,0.00009079806,0.00004601478,0.0004577879,0.0002208427,0.0002887548,0.000016540944,0.00014915709,0.0000012562466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005091212,0.0011720343,0.00066304,0.00016291827,0.00012320303,0.000019493587,0.0005952192,0.92986685,0.00009516707,0.008867906,0.00020421606,0.057720855],"study_design_scores_gemma":[0.003666525,0.0028323778,0.00016587487,0.00052377296,0.00012124808,0.0007458676,0.00060958375,0.9861423,0.00046052304,0.0043894835,0.000060736096,0.00028171987],"about_ca_topic_score_codex":0.0000018607045,"about_ca_topic_score_gemma":0.0000016961942,"teacher_disagreement_score":0.36086395,"about_ca_system_score_codex":0.00014715883,"about_ca_system_score_gemma":0.000057922778,"threshold_uncertainty_score":0.37026373},"labels":[],"label_agreement":null},{"id":"W1509803206","doi":"10.1007/978-1-4757-9859-3","title":"Convex analysis and nonlinear optimization : theory and examples","year":2000,"lang":"en","type":"book","venue":"University of Maribor digital library (University of Maribor)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":852,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Convex analysis; Duality (order theory); Mathematics; Notation; Nonlinear programming; Convex optimization; Karush–Kuhn–Tucker conditions; Regular polygon; Nonlinear system; Applied mathematics; Mathematical optimization; Pure mathematics; Physics; Geometry","score_opus":0.010600764220291018,"score_gpt":0.19864467283221787,"score_spread":0.18804390861192685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509803206","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050442857,0.0007167108,0.37895426,0.00058565475,0.000066496505,0.0015458373,0.017032288,0.00048879563,0.5955657],"genre_scores_gemma":[0.00044902836,0.003899717,0.2243329,0.000023583989,0.00003197104,5.3065424e-8,0.004378618,0.00008378078,0.76680034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821156,0.00015873215,0.00025901073,0.00062057807,0.0004666001,0.00028350722],"domain_scores_gemma":[0.997446,0.0010861192,0.00051923183,0.0004994465,0.00018836348,0.0002608493],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019676625,0.00037353163,0.0009783701,0.0010857433,0.00025675198,0.00007410488,0.0006019566,0.00046252267,0.004099611],"category_scores_gemma":[0.00007134902,0.0005112383,0.00028451704,0.00061557034,0.0012474376,0.0019716437,0.0009940943,0.00036773787,0.000008388245],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020841928,0.003932137,0.028205372,0.010125082,0.03700393,0.0024493888,0.015819404,0.038051926,0.000011505685,0.35267776,0.16153322,0.32934836],"study_design_scores_gemma":[0.012045243,0.0012343948,0.004442176,0.0013170805,0.010728399,0.00008083285,0.01600348,0.13185282,0.0000384702,0.17383228,0.6433118,0.0051130047],"about_ca_topic_score_codex":0.000040999817,"about_ca_topic_score_gemma":0.000022820463,"teacher_disagreement_score":0.4817786,"about_ca_system_score_codex":0.00007358906,"about_ca_system_score_gemma":0.00035611368,"threshold_uncertainty_score":0.9997339},"labels":[],"label_agreement":null},{"id":"W1519364999","doi":"10.1007/978-1-4615-4381-7_5","title":"Self-Dual Embeddings","year":2000,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dual (grammatical number); Semidefinite programming; Point (geometry); Computer science; Interior point method; Process (computing); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.08160248743552477,"score_gpt":0.45229318320411277,"score_spread":0.370690695768588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519364999","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001103221,0.0000954662,0.0019381613,0.011447889,0.0020095552,0.0057279114,0.00022462127,0.0003216041,0.97713155],"genre_scores_gemma":[0.019711265,0.015548704,0.17017803,0.00018247415,0.000587824,0.0026343362,0.00040610664,0.00023241533,0.7905188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9714826,0.0004987159,0.0024649352,0.0038199814,0.018710373,0.0030233923],"domain_scores_gemma":[0.99064004,0.00052358536,0.00015715923,0.0024874844,0.005524205,0.0006675108],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","open_science","insufficient_payload"],"category_scores_codex":[0.02155994,0.0009966895,0.0007811711,0.020404771,0.0044951546,0.006125775,0.010804738,0.00035949014,0.0091932565],"category_scores_gemma":[0.002492754,0.0010629743,0.00022103994,0.007845587,0.011311518,0.011152792,0.008069418,0.00326221,0.0012292408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022522878,0.00060688896,0.000037991376,0.00012713371,0.00017645002,0.0005829851,0.0011106363,0.073502086,0.000104200684,0.91685325,0.0023821706,0.0042909896],"study_design_scores_gemma":[0.002539558,0.00040936397,0.0005301341,0.0014750827,0.000037189817,0.00014514645,0.00604565,0.18685226,0.00040321556,0.29008588,0.509398,0.0020785364],"about_ca_topic_score_codex":0.00032860736,"about_ca_topic_score_gemma":0.0034796866,"teacher_disagreement_score":0.6267674,"about_ca_system_score_codex":0.009625218,"about_ca_system_score_gemma":0.0014883425,"threshold_uncertainty_score":0.99995315},"labels":[],"label_agreement":null},{"id":"W1525133469","doi":"10.1023/a:1008787027641","title":"A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities","year":2000,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","score_opus":0.0379339446005809,"score_gpt":0.33932695613064007,"score_spread":0.30139301153005915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525133469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032205,0.00022152757,0.9947435,0.0014532636,0.00001990674,0.0022716117,0.0003122895,0.00022016017,0.00043564293],"genre_scores_gemma":[0.0038996348,0.00018050072,0.99243504,0.0002658699,0.0001038703,0.0012647548,0.00048348986,0.000041015322,0.0013258306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846596,0.00008855116,0.0005116804,0.0003873327,0.0002983801,0.00024810754],"domain_scores_gemma":[0.99681807,0.0022247867,0.00017950409,0.00021976737,0.00045202795,0.00010587085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041630593,0.00019196831,0.00021998506,0.00005873257,0.0007881886,0.00015848507,0.00020384052,0.0000727212,0.00024001552],"category_scores_gemma":[0.00009477069,0.00016189013,0.00006091543,0.00036215124,0.00016545359,0.00021061457,0.00004343046,0.00012634469,0.000008845468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016610149,0.000268152,0.000047737103,0.000052124826,0.000059734357,9.698703e-8,0.00031910086,0.93217665,0.000004504298,0.00918051,0.005138058,0.052736692],"study_design_scores_gemma":[0.00093746616,0.000033993194,0.000023611088,0.000008360443,0.00003319036,0.0000063358575,0.00020762412,0.97195417,0.00002128409,0.013162836,0.013426201,0.00018490465],"about_ca_topic_score_codex":0.000010367245,"about_ca_topic_score_gemma":0.000001642553,"teacher_disagreement_score":0.052551787,"about_ca_system_score_codex":0.00008002667,"about_ca_system_score_gemma":0.00012779662,"threshold_uncertainty_score":0.6601688},"labels":[],"label_agreement":null},{"id":"W1530501119","doi":"10.1007/s101079900106","title":"A branch and cut algorithm for nonconvex quadratically constrained quadratic programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Mathematics; Tree (set theory); Linearization; Mathematical optimization; Quadratic programming; Quadratic equation; Node (physics); Quadratically constrained quadratic program; Branch and cut; Second-order cone programming; Algorithm; Linear programming; Combinatorics; Convex optimization; Nonlinear system","score_opus":0.03949063608831347,"score_gpt":0.35372067884664565,"score_spread":0.31423004275833216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530501119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028032411,0.00009282822,0.9903378,0.00057670206,0.000039323353,0.003673022,0.000016567967,0.0005348636,0.0019256397],"genre_scores_gemma":[0.009373119,0.000016008793,0.9863354,0.00009788556,0.00015288866,0.0012226352,0.000022622928,0.00013534185,0.00264409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625474,0.00013358636,0.0010784949,0.0007126952,0.0007012106,0.001119287],"domain_scores_gemma":[0.9962541,0.0022929485,0.00017061102,0.0005170277,0.00028534656,0.00048000933],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001177344,0.00047968706,0.0008136349,0.00015168951,0.0004260847,0.00041040828,0.00032780762,0.00024532306,0.0011135709],"category_scores_gemma":[0.0016767182,0.00042403702,0.00019959468,0.00047408795,0.0006075249,0.00035122415,0.00008820053,0.0003993522,0.00009663561],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029406297,0.0004987181,0.000006698116,0.00075426203,0.000082593484,0.000015375968,0.0008869472,0.000010899988,0.000029724812,0.037195764,0.000066632856,0.960423],"study_design_scores_gemma":[0.0032911468,0.0006803828,0.0000040718683,0.00043515218,0.00017898176,0.00025560166,0.0008975644,0.5156506,0.0003629132,0.4657559,0.011479059,0.0010086718],"about_ca_topic_score_codex":0.0000029468301,"about_ca_topic_score_gemma":0.0000057202465,"teacher_disagreement_score":0.9594143,"about_ca_system_score_codex":0.00008257894,"about_ca_system_score_gemma":0.000111778245,"threshold_uncertainty_score":0.9998211},"labels":[],"label_agreement":null},{"id":"W1534354577","doi":"10.1137/s1052623402419789","title":"A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MINOS; Augmented Lagrangian method; Mathematics; Mathematical optimization; Robustness (evolution); Nonlinear system; Nonlinear programming; Lagrangian; Constrained optimization; MATLAB; Constrained optimization problem; Optimization problem; Applied mathematics; Computer science","score_opus":0.03817071064495997,"score_gpt":0.38230960659738866,"score_spread":0.3441388959524287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534354577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037038586,0.000069006834,0.9931399,0.0034635954,0.00035494482,0.0010910464,0.000095329415,0.00018201524,0.0015670948],"genre_scores_gemma":[0.00023026268,0.00032785904,0.99583614,0.00074221974,0.00094316836,0.00005291733,0.00016754895,0.00011689612,0.0015829636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682415,0.00027443137,0.000994049,0.00043317763,0.0008829021,0.0005912732],"domain_scores_gemma":[0.99646676,0.00062623445,0.0006280412,0.00034209192,0.0015584785,0.00037841537],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001458012,0.00036741764,0.00045345555,0.00042720494,0.00047354563,0.00030256828,0.0003983861,0.00024862643,0.0012210298],"category_scores_gemma":[0.0019497155,0.00034504468,0.00025340763,0.0006278929,0.000075309435,0.0006626554,0.000049941624,0.00044950642,0.000029887075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026505964,0.00030526117,0.0000041878484,0.00003388568,0.000090263085,0.0000062491004,0.00015844929,0.98158944,0.000029956402,0.004790443,0.0019853984,0.010741391],"study_design_scores_gemma":[0.003238788,0.00036883092,0.0000011265433,0.00008042084,0.000065444925,0.00012177711,0.00011110031,0.9860988,0.00042308832,0.0011523853,0.007982412,0.00035578554],"about_ca_topic_score_codex":0.0000012202017,"about_ca_topic_score_gemma":0.0000034250265,"teacher_disagreement_score":0.010385606,"about_ca_system_score_codex":0.00042525088,"about_ca_system_score_gemma":0.00030521894,"threshold_uncertainty_score":0.99990016},"labels":[],"label_agreement":null},{"id":"W1537384856","doi":"10.21236/ada445031","title":"Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems","year":2004,"lang":"en","type":"report","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Filter (signal processing); Variable (mathematics); Computer science; Mathematics; Mathematical optimization; Computer vision","score_opus":0.13997361561557833,"score_gpt":0.39433679544171635,"score_spread":0.254363179826138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537384856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.8674426e-7,0.000102394464,0.95015645,0.0002726657,0.00076767174,0.004722952,0.0008560849,0.00045801786,0.042662892],"genre_scores_gemma":[0.000029480057,0.00051739224,0.905859,0.00006629608,0.000652709,0.0011599403,0.0025997246,0.00037590548,0.088739574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993878,0.00014595276,0.0013791906,0.0011600696,0.002278616,0.0011581719],"domain_scores_gemma":[0.9927044,0.0010420271,0.00052244996,0.0010044118,0.0043994235,0.00032730922],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022119384,0.0007405125,0.0011248006,0.0005764864,0.00029787258,0.00026276213,0.0006366988,0.0009428225,0.0046299556],"category_scores_gemma":[0.0022549164,0.0006835139,0.00030729946,0.0006545245,0.00021083734,0.0003040955,0.00028356776,0.0008461068,0.000044992546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030684154,0.0006080475,0.000009250466,0.005051501,0.00057940406,0.00002651615,0.00020493452,0.9214031,0.000019623742,0.0026442816,0.042579576,0.026843047],"study_design_scores_gemma":[0.0039959117,0.00036487074,0.0000014275639,0.0010922663,0.00022840752,0.00018008439,0.00017662329,0.9333164,0.0004726814,0.021538202,0.037046883,0.0015862265],"about_ca_topic_score_codex":0.00019691572,"about_ca_topic_score_gemma":0.00003320789,"teacher_disagreement_score":0.04607668,"about_ca_system_score_codex":0.0013143709,"about_ca_system_score_gemma":0.0044163177,"threshold_uncertainty_score":0.9995616},"labels":[],"label_agreement":null},{"id":"W1539540708","doi":"10.1017/cbo9780511627217.006","title":"Nonlinear optimization","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nonlinear system; Computer science; Physics","score_opus":0.0460853528308138,"score_gpt":0.27324111419750496,"score_spread":0.22715576136669116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539540708","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.3987476e-7,0.000038005426,0.17282335,0.000020983358,0.000076586606,0.0005347633,0.00016380289,0.00027762193,0.82606405],"genre_scores_gemma":[0.0000010358293,0.00021157756,0.15492533,0.00003979932,0.00014589193,5.577656e-7,0.000120954996,0.00008838492,0.84446645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998262,0.000044814013,0.00027996182,0.0005466608,0.00052494515,0.00034160423],"domain_scores_gemma":[0.99811625,0.00015816836,0.0003037814,0.0007157707,0.0004898259,0.0002161863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012038753,0.00041439387,0.00047154396,0.00031175726,0.00020800834,0.00005072362,0.0005365118,0.00048541056,0.00004143613],"category_scores_gemma":[0.00007916822,0.0005080271,0.00019987147,0.000018314719,0.00017587664,0.00013870983,0.00027308302,0.0006277357,0.00002258534],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070567454,0.000030436127,6.411561e-8,0.00008544999,0.0000984883,0.00023226973,0.000021899423,0.0036600644,0.0000029087369,0.96739745,0.024061058,0.0043393453],"study_design_scores_gemma":[0.00083628553,0.00007377968,1.5864649e-7,0.00016902528,0.00016126616,0.0000191058,0.0000148612535,0.03992776,0.00012556594,0.0002782588,0.95775336,0.00064060045],"about_ca_topic_score_codex":0.000006456985,"about_ca_topic_score_gemma":4.700602e-7,"teacher_disagreement_score":0.9671192,"about_ca_system_score_codex":0.00034226087,"about_ca_system_score_gemma":0.00014671979,"threshold_uncertainty_score":0.99973714},"labels":[],"label_agreement":null},{"id":"W1544526981","doi":"10.1007/s101079900111","title":"A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Predictor–corrector method; Interior point method; Monotone polygon; Monotonic function; Quadratic growth; Path (computing); Smoothing; Linear complementarity problem; Mathematical optimization; Convergence (economics); Complementarity (molecular biology); Applied mathematics; Algorithm; Nonlinear system; Mathematical analysis; Computer science; Geometry; Statistics","score_opus":0.04868698048524479,"score_gpt":0.3654539087922773,"score_spread":0.3167669283070325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544526981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033975055,0.0000546473,0.99013746,0.00036164516,0.00011111143,0.004967909,0.000041848605,0.00036312648,0.00056473265],"genre_scores_gemma":[0.0066875187,0.000010560421,0.98828983,0.00008140346,0.000246909,0.002246091,0.000034556604,0.00012611347,0.0022769955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968186,0.00007732702,0.00088932714,0.00052466674,0.0007669138,0.00092315936],"domain_scores_gemma":[0.99710613,0.0016953049,0.00016070226,0.00064189045,0.00016377679,0.00023220525],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001276621,0.000383014,0.00057826424,0.00007482631,0.00059277227,0.000209015,0.0006018306,0.00012452166,0.0012814621],"category_scores_gemma":[0.00047728067,0.00027015,0.00038949834,0.00037763146,0.00016684135,0.00024065924,0.00016822969,0.00041891503,0.000107128886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007629034,0.00095114234,0.000085960375,0.0006495397,0.00042672845,0.000024640975,0.0026230216,0.00022621237,0.00005086999,0.0043674856,0.0009826835,0.98953545],"study_design_scores_gemma":[0.0016204139,0.00027470422,0.000007754514,0.00025832147,0.00016370336,0.000021712622,0.00061064615,0.9246994,0.0002506126,0.056910448,0.014784114,0.00039812407],"about_ca_topic_score_codex":0.000018493056,"about_ca_topic_score_gemma":0.0000072017847,"teacher_disagreement_score":0.9891373,"about_ca_system_score_codex":0.00016192213,"about_ca_system_score_gemma":0.00006378335,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W1545380151","doi":"10.1002/9781118884003.ch2","title":"Optimization algorithms—an overview","year":2014,"lang":"en","type":"other","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hessian matrix; Conjugate gradient method; Newton's method; Focus (optics); Newton's method in optimization; Gradient descent; Point (geometry); Computer science; Quasi-Newton method; Gauss; Algorithm; Mathematics; Function (biology); Minification; Mathematical optimization; Nonlinear conjugate gradient method; Nonlinear system; Applied mathematics; Iterative method; Local convergence; Artificial intelligence; Geometry","score_opus":0.12288001911251634,"score_gpt":0.42405850335429257,"score_spread":0.30117848424177623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545380151","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6060935e-9,0.00034026097,0.5639109,0.000042481046,0.0001232803,0.0003641568,0.000016754051,0.0006882213,0.43451396],"genre_scores_gemma":[6.137429e-8,0.0009852794,0.4941158,0.000088345536,0.00030851376,0.000033887387,0.00011098575,0.0007346071,0.50362253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796826,0.00017913891,0.0003511119,0.0005286241,0.00060765946,0.00036523593],"domain_scores_gemma":[0.9983077,0.00013338859,0.0002684857,0.00094937393,0.00013652978,0.0002045419],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029779068,0.000370998,0.0005067167,0.00039599426,0.000055918943,0.00006817626,0.00043497994,0.00043661825,0.062390216],"category_scores_gemma":[0.00022099508,0.00033392195,0.00008883402,0.00030717856,0.000064030835,0.00011061969,0.00011847483,0.00026567746,0.00065291306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037453801,0.00013692564,8.8063587e-7,0.0004025775,0.000111503345,0.0000063828143,0.000037199054,0.013769775,4.4932708e-7,0.06696371,0.9071484,0.011418439],"study_design_scores_gemma":[0.00044844885,0.000058916037,1.6216866e-7,0.00017938376,0.000047215573,0.0000068067025,0.000022649625,0.423716,0.0000089656905,0.008368102,0.5666098,0.0005335776],"about_ca_topic_score_codex":0.000031090363,"about_ca_topic_score_gemma":0.00005060636,"teacher_disagreement_score":0.40994623,"about_ca_system_score_codex":0.000071273236,"about_ca_system_score_gemma":0.00006692211,"threshold_uncertainty_score":0.9999113},"labels":[],"label_agreement":null},{"id":"W1549649786","doi":"","title":"A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interior point method; Algorithm; Newton's method in optimization; Complementarity (molecular biology); Centrality; Computer science; Kernel (algebra); Function (biology); Linear complementarity problem; Point (geometry); Mathematical optimization; Mathematics; Nonlinear system; Iterative method; Local convergence; Discrete mathematics; Combinatorics; Geometry","score_opus":0.18032849498786968,"score_gpt":0.45035541205422147,"score_spread":0.2700269170663518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549649786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014601806,0.00007522252,0.9897033,0.0015513088,0.0004149776,0.00527865,0.00035576118,0.00024161491,0.0009189824],"genre_scores_gemma":[0.022664655,0.000049155416,0.96418786,0.0002839302,0.0011450808,0.004440145,0.00074025197,0.0002072016,0.0062816967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939654,0.000796443,0.00092844287,0.00080290536,0.001816073,0.0016907189],"domain_scores_gemma":[0.9946035,0.0015094422,0.00009479824,0.0010846021,0.0021569065,0.00055071485],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00494127,0.00044518977,0.000508915,0.0010853823,0.0020813043,0.0002664998,0.0006082088,0.00024667825,0.0012545974],"category_scores_gemma":[0.0015317831,0.00042339324,0.00020517089,0.0014872088,0.00030097313,0.0009798014,0.00045423053,0.0011596909,0.00029297758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029425526,0.019751275,0.0011330857,0.0024352884,0.001579589,0.000036020698,0.01080437,0.22834586,0.008810296,0.10540981,0.11765317,0.5010987],"study_design_scores_gemma":[0.002807921,0.0016394482,0.000052305844,0.00012068555,0.000032753935,0.000013398933,0.0006787327,0.970599,0.0008233912,0.0019947495,0.02080091,0.0004366885],"about_ca_topic_score_codex":0.0002894568,"about_ca_topic_score_gemma":0.000437686,"teacher_disagreement_score":0.7422531,"about_ca_system_score_codex":0.00096417306,"about_ca_system_score_gemma":0.00052307977,"threshold_uncertainty_score":0.9998218},"labels":[],"label_agreement":null},{"id":"W1549791526","doi":"10.1023/a:1026583532263","title":"On Copositive Programming and Standard Quadratic Optimization Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":197,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Orthant; Positive-definite matrix; Semidefinite programming; Conic optimization; Cone (formal languages); Quadratically constrained quadratic program; Affine transformation; Scaling; Simplex; Relaxation (psychology); Combinatorics; Matrix (chemical analysis); Quadratic programming; Applied mathematics; Mathematical optimization; Convex optimization; Regular polygon; Pure mathematics; Algorithm; Convex set; Geometry","score_opus":0.01776061782903075,"score_gpt":0.3325683721105566,"score_spread":0.31480775428152585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549791526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034419012,0.00015927908,0.9932499,0.00043763427,0.00008417278,0.00053572556,0.00001743586,0.000049715327,0.0020242303],"genre_scores_gemma":[0.0321202,0.0005030433,0.96691114,0.00009396052,0.000088249115,0.000010360598,0.000013023028,0.000036979374,0.00022306872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789333,0.00016974784,0.0007126672,0.00020629277,0.0007471355,0.0002708159],"domain_scores_gemma":[0.9981384,0.00020005005,0.0004900561,0.00015375635,0.0008334114,0.00018432438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514227,0.00020533326,0.00035814333,0.000112393274,0.00017476403,0.00016823765,0.00014957567,0.00011550854,0.0005223536],"category_scores_gemma":[0.00053971104,0.00017886239,0.000073984695,0.00059677305,0.00009341521,0.0006484823,0.000023567523,0.00021948914,0.000004212012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003222683,0.00014306416,0.00006329432,0.00003764547,0.00005467686,0.000014394275,0.000185094,0.980352,0.0000012220142,0.003274034,0.00027118396,0.015281145],"study_design_scores_gemma":[0.002428594,0.001430254,0.000031020612,0.0003448621,0.00010428436,0.00022043288,0.00021209386,0.983952,0.00003702317,0.010719183,0.0002420315,0.0002782111],"about_ca_topic_score_codex":0.0000021307615,"about_ca_topic_score_gemma":0.0000020980733,"teacher_disagreement_score":0.028678298,"about_ca_system_score_codex":0.0003578758,"about_ca_system_score_gemma":0.00013666664,"threshold_uncertainty_score":0.7293797},"labels":[],"label_agreement":null},{"id":"W1563603078","doi":"10.1016/b978-0-444-53711-9.50108-5","title":"Tight Convex and Concave Relaxations via Taylor Models for Global Dynamic Optimization","year":2011,"lang":"en","type":"book-chapter","venue":"Computer-aided chemical engineering/Computer aided chemical engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Regular polygon; Pointwise; Concave function; Ode; Effective domain; Interval (graph theory); Discretization; Remainder; Parametric statistics; Applied mathematics; Nonlinear system; Convex analysis; Mathematical optimization; Convex optimization; Mathematical analysis; Combinatorics; Geometry","score_opus":0.02342056728203574,"score_gpt":0.25163655490760795,"score_spread":0.22821598762557221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563603078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082032166,0.0003194392,0.9947621,0.00009475632,0.00079380657,0.00150089,0.00019776331,0.0014443884,0.00080481946],"genre_scores_gemma":[0.002736869,0.00009408448,0.9928688,0.00010088865,0.0011773427,0.00023956408,0.00078989775,0.0006153348,0.0013772282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449134,0.000016085014,0.0017080918,0.0017410166,0.00077051454,0.0012729382],"domain_scores_gemma":[0.99584556,0.0010614356,0.00049352273,0.0010730143,0.00063995103,0.00088649604],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.000247226,0.0016481064,0.0018459077,0.0004011631,0.000108644694,0.00018735736,0.0009838176,0.0015016774,0.000096695876],"category_scores_gemma":[0.00022801108,0.0019001163,0.00056589406,0.00027623022,0.00019250563,0.00048272352,0.0009789494,0.0014309689,0.000016117774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005022077,0.000101481884,1.6024657e-7,0.0012981134,0.0005554099,0.000033956498,0.00014761837,0.9054562,0.002395874,0.083376445,0.00057651754,0.006008013],"study_design_scores_gemma":[0.0018318618,0.00010644794,2.286807e-7,0.0005637719,0.00021006697,0.00016643989,8.152967e-7,0.96265745,0.0031809923,0.028381247,0.0011547761,0.001745911],"about_ca_topic_score_codex":0.0000020042396,"about_ca_topic_score_gemma":1.8621809e-7,"teacher_disagreement_score":0.057201248,"about_ca_system_score_codex":0.0010344614,"about_ca_system_score_gemma":0.00009244107,"threshold_uncertainty_score":0.9997946},"labels":[],"label_agreement":null},{"id":"W1566416280","doi":"","title":"Self-regular proximities and new search directions for nonlinear P*(K) complementarity problems","year":2000,"lang":"en","type":"book","venue":"University of Tsukuba eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Mathematics; Complementarity (molecular biology); Regular polygon; Christian ministry; Generalization; Interior point method; Discrete mathematics; Computer science; Mathematical economics; Mathematical optimization; Pure mathematics; Political science","score_opus":0.06984495148830351,"score_gpt":0.29457833802377587,"score_spread":0.22473338653547237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566416280","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021227631,0.00060445606,0.10542335,0.00057880156,0.00015662062,0.009422913,0.0024908793,0.0007725588,0.88033813],"genre_scores_gemma":[0.0000018002809,0.00025185544,0.360591,0.000009188654,0.0000733033,0.0000018490016,0.00014581594,0.000045112545,0.6388801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983979,0.00006529031,0.0002710293,0.0004408493,0.0004673273,0.00035761885],"domain_scores_gemma":[0.9984904,0.00036227066,0.00018677577,0.00040055913,0.0003526841,0.00020733122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000236676,0.00028784794,0.00053433486,0.00034289033,0.00042722138,0.000032312542,0.00036626298,0.00025842982,0.00032348806],"category_scores_gemma":[0.00002937455,0.0003547442,0.00017035713,0.00005218705,0.00034599312,0.00007716649,0.00024620182,0.0003975417,0.000006497571],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016079732,0.0018606358,0.0000788621,0.02391503,0.006557562,0.00011874545,0.04890061,0.001026766,0.000082954444,0.2923903,0.37841213,0.24504846],"study_design_scores_gemma":[0.0016212966,0.00021979684,0.0000014701146,0.00022581982,0.00023217736,0.0000082389915,0.0005358656,0.0059206355,0.000085988846,0.04211357,0.9486641,0.00037099043],"about_ca_topic_score_codex":0.00015980455,"about_ca_topic_score_gemma":0.00039737686,"teacher_disagreement_score":0.57025206,"about_ca_system_score_codex":0.00033651278,"about_ca_system_score_gemma":0.0008921159,"threshold_uncertainty_score":0.99989045},"labels":[],"label_agreement":null},{"id":"W1572246416","doi":"10.1007/10997703_7","title":"On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simplex; Equivalence (formal languages); Mathematics; Minification; Algebraic number; Unit sphere; Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Mathematical optimization; Mathematical analysis","score_opus":0.12330903677169572,"score_gpt":0.3142176338614269,"score_spread":0.1909085970897312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572246416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006985904,0.00022710073,0.83618265,0.041047245,0.00010426669,0.0033652522,0.00012930862,0.000029167471,0.11821643],"genre_scores_gemma":[0.9873763,0.00023572284,0.0060129585,0.005260694,0.0000918106,0.00010628796,0.000012842775,0.000018723435,0.0008846713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820065,0.00005970275,0.00057785865,0.00014657447,0.0008321072,0.00018311777],"domain_scores_gemma":[0.99368346,0.0052823145,0.0005224783,0.00032752394,0.00015586114,0.000028349104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013751879,0.00018794241,0.00025788133,0.00024730974,0.00023823108,0.00008094474,0.00057253585,0.00011907493,0.00014239624],"category_scores_gemma":[0.003169963,0.000076537384,0.00006195247,0.0002693069,0.0005130152,0.00040601855,0.00007311703,0.00028896242,0.0000084650155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044675948,0.000009150704,0.0000026271312,0.00003776915,0.0000133207195,3.3208483e-8,0.0016339214,0.10703362,0.0000019105653,0.8168972,0.00011709699,0.07420868],"study_design_scores_gemma":[0.0005399725,0.00040949494,0.00005181875,0.00031670154,0.000023118731,0.000002604537,0.00026627514,0.36374137,0.0004878189,0.6239863,0.00992368,0.00025083806],"about_ca_topic_score_codex":0.0000033294139,"about_ca_topic_score_gemma":0.000023182278,"teacher_disagreement_score":0.9866777,"about_ca_system_score_codex":0.000031841275,"about_ca_system_score_gemma":0.00008515931,"threshold_uncertainty_score":0.37949705},"labels":[],"label_agreement":null},{"id":"W1590819555","doi":"10.1007/s101070100240","title":"Self-concordant barriers for hyperbolic means","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Homogeneous polynomial; Hyperbolic function; Homogeneous; Polynomial; Function (biology); Domain (mathematical analysis); Degree (music); Regular polygon; Mathematical analysis; Combinatorics; Matrix polynomial; Geometry","score_opus":0.052798400209735835,"score_gpt":0.36599263890353156,"score_spread":0.3131942386937957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590819555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034841697,0.00004852047,0.9885344,0.00051945145,0.000069306145,0.0018919447,0.000004848377,0.000742778,0.004704572],"genre_scores_gemma":[0.009985289,0.000019072328,0.987363,0.00008070942,0.00015503062,0.00068353367,0.0000061646087,0.00010943518,0.0015977618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976867,0.00006290788,0.00056047004,0.00038931062,0.00051037647,0.0007902449],"domain_scores_gemma":[0.99761075,0.0011548034,0.00012360203,0.0004705516,0.00023299732,0.00040731145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079255516,0.00026100333,0.00043439178,0.00012686985,0.0002841458,0.00012351527,0.00034607205,0.00012059705,0.00038091472],"category_scores_gemma":[0.0035116936,0.00022477876,0.00018345552,0.00042205187,0.00011677541,0.00019231963,0.00010267417,0.00022486363,0.00010310016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012746212,0.0011975688,0.00023325291,0.0022164022,0.00031255014,0.00008703299,0.004191224,0.00019971814,0.00013214238,0.80290306,0.001333955,0.18706566],"study_design_scores_gemma":[0.0015406563,0.00022345793,0.0000014378506,0.00010717845,0.00010209419,0.00013602483,0.0013741789,0.22311115,0.00054139434,0.6521409,0.120165415,0.00055610674],"about_ca_topic_score_codex":9.402026e-7,"about_ca_topic_score_gemma":0.0000024030717,"teacher_disagreement_score":0.22291143,"about_ca_system_score_codex":0.0001273182,"about_ca_system_score_gemma":0.00007658628,"threshold_uncertainty_score":0.91662115},"labels":[],"label_agreement":null},{"id":"W1592751003","doi":"10.1090/surv/146/02","title":"Positive polynomials and sums of squares","year":2008,"lang":"en","type":"book-chapter","venue":"Mathematical surveys and monographs","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":274,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Algebraic number; Pure mathematics; Semidefinite programming; Explained sum of squares; Moment (physics); Algebra over a field; Isotropy; Real algebraic geometry; Quadratic equation; Discrete mathematics; Combinatorics; Mathematical analysis; Physics; Mathematical optimization; Quantum mechanics; Geometry","score_opus":0.058520863052041745,"score_gpt":0.31770769055276465,"score_spread":0.2591868275007229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592751003","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007376033,0.008907424,0.3815655,0.00034504195,0.00016607052,0.0042028194,0.0019944774,0.00034848216,0.59509414],"genre_scores_gemma":[0.0390182,0.04199374,0.47284073,0.00015626568,0.00035766748,0.00019018368,0.00041551684,0.0010219683,0.44400573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794894,0.00019031091,0.00070265407,0.0004090924,0.00045224561,0.00029675275],"domain_scores_gemma":[0.99684626,0.0020205837,0.00031298312,0.0003660572,0.0002274464,0.00022667515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011459836,0.0003995658,0.0009875454,0.0003152109,0.000118483105,0.000036756737,0.00014434636,0.00035272323,0.00035108151],"category_scores_gemma":[0.00042744074,0.00033640477,0.00016704983,0.00007537245,0.0007261036,0.00008252994,0.0001991224,0.00031464905,0.000009135596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076689954,0.00030298045,0.00020534512,0.0024381995,0.0009086681,0.00009288877,0.0020685873,0.0000046651903,0.00008721825,0.9238131,0.0045832554,0.065418385],"study_design_scores_gemma":[0.00089378515,0.00032547922,0.00041421517,0.0008023717,0.00015586053,0.00010416984,0.00008245108,0.00078110537,0.00043281165,0.99314195,0.0020376665,0.0008281334],"about_ca_topic_score_codex":0.000009079934,"about_ca_topic_score_gemma":0.0000076506385,"teacher_disagreement_score":0.15108842,"about_ca_system_score_codex":0.000017712771,"about_ca_system_score_gemma":0.000034299323,"threshold_uncertainty_score":0.9999088},"labels":[],"label_agreement":null},{"id":"W1593747011","doi":"","title":"Global convergence of a primal-dual interior-point method for nonlinear programming","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interior point method; Iterated function; Convergence (economics); Nonlinear programming; Mathematical optimization; Dual (grammatical number); Point (geometry); Computer science; Nonlinear system; Linear programming; Mathematics; Mathematical analysis","score_opus":0.15464668638929757,"score_gpt":0.4936075924287063,"score_spread":0.3389609060394087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593747011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083310595,0.000092817834,0.987478,0.0005882646,0.00012131741,0.0026558575,0.0002701824,0.00009885989,0.00036362722],"genre_scores_gemma":[0.0091143465,0.00012443797,0.9875192,0.000021042688,0.00019859198,0.0008538409,0.00007989968,0.000053406173,0.0020352374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609375,0.00049177284,0.0008033233,0.0005908117,0.0012043699,0.0008159768],"domain_scores_gemma":[0.9946892,0.0010405415,0.00007172844,0.00065396674,0.0033133556,0.00023120665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025864812,0.00022675807,0.0004415567,0.0003499977,0.00073345046,0.00007667567,0.00053435436,0.00015682665,0.00029486537],"category_scores_gemma":[0.0041308226,0.00021583693,0.00015055652,0.0016542242,0.0005519613,0.00041421782,0.0003601241,0.00041419393,0.000035744284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016236542,0.007175076,0.0017351599,0.0027955922,0.0017481958,0.00043169668,0.023333224,0.06501144,0.021028377,0.27774864,0.024787672,0.57258123],"study_design_scores_gemma":[0.0015300285,0.0006357757,0.000046263205,0.000069572845,0.000017540851,0.00019755276,0.0012323083,0.9791673,0.00820242,0.003989317,0.004597207,0.0003147517],"about_ca_topic_score_codex":0.00018707922,"about_ca_topic_score_gemma":0.000119486096,"teacher_disagreement_score":0.91415584,"about_ca_system_score_codex":0.00035234995,"about_ca_system_score_gemma":0.0009380036,"threshold_uncertainty_score":0.8801575},"labels":[],"label_agreement":null},{"id":"W1601244479","doi":"","title":"The Eigenstep Method: An Iterative Method for Unconstrained Quadratic Optimization","year":2005,"lang":"en","type":"article","venue":"American Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Line search; Mathematical optimization; Hessian matrix; Gradient descent; Mathematics; Broyden–Fletcher–Goldfarb–Shanno algorithm; Gradient method; Method of steepest descent; Convergence (economics); Quadratic programming; Convex optimization; Iterative method; Descent (aeronautics); Applied mathematics; Regular polygon; Computer science; Artificial neural network; Artificial intelligence","score_opus":0.13024549217559736,"score_gpt":0.5364030428115195,"score_spread":0.4061575506359222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601244479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000595147,0.00007979843,0.98990107,0.008062913,0.00005083511,0.00070793024,0.000022036345,0.000013782757,0.0005664748],"genre_scores_gemma":[0.0074805273,0.00008476381,0.9899385,0.0001939449,0.0006122024,0.00009776282,0.00001594552,0.000048883816,0.0015274831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939941,0.0025165416,0.00093668024,0.00028212523,0.0017307857,0.00053976773],"domain_scores_gemma":[0.9812701,0.011529037,0.00042494445,0.00033156126,0.0061416547,0.00030271002],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011731734,0.00018193759,0.00039756956,0.00041182802,0.0010713683,0.00040574698,0.0006350083,0.000054121127,0.00022829094],"category_scores_gemma":[0.008429453,0.00012335033,0.00013833963,0.00095289067,0.0005399699,0.0008699591,0.000070145885,0.0006646405,0.0000066673874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005018048,0.00024097225,0.0000130336275,0.000012258637,0.00016615754,0.0000055124515,0.0016890509,0.6973241,0.0007868817,0.08441121,0.002238131,0.21261089],"study_design_scores_gemma":[0.0009118325,0.0014463407,0.000009093112,0.000028310105,0.000018634519,0.00013520953,0.0042381557,0.97162944,0.001483539,0.0137078725,0.0062259245,0.00016566543],"about_ca_topic_score_codex":0.0000111707495,"about_ca_topic_score_gemma":0.0000375033,"teacher_disagreement_score":0.2743053,"about_ca_system_score_codex":0.00035616924,"about_ca_system_score_gemma":0.0012098235,"threshold_uncertainty_score":0.999923},"labels":[],"label_agreement":null},{"id":"W1606844304","doi":"","title":"General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Line search; Convergence (economics); Mathematical optimization; Independence (probability theory); Line (geometry); Forcing (mathematics); Computer science; Mathematics; Applied mathematics; Mathematical analysis; Statistics","score_opus":0.11569012925258547,"score_gpt":0.46239019056594616,"score_spread":0.3467000613133607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606844304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035132384,0.00005628579,0.9889996,0.001970296,0.000048416845,0.003447111,0.00014245458,0.0001702277,0.0016523661],"genre_scores_gemma":[0.030604566,0.00020933883,0.96312004,0.00005133049,0.00035278598,0.0005297596,0.00024115905,0.00006377921,0.0048272302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626505,0.00030044912,0.00084010774,0.0005460276,0.0012104464,0.0008379399],"domain_scores_gemma":[0.99446154,0.0007549218,0.00005872786,0.0007165673,0.0037940822,0.00021414024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029383576,0.00024750657,0.0004385286,0.000999249,0.00063975353,0.00014410795,0.00059123826,0.0002301036,0.00027702368],"category_scores_gemma":[0.001813083,0.00023716662,0.00013441539,0.0016383898,0.00036050798,0.0005486659,0.00013000227,0.00056671794,0.000010771205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033840336,0.0021336863,0.000017311915,0.00026924865,0.00017406084,0.000015540967,0.0023780733,0.527273,0.03155332,0.17071371,0.0029091653,0.2622245],"study_design_scores_gemma":[0.0009937447,0.0008818257,0.000006293866,0.00004939616,0.00001170744,0.000013477395,0.00027766114,0.908031,0.07316935,0.016034853,0.0002976641,0.00023306212],"about_ca_topic_score_codex":0.000059166625,"about_ca_topic_score_gemma":0.000029558174,"teacher_disagreement_score":0.380758,"about_ca_system_score_codex":0.00028340716,"about_ca_system_score_gemma":0.00062178326,"threshold_uncertainty_score":0.9671374},"labels":[],"label_agreement":null},{"id":"W161953739","doi":"10.1090/fic/037/08","title":"Semi-infinite linear programming approaches to semidefinite programming problems","year":2003,"lang":"en","type":"other","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Linear programming; Mathematics; Lemma (botany); Bundle; Mathematical optimization; Interior point method; Eigenvalues and eigenvectors; Discretization; Set (abstract data type); Computer science","score_opus":0.19975733824195172,"score_gpt":0.3464206764495189,"score_spread":0.1466633382075672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161953739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6240614e-7,0.00030476926,0.5055123,0.00016608993,0.00013753168,0.0041213683,0.0000274,0.0015277627,0.4882021],"genre_scores_gemma":[0.0000011147874,0.000054930002,0.5168947,0.000071394956,0.0001835259,0.0007600321,0.000059724265,0.0010728028,0.48090178],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99553347,0.00018305912,0.000807788,0.0011445626,0.001064253,0.0012668679],"domain_scores_gemma":[0.997427,0.00030438916,0.00043746186,0.0011596454,0.0001586381,0.00051289744],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007635504,0.0008416307,0.00092969334,0.00096934097,0.00014619433,0.00021003168,0.00061522087,0.0007000102,0.002561068],"category_scores_gemma":[0.0009677023,0.00075952255,0.00021557642,0.0014956442,0.000135335,0.00011162198,0.00030570017,0.00083943736,0.00079019635],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041314735,0.001720468,0.00017684346,0.0067041568,0.0010071631,0.0000948928,0.0018221913,0.0054410496,0.000011331575,0.05964162,0.62417024,0.29916874],"study_design_scores_gemma":[0.0004734666,0.00011761134,1.624153e-7,0.0006432337,0.000053908607,0.000020236235,0.00021423065,0.0029439519,0.0000535842,0.0015619384,0.9929705,0.0009471223],"about_ca_topic_score_codex":0.000040544848,"about_ca_topic_score_gemma":0.00013801428,"teacher_disagreement_score":0.36880034,"about_ca_system_score_codex":0.00016824031,"about_ca_system_score_gemma":0.0001815107,"threshold_uncertainty_score":0.9999878},"labels":[],"label_agreement":null},{"id":"W1632219083","doi":"10.1090/s0002-9947-02-03088-x","title":"The radius of metric regularity","year":2002,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":186,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Parameterized complexity; Metric (unit); Constraint (computer-aided design); Variational inequality; RADIUS; Mathematical analysis; Applied mathematics; Pure mathematics; Geometry; Combinatorics","score_opus":0.04377922803604589,"score_gpt":0.3291177231930503,"score_spread":0.28533849515700443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1632219083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008398124,0.0001242857,0.9869364,0.002024863,0.000042300042,0.00045546528,0.000024384588,0.000057106296,0.0019370773],"genre_scores_gemma":[0.49243838,0.0005723569,0.5019571,0.00006496151,0.000025134934,0.000055379485,3.7202005e-7,0.00005079564,0.0048355013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823666,0.00015699021,0.00051954424,0.00015252459,0.00066432526,0.00026994196],"domain_scores_gemma":[0.99622774,0.0022796583,0.0004027869,0.0008241568,0.0001948413,0.00007084134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509851,0.00013557296,0.00038673295,0.000033550663,0.0003446779,0.000014908745,0.00063680724,0.000044083285,0.00037521846],"category_scores_gemma":[0.00064639613,0.00007711329,0.0005516845,0.0015441856,0.0016264167,0.0000710117,0.00003387708,0.00031340364,0.000010022563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002613548,0.01236396,0.0003801657,0.0035508024,0.00526389,0.0000031616275,0.023724904,0.020307804,0.007406499,0.4970424,0.042464763,0.3872303],"study_design_scores_gemma":[0.0012054464,0.00032323803,0.00040493874,0.00013260824,0.0004627428,0.00004044539,0.005082844,0.39398417,0.016163161,0.5800249,0.0016716571,0.00050385203],"about_ca_topic_score_codex":0.000015126906,"about_ca_topic_score_gemma":0.0000020759057,"teacher_disagreement_score":0.48497927,"about_ca_system_score_codex":0.000069953436,"about_ca_system_score_gemma":0.000022796665,"threshold_uncertainty_score":0.59926},"labels":[],"label_agreement":null},{"id":"W1643070418","doi":"10.1023/a:1020300717650","title":"Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems","year":2002,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Convex hull; Complementarity (molecular biology); Euclidean space; Linear complementarity problem; Regular polygon; Lift (data mining); Compact space; Mathematical optimization; Convex set; Quadratic equation; Complementarity theory; Hull; Subderivative; Convex polytope; Convex optimization; Combinatorics; Pure mathematics; Geometry; Computer science","score_opus":0.06810240993240227,"score_gpt":0.36597795573933334,"score_spread":0.2978755458069311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1643070418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04908147,0.0035740603,0.9420658,0.001680526,0.00054884463,0.0009978792,0.000019674293,0.00006562,0.0019661514],"genre_scores_gemma":[0.38773257,0.0013575125,0.6103094,0.00005011329,0.00007939012,0.0000068260306,0.0000038933204,0.000032121883,0.00042813714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803144,0.0002820627,0.00084542105,0.00014900579,0.0005232346,0.00016881229],"domain_scores_gemma":[0.9976907,0.00016105617,0.0012268509,0.00013442343,0.0006852091,0.0001017873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059337716,0.00015025392,0.0003530496,0.0001441385,0.00008886764,0.000047377496,0.00013842141,0.00012470817,0.00014742263],"category_scores_gemma":[0.0015106078,0.00011954763,0.00007301115,0.00042654574,0.00013096056,0.0007753798,0.000045557714,0.00021163507,0.000002751915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014396672,0.00046142715,0.00038570515,0.00017944763,0.00017321549,0.000008992368,0.00095525355,0.9771908,0.00075791834,0.0131799,0.0003310891,0.006232263],"study_design_scores_gemma":[0.0022932212,0.00077485177,0.00013656111,0.0004664098,0.00008616044,0.0001483591,0.00044160525,0.9786032,0.0021708135,0.0146161085,0.00005293804,0.00020979735],"about_ca_topic_score_codex":0.0000022261777,"about_ca_topic_score_gemma":3.9184198e-7,"teacher_disagreement_score":0.3386511,"about_ca_system_score_codex":0.00026567536,"about_ca_system_score_gemma":0.000041452673,"threshold_uncertainty_score":0.48750108},"labels":[],"label_agreement":null},{"id":"W1672652176","doi":"10.48550/arxiv.0808.2316","title":"A new secant method for unconstrained optimization","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Secant method; Computer science; Mathematics; Mathematical optimization; Applied mathematics; Newton's method; Physics; Nonlinear system","score_opus":0.15538150995557581,"score_gpt":0.4243592182204488,"score_spread":0.268977708264873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1672652176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054663635,0.000096768614,0.9938789,0.0007886703,0.00045539072,0.0020384274,0.00010589124,0.0003526028,0.0017366827],"genre_scores_gemma":[0.00041172386,0.00033757908,0.9884002,0.00012806439,0.0005158436,0.0003094542,0.00028433342,0.00016832435,0.009444482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972285,0.00017276657,0.0007303966,0.0008309237,0.0004848546,0.0005525552],"domain_scores_gemma":[0.996682,0.0009835364,0.00046728275,0.0009380561,0.00063984777,0.00028929976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005237313,0.00046326584,0.00069814123,0.00028081404,0.00020832954,0.000058057452,0.0005638376,0.00050635217,0.00046594828],"category_scores_gemma":[0.0023665957,0.00046806343,0.00028807067,0.0003255842,0.00007586171,0.0001342504,0.0005453221,0.00072024704,0.000031400596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009782771,0.00015810368,0.0005486905,0.00053660397,0.00028714855,0.000024921348,0.00089316483,0.96982443,0.00008291757,0.0022551196,0.012990907,0.012300159],"study_design_scores_gemma":[0.0021544294,0.00009774597,0.00006802156,0.00023915553,0.00013858597,0.00004329714,0.00014528238,0.9532537,0.0017865222,0.036932245,0.0042442502,0.00089676876],"about_ca_topic_score_codex":0.000051889197,"about_ca_topic_score_gemma":0.000015493402,"teacher_disagreement_score":0.034677126,"about_ca_system_score_codex":0.00027692196,"about_ca_system_score_gemma":0.001067957,"threshold_uncertainty_score":0.9997771},"labels":[],"label_agreement":null},{"id":"W170763256","doi":"10.1007/978-3-0346-0436-9_3","title":"Derived Functor SemiTor","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Endomorphism; Subcategory; Homotopy; Functor; Homotopy category; Pure mathematics; Idempotence; Discrete mathematics; Combinatorics","score_opus":0.0685574022644173,"score_gpt":0.34164624816878686,"score_spread":0.27308884590436955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170763256","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024640558,0.000045962843,0.14154005,0.0001408254,0.00038984418,0.00044207514,0.000036302277,0.00028996175,0.8571125],"genre_scores_gemma":[0.000003038057,0.000061749364,0.32847422,0.00006831901,0.00040331003,0.00001325001,0.000029250026,0.00012831639,0.67081857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841666,0.000009544213,0.00034687514,0.00038721098,0.00056039175,0.0002793172],"domain_scores_gemma":[0.9981684,0.00040997978,0.0001687221,0.00071452296,0.00035578434,0.00018256548],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012503701,0.00033871716,0.00039960144,0.00015943909,0.000091034184,0.000043210828,0.00031538968,0.00064176176,0.034884762],"category_scores_gemma":[0.00035896062,0.00029290462,0.0001453988,0.000023998804,0.00012790143,0.00007673898,0.00018492421,0.00096415303,0.0014600891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025372525,0.000045862613,9.550748e-7,0.0001809001,0.0001698322,0.000050233182,0.00007979896,0.000008102861,0.0015349172,0.95204914,0.036395006,0.009459854],"study_design_scores_gemma":[0.00029997583,0.00003143091,4.746913e-7,0.000052362415,0.00003224293,0.000010515085,0.0000069333105,0.00033919793,0.0014325997,0.36430693,0.63303655,0.00045078978],"about_ca_topic_score_codex":0.0000011915059,"about_ca_topic_score_gemma":0.00002180145,"teacher_disagreement_score":0.59664154,"about_ca_system_score_codex":0.00007675017,"about_ca_system_score_gemma":0.00012064647,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W1758756115","doi":"10.1016/j.orl.2015.10.002","title":"A primal-simplex based Tardos’ algorithm","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Japan Society for the Promotion of Science","keywords":"Unimodular matrix; Simplex algorithm; Simplex; Linear programming; Dimension (graph theory); Mathematics; Revised simplex method; Algorithm; Matrix (chemical analysis); Coefficient matrix; Polynomial; Bounded function; Mathematical optimization; Computer science; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.2905634287283733,"score_gpt":0.4823722494864992,"score_spread":0.1918088207581259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758756115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061307107,0.0000488034,0.9631634,0.025497796,0.0001265854,0.0013628613,0.0000603867,0.00023546304,0.003374037],"genre_scores_gemma":[0.011806904,0.000011576294,0.98223895,0.0013876711,0.000325799,0.00054175605,0.00012549286,0.00010123339,0.003460642],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526525,0.00082152465,0.0004055885,0.00050823623,0.0020992053,0.00090017857],"domain_scores_gemma":[0.9964137,0.00062115147,0.000025660389,0.0008386937,0.0015559432,0.00054486335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028639752,0.00020466106,0.0002463589,0.0006870865,0.00057781924,0.00039029043,0.00059661176,0.00009723535,0.00073680014],"category_scores_gemma":[0.0039152405,0.00019255535,0.00007637798,0.0014546447,0.00038412274,0.00054551975,0.00023638412,0.0007587432,0.00053971086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012106961,0.0014885692,0.000116554,0.00010943906,0.00015323775,0.00033317183,0.002216625,0.30902898,0.0064778007,0.028563527,0.5954766,0.05591438],"study_design_scores_gemma":[0.0020800948,0.00014344702,0.000018221826,0.000028351025,0.000007198711,0.000014327278,0.00049433904,0.94239306,0.0026159682,0.0036977085,0.04816647,0.00034082454],"about_ca_topic_score_codex":0.00011854127,"about_ca_topic_score_gemma":0.00007712692,"teacher_disagreement_score":0.6333641,"about_ca_system_score_codex":0.0005867159,"about_ca_system_score_gemma":0.00078357506,"threshold_uncertainty_score":0.80674446},"labels":[],"label_agreement":null},{"id":"W1809956987","doi":"10.2140/memocs.2015.3.139","title":"Canonical duality theory and triality for solving general global optimization problems in complex systems","year":2015,"lang":"en","type":"article","venue":"Mathematics and Mechanics of Complex Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Otto von Guericke University Magdeburg; Universität Duisburg-Essen; Freie Universität Berlin; Bilkent Üniversitesi; Centre National de la Recherche Scientifique; University of North Carolina at Chapel Hill; Universität zu Köln; Università degli Studi di Pavia; Akademie Věd České Republiky; Université de Lyon; Universität Wien; U.S. Air Force; McGill University; Indian National Science Academy; Carnegie Mellon University; Universidad Rey Juan Carlos; University of Pittsburgh; Louisiana State University; Wayne State University; Vanderbilt University","keywords":"Triality; Duality (order theory); Global optimization; Quartic function; Optimization problem; Complex system","score_opus":0.20684842331415362,"score_gpt":0.3965757936168301,"score_spread":0.18972737030267647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809956987","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007900665,0.00045903094,0.9880171,0.000049390193,0.00021581969,0.002737398,0.00022096909,0.0000631646,0.00033649366],"genre_scores_gemma":[0.4309612,0.000080674676,0.56797034,0.000017998156,0.00016548012,0.0003786449,0.00010259369,0.00008429672,0.00023879093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996955,0.00035616124,0.001327757,0.0003809878,0.0005762123,0.00040389685],"domain_scores_gemma":[0.9971865,0.00091838354,0.00061676506,0.00042144212,0.0006160804,0.00024082536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005734943,0.00027782685,0.000983964,0.00011442967,0.00010494722,0.00015405475,0.00023126577,0.00017655567,0.0000068380873],"category_scores_gemma":[0.001721324,0.00025088753,0.00006592538,0.00026076884,0.000079782105,0.00015263371,0.00020206597,0.00011840742,4.7317053e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007196338,0.00021485149,0.00002190097,0.0025569138,0.000057101217,0.0000010594308,0.00074445206,0.08293708,0.00024372782,0.91279215,0.00026714892,0.00009164439],"study_design_scores_gemma":[0.0020176668,0.00011909687,0.000003927044,0.00017800243,0.000033279626,0.00003250352,0.0013546799,0.7804093,0.000011529719,0.21549961,0.00014190387,0.00019854355],"about_ca_topic_score_codex":0.00015117734,"about_ca_topic_score_gemma":0.000041068797,"teacher_disagreement_score":0.6974722,"about_ca_system_score_codex":0.00020570449,"about_ca_system_score_gemma":0.0001556761,"threshold_uncertainty_score":0.99999434},"labels":[],"label_agreement":null},{"id":"W1839876751","doi":"10.48550/arxiv.1510.08345","title":"A polynomial expansion line search for large-scale unconstrained minimization of smooth L2-regularized loss functions, with implementation in Apache Spark","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Line search; Conjugate gradient method; Broyden–Fletcher–Goldfarb–Shanno algorithm; Computer science; Gradient descent; Algorithm; Polynomial; Mathematical optimization; Taylor series; Line (geometry); Function (biology); Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.11017418793692546,"score_gpt":0.29583258136464785,"score_spread":0.1856583934277224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839876751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27887246,0.0000124244025,0.7186813,0.00007350621,0.00008607877,0.0016705431,0.00040936214,0.000063169806,0.00013113928],"genre_scores_gemma":[0.89968985,0.00004808516,0.09747403,0.000011471651,0.00008793155,0.000023750998,0.0012365011,0.000077714125,0.001350665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976834,0.00027799138,0.0005106853,0.0007850728,0.00027734513,0.00046550413],"domain_scores_gemma":[0.9974046,0.00031789616,0.0004386354,0.0006446318,0.0010205824,0.00017368078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087445986,0.00033074894,0.0005744838,0.0006818607,0.000114654635,0.00003389313,0.0003600755,0.0003304665,0.00012893438],"category_scores_gemma":[0.0001556694,0.00035229287,0.00013174991,0.0008937788,0.00016156948,0.00026530868,0.00037535257,0.00044690745,0.0000036575404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037177883,0.0009912641,0.0082432525,0.00089132256,0.00025038602,0.000048788344,0.0019785753,0.9768383,0.00028230168,0.0041492265,0.0013456903,0.0012630915],"study_design_scores_gemma":[0.014993749,0.00043843035,0.0003511249,0.00028300346,0.00025359917,0.0000046034593,0.008418861,0.96439517,0.002009012,0.007977412,0.00021192081,0.00066314114],"about_ca_topic_score_codex":0.00012121522,"about_ca_topic_score_gemma":0.00074761204,"teacher_disagreement_score":0.6212073,"about_ca_system_score_codex":0.00054785423,"about_ca_system_score_gemma":0.00092859805,"threshold_uncertainty_score":0.9998929},"labels":[],"label_agreement":null},{"id":"W1844489214","doi":"","title":"BEYOND NEWTON: ROBUST METHODS FOR SOLVING LARGE NONLINEAR MODELS IN TROLL","year":2000,"lang":"en","type":"article","venue":"Computing in Economics and Finance","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Jacobian matrix and determinant; Newton's method in optimization; Newton's method; Krylov subspace; Quasi-Newton method; Robustness (evolution); Nonlinear system; Mathematical optimization; Computer science; Solver; Mathematics; Residual; Local convergence; Iterative method; Applied mathematics; Algorithm","score_opus":0.052894842713107355,"score_gpt":0.36351526098238934,"score_spread":0.310620418269282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844489214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11880724,0.00032072156,0.879276,0.00018095247,0.00005984429,0.00034691166,0.00001390799,0.000017656283,0.0009768101],"genre_scores_gemma":[0.0076843644,0.0017507357,0.9897812,0.00007796823,0.00006160314,0.000015571102,0.000005526512,0.000030001562,0.000593021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988846,0.00002906249,0.0004020632,0.00031239036,0.00002347155,0.00034842012],"domain_scores_gemma":[0.9991664,0.0005128854,0.00008710091,0.00017779482,0.00002906456,0.000026746891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299448,0.00011943954,0.00030204217,0.00009694293,0.000084747,0.000040230967,0.00014136135,0.00007731675,0.000008349879],"category_scores_gemma":[0.000098466844,0.00014044497,0.000035279736,0.00011562068,0.000029493158,0.00016336495,0.000069922105,0.00016230295,0.0000011829621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001805871,0.000051704785,0.00007248912,0.000019301715,0.000002621454,8.374262e-7,0.0002846666,0.8298344,0.000001057601,0.030901507,0.000017478196,0.13879588],"study_design_scores_gemma":[0.001061834,0.000018782797,0.000052633524,0.000029154935,0.0000012644251,0.0000022056986,0.000023547711,0.88746136,0.000019703284,0.108040884,0.0031595996,0.00012902246],"about_ca_topic_score_codex":0.0000048541533,"about_ca_topic_score_gemma":0.000039844523,"teacher_disagreement_score":0.13866687,"about_ca_system_score_codex":0.00006546822,"about_ca_system_score_gemma":0.000047766986,"threshold_uncertainty_score":0.57271796},"labels":[],"label_agreement":null},{"id":"W188153157","doi":"10.1007/978-1-4419-0158-3_22","title":"Mean Value Theorems for the Scalar Derivative and Applications","year":2009,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Scalar (mathematics); Mathematics; Applied mathematics; Derivative (finance); Mean value; Pure mathematics; Mathematical economics; Calculus (dental); Mathematical optimization; Algebra over a field; Statistics; Economics; Geometry; Medicine","score_opus":0.03913170960105142,"score_gpt":0.32369619721098886,"score_spread":0.28456448760993747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188153157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.4707876e-7,0.0023343305,0.9441889,0.0013824092,0.000019917907,0.005609196,0.00014915748,0.0001673203,0.046148527],"genre_scores_gemma":[0.00023744119,0.0220601,0.7011688,0.00073945883,0.0007973053,0.007460349,0.00045306122,0.00038263577,0.2667009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981886,0.000024700435,0.00051444845,0.0006658583,0.00032319737,0.00028320026],"domain_scores_gemma":[0.9971182,0.0010669553,0.0003738714,0.00064173393,0.0006289033,0.00017037227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003501311,0.0003983976,0.00037133135,0.00019798413,0.000879221,0.00015535834,0.00033266362,0.00028957298,0.00014824796],"category_scores_gemma":[0.00012821602,0.00033167208,0.00009543932,0.0001619308,0.00026190624,0.00015695348,0.00014765005,0.00034842239,0.000014507631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000765512,0.00003284761,3.0761765e-7,0.00007669456,0.00007635571,9.1586784e-8,0.00011273818,0.015833816,0.0000073608544,0.95380294,0.00020903687,0.02984014],"study_design_scores_gemma":[0.0005097784,0.000042352913,0.0000032996115,0.00006163213,0.00022175982,0.000008637602,0.00007451611,0.21161793,0.000061066414,0.3610281,0.42587218,0.00049875944],"about_ca_topic_score_codex":8.473913e-7,"about_ca_topic_score_gemma":0.0000030977071,"teacher_disagreement_score":0.59277487,"about_ca_system_score_codex":0.00007619391,"about_ca_system_score_gemma":0.000079459605,"threshold_uncertainty_score":0.9999135},"labels":[],"label_agreement":null},{"id":"W1919130806","doi":"10.1287/opre.2015.1427","title":"Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Stadium; Mathematical optimization; Norm (philosophy); Computer science; Optimization problem; Set (abstract data type); Mathematics; Algorithm","score_opus":0.4458326972844299,"score_gpt":0.4791435195208626,"score_spread":0.03331082223643267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919130806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073657406,0.00006846668,0.9769226,0.0013798644,0.00006315001,0.0019484569,0.000008746212,0.00010261861,0.018769544],"genre_scores_gemma":[0.002593069,0.000051987143,0.948687,0.000051781033,0.00025472857,0.0002546689,0.000045346675,0.00007039605,0.047991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632883,0.00063090696,0.00042348535,0.000600705,0.0013324893,0.0006835875],"domain_scores_gemma":[0.9962744,0.00041004192,0.000026957956,0.00068026263,0.0017130021,0.0008953509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036705977,0.00019965069,0.00025412577,0.00066305697,0.0005453146,0.0006281607,0.000433923,0.00013813625,0.00019429043],"category_scores_gemma":[0.0066681188,0.00018840733,0.000029541197,0.0014232411,0.00013978103,0.00063090597,0.00040747787,0.0005251252,0.00024136998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008054016,0.0002292705,0.000011658242,0.000024766397,0.000021321703,0.0000033466922,0.0034367256,0.95958596,0.000085297455,0.009575849,0.020721532,0.006223725],"study_design_scores_gemma":[0.0009733282,0.00024665703,0.0000064742567,0.000021144018,0.0000071184386,0.00001897779,0.0020269053,0.9895539,0.00037854657,0.0027869525,0.0037427994,0.00023719697],"about_ca_topic_score_codex":0.00021510271,"about_ca_topic_score_gemma":0.000050569248,"teacher_disagreement_score":0.029967934,"about_ca_system_score_codex":0.00033013115,"about_ca_system_score_gemma":0.0010016549,"threshold_uncertainty_score":0.7982843},"labels":[],"label_agreement":null},{"id":"W1925813256","doi":"10.1007/s11081-015-9283-0","title":"Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Convergence (economics); Algorithm; Benchmark (surveying); Mathematical optimization; Adaptive mesh refinement; Scale (ratio); Computational science; Mathematics","score_opus":0.047452642848286604,"score_gpt":0.323116341158649,"score_spread":0.2756636983103624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925813256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015303366,0.000104593324,0.99814445,0.00018043359,0.00008565674,0.0007439996,0.000015189683,0.0001156547,0.00045698835],"genre_scores_gemma":[0.006845132,0.00016453148,0.9924545,0.000034194403,0.00004513442,0.00013822266,0.00006200292,0.00006061607,0.00019561208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866605,0.00007636919,0.00029799953,0.00027845593,0.00034657223,0.00033452897],"domain_scores_gemma":[0.9989243,0.00043914025,0.00005348928,0.00019904104,0.00026835786,0.00011563435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092871505,0.00018369322,0.00021564288,0.0002596577,0.00010051758,0.000106168496,0.0001672454,0.00009866381,0.000016027268],"category_scores_gemma":[0.00055385265,0.00015927631,0.000037997277,0.0006071398,0.000036674483,0.0003138495,0.00005212882,0.00018364353,0.0000013071144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011649639,0.00003428194,0.0000048871534,0.000026089312,0.000012659432,0.0000021194087,0.0010280154,0.99487454,0.000002492186,0.00074916193,0.00005464783,0.0031994337],"study_design_scores_gemma":[0.00092070666,0.00005089762,0.0000058610053,0.000040243343,0.0000123223,0.000008499769,0.0010010729,0.9974958,0.000023320566,0.00016963648,0.00008813206,0.00018353846],"about_ca_topic_score_codex":0.0000050701296,"about_ca_topic_score_gemma":0.0000020485595,"teacher_disagreement_score":0.0066920985,"about_ca_system_score_codex":0.00013888266,"about_ca_system_score_gemma":0.00005174293,"threshold_uncertainty_score":0.64950997},"labels":[],"label_agreement":null},{"id":"W195213513","doi":"","title":"New adaptive interior point algorithms for linear optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Mathematics; Interior point method; Mathematical optimization; Perspective (graphical); Point (geometry); Predictor–corrector method","score_opus":0.06420078197670895,"score_gpt":0.36723760047713216,"score_spread":0.3030368185004232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195213513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015152378,0.000023994913,0.99246186,0.00042208369,0.00011186053,0.00086440274,0.00001941508,0.00025299427,0.005828224],"genre_scores_gemma":[0.00025663234,0.000008506914,0.9631017,0.00006675423,0.00036289298,0.00007507536,0.000047637182,0.00006407814,0.036016718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986746,0.00003125616,0.00038484987,0.0003064763,0.00027495914,0.00032787563],"domain_scores_gemma":[0.9988182,0.0003156752,0.00011290285,0.0002623927,0.00038128556,0.00010952473],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019710344,0.00017630661,0.0002240699,0.00014334908,0.00010255118,0.000045905384,0.00018036163,0.000094343006,0.0010763258],"category_scores_gemma":[0.00027195227,0.00015863824,0.000095807365,0.0002712009,0.000034679375,0.00027816393,0.00007518766,0.0001078425,0.00003526752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023611984,0.00021692015,0.000011459053,0.00005915421,0.000072840456,0.0000069685907,0.00021031851,0.75885147,0.00020906539,0.13827743,0.06548849,0.03635977],"study_design_scores_gemma":[0.001077393,0.0001395052,0.0000020026598,0.00001823477,0.000013420902,0.000005598315,0.00012304075,0.9448446,0.002896576,0.04869163,0.001988096,0.00019987627],"about_ca_topic_score_codex":0.00006172238,"about_ca_topic_score_gemma":0.000025812049,"teacher_disagreement_score":0.18599315,"about_ca_system_score_codex":0.000118409174,"about_ca_system_score_gemma":0.000097246404,"threshold_uncertainty_score":0.9998368},"labels":[],"label_agreement":null},{"id":"W1961233311","doi":"10.1109/mwscas.1993.343095","title":"PCG techniques for interior point algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjugate gradient method; Bottleneck; Computer science; Simplex algorithm; Algorithm; Point (geometry); Simplex; Interior point method; Focus (optics); Mathematical optimization; Linear programming; Mathematics; Combinatorics; Geometry","score_opus":0.10298550714437125,"score_gpt":0.38974340700377264,"score_spread":0.28675789985940137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1961233311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040021114,0.000029003791,0.9775092,0.0011985252,0.00005397232,0.0007596008,0.000011867191,0.000491482,0.019906346],"genre_scores_gemma":[0.0010496001,0.000049115657,0.9621551,0.00020050506,0.00010057306,0.00026950127,0.0000037170776,0.000047356403,0.03612452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899787,0.000022531869,0.00026633978,0.00022375211,0.00020358076,0.0002859231],"domain_scores_gemma":[0.9990427,0.00028899233,0.000057545865,0.00030771625,0.00021789502,0.000085171116],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020889689,0.0001263489,0.00017919169,0.000121229765,0.00008130721,0.000042614236,0.00020350801,0.00007162147,0.0030127417],"category_scores_gemma":[0.000605872,0.0001064251,0.00007997101,0.00016349266,0.00005157221,0.00017965157,0.000084093364,0.000105587475,0.000082096325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037990627,0.00046467278,0.000014768618,0.00024764964,0.00008884567,0.0000147204255,0.00093964377,0.000020563424,0.002086128,0.09685454,0.20945147,0.68977904],"study_design_scores_gemma":[0.001352946,0.00053480006,0.000004392081,0.00008551632,0.000024791569,0.00005168263,0.00052487495,0.5772483,0.08403679,0.21923451,0.116183825,0.00071757386],"about_ca_topic_score_codex":0.0000020641342,"about_ca_topic_score_gemma":0.0000027938331,"teacher_disagreement_score":0.68906146,"about_ca_system_score_codex":0.00007012043,"about_ca_system_score_gemma":0.0000073845945,"threshold_uncertainty_score":0.99789864},"labels":[],"label_agreement":null},{"id":"W1964191135","doi":"10.1007/s10107-005-0578-3","title":"Cuts for mixed 0-1 conic programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Conic section; Semidefinite programming; Mathematics; Conic optimization; Linear programming; Mathematical optimization; Convex optimization; Rank (graph theory); Regular polygon; Travelling salesman problem; Quadratic programming; Combinatorics; Convex analysis; Geometry","score_opus":0.07451220809616238,"score_gpt":0.3946342440206426,"score_spread":0.32012203592448024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964191135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016921122,0.000102784375,0.9917245,0.0010560025,0.00007200777,0.002863476,0.0000059824843,0.00070290605,0.0017802503],"genre_scores_gemma":[0.019140715,0.000004692783,0.97569674,0.000061957195,0.0002874973,0.001320111,0.00001678548,0.00012686833,0.0033446325],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970057,0.000071353104,0.000784331,0.0004963445,0.0006166788,0.0010255857],"domain_scores_gemma":[0.99715734,0.0014991327,0.0002010776,0.0005315829,0.00031576958,0.00029510455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010980254,0.00032652964,0.0005138793,0.00015173695,0.00030027356,0.00021396,0.0004046592,0.00017183178,0.0002764963],"category_scores_gemma":[0.0032333578,0.0002897106,0.00023261787,0.0003994654,0.00018959661,0.00031162202,0.00015262696,0.00030309125,0.00019987636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003514439,0.0007814572,0.0000105766085,0.00077349844,0.00007887822,0.0000057119755,0.0006329665,0.0001268925,0.00007196245,0.24509291,0.00128172,0.7511083],"study_design_scores_gemma":[0.0028713937,0.00037922704,0.0000030773974,0.0003190445,0.00013998363,0.000085558386,0.00090380036,0.18147968,0.0031019333,0.4314977,0.37820217,0.0010164359],"about_ca_topic_score_codex":6.302417e-7,"about_ca_topic_score_gemma":0.000005954297,"teacher_disagreement_score":0.75009185,"about_ca_system_score_codex":0.00017306596,"about_ca_system_score_gemma":0.00006980983,"threshold_uncertainty_score":0.9999555},"labels":[],"label_agreement":null},{"id":"W1964424570","doi":"10.1016/j.laa.2004.12.010","title":"Strengthened existence and uniqueness conditions for search directions in semidefinite programming","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Uniqueness; Symmetrization; Semidefinite programming; Kronecker product; Product (mathematics); Matrix (chemical analysis); Positive-definite matrix; Applied mathematics; Linearization; Combinatorics; Kronecker delta; Mathematical optimization; Mathematical analysis; Nonlinear system","score_opus":0.06015745574374392,"score_gpt":0.3869559617439813,"score_spread":0.32679850600023735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964424570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20853055,0.0022554959,0.7684295,0.007896372,0.0000442819,0.009127506,0.0006461787,0.0006671333,0.0024029731],"genre_scores_gemma":[0.22065927,0.0015100957,0.76944435,0.00013333544,0.0002117482,0.005216673,0.00019838345,0.0000750494,0.002551112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905,0.000037238304,0.000260053,0.00028930776,0.00012027794,0.00024311808],"domain_scores_gemma":[0.99873585,0.0007178863,0.00004915633,0.00018743235,0.0001964062,0.00011324986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000221456,0.00011303726,0.00014902127,0.00016808686,0.00031486453,0.00004636,0.00009340974,0.00007079924,0.000022865312],"category_scores_gemma":[0.0002018701,0.00011546476,0.000024470099,0.00045164142,0.00009023954,0.0001865922,0.000056163146,0.00014989798,0.0000065290037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015124122,0.00036042515,0.00022365409,0.00019338763,0.000027691807,5.220664e-7,0.0008259875,0.0005767464,0.00080765027,0.8904839,0.000051314422,0.10643358],"study_design_scores_gemma":[0.0033151319,0.00019880287,0.0012015725,0.00019322634,0.00009830884,0.000056167795,0.0020953512,0.56910074,0.010077343,0.21991788,0.19270775,0.0010377109],"about_ca_topic_score_codex":0.000007345167,"about_ca_topic_score_gemma":0.000077939854,"teacher_disagreement_score":0.670566,"about_ca_system_score_codex":0.000036250593,"about_ca_system_score_gemma":0.000045878296,"threshold_uncertainty_score":0.47085163},"labels":[],"label_agreement":null},{"id":"W1964916956","doi":"10.1007/s10589-012-9480-0","title":"Strong duality and minimal representations for cone optimization","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Second-order cone programming; Strong duality; Duality (order theory); Mathematics; Complementarity (molecular biology); Mathematical optimization; Conic optimization; Interior point method; Weak duality; Duality gap; Cone (formal languages); Linear programming; Linear complementarity problem; Preprocessor; Complementarity theory; Semidefinite programming; Wolfe duality; Optimization problem; Algorithm; Discrete mathematics; Convex optimization; Computer science; Convex analysis; Nonlinear system; Geometry","score_opus":0.08166275618822488,"score_gpt":0.4123049513317906,"score_spread":0.33064219514356574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964916956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022897904,0.00018622365,0.99609464,0.0008065303,0.000039185426,0.0014986685,0.00015080725,0.00013609332,0.0008588812],"genre_scores_gemma":[0.033975843,0.000094434334,0.96340907,0.00013565584,0.00019089665,0.0009706763,0.0007519138,0.00004213939,0.00042936884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859273,0.000074034906,0.0004463624,0.0003427954,0.00025821285,0.0002858674],"domain_scores_gemma":[0.9978057,0.0010399467,0.00020667302,0.0001922238,0.0005200482,0.00023540195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562793,0.0001765682,0.0002004598,0.00016552856,0.000542738,0.00010094187,0.00008910635,0.00008962782,0.00011570979],"category_scores_gemma":[0.00033041378,0.0001933436,0.000040445648,0.00036658972,0.00017904153,0.00054804166,0.000077666395,0.00009693805,0.0000032841456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116427445,0.00012999648,0.0003655537,0.00005169181,0.00001880862,3.8594813e-8,0.00015216095,0.776034,0.0000037916348,0.22166933,0.00033089262,0.0012321159],"study_design_scores_gemma":[0.000910181,0.00002397487,0.00040337307,0.000009218244,0.000045444835,0.00001330899,0.0002990612,0.9798628,0.000017854083,0.017052991,0.0011440483,0.0002177219],"about_ca_topic_score_codex":0.0000019798963,"about_ca_topic_score_gemma":6.578516e-7,"teacher_disagreement_score":0.20461634,"about_ca_system_score_codex":0.0000498548,"about_ca_system_score_gemma":0.000054202806,"threshold_uncertainty_score":0.7884323},"labels":[],"label_agreement":null},{"id":"W1965094948","doi":"10.1007/s10107-006-0039-7","title":"Reduction of symmetric semidefinite programs using the regular $$\\ast$$ -representation","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":129,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Semidefinite programming; Centralizer and normalizer; Bipartite graph; Matrix (chemical analysis); Order (exchange); Permutation (music); Permutation matrix; Permutation group; Upper and lower bounds; Discrete mathematics; Physics; Graph; Mathematical analysis","score_opus":0.09965246932807036,"score_gpt":0.37624818502799634,"score_spread":0.27659571569992597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965094948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07573354,0.00014486234,0.91992193,0.00020370678,0.00007750762,0.0017646583,0.0000020431191,0.00024882954,0.0019028939],"genre_scores_gemma":[0.24857534,0.000004417847,0.7505432,0.0000034855411,0.00013973918,0.00012595538,0.00001605857,0.00006224291,0.00052959385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973404,0.00018091012,0.00082383084,0.00031713114,0.0008791568,0.00045859755],"domain_scores_gemma":[0.9980587,0.00056346954,0.00039423216,0.0005544813,0.00035889415,0.00007025279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694235,0.00020953207,0.00036044535,0.0002435317,0.00022461006,0.00011506691,0.00027831356,0.00011287092,0.000054897926],"category_scores_gemma":[0.0010505528,0.00015244124,0.0001590073,0.0018064156,0.00032322368,0.0002357194,0.00012389294,0.00025374664,0.00001315495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045956698,0.0015406371,0.0002962991,0.0010498276,0.0001155104,0.000011633661,0.0008769238,0.0048444583,0.003333939,0.8266974,0.00016202539,0.1610254],"study_design_scores_gemma":[0.0005133846,0.00009133584,0.000017214717,0.00021601278,0.00011348248,0.00011268603,0.0012838147,0.147995,0.006270287,0.8427826,0.0003397434,0.00026442003],"about_ca_topic_score_codex":0.000033812077,"about_ca_topic_score_gemma":0.0000018108941,"teacher_disagreement_score":0.1728418,"about_ca_system_score_codex":0.000105810366,"about_ca_system_score_gemma":0.00003964121,"threshold_uncertainty_score":0.62163734},"labels":[],"label_agreement":null},{"id":"W1965468942","doi":"10.1007/s10898-008-9371-1","title":"A new Lagrangean approach to the pooling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Mathematical optimization; Benchmark (surveying); Pooling; Relaxation (psychology); Nonlinear system; Upper and lower bounds; Set (abstract data type); Bilinear interpolation; Function (biology); Nonlinear programming; Applied mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.05188978761513707,"score_gpt":0.33284879822323504,"score_spread":0.28095901060809797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965468942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035830075,0.00012792477,0.9904181,0.0014883459,0.000110469235,0.00035065095,0.0000038534945,0.000029680881,0.0071126977],"genre_scores_gemma":[0.007320197,0.000106200525,0.9914454,0.00018345621,0.00034387922,0.0000036948848,0.0000025056963,0.000021039297,0.000573578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828726,0.000098561024,0.0005320116,0.0001317133,0.0007128288,0.00023761096],"domain_scores_gemma":[0.9984589,0.00008409513,0.0003739749,0.00020129414,0.00065657153,0.00022513859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046494804,0.00013210291,0.00023073627,0.00008300699,0.00019553682,0.00005352538,0.00038592308,0.00006566456,0.000045714947],"category_scores_gemma":[0.0006246684,0.000089513014,0.000101395635,0.0009457144,0.000028516875,0.00033089594,0.0000662593,0.00020235793,0.000010184815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057979167,0.000086608336,0.00012057625,0.000009861842,0.00003226848,0.0000079206475,0.00036761077,0.9757482,0.0000026964872,0.0036916547,0.018116834,0.0017577811],"study_design_scores_gemma":[0.003523803,0.0005445738,0.0004602924,0.00016689225,0.00014153225,0.003119016,0.0007539309,0.96135926,0.000086478816,0.017464977,0.011799119,0.00058014755],"about_ca_topic_score_codex":0.0000083607965,"about_ca_topic_score_gemma":0.0000030274598,"teacher_disagreement_score":0.014388972,"about_ca_system_score_codex":0.00024187165,"about_ca_system_score_gemma":0.00026887562,"threshold_uncertainty_score":0.36502346},"labels":[],"label_agreement":null},{"id":"W1965523840","doi":"10.1007/s10732-007-9021-7","title":"Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Intersection (aeronautics); Integer programming; Convexity; Heuristic; Integer (computer science); Mathematical optimization; Linear programming; Software; Computer science; Mathematics; Function (biology); Algorithm; Programming language","score_opus":0.05059042372315479,"score_gpt":0.4014260918634955,"score_spread":0.3508356681403407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965523840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006391054,0.00031464305,0.99228513,0.00017476834,0.00031654793,0.00032347877,0.000011690887,0.000022636126,0.00016007246],"genre_scores_gemma":[0.11033377,0.00013909992,0.8882363,0.00004871054,0.0004655911,0.000005820544,0.0000025689699,0.000057662062,0.0007104848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823254,0.0000427229,0.0007711756,0.00013527206,0.00044815574,0.00037010433],"domain_scores_gemma":[0.99611735,0.0019859446,0.00050697965,0.00015333941,0.0010064103,0.00022997141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015325367,0.0001540312,0.00035119054,0.00024007958,0.00012804804,0.00006545747,0.00018772973,0.00008548622,0.000016180331],"category_scores_gemma":[0.0072534396,0.00012778577,0.00009778499,0.00019488948,0.000116332056,0.0001272249,0.00007407343,0.00035826,0.0000018719585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046171825,0.004732873,0.0073604076,0.0053262524,0.0016304132,0.002849807,0.008662695,0.002653894,0.0011991521,0.16281241,0.11059711,0.6875578],"study_design_scores_gemma":[0.016647479,0.005751271,0.0020376183,0.001457624,0.001168932,0.004603512,0.0071767103,0.09180707,0.005537021,0.5702987,0.29124513,0.0022689914],"about_ca_topic_score_codex":7.495773e-7,"about_ca_topic_score_gemma":0.0000057283464,"teacher_disagreement_score":0.6852888,"about_ca_system_score_codex":0.00008780206,"about_ca_system_score_gemma":0.00007844516,"threshold_uncertainty_score":0.8683569},"labels":[],"label_agreement":null},{"id":"W1966613145","doi":"10.3329/dujs.v60i2.11487","title":"A Computer Technique for Solving LP Problems with Bounded Variables","year":2012,"lang":"en","type":"article","venue":"Dhaka University Journal of Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bounded function; Linear programming; Code (set theory); Simplex algorithm; Simplex; Basis (linear algebra); Mathematics; Matrix (chemical analysis); Mathematical optimization; Computer science; Algorithm; Combinatorics; Programming language; Mathematical analysis; Geometry","score_opus":0.04193085280311634,"score_gpt":0.301897833840958,"score_spread":0.25996698103784166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966613145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007674325,0.000012133266,0.99146336,0.00008919279,0.000064719236,0.00028083887,0.0000022203276,0.000013767125,0.0003994207],"genre_scores_gemma":[0.06080886,0.000011047299,0.93881905,0.0000139252525,0.000060359635,5.014589e-7,1.7362777e-7,0.0000070597725,0.00027899936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989669,0.000021215483,0.0001355471,0.000099501965,0.00045782325,0.0003190232],"domain_scores_gemma":[0.99842787,0.0002134071,0.00024413438,0.00011636463,0.00082061335,0.00017762271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014515129,0.000071157956,0.00013879617,0.00032187763,0.00039042707,0.000048691243,0.0004729823,0.000030266083,0.000018638844],"category_scores_gemma":[0.00016589349,0.00005777545,0.000035646182,0.00066186645,0.0005203369,0.0014829047,0.000103590544,0.0001504278,8.0638944e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016884955,0.004105805,0.01494221,0.0015453701,0.00053320196,0.00024949727,0.03910526,0.06375475,0.16729458,0.6771264,0.0093725575,0.020281864],"study_design_scores_gemma":[0.027039152,0.009466887,0.0039225025,0.004981943,0.00077148003,0.0079365345,0.028338872,0.3562248,0.19767253,0.26526064,0.09371491,0.004669773],"about_ca_topic_score_codex":0.0000018774155,"about_ca_topic_score_gemma":9.461215e-7,"teacher_disagreement_score":0.4118658,"about_ca_system_score_codex":0.00023021089,"about_ca_system_score_gemma":0.00031841197,"threshold_uncertainty_score":0.3002889},"labels":[],"label_agreement":null},{"id":"W1966702992","doi":"10.3934/jimo.2010.6.411","title":"Nonsmooth generalized complementarity asunconstrained optimization","year":2010,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Complementarity (molecular biology); Differentiable function; Mathematics; Generalization; Complementarity theory; Mathematical optimization; Property (philosophy); Applied mathematics; Pure mathematics; Mathematical economics; Mathematical analysis; Physics","score_opus":0.08803819120453164,"score_gpt":0.3480262621901413,"score_spread":0.25998807098560966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966702992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003050931,0.000013149434,0.9924667,0.0009858422,0.00071641157,0.00061404466,0.000010175124,0.000037348622,0.0021054214],"genre_scores_gemma":[0.0055212863,0.00043130145,0.99304175,0.00009595355,0.00043771538,0.0000112180705,0.000034481778,0.000030752737,0.0003955156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981696,0.00011069864,0.0007724514,0.00018677434,0.0005304766,0.0002300152],"domain_scores_gemma":[0.99846584,0.00013190076,0.0006367907,0.00018312724,0.00042178066,0.00016058987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097001484,0.00018140233,0.0003095697,0.0003836077,0.00018337985,0.00013243343,0.0002079221,0.00014190887,0.00084450975],"category_scores_gemma":[0.00040699905,0.00015908145,0.00007563572,0.00039741825,0.00010061249,0.00051472307,0.00011109294,0.0004416917,9.2747064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021039559,0.00025090724,0.00032569584,0.0000397322,0.00018829363,0.000020855477,0.00008591225,0.9548134,0.00006468504,0.02534689,0.0043921177,0.014261103],"study_design_scores_gemma":[0.0123765925,0.00034890318,0.000039231414,0.0001198676,0.00030595963,0.00010612739,0.00046834204,0.9710048,0.00026537012,0.0074166115,0.007065829,0.00048241077],"about_ca_topic_score_codex":0.0000060629072,"about_ca_topic_score_gemma":0.000008422502,"teacher_disagreement_score":0.017930279,"about_ca_system_score_codex":0.00006262301,"about_ca_system_score_gemma":0.00006950336,"threshold_uncertainty_score":0.9246789},"labels":[],"label_agreement":null},{"id":"W1967710355","doi":"10.1080/02331930600711968","title":"Characterization of convexifiable functions","year":2006,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Convex function; Concave function; Class (philosophy); Function (biology); Convex analysis; Transformation (genetics); Linear programming; Analytic function; Pure mathematics; Regular polygon; Characterization (materials science); Convex optimization; Discrete mathematics; Applied mathematics; Mathematical optimization; Computer science","score_opus":0.02564100181370066,"score_gpt":0.2985124660899341,"score_spread":0.27287146427623343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967710355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006579002,0.0000067844026,0.98336786,0.00009376421,0.00010159692,0.00028746412,0.00002814982,0.00011414828,0.009421253],"genre_scores_gemma":[0.11159599,0.00004858203,0.8606466,0.000033837106,0.00021056831,0.000086651664,0.0012341418,0.000088704845,0.026054943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.00004691166,0.00034986928,0.00016736818,0.00026015117,0.0001581564],"domain_scores_gemma":[0.99906063,0.000081271115,0.0002050642,0.00022402892,0.00039727587,0.000031746535],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014535268,0.000097711374,0.0001515453,0.00016407012,0.000093896924,0.000022891638,0.0000849466,0.000073081545,0.0009245041],"category_scores_gemma":[0.00014418905,0.00010174286,0.000038014252,0.0005340105,0.000053510477,0.00031015222,0.000026302308,0.000065199856,0.00001836781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002487008,0.00024592454,0.0004075846,0.000061336075,0.0000147709725,8.0800817e-7,0.00004610209,0.94720846,0.020003557,0.030546885,0.00078718376,0.00065251667],"study_design_scores_gemma":[0.0007345351,0.00005020829,0.0002867845,0.000029656281,0.00002666344,0.000004342072,0.00004366266,0.9677224,0.02167141,0.007495087,0.0017234951,0.0002117402],"about_ca_topic_score_codex":0.000012517343,"about_ca_topic_score_gemma":0.0000025658273,"teacher_disagreement_score":0.122721255,"about_ca_system_score_codex":0.00004560106,"about_ca_system_score_gemma":0.00004021761,"threshold_uncertainty_score":0.9999888},"labels":[],"label_agreement":null},{"id":"W1968883268","doi":"10.1016/j.apnum.2011.01.009","title":"Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs","year":2011,"lang":"en","type":"article","venue":"Applied Numerical Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Discretization; Pointwise; Regular polygon; Ode; Interval (graph theory); Concave function; Applied mathematics; Parametric statistics; A priori and a posteriori; Mathematical analysis; Effective domain; Convex analysis; Mathematical optimization; Convex optimization; Geometry; Combinatorics","score_opus":0.1574194218886259,"score_gpt":0.32554329590807973,"score_spread":0.16812387401945383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968883268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088329235,0.000029459727,0.97867745,0.00005696065,0.000039330247,0.0016524235,0.000063310756,0.000065293054,0.018532505],"genre_scores_gemma":[0.36387637,0.000009002248,0.63550067,0.000014958109,0.000014633318,0.00030719046,0.000007514743,0.000046895675,0.00022275513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978145,0.00006275172,0.0009273252,0.0002721968,0.0005316707,0.0003915989],"domain_scores_gemma":[0.9960104,0.0019378149,0.00078899093,0.0008404893,0.00032170533,0.0001005841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005295336,0.00022701413,0.0006062578,0.00015819009,0.00019241069,0.000010355199,0.0006121847,0.0001551539,0.000089742156],"category_scores_gemma":[0.0021566153,0.00015935102,0.00024200606,0.0011923217,0.0005066048,0.00006828471,0.00022827882,0.0002480364,0.0000073905935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028467823,0.0011848329,0.000025291814,0.00051827135,0.00012431349,9.5730535e-8,0.0027864033,0.0006758817,0.0003125521,0.99322546,0.00030789612,0.00081051694],"study_design_scores_gemma":[0.0009532159,0.00011339096,0.000094749026,0.00004701221,0.0002109309,0.0000056747926,0.0026316922,0.17064051,0.007289982,0.8176291,0.000081384824,0.00030236336],"about_ca_topic_score_codex":0.0000058811675,"about_ca_topic_score_gemma":3.6922185e-7,"teacher_disagreement_score":0.3629931,"about_ca_system_score_codex":0.000059956255,"about_ca_system_score_gemma":0.00007771161,"threshold_uncertainty_score":0.6498146},"labels":[],"label_agreement":null},{"id":"W1969129923","doi":"10.1137/s1052623499358586","title":"Robust Filtering via Semidefinite Programming with Applications to Target Tracking","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Bounded function; Interior point method; Mathematical optimization; Upper and lower bounds; Robustness (evolution); Mathematics; Norm (philosophy); Robust optimization; Semidefinite embedding; Computer science; Algorithm; Quadratically constrained quadratic program","score_opus":0.09482905424110503,"score_gpt":0.326649580935868,"score_spread":0.23182052669476294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969129923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010113987,0.000054450098,0.9961119,0.00060923485,0.000057179648,0.0007668628,0.000004647491,0.00016445204,0.0021301322],"genre_scores_gemma":[0.0049695363,0.00010060383,0.9932923,0.00016668385,0.00023426741,0.0001473151,0.0000144557225,0.000100293924,0.00097459246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802065,0.0000880849,0.00048225277,0.0003143803,0.00064074184,0.0004539077],"domain_scores_gemma":[0.9983833,0.000196216,0.0002908955,0.00030911498,0.0005203909,0.00030008054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000370152,0.00023384273,0.00023965034,0.0004150564,0.0005055925,0.00029688503,0.00025393814,0.0000849497,0.00079029414],"category_scores_gemma":[0.0002835185,0.00020570637,0.00006226778,0.00096176955,0.000036401198,0.0005086901,0.000043877084,0.0004700983,0.00006349534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027203223,0.00016565151,0.000026582344,0.000026191592,0.000026824313,0.000024818402,0.0003387669,0.9747135,0.00003561764,0.00070937315,0.00022688069,0.023678595],"study_design_scores_gemma":[0.0008079245,0.00035754347,0.0000071826303,0.00020228607,0.000024659186,0.00047542798,0.00018405043,0.98802835,0.00031612298,0.0011675918,0.0080286255,0.0004002626],"about_ca_topic_score_codex":5.1388264e-7,"about_ca_topic_score_gemma":0.0000010774855,"teacher_disagreement_score":0.023278331,"about_ca_system_score_codex":0.00021823094,"about_ca_system_score_gemma":0.000026056636,"threshold_uncertainty_score":0.8653167},"labels":[],"label_agreement":null},{"id":"W1970022960","doi":"10.1016/j.mcm.2006.01.023","title":"Solving a nonlinear integer program for allocating resources","year":2006,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Integer (computer science); Nonlinear system; Computer science; Mathematical optimization; Integer programming; Operations research; Mathematics; Algorithm; Programming language","score_opus":0.05034349469758915,"score_gpt":0.3283996325178306,"score_spread":0.27805613782024147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970022960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011376668,0.000055123495,0.9868538,0.00013281946,0.000023311726,0.00067327457,0.000003458595,0.00025191146,0.0006296296],"genre_scores_gemma":[0.0077982894,0.0000042539914,0.9911372,0.00003261211,0.00032296352,0.00014353688,0.0000079343135,0.00004489978,0.0005082872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862224,0.000027740392,0.00043566318,0.00030828657,0.00024305528,0.0003630133],"domain_scores_gemma":[0.9987195,0.0007682784,0.00008780493,0.00018717855,0.00015648933,0.00008072762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547222,0.00017715083,0.00028596996,0.000074924545,0.00019440117,0.0001689347,0.00014828166,0.00007446616,0.000015669428],"category_scores_gemma":[0.000059451417,0.00014571904,0.00007593697,0.000118116164,0.000073488125,0.00011118271,0.00012564786,0.00015340242,0.0000057263383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045081066,0.00111842,0.000020739277,0.0016859674,0.00007640546,0.000009431653,0.0019371816,0.33570606,0.000052174808,0.5799904,0.0004930371,0.07886512],"study_design_scores_gemma":[0.00022384674,0.00005948491,2.1594029e-7,0.00010149215,0.00001027373,0.000008189471,0.00003481123,0.68866783,0.00003977583,0.3100592,0.00067283475,0.00012205902],"about_ca_topic_score_codex":0.0000034834661,"about_ca_topic_score_gemma":9.284143e-7,"teacher_disagreement_score":0.35296178,"about_ca_system_score_codex":0.000019948042,"about_ca_system_score_gemma":0.000011770687,"threshold_uncertainty_score":0.594225},"labels":[],"label_agreement":null},{"id":"W1970351398","doi":"10.1007/s10957-008-9409-z","title":"On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Thompson Rivers University","funders":"","keywords":"Nonlinear complementarity problem; Mathematics; Complementarity (molecular biology); Differentiable function; Theory of computation; Mixed complementarity problem; Nonlinear system; Complementarity theory; Applied mathematics; Convergence (economics); Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.07448926588929954,"score_gpt":0.3608122905417831,"score_spread":0.28632302465248355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970351398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031434277,0.00007952484,0.99514735,0.0004999645,0.00005189682,0.00084418454,0.000072458126,0.00003116031,0.00013003606],"genre_scores_gemma":[0.03294478,0.00049761066,0.964325,0.0003035478,0.00038146082,0.00035378648,0.00013012462,0.000059615653,0.0010040682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864864,0.00015083665,0.0005890814,0.0001894805,0.00025034993,0.00017162073],"domain_scores_gemma":[0.99717283,0.0014990101,0.00041968992,0.00022332658,0.0005615097,0.00012362022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007839745,0.0001377222,0.00025190238,0.00016869142,0.0005952814,0.000024479397,0.00014950607,0.000062894214,0.00019762777],"category_scores_gemma":[0.0003858527,0.000121336525,0.00010139747,0.00022534546,0.0001752821,0.00029414264,0.000035328823,0.00020211111,0.0000022139413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022831545,0.0009042136,0.000055422977,0.00008990961,0.00011808344,4.7480773e-7,0.00024462806,0.5910811,0.00009955793,0.40495187,0.00093790074,0.0012885166],"study_design_scores_gemma":[0.0027244848,0.00038955454,0.00008332952,0.000055735065,0.00014414897,0.00008602908,0.0007842765,0.14419356,0.00046167793,0.84575653,0.0050036553,0.0003169901],"about_ca_topic_score_codex":4.0894986e-7,"about_ca_topic_score_gemma":6.6836617e-7,"teacher_disagreement_score":0.44688755,"about_ca_system_score_codex":0.000072413524,"about_ca_system_score_gemma":0.000077066965,"threshold_uncertainty_score":0.49479598},"labels":[],"label_agreement":null},{"id":"W1970748391","doi":"10.1007/s10114-005-0837-5","title":"The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems","year":2006,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Quasi-Newton method; Line search; Mathematical optimization; Convergence (economics); Mathematics; Scaling; Optimization problem; Hessian equation; Applied mathematics; Algorithm; Computer science; Nonlinear system; Newton's method; Mathematical analysis","score_opus":0.022266143007490826,"score_gpt":0.30244424375933165,"score_spread":0.28017810075184085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970748391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028788266,0.000081625825,0.9894687,0.000845929,0.00016151559,0.0027436235,0.0001982651,0.0004185798,0.0032029669],"genre_scores_gemma":[0.04465728,0.00014893888,0.9538461,0.000015614381,0.00020879465,0.00038502223,0.000071414994,0.00009888517,0.00056796527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652165,0.00014808208,0.0012349845,0.0005138666,0.0008690692,0.0007123313],"domain_scores_gemma":[0.99377173,0.0025391895,0.0005716227,0.0008396595,0.0021313983,0.00014637868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013208529,0.00040585123,0.00068628456,0.00008482413,0.00046298016,0.00019054515,0.0006667284,0.00019250343,0.00008157577],"category_scores_gemma":[0.0013983303,0.00028943524,0.00015105394,0.00081788376,0.00072795816,0.0006834478,0.00017968094,0.00025713842,0.000002964256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016968774,0.005315619,0.0006108216,0.0077269273,0.0019325924,0.00003319373,0.013575697,0.29422125,0.0005518544,0.66221803,0.0028598665,0.009257294],"study_design_scores_gemma":[0.0041188453,0.0010581526,0.000018179182,0.000535988,0.0002603948,0.00006935884,0.005155623,0.8988529,0.010734883,0.075641,0.002594386,0.0009602909],"about_ca_topic_score_codex":0.0000119104,"about_ca_topic_score_gemma":0.000024731047,"teacher_disagreement_score":0.60463166,"about_ca_system_score_codex":0.00015941136,"about_ca_system_score_gemma":0.0003720461,"threshold_uncertainty_score":0.9999558},"labels":[],"label_agreement":null},{"id":"W1971200627","doi":"10.1007/s10107-003-0484-5","title":"Generalized pattern searches with derivative information","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Iterated function; Polling; Function (biology); Mathematics; Convergence (economics); Mathematical optimization; Derivative (finance); Pattern search; Global Positioning System; Algorithm; Computer science","score_opus":0.0657266595787926,"score_gpt":0.34676287915577386,"score_spread":0.28103621957698127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971200627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008693698,0.00001098452,0.98411345,0.00017688714,0.000015723559,0.0008946836,0.0000024423564,0.00024070653,0.0058514145],"genre_scores_gemma":[0.06997479,0.0000034408963,0.9291537,0.00008321377,0.000019628826,0.00027308334,0.000012164897,0.000045825043,0.0004341683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979704,0.00016344548,0.00044422492,0.00020067555,0.00069428893,0.0005269893],"domain_scores_gemma":[0.9985056,0.00052834203,0.00014405073,0.0003469824,0.00029297368,0.000182051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871289,0.00022130844,0.0003023349,0.00013778478,0.00017996284,0.00018519364,0.00018017572,0.00008317879,0.00051790423],"category_scores_gemma":[0.0019823343,0.00016284456,0.000058948197,0.00046566108,0.0001621037,0.00061093766,0.00005694834,0.000265785,0.00016940993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052587453,0.0005959594,0.00035356695,0.0010679219,0.00017802863,0.000035802306,0.0054325406,0.00041213987,0.000042043506,0.7731363,0.00033532537,0.21835777],"study_design_scores_gemma":[0.00505612,0.0006384497,0.000043084958,0.00048181074,0.00010484391,0.0002957761,0.005803439,0.06094715,0.009215861,0.8853449,0.03057486,0.0014936972],"about_ca_topic_score_codex":0.0000021576761,"about_ca_topic_score_gemma":0.0000020156265,"teacher_disagreement_score":0.21686406,"about_ca_system_score_codex":0.000091403635,"about_ca_system_score_gemma":0.00006778796,"threshold_uncertainty_score":0.6640609},"labels":[],"label_agreement":null},{"id":"W1972338219","doi":"10.5539/jmr.v3n3p96","title":"Working Under Feasible Region Contraction Algorithm (FRCA) Solver Environment","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Solver; Mathematics; Linear programming; Bounded function; Contraction (grammar); Mathematical optimization; Sequence (biology); Algorithm; Software; Computer science; Programming language; Mathematical analysis","score_opus":0.43770230812486305,"score_gpt":0.43544181918546837,"score_spread":0.002260488939394678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972338219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041005844,0.00023710895,0.9865401,0.0003428565,0.0002530291,0.0005503113,0.0000013028641,0.00003478256,0.007939972],"genre_scores_gemma":[0.037389025,0.0009885661,0.95593315,0.00002401061,0.00035057036,0.00002525106,0.0000012364752,0.00011234306,0.005175814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504465,0.00039958695,0.0010628526,0.000248533,0.002539836,0.00070457096],"domain_scores_gemma":[0.9960005,0.0015109212,0.0006987114,0.0005625795,0.0009008785,0.00032636436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048746825,0.00022200707,0.00049851777,0.000804823,0.000294955,0.00012632528,0.0006339422,0.00019902029,0.00084527174],"category_scores_gemma":[0.0011361183,0.00018405187,0.00019915795,0.0004921861,0.00026413938,0.00047375163,0.00021835272,0.0013787996,0.00012684804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014857135,0.028170113,0.0014190786,0.0021442433,0.0033248747,0.0040805093,0.03965128,0.0063416213,0.009210984,0.44637054,0.069831684,0.38796934],"study_design_scores_gemma":[0.0027927095,0.0008773503,0.00016242999,0.000727563,0.00009703309,0.0013528599,0.0095773805,0.048714183,0.0078048166,0.92080015,0.0065610246,0.00053252623],"about_ca_topic_score_codex":0.000006057059,"about_ca_topic_score_gemma":0.000002348657,"teacher_disagreement_score":0.47442958,"about_ca_system_score_codex":0.0005663818,"about_ca_system_score_gemma":0.0002188079,"threshold_uncertainty_score":0.92551327},"labels":[],"label_agreement":null},{"id":"W1973659154","doi":"10.1142/s0218127405012363","title":"NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING","year":2005,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Gravitational singularity; Vector field; Mathematics; Interior point method; Logarithm; Extension (predicate logic); Boundary (topology); Linear programming; Flow (mathematics); Field (mathematics); Mathematical analysis; Point (geometry); Newton's method; Function (biology); Geometry; Computer science; Mathematical optimization; Pure mathematics; Physics; Nonlinear system","score_opus":0.05162428453062728,"score_gpt":0.46425842847659265,"score_spread":0.41263414394596537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973659154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04996022,0.0004572659,0.9359094,0.012845632,0.00036339974,0.00021687931,0.0000034423394,0.000020271124,0.00022347656],"genre_scores_gemma":[0.04472953,0.0004478303,0.9539447,0.00017742123,0.00025189965,0.0000066191437,0.0000024547555,0.000014395217,0.00042518633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989404,0.000080912054,0.00047593555,0.000105485466,0.0002939298,0.00010331127],"domain_scores_gemma":[0.9989848,0.0001908444,0.00025086067,0.000062457664,0.0004303236,0.00008070755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261072,0.00008376069,0.00015052331,0.00035400694,0.000025198962,0.0000586193,0.00014171732,0.000047271755,0.000079809404],"category_scores_gemma":[0.0006236403,0.0000735197,0.000034868423,0.00010431421,0.000047351296,0.00036590677,0.0000636337,0.00019944742,0.0000020364066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108993554,0.00013228542,0.0006550075,0.000022250895,0.00005860363,0.000013685618,0.0022649306,0.00076742464,0.001397615,0.0023949926,0.000191196,0.991993],"study_design_scores_gemma":[0.0066835512,0.00044379378,0.0032128678,0.00066780584,0.000044711327,0.0013738045,0.0030011726,0.84217757,0.012356519,0.028467601,0.10102553,0.0005450692],"about_ca_topic_score_codex":0.0000032086873,"about_ca_topic_score_gemma":0.000013869055,"teacher_disagreement_score":0.9914479,"about_ca_system_score_codex":0.00009718331,"about_ca_system_score_gemma":0.000040217303,"threshold_uncertainty_score":0.29980466},"labels":[],"label_agreement":null},{"id":"W1974432154","doi":"10.1007/s10100-007-0054-7","title":"Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization","year":2008,"lang":"en","type":"article","venue":"Central European Journal of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parametric statistics; Partition (number theory); Mathematics; Mathematical optimization; Sensitivity (control systems); Perturbation (astronomy); Function (biology); Invariant (physics); Applied mathematics; Computer science; Algorithm; Combinatorics; Statistics; Physics","score_opus":0.1544883455717302,"score_gpt":0.4044897459703154,"score_spread":0.2500014003985852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974432154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20936643,0.00007057626,0.7890449,0.00039753062,0.00009046395,0.00031235212,0.000012395614,0.000020468678,0.0006848591],"genre_scores_gemma":[0.65889573,0.0006518259,0.3397572,0.00001531363,0.00017927503,0.0000036317695,0.00002671717,0.00003745331,0.0004328575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99269336,0.003975092,0.0010532526,0.00030078617,0.0013164824,0.0006610032],"domain_scores_gemma":[0.996313,0.0006595448,0.00014755373,0.00037222652,0.0021700666,0.00033760292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058816927,0.0001688906,0.00041307224,0.0028776997,0.00047628206,0.00012916923,0.00031773798,0.00005838827,0.00040894808],"category_scores_gemma":[0.00660053,0.00015670211,0.00018255596,0.0068012993,0.00025304354,0.0008542756,0.00013235606,0.0010620689,0.000044512264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007058647,0.00041271263,0.0014411191,0.000011320298,0.00011497307,0.0008708614,0.0005744434,0.9950793,0.0001644598,0.00044626134,0.00032996642,0.00048402944],"study_design_scores_gemma":[0.0010516334,0.00021394323,0.008265001,0.000039649993,0.00004819432,0.00020299798,0.00023670988,0.98923236,0.0003704521,0.000045273864,0.00012935407,0.00016443443],"about_ca_topic_score_codex":0.00002121315,"about_ca_topic_score_gemma":0.000039396924,"teacher_disagreement_score":0.4495293,"about_ca_system_score_codex":0.00035606523,"about_ca_system_score_gemma":0.0004199508,"threshold_uncertainty_score":0.7901927},"labels":[],"label_agreement":null},{"id":"W1974846298","doi":"10.1007/s10589-012-9473-z","title":"Improved constraint consensus methods for seeking feasibility in nonlinear programs","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Solver; Mathematical optimization; Constraint (computer-aided design); Mathematics; Nonlinear system; Trust region; Set (abstract data type); Point (geometry); Quadratic equation; Simple (philosophy); Nonlinear programming; Algorithm; Computer science","score_opus":0.11300995214938463,"score_gpt":0.4626816648866754,"score_spread":0.34967171273729075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974846298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027188903,0.0001058767,0.9962714,0.00039908962,0.00003320447,0.0025227014,0.000034476605,0.00010518893,0.00025621912],"genre_scores_gemma":[0.015781598,0.000012023335,0.982671,0.00008458867,0.000083515886,0.0009834191,0.00027951517,0.000029038547,0.00007526738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987025,0.000120581855,0.00046532907,0.00029150926,0.00012710512,0.0002929313],"domain_scores_gemma":[0.9977928,0.0012854711,0.00016589162,0.00017282994,0.00042559436,0.00015744622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084725907,0.00014730754,0.0002072244,0.00014270193,0.00019921559,0.000052537467,0.00009312929,0.000086117325,0.000031930682],"category_scores_gemma":[0.00046719893,0.00015443517,0.00004711861,0.00044134984,0.00017149094,0.00013158863,0.000050988947,0.00012625371,0.000001580845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004128435,0.0009854097,0.0022198234,0.0001627727,0.000038388207,1.3349597e-7,0.00039907033,0.72783923,0.00008874415,0.16967689,0.00004728872,0.098500974],"study_design_scores_gemma":[0.00090253644,0.000021671945,0.00013188647,0.000011199582,0.0000125926335,0.000009146724,0.00016831553,0.96625865,0.000028372624,0.03123105,0.0010649408,0.0001596596],"about_ca_topic_score_codex":0.0000018080198,"about_ca_topic_score_gemma":0.0000018484021,"teacher_disagreement_score":0.2384194,"about_ca_system_score_codex":0.00009825622,"about_ca_system_score_gemma":0.00009340726,"threshold_uncertainty_score":0.6297683},"labels":[],"label_agreement":null},{"id":"W1979343909","doi":"10.5539/jmr.v7n2p7","title":"A Regularized Newton Method with Correction for Unconstrained Nonconvex Optimization","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hujiang Foundation of China","keywords":"Hessian matrix; Mathematics; Lipschitz continuity; Quasi-Newton method; Hessian equation; Convergence (economics); Applied mathematics; Newton's method; Function (biology); Mathematical optimization; Mathematical analysis; Nonlinear system","score_opus":0.2955238327155675,"score_gpt":0.5128277677295039,"score_spread":0.2173039350139364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979343909","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006275144,0.00003577567,0.99508476,0.0011015678,0.00023991003,0.001053745,0.0000052369,0.00003798155,0.0018135044],"genre_scores_gemma":[0.0007524432,0.000026116115,0.9933178,0.000013611953,0.00025381104,0.000058416947,0.0000054399507,0.00008704563,0.0054853284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954207,0.00053790765,0.0009823779,0.00023207728,0.002294913,0.00053205574],"domain_scores_gemma":[0.9868901,0.0042260126,0.00072619773,0.00041780534,0.007315195,0.00042470737],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01195564,0.00020738003,0.00061529945,0.00086432503,0.00019219337,0.00016453254,0.00047371088,0.00017189956,0.00009430665],"category_scores_gemma":[0.012914724,0.00015265227,0.00013892232,0.0010280991,0.00019766751,0.00046421168,0.00009055696,0.00074227905,0.0000065477675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004482013,0.0039943587,0.00006820669,0.0017985274,0.0010613602,0.00018959327,0.01245689,0.7888123,0.0024566867,0.058123715,0.10618711,0.020369275],"study_design_scores_gemma":[0.0048813783,0.0015006403,7.125962e-7,0.0003051193,0.00006141204,0.00060474226,0.0058876066,0.8809264,0.0030912904,0.10132017,0.0012202141,0.00020035195],"about_ca_topic_score_codex":0.0000046162854,"about_ca_topic_score_gemma":0.0000071908485,"teacher_disagreement_score":0.104966894,"about_ca_system_score_codex":0.00048112712,"about_ca_system_score_gemma":0.0011797696,"threshold_uncertainty_score":0.9953999},"labels":[],"label_agreement":null},{"id":"W1980307085","doi":"10.1007/pl00011394","title":"Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discretization; Relaxation (psychology); Convex hull; Convex optimization; Linear programming relaxation; Quadratic equation; Semidefinite programming; Quadratic programming; Linear programming; Function (biology); Mathematical optimization; Finite set; Feasible region; Applied mathematics; Regular polygon; Combinatorics; Mathematical analysis; Geometry","score_opus":0.04527866346224898,"score_gpt":0.43101913157996863,"score_spread":0.38574046811771967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980307085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061406,0.00007542639,0.9958975,0.00030988245,0.000029838382,0.002208631,0.0000029537784,0.00016468143,0.00069707463],"genre_scores_gemma":[0.016605994,0.000049382892,0.9819444,0.000056560268,0.000044061948,0.0006155732,0.000085067666,0.00007562329,0.00052335695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977283,0.00029894896,0.0008095205,0.0004461326,0.00029919157,0.0004179083],"domain_scores_gemma":[0.99724066,0.0019075001,0.0002220275,0.00026407622,0.00023249343,0.00013321293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750013,0.0002443196,0.00043156312,0.00021471624,0.00020674912,0.0001719169,0.0001439408,0.0001922834,0.0006198169],"category_scores_gemma":[0.003792062,0.00022805437,0.000058505244,0.0006731832,0.00015914417,0.0005427057,0.000040535782,0.00017927287,0.000010803398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015146288,0.0005962837,0.00020967076,0.0016407744,0.000048210208,0.0000043647447,0.00411708,0.16185573,0.00004874557,0.1419473,0.000051007955,0.6893294],"study_design_scores_gemma":[0.00087350124,0.000081835606,0.0000059345384,0.00015386975,0.000030045261,0.000005769591,0.00032285054,0.8497804,0.00016782827,0.14795585,0.00040018855,0.00022196761],"about_ca_topic_score_codex":0.0000044261888,"about_ca_topic_score_gemma":0.0000051864276,"teacher_disagreement_score":0.6891074,"about_ca_system_score_codex":0.0001283334,"about_ca_system_score_gemma":0.000042762756,"threshold_uncertainty_score":0.9299787},"labels":[],"label_agreement":null},{"id":"W1980450998","doi":"10.1007/s10107-002-0349-3","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":664,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Conic section; Conic optimization; Quadratic equation; Mathematics; Quadratic programming; Mathematical optimization; Dual (grammatical number); Quadratic unconstrained binary optimization; Optimization problem; Extension (predicate logic); Algorithm; Computer science; Convex optimization; Geometry","score_opus":0.06817259144325699,"score_gpt":0.4259764846376932,"score_spread":0.35780389319443623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980450998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031557315,0.000015972853,0.99359477,0.0001994984,0.00005851876,0.0024901915,0.000006099114,0.0002685842,0.0030508048],"genre_scores_gemma":[0.0061323466,0.000001909328,0.99212146,0.000087154716,0.00004111009,0.00084367034,0.00001759741,0.00011416344,0.00064061116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968729,0.00027571607,0.00092118885,0.00051043794,0.00053582556,0.00088392344],"domain_scores_gemma":[0.9956991,0.0030622606,0.00029772165,0.0004594033,0.00029149195,0.00019004423],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002623479,0.00032635848,0.0005258485,0.0001821098,0.00033014105,0.00022585978,0.00019816236,0.00012523663,0.0009750154],"category_scores_gemma":[0.009862697,0.0002876878,0.00019097741,0.00038070514,0.000080048565,0.00021542264,0.00009735654,0.000280267,0.000039693354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049354112,0.00044655812,0.0000026220291,0.0009043054,0.000100240046,0.0000070958426,0.0010469395,0.0061068176,0.00014228675,0.9629189,0.00021154502,0.028063355],"study_design_scores_gemma":[0.0013028058,0.0003399625,1.0031463e-7,0.00018894271,0.0000648549,0.000038235085,0.00094700814,0.570731,0.002146063,0.42244872,0.0014357369,0.0003565649],"about_ca_topic_score_codex":7.4672914e-7,"about_ca_topic_score_gemma":0.0000016911763,"teacher_disagreement_score":0.5646242,"about_ca_system_score_codex":0.00019727946,"about_ca_system_score_gemma":0.00008399964,"threshold_uncertainty_score":0.9999575},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05297343988889592,"score_gpt":0.4344821924655114,"score_spread":0.3815087525766155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981321991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025764408,0.00010284406,0.9957147,0.0005131098,0.00011924731,0.0020344462,0.00017448666,0.0012219745,0.00009341665],"genre_scores_gemma":[0.000092754926,0.000034761582,0.997288,0.0006039022,0.00025946676,0.000574208,0.0004177498,0.00021773604,0.00051142176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961162,0.0009986964,0.00070436765,0.0008168182,0.0005951596,0.0007687425],"domain_scores_gemma":[0.99544054,0.0014307161,0.00039289042,0.0009662298,0.0014289644,0.000340662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025098196,0.00043455098,0.00053982594,0.0003384595,0.0005286961,0.000180116,0.0005404846,0.00030606604,0.00073034276],"category_scores_gemma":[0.0030060231,0.00044061747,0.00019013823,0.0008185055,0.00008618709,0.001139055,0.00009202155,0.0003181179,0.000022658189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015667107,0.00064902386,0.00003293123,0.00011224197,0.000070486036,0.0000018701614,0.00027399586,0.95375866,0.000027407319,0.0076927138,0.0006567577,0.03656723],"study_design_scores_gemma":[0.0020826415,0.00022083487,0.0000033339388,0.00003386303,0.00009590383,0.0000036376148,0.00010776626,0.96751463,0.0027211208,0.012127965,0.014577822,0.0005104929],"about_ca_topic_score_codex":0.000001051654,"about_ca_topic_score_gemma":0.0000041813596,"teacher_disagreement_score":0.036056735,"about_ca_system_score_codex":0.00029791667,"about_ca_system_score_gemma":0.0003085209,"threshold_uncertainty_score":0.99980456},"labels":[],"label_agreement":null},{"id":"W1986778342","doi":"","title":"Improved asymptotic analysis for SUMT methods","year":2011,"lang":"en","type":"article","venue":"Federated Conference on Computer Science and Information Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Extrapolation; Taylor series; Mathematics; Applied mathematics; Convergence (economics); Logarithm; Path (computing); Quadratic equation; Newton's method; Order (exchange); Computation; Mathematical optimization; Algorithm; Nonlinear system; Mathematical analysis; Computer science","score_opus":0.13419163115019186,"score_gpt":0.3816463859460966,"score_spread":0.24745475479590476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986778342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006690468,0.0000071948143,0.99393386,0.000049183956,0.00029215464,0.00071410136,0.000011088838,0.00010520251,0.0042181932],"genre_scores_gemma":[0.4361243,0.000017406515,0.56335807,0.0002017622,0.000038598413,0.0001351026,0.00001833719,0.0000079610845,0.0000984922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983309,0.00009141308,0.0005309373,0.00025940227,0.00045174014,0.00033560136],"domain_scores_gemma":[0.9967242,0.00019826983,0.00027552692,0.00027497933,0.0023580869,0.00016896697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019643211,0.00015954782,0.00030235676,0.00073297566,0.0005238443,0.0009277815,0.00032040954,0.00007216674,0.000023928682],"category_scores_gemma":[0.0003486149,0.00012960994,0.00004599569,0.0015410747,0.00017553497,0.002746425,0.00008666238,0.00010384348,0.000012982363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013897987,0.00014375433,0.00012613896,0.0002891642,0.00046752355,9.5144384e-7,0.008245037,0.0044536046,0.00039975447,0.7082933,0.0005047458,0.276937],"study_design_scores_gemma":[0.0003544216,0.00019517954,0.00011967479,0.000022111259,0.000030970314,0.0000035647743,0.00037677624,0.9962697,0.0009860066,0.0010366404,0.00043783864,0.0001670871],"about_ca_topic_score_codex":0.00002379243,"about_ca_topic_score_gemma":0.0000018961206,"teacher_disagreement_score":0.9918161,"about_ca_system_score_codex":0.000071426926,"about_ca_system_score_gemma":0.0002778169,"threshold_uncertainty_score":0.89466184},"labels":[],"label_agreement":null},{"id":"W1987364022","doi":"10.1007/s10589-007-9157-2","title":"A stable primal–dual approach for linear programming under nondegeneracy assumptions","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Solver; Jacobian matrix and determinant; Interior point method; Applied mathematics; Linearization; Iterated function; Mathematical optimization; Simple (philosophy); Matrix (chemical analysis); Nonlinear system; Mathematical analysis","score_opus":0.07123505202571571,"score_gpt":0.3926121186801358,"score_spread":0.32137706665442006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987364022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084140636,0.000069552065,0.99621016,0.00027618898,0.000021483895,0.0020188633,0.000058649664,0.00021256314,0.0010483909],"genre_scores_gemma":[0.0061186263,0.00002192435,0.99046946,0.00016776267,0.00020460028,0.00091853086,0.0011555216,0.000054695203,0.0008888884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983757,0.000031360138,0.00048565626,0.00042733937,0.00034301574,0.00033691854],"domain_scores_gemma":[0.9979329,0.000722986,0.00018941032,0.00020753135,0.0007624134,0.00018476458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053612504,0.00018458885,0.00019261966,0.00023882926,0.0006251376,0.00009940155,0.00012471691,0.00010441088,0.000060927752],"category_scores_gemma":[0.00013151058,0.00019592298,0.0000625279,0.00062738237,0.00012413319,0.0002605131,0.00006491175,0.00014250005,0.0000050111544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012023284,0.00024610193,0.000021852724,0.00004812257,0.000023658422,1.2318527e-7,0.000056546723,0.7811614,0.000011729312,0.21369597,0.00015627786,0.0045661633],"study_design_scores_gemma":[0.00080717076,0.000029395243,0.00005363468,0.000006749178,0.000029639634,0.000012657821,0.0002284841,0.9636126,0.00004849963,0.030004617,0.0049418462,0.00022468632],"about_ca_topic_score_codex":0.0000015075921,"about_ca_topic_score_gemma":0.0000015963847,"teacher_disagreement_score":0.18369137,"about_ca_system_score_codex":0.0000958692,"about_ca_system_score_gemma":0.000118441174,"threshold_uncertainty_score":0.79895073},"labels":[],"label_agreement":null},{"id":"W1988815259","doi":"10.1007/s10107-015-0870-9","title":"A dynamic inequality generation scheme for polynomial programming","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polynomial; Scheme (mathematics); Binary number; Relaxation (psychology); Mathematical optimization; Semidefinite programming; Applied mathematics; Algorithm","score_opus":0.19967326502026428,"score_gpt":0.43364985461347416,"score_spread":0.23397658959320988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988815259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012204332,0.000057555142,0.98380065,0.00048165757,0.00012556168,0.0025152157,0.000008628786,0.000474087,0.00033229744],"genre_scores_gemma":[0.03216016,0.0000012523981,0.965564,0.000036608024,0.00021590616,0.0010768272,0.00006190617,0.000097389464,0.0007859138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709666,0.00012275676,0.00080013665,0.0004919155,0.0007249077,0.0007635988],"domain_scores_gemma":[0.9977908,0.00054973346,0.00022866887,0.0005009833,0.00052824436,0.00040154502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020474344,0.000299445,0.00047385212,0.00014561832,0.00021582976,0.00025183294,0.00030560858,0.000184303,0.00004568017],"category_scores_gemma":[0.0066030193,0.00027052077,0.00016277451,0.00041196018,0.00014510717,0.00032951857,0.00015874549,0.00026698777,0.000056458546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032721265,0.0033973358,0.00015400321,0.0026533597,0.00030230655,0.0000311683,0.005639282,0.00058918336,0.001798542,0.18699722,0.005401242,0.7927092],"study_design_scores_gemma":[0.0024310388,0.00037836639,0.00000178875,0.00009615847,0.000060760292,0.000034321285,0.001012686,0.84628576,0.00070552324,0.13130465,0.017064605,0.00062434986],"about_ca_topic_score_codex":0.0000031052357,"about_ca_topic_score_gemma":0.000009938913,"teacher_disagreement_score":0.84569657,"about_ca_system_score_codex":0.00030030342,"about_ca_system_score_gemma":0.00015199189,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W1989390764","doi":"10.1007/s10957-010-9747-5","title":"Convexity of the Proximal Average","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convexity; Interpolation (computer graphics); Regular polygon; Mathematics; Factor (programming language); Function (biology); Convex function; Applied mathematics; Mathematical analysis; Combinatorics; Mathematical optimization; Computer science; Geometry; Artificial intelligence; Image (mathematics)","score_opus":0.017471379758686678,"score_gpt":0.3263128521392824,"score_spread":0.3088414723805957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989390764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057798573,0.000024975632,0.99217874,0.0003019741,0.000057347923,0.00032849144,0.000007171156,0.000008872507,0.0013125904],"genre_scores_gemma":[0.47753263,0.00011343844,0.5209414,0.000087961875,0.00020019535,0.000041106934,0.0000024687079,0.000027345422,0.0010534857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991299,0.00011876744,0.00038374995,0.00007504922,0.00021259792,0.00007994943],"domain_scores_gemma":[0.9981827,0.00050406036,0.00050733826,0.00023577886,0.00051007775,0.00006002618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094922783,0.00006823368,0.0001389897,0.00007135028,0.00015185241,0.00001946922,0.00023018276,0.00005816654,0.00022275446],"category_scores_gemma":[0.00076168537,0.00004583711,0.000059217677,0.00026664778,0.0002312789,0.0001620056,0.000052612526,0.00029967204,7.162151e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054208336,0.00019417582,0.00022258132,0.00004104665,0.000031902688,3.136475e-7,0.00022252016,0.07134674,0.002021409,0.92262113,0.00008888882,0.0031550936],"study_design_scores_gemma":[0.0013686359,0.00008409308,0.0004503995,0.000047544447,0.0000931778,0.00017651374,0.00036196827,0.067276,0.016625023,0.9093942,0.003912342,0.0002101176],"about_ca_topic_score_codex":1.4057518e-7,"about_ca_topic_score_gemma":3.5103602e-7,"teacher_disagreement_score":0.47175276,"about_ca_system_score_codex":0.0000089974965,"about_ca_system_score_gemma":0.000074032025,"threshold_uncertainty_score":0.24390051},"labels":[],"label_agreement":null},{"id":"W1989744925","doi":"10.1007/s10107-006-0037-9","title":"Foreword: Special issue on large-scale nonlinear and semidefinite programming","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Nonlinear programming; Semidefinite embedding; Nonlinear system; Scale (ratio); Mathematical optimization; Numerical analysis; Applied mathematics; Quadratically constrained quadratic program; Mathematical analysis; Quadratic programming; Geography","score_opus":0.026590515130218303,"score_gpt":0.3325327726903277,"score_spread":0.3059422575601094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989744925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019406293,0.00013342004,0.9352635,0.0012851444,0.00028364448,0.0040102494,0.00006718796,0.001301548,0.038248967],"genre_scores_gemma":[0.0020391229,0.000006728638,0.9897851,0.000069062815,0.0027271486,0.00021249527,0.00003468909,0.00013135608,0.0049943393],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99681383,0.00008645457,0.0007367199,0.00057357154,0.0008071095,0.0009823136],"domain_scores_gemma":[0.99807924,0.0008654721,0.0001831091,0.00047913095,0.00016071345,0.00023236271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008459856,0.00038058215,0.0005338932,0.00019864466,0.000344912,0.00021196916,0.00024796606,0.00020202294,0.0006010214],"category_scores_gemma":[0.00093772647,0.0003324114,0.00013144594,0.0005020001,0.00021695308,0.00020477637,0.00021593744,0.0005020219,0.00027258194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014752455,0.0040603173,0.00041614493,0.0018277965,0.00009552069,0.00014899507,0.0022125246,0.00025904473,0.000039816743,0.33371,0.0061664297,0.65091586],"study_design_scores_gemma":[0.0026339833,0.0005491047,0.000039714527,0.0005766331,0.0001068415,0.00010604151,0.0016663207,0.14228007,0.0007749013,0.42195424,0.42812553,0.0011866271],"about_ca_topic_score_codex":0.000003707355,"about_ca_topic_score_gemma":0.00002176506,"teacher_disagreement_score":0.64972925,"about_ca_system_score_codex":0.00008748622,"about_ca_system_score_gemma":0.000029401119,"threshold_uncertainty_score":0.9999128},"labels":[],"label_agreement":null},{"id":"W1989753182","doi":"10.1007/s00454-015-9682-1","title":"Small Extended Formulations for Cyclic Polytopes","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Dimension (graph theory); Iterated function; Factorization; Yield (engineering); Base (topology); Tensor product","score_opus":0.15288814404874046,"score_gpt":0.40237703885139203,"score_spread":0.24948889480265157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989753182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012113289,0.00008192582,0.9838738,0.000657756,0.00013005805,0.00063886016,0.0001297308,0.0001615294,0.0022130795],"genre_scores_gemma":[0.19031923,0.000002545481,0.806225,0.00015389848,0.00016650264,0.00012187499,0.00044269103,0.000052921747,0.0025153293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983648,0.000048843784,0.00039353067,0.00031131113,0.0005305164,0.0003510009],"domain_scores_gemma":[0.99758726,0.0010795356,0.00014147391,0.00023070915,0.00071913155,0.00024185741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038321712,0.00017724845,0.00023095937,0.0003585423,0.00018800578,0.00007942685,0.00023982082,0.00007789257,0.00008326736],"category_scores_gemma":[0.0016435115,0.00017130021,0.00011729699,0.0006467555,0.00007141436,0.00025087822,0.00010130128,0.00013232222,0.000049659615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014973932,0.0003083265,0.00068787526,0.00010815432,0.00015896434,0.0000057551392,0.00066729356,0.46176928,0.000029052615,0.51198226,0.0057766335,0.018356668],"study_design_scores_gemma":[0.0012502117,0.00009054632,0.0013785101,0.000014733765,0.000019021387,0.000009642491,0.00021067091,0.3686664,0.00006001813,0.6254678,0.0026065237,0.00022594728],"about_ca_topic_score_codex":0.0000053806866,"about_ca_topic_score_gemma":0.0000053785443,"teacher_disagreement_score":0.17820594,"about_ca_system_score_codex":0.00011980547,"about_ca_system_score_gemma":0.00017265683,"threshold_uncertainty_score":0.698542},"labels":[],"label_agreement":null},{"id":"W1991452775","doi":"10.1007/s10957-006-9095-7","title":"Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Mathematics; Predictor–corrector method; Logarithm; Function (biology); Path (computing); Quadratic equation; Combinatorics; Affine transformation; Theory of computation; Scaling; Applied mathematics; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.02557483011133986,"score_gpt":0.3966613630238401,"score_spread":0.3710865329125002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991452775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036140053,0.0002981684,0.9976075,0.00013636069,0.00014103712,0.0012546689,0.000031732507,0.000100348065,0.00039402046],"genre_scores_gemma":[0.0025598395,0.0003238243,0.9961514,0.00009143975,0.0003524785,0.00013038919,0.00003465687,0.000072337316,0.00028365734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976531,0.0003774751,0.0010496145,0.00028986586,0.00028484318,0.00034504902],"domain_scores_gemma":[0.99435526,0.0025717358,0.00094155053,0.00031055155,0.0015662198,0.00025470133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005411472,0.00024261705,0.00041538736,0.00041547976,0.00036611693,0.000064260596,0.00029221398,0.00018018854,0.00020058622],"category_scores_gemma":[0.0015340382,0.00021907974,0.00015954796,0.00059507595,0.000104467916,0.00054432714,0.000081831524,0.0002978977,0.0000012702727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066624925,0.00047757063,0.000025286361,0.00009902949,0.00026982353,0.0000017743685,0.0009695634,0.724409,0.00013036077,0.2596546,0.00017830919,0.01311846],"study_design_scores_gemma":[0.0017567957,0.00030601994,0.0000056907284,0.000066719316,0.00020250825,0.00007340994,0.0013423249,0.89920557,0.0012571771,0.093067385,0.0024523453,0.00026407445],"about_ca_topic_score_codex":1.5052181e-7,"about_ca_topic_score_gemma":3.0373417e-7,"teacher_disagreement_score":0.17479657,"about_ca_system_score_codex":0.00014693072,"about_ca_system_score_gemma":0.00012717342,"threshold_uncertainty_score":0.89338124},"labels":[],"label_agreement":null},{"id":"W1991749916","doi":"10.1016/j.cor.2009.03.020","title":"A new version of the Improved Primal Simplex for degenerate linear programs","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Simplex; Linear programming; Degenerate energy levels; Simplex algorithm; Mathematical optimization; Computer science; Mathematics; Applied mathematics; Combinatorics; Physics","score_opus":0.14117109825347857,"score_gpt":0.4515330468494342,"score_spread":0.3103619485959556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991749916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122636305,0.0000448273,0.9811024,0.0033961255,0.00011808554,0.0027920986,0.00001723736,0.00006474709,0.00020086046],"genre_scores_gemma":[0.061005563,0.000018150151,0.93487066,0.00007505726,0.0002537875,0.000089918045,0.00004978568,0.00003158502,0.0036054698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979111,0.00023538154,0.0003687126,0.00032649192,0.0006657227,0.0004926119],"domain_scores_gemma":[0.99744713,0.00037565324,0.000040590006,0.0006192654,0.001358423,0.00015893867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008588449,0.00013546126,0.00020316237,0.00019928663,0.00061028206,0.00013389232,0.00069018843,0.00008949436,0.000053618263],"category_scores_gemma":[0.0007610497,0.00010102297,0.00011513536,0.0010005104,0.00013105162,0.00020351475,0.00024143982,0.000342951,0.000010095023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004567616,0.0013812435,0.000047245496,0.00022053432,0.00014217969,0.0000040625223,0.0025977716,0.16466758,0.042594887,0.097607456,0.0566983,0.633582],"study_design_scores_gemma":[0.0012746707,0.0005477681,0.00004436438,0.000050331433,0.000007974941,0.0000032807463,0.00009249895,0.9655623,0.020862998,0.004862932,0.0065540485,0.0001368338],"about_ca_topic_score_codex":0.000030196325,"about_ca_topic_score_gemma":0.000042365813,"teacher_disagreement_score":0.80089474,"about_ca_system_score_codex":0.00014172705,"about_ca_system_score_gemma":0.00061324635,"threshold_uncertainty_score":0.4693858},"labels":[],"label_agreement":null},{"id":"W1993435502","doi":"10.1007/s00605-004-0288-6","title":"On the Mean Value of the Index of Composition of an Integer","year":2005,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Lambda; Integer (computer science); Combinatorics; Composition (language); Mathematics; Value (mathematics); Physics; Statistics; Computer science; Quantum mechanics","score_opus":0.02600373576999143,"score_gpt":0.33122510673736094,"score_spread":0.3052213709673695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993435502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72109544,0.0013167369,0.2512108,0.0059819994,0.00066182704,0.005463903,0.0006065266,0.00013250978,0.013530261],"genre_scores_gemma":[0.95370036,0.000092639275,0.044971794,0.00013531627,0.00011786927,0.00004238063,0.000014982939,0.00010551184,0.0008191246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549085,0.0006289367,0.0014878211,0.0003616804,0.0016446874,0.00038601417],"domain_scores_gemma":[0.99410146,0.0018257252,0.0015039986,0.0017576639,0.000711387,0.00009978279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001481078,0.00038399536,0.00078040425,0.0002443996,0.00016495331,0.000028470258,0.001275307,0.00023626427,0.0009442633],"category_scores_gemma":[0.0008354835,0.00023560679,0.00034858103,0.0007332213,0.00068692164,0.00023347717,0.00036484006,0.00063325925,0.00006135354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036886754,0.0050634756,0.00006782128,0.0021429912,0.00065468077,0.000003419082,0.019626575,0.12706676,0.008654339,0.8264125,0.0016921065,0.008246454],"study_design_scores_gemma":[0.0011532475,0.0003528381,0.00021251956,0.0014342332,0.0001988935,0.000009627292,0.0015673514,0.6402117,0.14975074,0.2044784,0.0002838067,0.00034664504],"about_ca_topic_score_codex":0.000020591973,"about_ca_topic_score_gemma":0.000010714283,"teacher_disagreement_score":0.6219341,"about_ca_system_score_codex":0.00015257216,"about_ca_system_score_gemma":0.00013618555,"threshold_uncertainty_score":0.999969},"labels":[],"label_agreement":null},{"id":"W1994576520","doi":"10.1007/s10957-013-0410-9","title":"Approximation in p-Norm of Univariate Concave Functions","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Subgradient method; Mathematics; Norm (philosophy); Univariate; Uniform norm; Concave function; Mathematical optimization; Applied mathematics; Discrete mathematics; Algorithm; Regular polygon; Statistics; Multivariate statistics","score_opus":0.02009323997641423,"score_gpt":0.3141583261122085,"score_spread":0.2940650861357943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994576520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025087807,0.00007496283,0.99463814,0.00021084076,0.000022094973,0.0005100062,0.0000053688264,0.00001227891,0.0020175288],"genre_scores_gemma":[0.31130537,0.00046756514,0.6863352,0.00006321581,0.00011836214,0.00020397296,0.000024050272,0.000040471143,0.0014417629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988005,0.00016371997,0.0006434684,0.00009958642,0.00018488016,0.00010783515],"domain_scores_gemma":[0.9978763,0.000661521,0.0005638608,0.00016018336,0.0006658623,0.00007230674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080895895,0.000087700246,0.00020855347,0.00031437955,0.000078397556,0.00002800107,0.0001223657,0.000066223176,0.0003747578],"category_scores_gemma":[0.00042365122,0.00007802384,0.00004239418,0.0005334899,0.00010470616,0.00048406795,0.000029666133,0.0001630409,0.0000044605313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051101862,0.0003054003,0.00016475581,0.000067961395,0.000041789128,4.6096574e-7,0.00046627148,0.41235542,0.00043853474,0.57655525,0.00016842362,0.009384644],"study_design_scores_gemma":[0.0018731772,0.00013301306,0.0004822744,0.00009117887,0.000067696106,0.00005524997,0.002848667,0.24456717,0.00094315194,0.7481306,0.0005835913,0.00022422278],"about_ca_topic_score_codex":0.0000019581335,"about_ca_topic_score_gemma":5.667956e-7,"teacher_disagreement_score":0.3087966,"about_ca_system_score_codex":0.000044585006,"about_ca_system_score_gemma":0.000061964674,"threshold_uncertainty_score":0.41033348},"labels":[],"label_agreement":null},{"id":"W1994797589","doi":"10.1051/ro:2008008","title":"Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications","year":2008,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Logarithm; Differentiable function; Constraint (computer-aided design); Set (abstract data type); Mathematics; Multiplier (economics); Algorithm; Nonlinear system; Mathematical optimization; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.15214221796013597,"score_gpt":0.43252963383834475,"score_spread":0.2803874158782088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994797589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43089053,0.00024498077,0.5501776,0.0045020455,0.00035706363,0.005457442,0.0015047173,0.00013486552,0.0067307623],"genre_scores_gemma":[0.9266013,0.0000868591,0.066230826,0.000022123673,0.000047579815,0.00014546508,0.00002613053,0.000037872964,0.0068018567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953079,0.0012755357,0.0008002306,0.0003642226,0.0018153075,0.0004367773],"domain_scores_gemma":[0.99495715,0.0010949483,0.00012369169,0.001536931,0.0021695371,0.00011774371],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016406465,0.00017763865,0.00045567015,0.0006628278,0.0013310215,0.00004694828,0.0010583655,0.00013135652,0.00061316014],"category_scores_gemma":[0.003987008,0.00011124188,0.00032420602,0.005689336,0.0025695942,0.00018692327,0.00030770828,0.0006710169,0.000009160728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008603138,0.0032988617,0.0416148,0.00032547393,0.005713976,0.000008819886,0.034900438,0.5912987,0.03339322,0.27634737,0.0041024107,0.008909921],"study_design_scores_gemma":[0.0015086159,0.00015174485,0.03624771,0.00012071736,0.0006067879,0.00004196434,0.0064536356,0.89671576,0.051069982,0.0055749626,0.0009814184,0.0005266835],"about_ca_topic_score_codex":0.00026543817,"about_ca_topic_score_gemma":0.0005919545,"teacher_disagreement_score":0.49571076,"about_ca_system_score_codex":0.00019069805,"about_ca_system_score_gemma":0.0011680534,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W1994859090","doi":"10.1016/s0305-0548(03)00032-7","title":"Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Jacobian matrix and determinant; Quadratic equation; Variational inequality; Mathematics; Variety (cybernetics); Dual (grammatical number); Mathematical optimization; Newton's method; Applied mathematics; Center (category theory); Nonlinear system; Geometry","score_opus":0.17788448041439678,"score_gpt":0.4432832803204287,"score_spread":0.2653987999060319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994859090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009471615,0.00007503653,0.9884418,0.0007997149,0.0000738005,0.0014185712,0.000028082994,0.0001606441,0.008055176],"genre_scores_gemma":[0.010596771,0.000024629548,0.9834397,0.000101970356,0.00014094557,0.00056085334,0.000077696626,0.000088413726,0.004969047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99295944,0.0027004778,0.0006502071,0.00073937635,0.0020334553,0.00091703923],"domain_scores_gemma":[0.9932402,0.0031723327,0.00006475159,0.0012013161,0.0020284776,0.00029293683],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0052979016,0.0003102796,0.00042756743,0.0008065537,0.001312632,0.0007494011,0.00073552795,0.00014557627,0.00040609986],"category_scores_gemma":[0.0051351385,0.00026895117,0.00007814295,0.0018921026,0.00032478909,0.0007902414,0.0003796714,0.0009392307,0.00005427484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041070085,0.00060346036,0.000041139647,0.00017884806,0.00015071178,0.000020792524,0.004798468,0.26110107,0.00023112517,0.72531825,0.006474401,0.0010406435],"study_design_scores_gemma":[0.0016370785,0.00024861374,0.000028184631,0.00008577692,0.000018474057,0.00012534099,0.0024326383,0.9668851,0.00062140723,0.025745131,0.0017328551,0.00043940882],"about_ca_topic_score_codex":0.00008212577,"about_ca_topic_score_gemma":0.00012394614,"teacher_disagreement_score":0.705784,"about_ca_system_score_codex":0.0004087257,"about_ca_system_score_gemma":0.0012414041,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W1995339711","doi":"10.1007/s10107-013-0666-8","title":"Computing the conjugate of convex piecewise linear-quadratic bivariate functions","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Bivariate analysis; Piecewise; Regular polygon; Quadratic equation; Piecewise linear function; Applied mathematics; Convex analysis; Convex conjugate; Convex optimization; Proper convex function; Mathematical optimization; Mathematical analysis; Statistics; Geometry","score_opus":0.05572542173380636,"score_gpt":0.352413941868189,"score_spread":0.2966885201343826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995339711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011892899,0.000051312833,0.98219186,0.0009407173,0.00008007725,0.0017154046,0.0000026339992,0.00023889614,0.0028862183],"genre_scores_gemma":[0.32608575,0.0000049256632,0.67216516,0.00007588865,0.00010173878,0.0001962119,0.000005754209,0.00007233006,0.0012922166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974109,0.00017366801,0.00086694385,0.0002768006,0.0007386909,0.00053302303],"domain_scores_gemma":[0.9959935,0.00230322,0.00030752592,0.0005966085,0.00063873164,0.000160392],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011156138,0.00023334866,0.00046557855,0.00009880215,0.00030099967,0.00012581484,0.00038527025,0.00009869517,0.0009344925],"category_scores_gemma":[0.0034821925,0.0001539446,0.00014121062,0.00055340555,0.00040232384,0.00020884987,0.000225559,0.00038824207,0.00050934043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047809277,0.0027137764,0.0002824578,0.00372859,0.0006933827,0.000022020336,0.008874442,0.003975873,0.0017314707,0.6907282,0.003168132,0.28403386],"study_design_scores_gemma":[0.000711928,0.00013106769,0.00003058535,0.0002269234,0.00008673546,0.000022722541,0.0019055621,0.68814355,0.00071754184,0.3063919,0.0013164749,0.00031503075],"about_ca_topic_score_codex":0.000014095888,"about_ca_topic_score_gemma":0.0000016687557,"teacher_disagreement_score":0.6841677,"about_ca_system_score_codex":0.00005388105,"about_ca_system_score_gemma":0.00006457277,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W1996274033","doi":"10.1016/j.endm.2006.06.091","title":"Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Mathematics; Automatic differentiation; Matrix (chemical analysis); Algorithm; Sparse matrix; Combinatorics; Computation; Applied mathematics","score_opus":0.043405915023358665,"score_gpt":0.3179354508031987,"score_spread":0.27452953577984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996274033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037288677,0.00059653266,0.9590769,0.00015473498,0.000037948746,0.0007015176,0.000021748067,0.000099673365,0.0020223022],"genre_scores_gemma":[0.2621633,0.00016205314,0.736911,0.000005329373,0.000079318044,0.00008288827,0.000028564638,0.00006812979,0.00049937307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977801,0.00009158057,0.00072328415,0.00034835443,0.0005217366,0.0005349687],"domain_scores_gemma":[0.99796444,0.0011866947,0.00034411967,0.00034667537,0.00010427995,0.000053798947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007776503,0.00025123823,0.00043546627,0.00037349045,0.00008261632,0.000043029777,0.00022325847,0.00013682956,0.000064343665],"category_scores_gemma":[0.0007076148,0.00023671197,0.000074771146,0.00062598556,0.00018091896,0.00023497692,0.00010557605,0.000299869,0.0000046339874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012568125,0.0028006707,0.0026818695,0.0039259074,0.00016656485,0.000034476874,0.0032897333,0.008607698,0.0029906626,0.87387186,0.00017599613,0.10132889],"study_design_scores_gemma":[0.00074096996,0.00010403942,0.0001561893,0.00013378715,0.00003505218,0.000044738797,0.00019779615,0.37782013,0.0072555686,0.6130971,0.00010575003,0.00030891047],"about_ca_topic_score_codex":0.00003673532,"about_ca_topic_score_gemma":0.00017815948,"teacher_disagreement_score":0.36921242,"about_ca_system_score_codex":0.00022658784,"about_ca_system_score_gemma":0.000107910484,"threshold_uncertainty_score":0.9652834},"labels":[],"label_agreement":null},{"id":"W1996513689","doi":"10.1007/s10107-002-0330-1","title":"An analytic center quadratic cut method for the convex quadratic feasibility problem","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Quadratic equation; Quadratic function; Quadratically constrained quadratic program; Isotropic quadratic form; Quadratic programming; Convex function; Combinatorics; Regular polygon; Quadratic growth; Convex set; Convex optimization; Polynomial; Binary quadratic form; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Geometry","score_opus":0.15324201619284777,"score_gpt":0.4432078262764525,"score_spread":0.2899658100836047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996513689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045016303,0.00007734973,0.9921287,0.0013463731,0.00005178378,0.004606171,0.000011480727,0.00034095065,0.0009870855],"genre_scores_gemma":[0.04249016,0.0000066514945,0.9545605,0.00013389763,0.00011298487,0.0010733957,0.000011144182,0.00011052885,0.0015007327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961673,0.000405457,0.0010381928,0.0006675999,0.0008070448,0.00091438834],"domain_scores_gemma":[0.99398214,0.003795645,0.00027937707,0.0012504071,0.0003719959,0.00032046082],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025268644,0.0003975932,0.0006875307,0.00012235991,0.0005236817,0.00037850515,0.0007154777,0.00016051937,0.0011111678],"category_scores_gemma":[0.0031654418,0.0002644887,0.00028084553,0.0005750633,0.00027825453,0.0003828098,0.00011431166,0.00043757015,0.00013204325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019338293,0.012638703,0.00056167296,0.009081792,0.0009612964,0.000042478787,0.01579884,0.0027726328,0.00030008395,0.5811244,0.0039718607,0.37255284],"study_design_scores_gemma":[0.0007980439,0.00020760078,0.0000034494349,0.000079945516,0.00011910037,0.000029841987,0.0008106669,0.75031084,0.000094216746,0.24631128,0.00095578784,0.00027922745],"about_ca_topic_score_codex":0.0000037462073,"about_ca_topic_score_gemma":0.000018393239,"teacher_disagreement_score":0.7475382,"about_ca_system_score_codex":0.00017340845,"about_ca_system_score_gemma":0.000036234866,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W1998749229","doi":"10.1016/j.matpur.2010.03.004","title":"Computation of capacity via quadratic programming","year":2010,"lang":"fr","type":"article","venue":"Journal de Mathématiques Pures et Appliquées","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computation; Computer science; Quadratic equation; Quadratic programming; Mathematical optimization; Computational science; Mathematics; Programming language; Geometry","score_opus":0.032443583479574614,"score_gpt":0.3649812414023543,"score_spread":0.3325376579227797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998749229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11522933,0.0007839737,0.8777628,0.0035431397,0.0005877059,0.0008078018,0.000021657548,0.0001105669,0.0011530479],"genre_scores_gemma":[0.16155337,0.00052327063,0.8363749,0.0001212437,0.0004085873,0.000056842993,0.000007715222,0.00010486495,0.00084923056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605864,0.0006124998,0.0013633043,0.00029095775,0.0009498927,0.00072470383],"domain_scores_gemma":[0.9960266,0.0009057521,0.001237811,0.0003537438,0.0010724748,0.00040365936],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028723385,0.00040895733,0.0006925802,0.00035931228,0.0002768897,0.00041691618,0.00048604142,0.0004722422,0.00040530402],"category_scores_gemma":[0.0013016991,0.0003986038,0.00026163127,0.00045264376,0.00048190635,0.0007675916,0.0001483142,0.0024342635,0.000039435552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024633802,0.0040552896,0.0010373315,0.009737601,0.00083568844,0.00030980908,0.036878653,0.031134851,0.051903017,0.48459187,0.0098272925,0.36944225],"study_design_scores_gemma":[0.0010817009,0.00046952744,0.00055193226,0.0010401048,0.00018512465,0.002969994,0.0009328403,0.28487235,0.013734806,0.68359786,0.009863485,0.00070027605],"about_ca_topic_score_codex":0.00007630834,"about_ca_topic_score_gemma":0.0002086276,"teacher_disagreement_score":0.368742,"about_ca_system_score_codex":0.00021636792,"about_ca_system_score_gemma":0.00046235192,"threshold_uncertainty_score":0.99986714},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07474502751145072,"score_gpt":0.4498631699427029,"score_spread":0.3751181424312522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999360615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028547369,0.00027795325,0.99508613,0.0005792566,0.00028822472,0.0010677589,0.000016951155,0.001061662,0.0015935116],"genre_scores_gemma":[0.00032208947,0.00032760404,0.9961283,0.00054643024,0.00013525446,0.00008113391,0.00016874663,0.0001269327,0.0021634994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954437,0.0010667295,0.0010537335,0.0008275134,0.0008770941,0.0007312485],"domain_scores_gemma":[0.99522144,0.0017953846,0.0005388715,0.0009848033,0.0011015027,0.00035801795],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016821631,0.00050811045,0.0007300391,0.00092472666,0.00045921266,0.00025523434,0.0005644381,0.00036251036,0.0024660937],"category_scores_gemma":[0.014745334,0.00051205914,0.00019334798,0.0036606395,0.00013342958,0.00084034447,0.00010267363,0.00048296928,0.000048704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003393718,0.00021037275,0.00006553362,0.000044983684,0.000031525746,0.0000065771933,0.00015769251,0.95091796,0.00001618726,0.002610016,0.00083697855,0.045068208],"study_design_scores_gemma":[0.0010177462,0.00017344802,0.00004253106,0.00005269652,0.00007341918,0.000018290106,0.00010359125,0.97683865,0.00044653405,0.020047497,0.0005929729,0.00059261825],"about_ca_topic_score_codex":0.0000036096335,"about_ca_topic_score_gemma":5.7013335e-7,"teacher_disagreement_score":0.04447559,"about_ca_system_score_codex":0.00027658054,"about_ca_system_score_gemma":0.00020139074,"threshold_uncertainty_score":0.9997331},"labels":[],"label_agreement":null},{"id":"W1999770095","doi":"10.1016/j.mcm.2003.12.003","title":"Cubic algorithm for global optimization with box and equality constraints and application to optimal allocation of resources","year":2004,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Overdetermined system; Underdetermined system; Mathematical optimization; Computer science; Resource allocation; Linear subspace; Linear programming; Nonlinear system; Algorithm; Graphics; Controllability; Code (set theory); Mathematics; Applied mathematics","score_opus":0.03544963206930366,"score_gpt":0.31586731508313454,"score_spread":0.28041768301383085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999770095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018925723,0.000031375243,0.9800321,0.00016710979,0.0000048931015,0.0007380173,0.000015125909,0.000041354942,0.000044330467],"genre_scores_gemma":[0.053194497,0.000015979958,0.9466382,0.00003154969,0.000028177052,0.000059758302,0.0000076713795,0.000014638097,0.000009487546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896944,0.000024062361,0.00032021612,0.00030271153,0.000209751,0.00017381378],"domain_scores_gemma":[0.99925977,0.0001905633,0.00009845184,0.00013363187,0.00018691357,0.00013066309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027928298,0.0001413151,0.00026035632,0.000048169713,0.000102423604,0.00005840961,0.00006734035,0.00006348228,0.0000022191855],"category_scores_gemma":[0.000019210933,0.00011863254,0.00001790055,0.00013271766,0.00017556096,0.00011720853,0.000076140204,0.000055627464,3.6185432e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002651525,0.00009296192,0.0000035324488,0.00025781174,0.000021254284,3.0143448e-7,0.00092687353,0.829098,0.00000667526,0.12369469,9.589616e-7,0.045870434],"study_design_scores_gemma":[0.0006598198,0.00014270529,0.0000024688077,0.000106067455,0.000022330485,0.00002055441,0.00011931828,0.8794734,0.00011305154,0.119215034,0.0000070284855,0.00011821231],"about_ca_topic_score_codex":0.0000036527983,"about_ca_topic_score_gemma":7.398912e-7,"teacher_disagreement_score":0.050375417,"about_ca_system_score_codex":0.000029595714,"about_ca_system_score_gemma":0.000020015692,"threshold_uncertainty_score":0.48376945},"labels":[],"label_agreement":null},{"id":"W1999777494","doi":"10.1007/s10898-004-9971-3","title":"Comparative Assessment of Algorithms and Software for Global Optimization","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Solver; Computer science; Software; Implementation; Stochastic programming; Mathematical optimization; Theoretical computer science; Algorithm; Software engineering; Programming language; Mathematics","score_opus":0.05312631796310618,"score_gpt":0.42537118337361673,"score_spread":0.37224486541051055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999777494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007604213,0.00024354768,0.99721915,0.00041991955,0.00014595415,0.00055042934,0.000119455115,0.000029174258,0.0005119383],"genre_scores_gemma":[0.016783372,0.00021689307,0.982685,0.00004737653,0.00016520295,0.000010794683,0.000028121183,0.000017825854,0.00004539346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977674,0.00011654572,0.0010014212,0.00020690303,0.0006533833,0.00025434088],"domain_scores_gemma":[0.9956742,0.0002679861,0.0011590937,0.00016842024,0.0025611764,0.00016911785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005591136,0.00021279218,0.0005805862,0.00009052487,0.000117180236,0.00006496029,0.00021688738,0.00013370595,0.00006345239],"category_scores_gemma":[0.00079210685,0.00019553474,0.00011747333,0.00064873655,0.000110071785,0.00075681956,0.00006917932,0.00013104676,3.5547686e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010202674,0.0002456477,0.0010485303,0.000055482902,0.00010257317,0.0000014447962,0.00006502911,0.98813874,0.0000031071572,0.005121177,0.000655664,0.0044606067],"study_design_scores_gemma":[0.0022360797,0.00040214235,0.00041314383,0.00008380537,0.000100912366,0.0000759475,0.0001694162,0.9926581,0.000046255474,0.0034427824,0.00019943947,0.00017201524],"about_ca_topic_score_codex":0.0000019154893,"about_ca_topic_score_gemma":0.000005378766,"teacher_disagreement_score":0.01602295,"about_ca_system_score_codex":0.00064374466,"about_ca_system_score_gemma":0.00033279718,"threshold_uncertainty_score":0.7973676},"labels":[],"label_agreement":null},{"id":"W2003791523","doi":"10.5539/jmr.v5n1p1","title":"The Generalized Horizontal Linear Complementarity Problem","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Uniqueness; Complementarity (molecular biology); Combinatorics; Linear complementarity problem; Complementarity theory; Block (permutation group theory); Mathematical analysis; Nonlinear system","score_opus":0.21964430345862154,"score_gpt":0.4804692793574385,"score_spread":0.2608249758988169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003791523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31763813,0.0013890184,0.622177,0.023879796,0.0009081137,0.008340112,0.000039229064,0.00019094581,0.025437621],"genre_scores_gemma":[0.015988069,0.00049066107,0.97903466,0.000026536392,0.0004277858,0.000091762835,0.0000022994982,0.00008046458,0.0038577537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943595,0.00058216683,0.0012732287,0.00016557076,0.0028460852,0.00077343715],"domain_scores_gemma":[0.9911001,0.0040651895,0.00052681693,0.00055630284,0.0034485813,0.00030304922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00765612,0.00018344715,0.00042808198,0.00032513207,0.00072644965,0.00033305038,0.0011764162,0.00009083787,0.00089340296],"category_scores_gemma":[0.0031870638,0.00010977524,0.00018275646,0.00058984006,0.00037299914,0.0004016951,0.00039977607,0.001302102,0.00019473585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023035344,0.004475431,0.0005297973,0.0013341339,0.00117922,0.00015884874,0.0069978866,0.0009991389,0.009696615,0.5505905,0.3892921,0.03451597],"study_design_scores_gemma":[0.0017707733,0.00058231124,0.00004140047,0.0001555276,0.00002323615,0.00022663726,0.004637927,0.054476943,0.0022949597,0.91878057,0.0167755,0.00023422518],"about_ca_topic_score_codex":0.000042233456,"about_ca_topic_score_gemma":0.000035668938,"teacher_disagreement_score":0.37251657,"about_ca_system_score_codex":0.00030100832,"about_ca_system_score_gemma":0.00029274952,"threshold_uncertainty_score":0.9782136},"labels":[],"label_agreement":null},{"id":"W2004843907","doi":"10.1016/s0024-3795(02)00440-8","title":"Volume and variance in the linear statistical model","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Variance (accounting); Expression (computer science); Volume (thermodynamics); Linear model; Applied mathematics; Range (aeronautics); Simple (philosophy); Matrix (chemical analysis); Linear least squares; Statistics; Least-squares function approximation; Computer science","score_opus":0.061503076815951296,"score_gpt":0.3457942258587214,"score_spread":0.2842911490427701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004843907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020838792,0.00034899157,0.9931654,0.002106321,0.000005181394,0.00064319145,0.00006770955,0.00004175147,0.001537601],"genre_scores_gemma":[0.18237665,0.001576549,0.8073965,0.0007016747,0.00019189928,0.00077944616,0.000038747003,0.00005507806,0.0068834876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991752,0.000044637753,0.0002020689,0.00022572269,0.00017346455,0.00017890183],"domain_scores_gemma":[0.9991937,0.00039613558,0.000037528407,0.0002338404,0.00006724022,0.00007152481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018712485,0.000094437,0.00011755397,0.000048962516,0.00015331314,0.000031985266,0.0001394003,0.00006190047,0.00012437547],"category_scores_gemma":[0.00023334374,0.000073770156,0.000011246849,0.000253195,0.00008022879,0.00010014067,0.00005318595,0.00022438899,0.000058302892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004966087,0.00026146846,0.000071364084,0.00006863981,0.000010452181,0.000002587402,0.0011649877,0.0022759389,0.000052294257,0.9837294,0.0019566151,0.010401286],"study_design_scores_gemma":[0.00021454676,0.0000140555,0.0000813107,0.000004453412,0.000007652101,0.00000810283,0.00006804417,0.9272713,0.000010623546,0.06686026,0.0053766156,0.00008301779],"about_ca_topic_score_codex":0.000001886087,"about_ca_topic_score_gemma":0.000003806977,"teacher_disagreement_score":0.92499536,"about_ca_system_score_codex":0.000010125825,"about_ca_system_score_gemma":0.000010719287,"threshold_uncertainty_score":0.30082595},"labels":[],"label_agreement":null},{"id":"W2004906124","doi":"10.1016/j.advengsoft.2013.03.001","title":"A survey of non-gradient optimization methods in structural engineering","year":2013,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":192,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Heuristic; Computer science; Mathematical optimization; Convergence (economics); Engineering optimization; Optimization problem; Algorithm; Mathematics","score_opus":0.021122435204401248,"score_gpt":0.3640855014981272,"score_spread":0.3429630662937259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004906124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013413136,0.0007052703,0.98511314,0.0000056318536,0.00018919223,0.00044106957,0.000009321658,0.00010730236,0.000015931435],"genre_scores_gemma":[0.07401407,0.0001297735,0.9256344,0.0000027868482,0.000013507715,0.00011091396,0.00001926106,0.00005637379,0.000018954253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985003,0.00006367264,0.000550528,0.00026605892,0.00022946362,0.00039001528],"domain_scores_gemma":[0.9980658,0.0012772765,0.0001045981,0.0002899539,0.00019037974,0.00007196457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000479937,0.00021190061,0.00038150855,0.00046246062,0.00001569296,0.00001716701,0.00024284008,0.00009011872,0.000067834786],"category_scores_gemma":[0.004425834,0.00022106449,0.000036446752,0.0010925577,0.00002516186,0.0006576302,0.00008331698,0.00028318926,0.0000017821192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036921099,0.000018709343,0.006247879,0.00024816897,0.000006205677,0.000002120306,0.00015913318,0.9840254,0.00007748493,0.0001288275,0.0000020616228,0.009080272],"study_design_scores_gemma":[0.00039347826,0.000023672681,0.021308413,0.00016423213,0.0000019382799,0.0000022667643,0.000020565534,0.97701657,0.00041858276,0.00042252307,0.000015806474,0.00021198283],"about_ca_topic_score_codex":0.00008788654,"about_ca_topic_score_gemma":0.00003580806,"teacher_disagreement_score":0.060600933,"about_ca_system_score_codex":0.00016732287,"about_ca_system_score_gemma":0.000025329251,"threshold_uncertainty_score":0.9014748},"labels":[],"label_agreement":null},{"id":"W2005484777","doi":"10.1007/bf02578956","title":"On self-regular IPMs","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Duality gap; Conic section; Duality (order theory); Conic optimization; Dual (grammatical number); Mathematical optimization; Semidefinite programming; Interior point method; Optimization problem; Point (geometry); Discrete mathematics; Convex optimization; Subderivative","score_opus":0.031515506881294245,"score_gpt":0.3562669717050758,"score_spread":0.3247514648237816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005484777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05343114,0.000051273764,0.89305604,0.001801127,0.00018371797,0.0005831607,0.0000060538687,0.00080107606,0.05008644],"genre_scores_gemma":[0.045221712,0.000022209562,0.94876283,0.0003065903,0.00012342956,0.000029849813,0.0000048267825,0.00005126559,0.0054772617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993184,0.000016442043,0.0001031788,0.00013178198,0.00025526946,0.00017493343],"domain_scores_gemma":[0.9994869,0.000096364936,0.000026438798,0.00027117974,0.000056556742,0.00006256394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010031637,0.000071414244,0.00008726627,0.00005545167,0.000055996625,0.00001402896,0.0001168661,0.000042257216,0.000292174],"category_scores_gemma":[0.00025107284,0.00006343943,0.000028687624,0.00015178353,0.000020195415,0.00005814523,0.000031984404,0.00010723305,0.00035306023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017766228,0.00039281682,0.00001148141,0.00004314266,0.00003401857,0.000041474712,0.0007319354,0.016174274,0.00020869006,0.9743366,0.002284801,0.0057229754],"study_design_scores_gemma":[0.0012031615,0.00011861939,0.000027366266,0.000029962133,0.0000082007855,0.000009891682,0.00006304912,0.0027482267,0.013116091,0.97754216,0.004949333,0.00018391403],"about_ca_topic_score_codex":0.0000030241542,"about_ca_topic_score_gemma":0.0000014270073,"teacher_disagreement_score":0.05570684,"about_ca_system_score_codex":0.00009864614,"about_ca_system_score_gemma":0.000035953206,"threshold_uncertainty_score":0.45379928},"labels":[],"label_agreement":null},{"id":"W2006760627","doi":"10.48550/arxiv.1009.1909","title":"Computing Optimal Experimental Designs via Interior Point Method","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Multiplicative function; Convergence (economics); Interior point method; Matrix (chemical analysis); Point (geometry); Mathematical optimization; Rank (graph theory); Mathematics; Regular polygon; Class (philosophy); Computer science; Applied mathematics; Algorithm; Combinatorics; Mathematical analysis; Artificial intelligence","score_opus":0.18660490915861336,"score_gpt":0.3236216128947095,"score_spread":0.13701670373609612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006760627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07764958,0.000021212705,0.9196342,0.000031497646,0.00041739113,0.0006628053,0.000018697761,0.00030900488,0.0012555787],"genre_scores_gemma":[0.46471202,0.000010801156,0.5339197,0.000025909712,0.000102178004,0.000001759603,0.00001915386,0.00007091408,0.0011375922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739707,0.00035625475,0.00039072623,0.0011141931,0.00018452258,0.00055721536],"domain_scores_gemma":[0.99746895,0.00053085014,0.00039956268,0.0010218661,0.00029390948,0.00028486483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006201239,0.00047744397,0.00059177954,0.00036890828,0.0002423689,0.0000967862,0.0010460801,0.0005207725,0.000771313],"category_scores_gemma":[0.0002384878,0.00056391227,0.0002966151,0.00035478524,0.00022691688,0.00022805003,0.0026631625,0.0017234866,0.00008885951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033530727,0.0007025917,0.00010941571,0.00036034975,0.00046756686,0.0008914491,0.0025045443,0.91945803,0.012986708,0.059096955,0.00050732016,0.0025797533],"study_design_scores_gemma":[0.0007548477,0.00008042402,0.0000067844467,0.00010327152,0.00006796814,0.00002695804,0.000712082,0.95379585,0.017485347,0.026261332,0.00010613257,0.0005990094],"about_ca_topic_score_codex":0.00004373596,"about_ca_topic_score_gemma":0.000010807334,"teacher_disagreement_score":0.38706243,"about_ca_system_score_codex":0.0004590208,"about_ca_system_score_gemma":0.00017607842,"threshold_uncertainty_score":0.99968123},"labels":[],"label_agreement":null},{"id":"W2006905759","doi":"10.1137/s1052623401398120","title":"A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quadratic growth; Mathematics; Quadratically constrained quadratic program; Quadratic programming; Second-order cone programming; Mathematical optimization; Rate of convergence; Quadratic equation; Differentiable function; Convex optimization; Interior point method; Sequential quadratic programming; Quadratic function; Function (biology); Convergence (economics); Regular polygon; Algorithm; Computer science; Mathematical analysis","score_opus":0.06237039632763324,"score_gpt":0.39680670029346676,"score_spread":0.3344363039658335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006905759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090100206,0.000032527063,0.99552315,0.0005175121,0.0003368575,0.0014988992,0.000013151207,0.00013577256,0.0018520541],"genre_scores_gemma":[0.0037913641,0.000041968025,0.99392253,0.00019547153,0.00016843439,0.00015541232,0.00007259583,0.00011337429,0.0015388363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996449,0.00069826166,0.0010250598,0.00043397877,0.0007558551,0.0006378402],"domain_scores_gemma":[0.99646515,0.0011686021,0.0006197946,0.00031418976,0.0011157853,0.00031650273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014077104,0.0003585924,0.0005197202,0.00039756106,0.0006028433,0.00042889366,0.00023022307,0.00022184163,0.00091273716],"category_scores_gemma":[0.0052217767,0.00032728745,0.00020693816,0.0005739118,0.000101749276,0.00049020356,0.000023077233,0.0004290356,0.000009784073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020557204,0.00053959794,0.00001323107,0.00015420925,0.00015688023,0.000012064932,0.00035262233,0.805012,0.00024869063,0.18787883,0.00083379814,0.004592501],"study_design_scores_gemma":[0.0032254509,0.0005456461,0.0000010048511,0.00012318752,0.00011107169,0.00015840412,0.00037060303,0.94543755,0.0018245623,0.04564778,0.002148906,0.00040584712],"about_ca_topic_score_codex":5.427288e-7,"about_ca_topic_score_gemma":0.0000015199071,"teacher_disagreement_score":0.14223105,"about_ca_system_score_codex":0.00025337667,"about_ca_system_score_gemma":0.00038105273,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W2007077331","doi":"10.1002/cjce.5450790615","title":"Further developments in the new approach to boundary condition iteration in optimal control","year":2001,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Optimal control; Convergence (economics); Mathematics; Mathematical optimization; Boundary value problem; Boundary (topology); Maximum principle; Matrix (chemical analysis); Clipping (morphology); State (computer science); Transformation (genetics); Iterative method; Applied mathematics; Control theory (sociology); Control (management); Computer science; Algorithm; Mathematical analysis","score_opus":0.023083468744903555,"score_gpt":0.2780353291811229,"score_spread":0.2549518604362193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007077331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36673898,0.00016998271,0.62527204,0.0058064535,0.00012976036,0.0006729356,0.0000052413293,0.000012869225,0.0011917753],"genre_scores_gemma":[0.95701,0.0000015367061,0.042611204,0.00021289827,0.000088095665,0.000008620267,0.000002473366,0.000014996806,0.0000501937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917984,0.000032886277,0.00028078482,0.00006402428,0.00021229431,0.00023018029],"domain_scores_gemma":[0.99946517,0.00015215942,0.00004802986,0.00009197048,0.0000616194,0.00018105382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055573945,0.00007874437,0.00012492413,0.00020286434,0.000030922864,0.00007406359,0.00025598236,0.00004561644,0.000031260857],"category_scores_gemma":[0.0005340299,0.000055011147,0.000024984154,0.00035066344,0.000018729348,0.00012855914,0.0000064262,0.00035188216,0.000003573744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051924562,0.000040246832,0.0002071097,0.000020851361,0.000031699223,0.000093261675,0.008422302,0.9817498,0.0029853056,0.002703851,0.0012072852,0.0024864175],"study_design_scores_gemma":[0.012177416,0.00015715073,0.0037451887,0.0008451472,0.00006939178,0.0026093428,0.0016206333,0.92097545,0.009593576,0.016147578,0.030700749,0.0013583652],"about_ca_topic_score_codex":0.000109446955,"about_ca_topic_score_gemma":0.0002103142,"teacher_disagreement_score":0.590271,"about_ca_system_score_codex":0.00033359957,"about_ca_system_score_gemma":0.0003540192,"threshold_uncertainty_score":0.22432895},"labels":[],"label_agreement":null},{"id":"W2007203545","doi":"10.1134/s1995080212030158","title":"Few remarks on the geometry of the uncentered coefficient of determination","year":2012,"lang":"en","type":"article","venue":"Lobachevskii Journal of Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Geometry; Calculus (dental); Algebra over a field; Pure mathematics","score_opus":0.06404116727728586,"score_gpt":0.3517907299601111,"score_spread":0.28774956268282526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007203545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49662104,0.0005794053,0.49569404,0.0011011958,0.0006750715,0.0009944027,0.00003215989,0.000018054965,0.0042846086],"genre_scores_gemma":[0.8663815,0.00008363372,0.13302004,0.00004911824,0.000097156044,0.0000035501637,6.0701797e-7,0.000034887977,0.00032946758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99710244,0.00021223415,0.0011107551,0.00007291996,0.001233483,0.00026814232],"domain_scores_gemma":[0.9948147,0.0019089917,0.0019214362,0.00056473276,0.00070328126,0.00008686868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024964737,0.00016147744,0.00041673536,0.00016933793,0.000084331725,0.000016290442,0.0006959515,0.00008937843,0.00012765994],"category_scores_gemma":[0.0046725417,0.00008438339,0.00024551246,0.0005637336,0.0001979819,0.00014643185,0.00014608516,0.00037665412,0.000004746057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060989783,0.02726864,0.0076053906,0.008694325,0.0018430615,0.000027817428,0.052333083,0.023636192,0.015096156,0.7894728,0.020016301,0.053396307],"study_design_scores_gemma":[0.009715605,0.0025804285,0.0060709813,0.012668142,0.0016240159,0.0018218713,0.034665752,0.17094737,0.4678382,0.28670645,0.0035403154,0.0018208759],"about_ca_topic_score_codex":4.915289e-7,"about_ca_topic_score_gemma":5.974768e-7,"teacher_disagreement_score":0.5027664,"about_ca_system_score_codex":0.00012048507,"about_ca_system_score_gemma":0.00007475759,"threshold_uncertainty_score":0.55938065},"labels":[],"label_agreement":null},{"id":"W2007787872","doi":"10.4208/jcm.1301-m4106","title":"On an Efficient Implementation of the Face Algorithm for Linear Programming","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Shanghai University of Finance and Economics; National Natural Science Foundation of China; Hong Kong Baptist University","keywords":"Computer science; Face (sociological concept); Algorithm; Linear programming; Programming language; Linguistics; Philosophy","score_opus":0.044293353251518654,"score_gpt":0.40546932045895173,"score_spread":0.36117596720743306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007787872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089668095,0.0000073956344,0.9090367,0.0002669711,0.00009599289,0.0008819466,0.000014974333,0.000010508487,0.000017415272],"genre_scores_gemma":[0.06538757,0.0000011204198,0.9343958,0.00003321999,0.000075119206,0.000027209982,0.000004471923,0.000027182863,0.000048305737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979872,0.00006780573,0.00084059435,0.00009097823,0.00084730453,0.00016610694],"domain_scores_gemma":[0.9959917,0.0012810258,0.0010161392,0.0001592433,0.0014750483,0.00007681405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006173931,0.00012055004,0.0002536459,0.0001377271,0.000105967534,0.0000393903,0.00028885508,0.00004151857,0.000066931105],"category_scores_gemma":[0.00044717282,0.00008048354,0.00014643866,0.00022463556,0.000058719546,0.0001544589,0.000039044386,0.00015041057,0.0000039297543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012382792,0.001066377,0.000013236967,0.00025098794,0.00011577037,8.2242076e-7,0.0029966426,0.84368515,0.00007020832,0.043671813,0.0005348473,0.10758179],"study_design_scores_gemma":[0.000769228,0.0002992084,0.00008099225,0.0000785853,0.00002500477,0.000022909506,0.00192139,0.7557541,0.0007518066,0.24019314,0.000030331357,0.00007330878],"about_ca_topic_score_codex":0.0000011349982,"about_ca_topic_score_gemma":4.2396155e-7,"teacher_disagreement_score":0.19652133,"about_ca_system_score_codex":0.00007670314,"about_ca_system_score_gemma":0.00014295314,"threshold_uncertainty_score":0.32820234},"labels":[],"label_agreement":null},{"id":"W2009009651","doi":"10.1007/s10589-013-9596-x","title":"Lower bounds on the global minimum of a polynomial","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Semidefinite programming; Degree (music); Ball (mathematics); Polynomial; Computation; Discrete mathematics; Mathematical analysis; Algorithm; Mathematical optimization","score_opus":0.030582452357959092,"score_gpt":0.3310471121649883,"score_spread":0.3004646598070292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009009651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016174375,0.000021640188,0.9898209,0.0029508201,0.0000255588,0.0008788207,0.00003676819,0.00005099572,0.0045970483],"genre_scores_gemma":[0.3133492,0.000031989675,0.6839264,0.00082684023,0.00012896383,0.0008601075,0.00010783644,0.000031386797,0.0007372601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.000047343045,0.00029707953,0.00019434522,0.00028143718,0.00012827455],"domain_scores_gemma":[0.9985454,0.00061666046,0.00014523091,0.00020180483,0.00041428008,0.00007661982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001046732,0.000109271714,0.000121770245,0.000058880083,0.00021973239,0.00006706783,0.00015778713,0.00004908397,0.0005303962],"category_scores_gemma":[0.0001417036,0.00008496079,0.000039792507,0.00043818867,0.00018530223,0.00011728508,0.000054913417,0.00007847129,0.000040494324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007793028,0.00016262702,0.000070982074,0.000010888645,0.000019326786,7.927158e-8,0.00004499901,0.70041734,0.000004176608,0.29344827,0.0038972422,0.0019162936],"study_design_scores_gemma":[0.00036814227,0.000041645253,0.00034426703,0.000010671771,0.000009581179,0.0000040333643,0.00010381937,0.8711882,0.0000159768,0.12637055,0.00143056,0.000112528185],"about_ca_topic_score_codex":0.0000039786714,"about_ca_topic_score_gemma":6.17763e-7,"teacher_disagreement_score":0.31173176,"about_ca_system_score_codex":0.000047370457,"about_ca_system_score_gemma":0.00006647572,"threshold_uncertainty_score":0.5807466},"labels":[],"label_agreement":null},{"id":"W2009873747","doi":"10.1007/s11228-010-0157-5","title":"Convex Hull Algorithms for Piecewise Linear-Quadratic Functions in Computational Convex Analysis","year":2010,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convex hull; Proper convex function; Mathematics; Convex analysis; Algorithm; Convex conjugate; Convex combination; Subderivative; Mathematical optimization; Convex optimization; Piecewise linear function; Piecewise; Conic optimization; Computation; Quadratic equation; Envelope (radar); Convex set; Regular polygon; Computer science; Mathematical analysis","score_opus":0.05239085046265335,"score_gpt":0.3808286360075549,"score_spread":0.32843778554490155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009873747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014563947,0.00003347392,0.9828766,0.0010929238,0.00010717018,0.00049062,0.0005849175,0.00007057558,0.00017974475],"genre_scores_gemma":[0.32840168,0.000012764501,0.6661454,0.00020088987,0.00020526774,0.00023567476,0.0029471363,0.000039806822,0.0018113692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731874,0.00015205325,0.0008051043,0.00063075795,0.0007113775,0.00038195172],"domain_scores_gemma":[0.9965117,0.0017525435,0.00029746784,0.0003445058,0.0008807082,0.00021310331],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010627873,0.0002745397,0.00076103804,0.0016541214,0.00035856015,0.00011085272,0.00020090191,0.00019382028,0.0011785747],"category_scores_gemma":[0.000919677,0.000266059,0.00041072597,0.0044196574,0.00014274566,0.00028294715,0.00007017647,0.00038135127,0.000020626849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012660759,0.00069516076,0.02370096,0.000083571635,0.009850939,0.000006750493,0.00094933715,0.76249653,0.000095466195,0.19952224,0.00043836792,0.0020340425],"study_design_scores_gemma":[0.0011720095,0.000033184413,0.012062875,0.000003900617,0.0026258028,0.0000021918452,0.00017009846,0.91395116,0.000008775717,0.06947111,0.00022867022,0.00027022377],"about_ca_topic_score_codex":0.00008171015,"about_ca_topic_score_gemma":0.00049412105,"teacher_disagreement_score":0.31673124,"about_ca_system_score_codex":0.00007114347,"about_ca_system_score_gemma":0.00018315346,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W2010003677","doi":"10.1007/s101070050020","title":"New error bounds and their applications to convergence analysis of iterative algorithms","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Sublinear function; Mathematics; Sequence (biology); Convex function; Rate of convergence; Function (biology); Convergence (economics); Convex optimization; Algorithm; Combinatorics; Regular polygon; Applied mathematics; Mathematical optimization; Computer science","score_opus":0.05693277297337088,"score_gpt":0.38643188571191994,"score_spread":0.32949911273854904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010003677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037439817,0.000062447165,0.9935556,0.00024422244,0.000007073955,0.00097634055,0.000017802817,0.00010171779,0.0012908225],"genre_scores_gemma":[0.026122708,0.0000108308595,0.97018254,0.000042849577,0.00003372071,0.0002793051,0.000013038939,0.00003343574,0.0032815614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836826,0.00005533431,0.0005431666,0.0003605423,0.0003301487,0.0003425414],"domain_scores_gemma":[0.9983723,0.00061467744,0.00009926234,0.00043168984,0.00016866978,0.00031336964],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035198563,0.00020217894,0.00053115975,0.00027700266,0.00012844962,0.00008295408,0.000240738,0.00007417621,0.0021181605],"category_scores_gemma":[0.00026439223,0.0001626479,0.00012463839,0.0018663828,0.00013274106,0.00013470474,0.00008498754,0.00014212907,0.000051740713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031057083,0.0004423568,0.00008310317,0.00026537216,0.0008273999,0.0000027755295,0.00841639,0.00093625113,0.00015349487,0.07168556,0.0002028558,0.9169534],"study_design_scores_gemma":[0.00087096344,0.00032724426,0.00011466573,0.0001696342,0.000812964,0.00001984492,0.0024690556,0.55253774,0.002159258,0.42269588,0.016954323,0.00086842757],"about_ca_topic_score_codex":0.0000075150238,"about_ca_topic_score_gemma":0.0000067966344,"teacher_disagreement_score":0.91608495,"about_ca_system_score_codex":0.00004024545,"about_ca_system_score_gemma":0.00004140263,"threshold_uncertainty_score":0.998794},"labels":[],"label_agreement":null},{"id":"W2010057117","doi":"10.1021/ie071316j","title":"Global Optimization of Reverse Osmosis Network for Wastewater Treatment and Minimization","year":2008,"lang":"en","type":"article","venue":"Industrial & Engineering Chemistry Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Global optimization; Nonlinear programming; Computer science; Integer programming; Linear programming; Simplex algorithm; Tree (set theory); Piecewise; Branch and bound; Convergence (economics); Minification; Node (physics); Nonlinear system; Mathematics; Engineering","score_opus":0.17132539074068937,"score_gpt":0.3795481335498377,"score_spread":0.20822274280914832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010057117","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7777403,0.00055071496,0.21149158,0.0011613731,0.00056819676,0.0059452187,0.0006174138,0.00053425593,0.0013909314],"genre_scores_gemma":[0.4320831,0.0013773844,0.55260676,0.000010055405,0.0035216073,0.0011394277,0.0006049506,0.00030497398,0.008351771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983861,0.00004963422,0.00036962255,0.0003061272,0.000411429,0.00047710966],"domain_scores_gemma":[0.99849135,0.00058877317,0.000076259894,0.00028539592,0.0004014431,0.00015676391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004531002,0.00017194718,0.00028538142,0.000063440944,0.00016051164,0.00002490074,0.00015290169,0.00025652564,0.00007877504],"category_scores_gemma":[0.0017393685,0.00016870741,0.000059704937,0.0006543508,0.00011722599,0.00011000114,0.00008402112,0.0001791757,6.988442e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016118442,0.000100605524,0.0004029585,0.00013660219,0.000071331575,0.000005307488,0.00009716802,0.9908269,0.0043335017,0.00013285434,0.0032287734,0.0005028303],"study_design_scores_gemma":[0.005369629,0.00035077907,0.000021673397,0.00022244616,0.00004748139,0.000057763427,0.00014258736,0.83692145,0.15075156,0.0006215195,0.005053984,0.00043912695],"about_ca_topic_score_codex":0.000017922466,"about_ca_topic_score_gemma":5.068829e-7,"teacher_disagreement_score":0.34565723,"about_ca_system_score_codex":0.0003453833,"about_ca_system_score_gemma":0.00016926338,"threshold_uncertainty_score":0.68796885},"labels":[],"label_agreement":null},{"id":"W2010175834","doi":"10.1016/j.cam.2003.09.011","title":"Simultaneous solution approaches for large optimization problems","year":2003,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bundesministerium für Bildung und Forschung; Universität Heidelberg; Ryerson University","keywords":"Mathematics; Quadratic programming; Sequential quadratic programming; Mathematical optimization; Quadratic unconstrained binary optimization; Quadratic equation; Optimization problem; Active set method; Algorithm; Nonlinear programming","score_opus":0.0651527538157605,"score_gpt":0.3148085425683438,"score_spread":0.2496557887525833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010175834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009322949,0.00006905536,0.9973792,0.000111413945,0.00005332032,0.00049349957,0.000009881538,0.000019812145,0.00093155436],"genre_scores_gemma":[0.059822615,0.000020588888,0.9398567,0.000024710043,0.00007598262,0.000020948686,0.0000096525055,0.000029154638,0.00013966218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986299,0.000024296301,0.0006217811,0.000119484845,0.00040807383,0.00019643635],"domain_scores_gemma":[0.99741656,0.0014345744,0.0005460698,0.00007578674,0.00043644226,0.00009055012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079118693,0.00013912436,0.0003062131,0.00013437666,0.00016163995,0.00005370399,0.00009119101,0.00007074737,0.000024094976],"category_scores_gemma":[0.0007673257,0.00011655435,0.000066538836,0.00015824546,0.000038569717,0.00012135623,0.000020774823,0.00013373964,0.0000012201959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012969429,0.0002272083,7.0354406e-7,0.000196561,0.000031646206,5.737493e-7,0.0003375906,0.6418157,0.000013419473,0.35649702,0.00012985311,0.00073674],"study_design_scores_gemma":[0.0008732833,0.00005454435,4.1985686e-7,0.000027820726,0.000026278041,0.00006345272,0.0002607072,0.607081,0.00007945669,0.3910086,0.00043848398,0.00008598078],"about_ca_topic_score_codex":2.4508186e-8,"about_ca_topic_score_gemma":1.576211e-7,"teacher_disagreement_score":0.05889032,"about_ca_system_score_codex":0.00004503135,"about_ca_system_score_gemma":0.00008080784,"threshold_uncertainty_score":0.47529486},"labels":[],"label_agreement":null},{"id":"W2011613539","doi":"10.1145/2429135.2429150","title":"Structured computation in optimization and algorithmic differentiation","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computation; Automatic differentiation; Computer science; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.052052283369908726,"score_gpt":0.3556649149947944,"score_spread":0.30361263162488566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011613539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055038135,0.00013003539,0.9419721,0.0015992614,0.00007248636,0.0009917645,0.000003704106,0.00010844431,0.00008408891],"genre_scores_gemma":[0.29092202,0.00021548147,0.70849276,0.00006540387,0.000022327054,0.00014200673,0.000099821045,0.000025112506,0.000015083225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982737,0.0003560849,0.0005761251,0.0003065471,0.00023147275,0.00025608807],"domain_scores_gemma":[0.9972527,0.0010302669,0.0001600177,0.0012802692,0.00021050073,0.00006622873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002658519,0.00018019437,0.0002506804,0.0005190858,0.00013343191,0.00014052578,0.00083079585,0.000115603754,0.000074284006],"category_scores_gemma":[0.0003098424,0.00019364977,0.000026858468,0.00073382974,0.0001242447,0.00059386576,0.0009208974,0.00036457132,0.000012046081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016186952,0.0008819298,0.017702194,0.00014979411,0.00006878309,0.0000038486587,0.004625529,0.5182498,0.00017231399,0.023080582,0.0007942324,0.43425483],"study_design_scores_gemma":[0.00079036725,0.000020810661,0.019835735,0.000045820314,0.000003982246,0.0000053951553,0.000062424595,0.86226463,0.000017422046,0.11677958,0.000011969183,0.00016184036],"about_ca_topic_score_codex":0.00008382445,"about_ca_topic_score_gemma":0.0001267897,"teacher_disagreement_score":0.43409297,"about_ca_system_score_codex":0.00016069153,"about_ca_system_score_gemma":0.000032827495,"threshold_uncertainty_score":0.7896809},"labels":[],"label_agreement":null},{"id":"W2014632088","doi":"10.1137/s1052623499352632","title":"A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Overdetermined system; Symmetrization; Mathematics; Semidefinite programming; Interior point method; Linearization; Gauss; Mathematical optimization; Optimization problem; Applied mathematics; Combinatorics; Nonlinear system","score_opus":0.07053505632736073,"score_gpt":0.37942709032516825,"score_spread":0.3088920339978075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014632088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011822847,0.00007681404,0.9911462,0.0017583331,0.00050532114,0.0012744416,0.000023376178,0.0002640402,0.0037691975],"genre_scores_gemma":[0.004993619,0.0022250572,0.9832737,0.0002769424,0.0009815402,0.00014820458,0.00023556536,0.00023484736,0.00763054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616235,0.0003712041,0.000987593,0.0005531907,0.0011612404,0.00076439953],"domain_scores_gemma":[0.99621254,0.0008346906,0.00053278694,0.0004168359,0.0016398578,0.0003633078],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015421499,0.00040743276,0.00047166387,0.0008352011,0.00087085855,0.0003884221,0.00028323644,0.00029330197,0.000991335],"category_scores_gemma":[0.0020475613,0.0003885828,0.00023017886,0.0012387978,0.000094097006,0.001001221,0.000067882596,0.0006679682,0.000029861018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006759123,0.00034887195,0.00007845336,0.000048932376,0.00006691424,0.000020066946,0.00018995139,0.98979944,0.00008155754,0.0024755388,0.002081186,0.0041331733],"study_design_scores_gemma":[0.0030720811,0.00058986706,0.000020629996,0.00015659428,0.0000554486,0.00034867408,0.00017480271,0.9892978,0.0005640031,0.0027865027,0.0025065918,0.0004269803],"about_ca_topic_score_codex":0.0000025511538,"about_ca_topic_score_gemma":0.0000022078368,"teacher_disagreement_score":0.007872508,"about_ca_system_score_codex":0.0006394419,"about_ca_system_score_gemma":0.00022523945,"threshold_uncertainty_score":0.9999219},"labels":[],"label_agreement":null},{"id":"W2015695027","doi":"10.1016/j.dam.2008.01.016","title":"The colourful feasibility problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Benchmarking; Generalization; Convergence (economics); Mathematics; Mathematical optimization; Linear programming; Computational complexity theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.07630770286649102,"score_gpt":0.35293061711257817,"score_spread":0.27662291424608715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015695027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033617623,0.00011918609,0.7835016,0.0010634809,0.00012994121,0.004627815,0.000037594156,0.0008326294,0.17607014],"genre_scores_gemma":[0.059582934,0.00018099319,0.93406016,0.000069591704,0.00009158075,0.00042028676,0.000013723133,0.00012174908,0.005459004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751765,0.000044542987,0.0006620582,0.00036329322,0.00081411516,0.0005983358],"domain_scores_gemma":[0.9968328,0.0014557341,0.0002768812,0.0010568666,0.00020818415,0.00016954371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007898818,0.0002821213,0.00037112393,0.000054573706,0.00095943775,0.0000724826,0.00062521483,0.00011559713,0.00011597245],"category_scores_gemma":[0.0006606536,0.00018695317,0.00011551472,0.00042132754,0.0004964028,0.000101535064,0.00024794874,0.000364079,0.0001881614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054991073,0.00038328205,0.00006193511,0.0002640465,0.000084254956,0.000015426793,0.0029352636,0.00027730054,0.0005478831,0.98583287,0.008135798,0.0014069657],"study_design_scores_gemma":[0.000995093,0.000056752102,0.000058885238,0.000029404433,0.00003427303,0.00007048761,0.0015826117,0.012721096,0.0019505256,0.9770787,0.004966629,0.00045558327],"about_ca_topic_score_codex":0.0000012901424,"about_ca_topic_score_gemma":0.0000069905936,"teacher_disagreement_score":0.17061113,"about_ca_system_score_codex":0.00013485002,"about_ca_system_score_gemma":0.00011645891,"threshold_uncertainty_score":0.7623729},"labels":[],"label_agreement":null},{"id":"W2015985877","doi":"10.1016/j.cam.2004.11.043","title":"High-order Newton-penalty algorithms","year":2005,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Extrapolation; Newton's method in optimization; Mathematics; Penalty method; Newton's method; Differentiable function; Quadratic growth; Residual; Convergence (economics); Applied mathematics; Interior point method; Quadratic equation; Algorithm; Richardson extrapolation; Rate of convergence; Mathematical optimization; Order (exchange); Local convergence; Iterative method; Computer science; Mathematical analysis; Nonlinear system","score_opus":0.031490206178281285,"score_gpt":0.33012491499685054,"score_spread":0.29863470881856924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015985877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017674942,0.00008199929,0.9792732,0.0016114893,0.000065014596,0.00019782802,0.0000073197007,0.000030386773,0.0010578331],"genre_scores_gemma":[0.017539954,0.000045603145,0.98133224,0.00015261164,0.00037010355,0.0000052169476,0.000004294256,0.000032371052,0.00051757676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807686,0.000018470513,0.0008154624,0.00012917841,0.0007536766,0.00020632819],"domain_scores_gemma":[0.99771655,0.0008261296,0.0005818503,0.00011490526,0.0005957732,0.00016478276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005309602,0.00017602867,0.00040468288,0.00018472053,0.00012031358,0.000067509,0.00019021131,0.00006633441,0.00015436577],"category_scores_gemma":[0.00019591706,0.00014044112,0.00006541976,0.00025347536,0.00008824762,0.00020342914,0.00007131493,0.00028409783,0.000021898235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033432465,0.0006075941,0.0000027988117,0.0001729702,0.00014131833,0.000009723504,0.00085984776,0.28459853,0.0001964533,0.6678533,0.0041535213,0.041370504],"study_design_scores_gemma":[0.0015214646,0.0000743667,0.000034439858,0.00005898814,0.000045906512,0.00027448073,0.0002999906,0.13705854,0.0007969841,0.856887,0.0027361528,0.00021167981],"about_ca_topic_score_codex":2.5315217e-7,"about_ca_topic_score_gemma":3.4132043e-7,"teacher_disagreement_score":0.18903369,"about_ca_system_score_codex":0.000057797228,"about_ca_system_score_gemma":0.0001102059,"threshold_uncertainty_score":0.5727023},"labels":[],"label_agreement":null},{"id":"W2017858314","doi":"10.1007/bf02294738","title":"The Optimality of the Centroid Method","year":2003,"lang":"en","type":"article","venue":"Psychometrika","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Centroid; Mathematics; Constraint (computer-aided design); Statistics; Component (thermodynamics); Variance (accounting); Mean squared error; Variance components; Econometrics; Geometry","score_opus":0.06974073740841744,"score_gpt":0.4315197948621453,"score_spread":0.36177905745372785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017858314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022040375,0.0008388658,0.95657885,0.0012278637,0.0006273587,0.00077238714,0.000016332278,0.00005565228,0.03767866],"genre_scores_gemma":[0.034854252,0.00033445875,0.9566203,0.000092211645,0.00004915451,0.000042505555,7.234909e-7,0.000044005246,0.007962419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813104,0.00048488253,0.0003347296,0.00018466733,0.00057052023,0.00029417724],"domain_scores_gemma":[0.9956805,0.0029912684,0.00018635218,0.0008454921,0.0002325341,0.00006385715],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0018336041,0.00010448128,0.00016628041,0.00009958952,0.00024137972,0.00003133743,0.0005057827,0.000050555554,0.00022084854],"category_scores_gemma":[0.01060579,0.0000555933,0.00012241144,0.0019405334,0.000130904,0.000055790748,0.00005948171,0.00022772701,0.00001401059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093972856,0.0007108003,0.0051650447,0.00011708355,0.00023780724,0.0000011658923,0.00059002516,0.0019040882,0.0008208851,0.90353584,0.017689507,0.06913376],"study_design_scores_gemma":[0.0030394895,0.0001274452,0.005793663,0.000054181386,0.00006990831,0.000033674627,0.0010767442,0.0074323104,0.039306384,0.5450119,0.39751798,0.0005363332],"about_ca_topic_score_codex":0.0000023886373,"about_ca_topic_score_gemma":0.0000023687098,"teacher_disagreement_score":0.37982848,"about_ca_system_score_codex":0.000050666913,"about_ca_system_score_gemma":0.0000490473,"threshold_uncertainty_score":0.9977283},"labels":[],"label_agreement":null},{"id":"W2018727518","doi":"10.1007/s10589-013-9622-z","title":"Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convex conjugate; Conjugate residual method; Derivation of the conjugate gradient method; Conjugate; Piecewise; Convex function; Applied mathematics; Conjugate gradient method; Convex analysis; Regular polygon; Mathematical analysis; Convex optimization; Mathematical optimization; Computer science","score_opus":0.03456162899230268,"score_gpt":0.33283612322275286,"score_spread":0.29827449423045016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018727518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083010696,0.00006555042,0.99515253,0.0016341342,0.000041099087,0.0012523753,0.000023832597,0.00010267372,0.00089769025],"genre_scores_gemma":[0.3050472,0.00006036197,0.6930358,0.00034979364,0.00016429457,0.00051382784,0.00021288227,0.000045695255,0.0005701398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846816,0.000106646345,0.0005682165,0.0002688069,0.0003955596,0.00019259186],"domain_scores_gemma":[0.9971254,0.0010732596,0.0003000717,0.00026106802,0.0011283343,0.00011187863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028466084,0.00015550293,0.00021418126,0.00011636605,0.0004929622,0.00008274276,0.00018134463,0.00006287528,0.00039985887],"category_scores_gemma":[0.00025490217,0.00012675377,0.00005274341,0.0005980732,0.00029003032,0.00022055866,0.00009637104,0.00015770967,0.0000596052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033480947,0.000095246985,0.00006749238,0.000027585756,0.00003192766,8.607413e-8,0.00014358498,0.9090293,0.000019573836,0.08740415,0.00054056133,0.0026371416],"study_design_scores_gemma":[0.00045578415,0.000021577835,0.00020592459,0.000013495682,0.000027794473,0.0000050279964,0.00020191119,0.96425235,0.00003624819,0.033678506,0.0009751669,0.00012620482],"about_ca_topic_score_codex":0.000011617212,"about_ca_topic_score_gemma":0.0000010164869,"teacher_disagreement_score":0.3042171,"about_ca_system_score_codex":0.000033381213,"about_ca_system_score_gemma":0.00011405021,"threshold_uncertainty_score":0.5168869},"labels":[],"label_agreement":null},{"id":"W2019780010","doi":"10.1007/s00186-013-0431-z","title":"Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cutting-plane method; Mathematical optimization; Relaxation (psychology); Set (abstract data type); Conic section; Cluster analysis; Constraint (computer-aided design); Computer science; Point (geometry); Plane (geometry); Interior point method; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Integer programming; Geometry","score_opus":0.1633956873692615,"score_gpt":0.5237032706965733,"score_spread":0.36030758332731183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019780010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004970145,0.000021639433,0.9877483,0.001417088,0.00003810756,0.004343608,0.00004126554,0.000035612873,0.0013842048],"genre_scores_gemma":[0.01202881,0.000009827105,0.98469526,0.000014793347,0.000025915542,0.0017692735,0.0000066164534,0.000052251897,0.001397261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454767,0.0021365539,0.0014345502,0.00041123744,0.0008539581,0.0006160396],"domain_scores_gemma":[0.98603046,0.01064777,0.00019633013,0.00056904997,0.002428026,0.00012836719],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011845991,0.00020544368,0.00060533575,0.0006098182,0.00036269648,0.00012416464,0.00060830114,0.00017979782,0.0010615212],"category_scores_gemma":[0.032355573,0.00015034253,0.00015105856,0.0016470642,0.00047508552,0.00036850234,0.00036085263,0.0007718619,0.000012593662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006964518,0.0008139088,0.00010196839,0.0023073845,0.00015742957,6.131833e-7,0.0074758525,0.015835842,0.19868015,0.747321,0.0014068176,0.025829364],"study_design_scores_gemma":[0.0005475807,0.00014278943,0.000024900215,0.00031266984,0.000015825539,0.000015979249,0.0022961495,0.5869949,0.05987005,0.34959435,0.000056512523,0.0001283258],"about_ca_topic_score_codex":0.00015580069,"about_ca_topic_score_gemma":0.00011756695,"teacher_disagreement_score":0.571159,"about_ca_system_score_codex":0.00023028608,"about_ca_system_score_gemma":0.00037413635,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W2020604580","doi":"10.1088/1742-6596/410/1/012051","title":"Computing sparse derivatives and consecutive zeros problem","year":2013,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Jacobian matrix and determinant; Travelling salesman problem; Matrix (chemical analysis); Sparse matrix; Algorithm; A priori and a posteriori; Computation; Computer science; Heuristic; Substitution (logic); Cuthill–McKee algorithm; Graph; Mathematics; Theoretical computer science; Artificial intelligence; Symmetric matrix; Eigenvalues and eigenvectors; Square matrix","score_opus":0.06426015364986735,"score_gpt":0.33073751990466654,"score_spread":0.2664773662547992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020604580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11496339,0.00005117908,0.88248956,0.0008072874,0.000059735496,0.00033582246,0.000005020644,0.000026439056,0.0012615499],"genre_scores_gemma":[0.6544216,0.000081060236,0.3450976,0.00002556684,0.00008376449,0.0000033587987,7.291437e-7,0.000015768623,0.0002704908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989619,0.000085404565,0.00037273276,0.00010845613,0.0002779199,0.00019355473],"domain_scores_gemma":[0.9977509,0.00032105198,0.0004663756,0.000102572725,0.0012561661,0.000102940074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016688956,0.00013451485,0.0003066681,0.00005321892,0.00011141504,0.00014241274,0.0001454842,0.00003742802,0.00008372061],"category_scores_gemma":[0.00024592446,0.00010954602,0.000041304087,0.00013950044,0.00030790095,0.0009647627,0.00009827189,0.0002716465,0.0000063937373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001249272,0.00039331382,0.0020289489,0.00040746192,0.00038981557,0.000035572186,0.022070982,0.0009032139,0.0261103,0.70194286,0.0018659801,0.24372663],"study_design_scores_gemma":[0.00070451986,0.00031255902,0.00069683784,0.00024837867,0.000021169297,0.00009415127,0.0063006333,0.0057756845,0.07021114,0.9152697,0.00013093202,0.00023431648],"about_ca_topic_score_codex":0.0000039480196,"about_ca_topic_score_gemma":9.357394e-7,"teacher_disagreement_score":0.5394583,"about_ca_system_score_codex":0.000024887364,"about_ca_system_score_gemma":0.00014996929,"threshold_uncertainty_score":0.44671568},"labels":[],"label_agreement":null},{"id":"W2021428356","doi":"10.1007/s002080010009","title":"Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form","year":2001,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interior point method; Conic optimization; Mathematics; Mathematical optimization; Linear programming; Second-order cone programming; Convex optimization; Regular polygon; Convex analysis; Geometry","score_opus":0.08016735234894054,"score_gpt":0.430702327804027,"score_spread":0.3505349754550865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021428356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010887475,0.000021494674,0.986303,0.00031158046,0.00007947024,0.0011593972,0.000023839375,0.00005815875,0.0011556209],"genre_scores_gemma":[0.050202925,0.000027215145,0.9491859,0.000038065544,0.000020615395,0.000109407,0.00016140277,0.000049391707,0.00020509736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972228,0.00015731309,0.0014810397,0.00026921617,0.0006098835,0.00025974607],"domain_scores_gemma":[0.9963158,0.0012463613,0.00066124776,0.00034322118,0.0013355714,0.00009779234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071055,0.00021246121,0.0005210856,0.0007459983,0.00008026481,0.000042727206,0.00026756083,0.00009820248,0.0005095163],"category_scores_gemma":[0.0019542133,0.00022420594,0.00008958062,0.0013744783,0.0001349087,0.0004123819,0.00014524469,0.00013325356,0.000012562681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015334335,0.000339465,0.000113980175,0.0002849323,0.00003908078,6.377704e-7,0.0020906006,0.88690513,0.00020930506,0.108504936,0.000055008717,0.0014415805],"study_design_scores_gemma":[0.0006006573,0.0000998401,0.000091663416,0.00016912812,0.000018842578,0.000016432077,0.00028433625,0.70135933,0.0004433556,0.29666165,0.00009857276,0.00015618546],"about_ca_topic_score_codex":0.000009499914,"about_ca_topic_score_gemma":0.000016703301,"teacher_disagreement_score":0.18815671,"about_ca_system_score_codex":0.00020562527,"about_ca_system_score_gemma":0.00023382704,"threshold_uncertainty_score":0.9142853},"labels":[],"label_agreement":null},{"id":"W2023710022","doi":"10.1016/s0166-218x(01)00352-3","title":"Semidefinite programming for discrete optimization and matrix completion problems","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Lagrangian relaxation; Matrix completion; Relaxation (psychology); Mathematical optimization; Euclidean geometry; Matrix (chemical analysis); Euclidean distance matrix; Maximum cut; Optimization problem; Positive-definite matrix; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.06678160909610262,"score_gpt":0.3380575190064754,"score_spread":0.27127590991037276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023710022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036239537,0.00012811298,0.99243796,0.000247757,0.000038109167,0.0029717204,0.00005948303,0.00034803015,0.0034064183],"genre_scores_gemma":[0.0077199806,0.00017950317,0.989552,0.0000331164,0.00007970706,0.00097401376,0.00013174942,0.00015325629,0.0011766541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763376,0.000026995427,0.00073857285,0.0004922881,0.00052571844,0.0005826533],"domain_scores_gemma":[0.9980171,0.0007199008,0.0003882677,0.00049511885,0.00019905693,0.00018055705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050154,0.00037005547,0.00052169274,0.00018518706,0.00035487497,0.00020655434,0.00024034466,0.00016283551,0.00016595864],"category_scores_gemma":[0.00040697952,0.0003383166,0.00009759882,0.0003898762,0.00016866077,0.00023081794,0.00014941968,0.0002150943,0.000024061712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055357636,0.00065181305,0.000022184766,0.0054512033,0.00023210426,0.0000042010242,0.007655764,0.104096204,0.0013678015,0.8631219,0.0016947977,0.015646648],"study_design_scores_gemma":[0.0012680787,0.000085800464,0.0000012571203,0.0001270225,0.00008981437,0.000017013486,0.0006415314,0.9032109,0.00023984855,0.091766454,0.0020837248,0.00046859332],"about_ca_topic_score_codex":9.1404723e-7,"about_ca_topic_score_gemma":0.0000018296626,"teacher_disagreement_score":0.79911464,"about_ca_system_score_codex":0.000076295175,"about_ca_system_score_gemma":0.000011979936,"threshold_uncertainty_score":0.9999069},"labels":[],"label_agreement":null},{"id":"W2024962211","doi":"10.1007/s10589-005-3064-1","title":"The Complexity of Self-Regular Proximity Based Infeasible IPMs","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Interior point method; Path (computing); Function (biology); Simple (philosophy); Mathematical optimization; Dual (grammatical number); Point (geometry); Current (fluid); Combinatorics; Algorithm; Discrete mathematics; Computer science","score_opus":0.05987156577406685,"score_gpt":0.34935601883539363,"score_spread":0.2894844530613268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024962211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010217359,0.000080512065,0.9949466,0.0030247627,0.000010395122,0.0008581003,0.00003167812,0.000121178,0.00082461233],"genre_scores_gemma":[0.039037723,0.000048971495,0.960195,0.00012667343,0.000059406404,0.000260585,0.0001268887,0.000020995403,0.00012377165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987855,0.0000763253,0.00040616645,0.00021645767,0.0003573279,0.00015822666],"domain_scores_gemma":[0.99816334,0.0006179117,0.00022070247,0.00025873393,0.00064759434,0.000091706745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029036953,0.00012073383,0.00014562682,0.000090821515,0.00052164186,0.00005999165,0.00019089953,0.000052036008,0.00008216714],"category_scores_gemma":[0.00012971973,0.00010147704,0.000044263856,0.00047380597,0.00041218495,0.00019188396,0.00006072326,0.00010520956,0.0000072240005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046802347,0.00013566109,0.00004324309,0.00001863209,0.000012675372,2.7642695e-8,0.00003007552,0.6449955,0.0000033162853,0.35158384,0.00014545424,0.0030268803],"study_design_scores_gemma":[0.0004616775,0.000013697595,0.00014262424,0.000006563184,0.000013430543,0.000002190996,0.00002824612,0.89718807,0.000097868455,0.09728588,0.0046641356,0.00009560871],"about_ca_topic_score_codex":0.00000152989,"about_ca_topic_score_gemma":0.0000046280934,"teacher_disagreement_score":0.25429794,"about_ca_system_score_codex":0.000057002802,"about_ca_system_score_gemma":0.0001441291,"threshold_uncertainty_score":0.41381136},"labels":[],"label_agreement":null},{"id":"W2026627205","doi":"10.1016/j.cor.2013.03.001","title":"Achieving MILP feasibility quickly using general disjunctions","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematical optimization; Mathematics","score_opus":0.3344502833390069,"score_gpt":0.5042806537434319,"score_spread":0.169830370404425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026627205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.287523,0.000051343704,0.70846146,0.0012848407,0.00022409378,0.0015353658,0.0000108058075,0.0001482208,0.000760862],"genre_scores_gemma":[0.13383174,0.000036287667,0.8589531,0.00009443316,0.00044185508,0.000275409,0.00004363572,0.000076770346,0.006246775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604625,0.0008455764,0.000533154,0.0006288073,0.001087583,0.0008586154],"domain_scores_gemma":[0.99598145,0.00074894464,0.000032082848,0.0009880969,0.0018937701,0.0003556737],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013208622,0.0002188883,0.00028094,0.0005812303,0.0017392628,0.0007082179,0.00062672526,0.00012207379,0.0009863683],"category_scores_gemma":[0.0013756709,0.00020665229,0.0001066322,0.0014916719,0.00039048036,0.0009726912,0.0005942255,0.00082463416,0.00035832118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043906395,0.0018999848,0.0040485743,0.00023958819,0.0002297528,0.000028473147,0.0027310092,0.81272537,0.027046908,0.07763359,0.047334425,0.02603841],"study_design_scores_gemma":[0.00048004757,0.00008194793,0.0013246811,0.000041269286,0.000006884609,0.000019352186,0.00030176624,0.9920107,0.0003024006,0.0044344855,0.0007477868,0.00024863987],"about_ca_topic_score_codex":0.0006124607,"about_ca_topic_score_gemma":0.0001423209,"teacher_disagreement_score":0.17928536,"about_ca_system_score_codex":0.00062754593,"about_ca_system_score_gemma":0.0003996828,"threshold_uncertainty_score":0.99992687},"labels":[],"label_agreement":null},{"id":"W2029207664","doi":"10.1016/j.orl.2010.08.007","title":"Lifting, tilting and fractional programming revisited","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer programming; Connection (principal bundle); Simple (philosophy); Linear programming; Mathematical optimization; Mathematics; Key (lock); Integer (computer science); Fractional programming; Computer science; Algorithm; Nonlinear programming; Programming language; Nonlinear system; Geometry","score_opus":0.08743048111281011,"score_gpt":0.44426865722914527,"score_spread":0.35683817611633517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029207664","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6546261,0.000070816786,0.3048049,0.033370655,0.0002469515,0.0024485341,0.000025291363,0.00039899317,0.0040077865],"genre_scores_gemma":[0.15100828,0.000033555785,0.84581363,0.00034336455,0.0005075662,0.00027880902,0.00004546623,0.000064818625,0.0019045124],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783874,0.00022864038,0.00026730678,0.00035197788,0.0008212794,0.0004920674],"domain_scores_gemma":[0.99802977,0.0007953243,0.000024614925,0.00035757927,0.00060793565,0.00018475809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913643,0.00011495527,0.00012969926,0.00038244377,0.0010631188,0.00046034888,0.00020744865,0.00007751623,0.0005068257],"category_scores_gemma":[0.0061419094,0.00010950746,0.000029884079,0.000682345,0.00029652214,0.00047271416,0.0001765702,0.0012919995,0.000065373206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079659665,0.0007758679,0.0050888485,0.00039382683,0.00020956378,0.00013688588,0.0039435118,0.0117798,0.5573649,0.22124374,0.041404128,0.15757932],"study_design_scores_gemma":[0.0023123254,0.00019951178,0.0015454637,0.00022483361,0.000027095131,0.00023672795,0.0015362987,0.77872944,0.008417279,0.00648883,0.19912568,0.0011565012],"about_ca_topic_score_codex":0.00003601884,"about_ca_topic_score_gemma":0.000100160076,"teacher_disagreement_score":0.76694965,"about_ca_system_score_codex":0.000055321932,"about_ca_system_score_gemma":0.00008945191,"threshold_uncertainty_score":0.81767577},"labels":[],"label_agreement":null},{"id":"W2030044614","doi":"10.1007/s11228-009-0112-5","title":"A Class of Quadratic Programs with Linear Complementarity Constraints","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Complementarity (molecular biology); Complementarity theory; Quadratic equation; Mathematical optimization; Linear complementarity problem; Class (philosophy); Constraint (computer-aided design); Stationary point; Mixed complementarity problem; Mathematics; Independence (probability theory); Point (geometry); Applied mathematics; Computer science; Mathematical economics; Nonlinear system; Mathematical analysis; Artificial intelligence","score_opus":0.06346052568580175,"score_gpt":0.37194278340215187,"score_spread":0.30848225771635013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030044614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031889245,0.000016259248,0.96616757,0.0006943714,0.000008300205,0.000367102,0.000095937285,0.000044546723,0.00071666186],"genre_scores_gemma":[0.60665745,0.0000050030885,0.39288145,0.0000645,0.000022000586,0.00000879812,0.00023971013,0.000006022556,0.00011504417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858576,0.00009832164,0.00036627878,0.00023416046,0.00053609913,0.00017936512],"domain_scores_gemma":[0.99899125,0.00017673758,0.00019986328,0.00018086594,0.000361097,0.00009017875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031336895,0.00012705094,0.00034808877,0.00022072373,0.00012930277,0.00002854348,0.00009657005,0.000044108852,0.00039353134],"category_scores_gemma":[0.00012622507,0.000100514444,0.00008341319,0.001022352,0.00013790217,0.000109087334,0.000022522818,0.00010830818,0.0000021176036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026105114,0.0016074266,0.025579834,0.0001509674,0.004868406,0.0000131323,0.0023711647,0.028869757,0.0002010893,0.9200454,0.00014291544,0.015888855],"study_design_scores_gemma":[0.0013537162,0.00030406276,0.014128766,0.000027736723,0.001021673,0.0000055037544,0.00045911068,0.90687984,0.00005185831,0.07548262,0.000059673795,0.00022542581],"about_ca_topic_score_codex":0.00003425467,"about_ca_topic_score_gemma":0.000072575815,"teacher_disagreement_score":0.8780101,"about_ca_system_score_codex":0.000035287205,"about_ca_system_score_gemma":0.00007694517,"threshold_uncertainty_score":0.43088922},"labels":[],"label_agreement":null},{"id":"W2030072108","doi":"10.4153/cmb-2003-054-7","title":"Optimization of Polynomial Functions","year":2003,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Semidefinite programming; Polynomial; Set (abstract data type); Duality (order theory); Stability (learning theory); Duality gap; Mathematical optimization; Algebra over a field; Optimization problem; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.032920779753588744,"score_gpt":0.2937928326217608,"score_spread":0.26087205286817206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030072108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011591646,0.00003171874,0.86851907,0.0012093587,0.00009422477,0.0004695542,0.00003806517,0.00006688303,0.12841195],"genre_scores_gemma":[0.07443989,0.000011075725,0.89963615,0.00021920656,0.00006686436,0.00007824474,0.000020562336,0.00009738538,0.025430609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858755,0.00011100087,0.00042290473,0.00020655195,0.00027396463,0.0003980302],"domain_scores_gemma":[0.99840385,0.00045448315,0.000093764465,0.0003665582,0.00021615175,0.00046517348],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004091169,0.00014463034,0.00026256702,0.00024882637,0.00012502368,0.000025501728,0.00015986909,0.00011823121,0.053145226],"category_scores_gemma":[0.004093951,0.0001431653,0.00007932732,0.00033700984,0.00013384616,0.000040324303,0.000016299988,0.00016530167,0.0017044242],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034766348,0.00057764805,0.000103629645,0.0005630668,0.0001630697,0.00004806684,0.00084855483,0.066191904,0.00009646229,0.5151935,0.41432664,0.0018527058],"study_design_scores_gemma":[0.0043466794,0.00040000203,0.000035036486,0.00041537458,0.00023490794,0.00027799784,0.0030004836,0.116339855,0.003379284,0.19906148,0.67046523,0.0020436328],"about_ca_topic_score_codex":0.000086260174,"about_ca_topic_score_gemma":0.00013590591,"teacher_disagreement_score":0.316132,"about_ca_system_score_codex":0.00016611296,"about_ca_system_score_gemma":0.0003181603,"threshold_uncertainty_score":0.99907285},"labels":[],"label_agreement":null},{"id":"W2030389346","doi":"10.1016/j.compchemeng.2011.01.031","title":"Convex/concave relaxations of parametric ODEs using Taylor models","year":2011,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Mathematics; Regular polygon; Pointwise; Effective domain; Parametric statistics; Remainder; Interval (graph theory); Discretization; Nonlinear system; Concave function; Applied mathematics; Mathematical optimization; Convex combination; Convex optimization; Mathematical analysis; Combinatorics; Geometry","score_opus":0.1498321808931704,"score_gpt":0.3118079012449519,"score_spread":0.16197572035178148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030389346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03744494,0.000048125108,0.9618372,0.0000068927725,0.00009145458,0.0001525861,0.0000038658973,0.00013521379,0.00027976828],"genre_scores_gemma":[0.43490705,0.0000031492436,0.5650201,0.0000058656005,0.00002383252,0.0000055744263,0.000002313191,0.000025538471,0.00000658526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989647,0.000011641364,0.00034479814,0.00020015873,0.00022305123,0.00025561065],"domain_scores_gemma":[0.9989631,0.000406281,0.00010326568,0.0002628381,0.00014854512,0.000115967436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010471865,0.00014559098,0.00026980226,0.00021283043,0.000024858218,0.000010820315,0.00023373708,0.00009072103,0.000025502895],"category_scores_gemma":[0.00039907044,0.00015493947,0.00007626099,0.0005455998,0.000055200824,0.00018201608,0.0001299696,0.00020170731,0.000002631961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013751043,0.0001673545,0.000021297135,0.0002685127,0.000113309536,0.000009991367,0.0010915208,0.9357275,0.023310477,0.03655605,0.000055469864,0.0026648052],"study_design_scores_gemma":[0.00025168768,0.000011224836,0.0000035598246,0.00004302532,0.0000145797685,0.000008028434,0.000017507955,0.9409853,0.051300947,0.0072125616,0.0000068086492,0.00014472332],"about_ca_topic_score_codex":0.0000051934517,"about_ca_topic_score_gemma":2.64002e-8,"teacher_disagreement_score":0.3974621,"about_ca_system_score_codex":0.000095190655,"about_ca_system_score_gemma":0.000018961995,"threshold_uncertainty_score":0.63182485},"labels":[],"label_agreement":null},{"id":"W2030454071","doi":"10.1007/s11590-011-0428-6","title":"Efficient use of parallelism in algorithmic parameter optimization applications","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Parallelism (grammar); Computer science; Solver; Computational intelligence; Context (archaeology); Task (project management); Minification; Identification (biology); Mathematical optimization; Optimization problem; Algorithm; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.08854811697420045,"score_gpt":0.31406325915510647,"score_spread":0.22551514218090601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030454071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019141694,0.000016152751,0.99610394,0.00024866543,0.00006300561,0.0012034967,0.000019036845,0.00010962516,0.0003218851],"genre_scores_gemma":[0.008239286,0.000058000245,0.9908102,0.0002537712,0.000029586921,0.00034380474,0.00006551522,0.00006809888,0.00013174603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978374,0.00016674065,0.000769098,0.00042848504,0.00042947996,0.00036876183],"domain_scores_gemma":[0.9983127,0.00039470967,0.0003487896,0.0005600959,0.00027918813,0.000104486506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028627567,0.00023375395,0.00032241203,0.00055652426,0.00008254001,0.000037748716,0.00026884564,0.0001267846,0.0005671156],"category_scores_gemma":[0.00043688307,0.00024570175,0.00008619164,0.0010498319,0.00016082756,0.000284517,0.00008458309,0.00020106438,0.000011538217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000305946,0.00027781946,0.00022271306,0.000033530796,0.000019375608,0.0000036885372,0.00048632082,0.99627495,0.000057484885,0.0017551434,0.0001485696,0.0006898377],"study_design_scores_gemma":[0.0006999265,0.000023725952,0.000084740575,0.000032973432,0.000018866787,0.000004358287,0.00005396239,0.9980872,0.00028524298,0.00037496924,0.00009231674,0.000241688],"about_ca_topic_score_codex":0.00003157962,"about_ca_topic_score_gemma":0.0000028790225,"teacher_disagreement_score":0.006325117,"about_ca_system_score_codex":0.0001278858,"about_ca_system_score_gemma":0.00004270649,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W2031535169","doi":"10.1007/s10957-010-9777-z","title":"The Q Method for Symmetric Cone Programming","year":2011,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Second-order cone programming; Interior point method; Cone (formal languages); Semidefinite programming; Eigenvalues and eigenvectors; Invertible matrix; Euclidean geometry; Newton's method; Applied mathematics; Algebra over a field; Pure mathematics; Algorithm; Mathematical optimization; Convex optimization; Geometry; Regular polygon","score_opus":0.06321141336508737,"score_gpt":0.3915314996434185,"score_spread":0.3283200862783311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031535169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011191764,0.00031891785,0.99795294,0.00016377721,0.00003066553,0.00065985793,0.0000035522723,0.000018535544,0.00084058335],"genre_scores_gemma":[0.00095981755,0.00039560505,0.9977261,0.00003477047,0.00009126277,0.00019990368,0.0000021668602,0.000020579959,0.00056983694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990158,0.00016898982,0.00042720567,0.00009703731,0.00015099466,0.00013996151],"domain_scores_gemma":[0.9960682,0.0025352864,0.000458512,0.00016315229,0.0006921216,0.00008277412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025000293,0.00008058453,0.00014274308,0.00014094893,0.00042205295,0.00005230914,0.00019518464,0.00004612057,0.000033406137],"category_scores_gemma":[0.0012741664,0.000054516895,0.000062945546,0.00043459123,0.00009779349,0.00016779783,0.000028383984,0.00012255003,7.2959097e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097372125,0.000091980895,0.000004604269,0.000019409781,0.000048278194,2.390641e-7,0.00024017046,0.0071854815,0.000009797278,0.8811904,0.00008901939,0.11102323],"study_design_scores_gemma":[0.0009227944,0.00017523377,0.000009721509,0.000019914287,0.00012234639,0.000081765065,0.0012632512,0.07918323,0.00069497916,0.8952189,0.022159409,0.00014844265],"about_ca_topic_score_codex":1.7921101e-7,"about_ca_topic_score_gemma":1.9318345e-7,"teacher_disagreement_score":0.11087479,"about_ca_system_score_codex":0.000021734859,"about_ca_system_score_gemma":0.000045231824,"threshold_uncertainty_score":0.32461327},"labels":[],"label_agreement":null},{"id":"W2033477411","doi":"10.1007/s12532-012-0035-2","title":"A primal–dual regularized interior-point method for convex quadratic programs","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; University of British Columbia","funders":"","keywords":"Interior point method; Regularization (linguistics); Mathematics; Theory of computation; Quadratic programming; Mathematical optimization; Regular polygon; Rank (graph theory); Linear programming; Applied mathematics; Quadratic equation; Convex optimization; Dual (grammatical number); Algorithm; Computer science; Combinatorics; Artificial intelligence; Geometry","score_opus":0.09562827335959624,"score_gpt":0.42808541220179064,"score_spread":0.3324571388421944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033477411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002009174,0.000035918118,0.9925333,0.00040902535,0.00017362877,0.0038911377,0.0000034097952,0.0005866286,0.00035775558],"genre_scores_gemma":[0.04447594,8.329831e-7,0.95349634,0.000052010124,0.00021460217,0.001185344,0.00007797664,0.00011315745,0.00038377446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967003,0.00031031895,0.0009704152,0.00042214294,0.0006755339,0.0009212752],"domain_scores_gemma":[0.99686456,0.0016206229,0.00036940814,0.0003604587,0.0004530569,0.000331896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002594527,0.00035475957,0.0006601395,0.00018825271,0.00027210618,0.00024103343,0.00021220114,0.00018350665,0.00010107965],"category_scores_gemma":[0.0026436818,0.00031345955,0.00022789904,0.00046109696,0.00015515926,0.00047888752,0.00015012942,0.00028472813,0.00007183749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020489508,0.0021420647,0.000047971225,0.0030503406,0.00026155481,0.000005675303,0.008425599,0.0002644344,0.00065822806,0.35804403,0.0004931227,0.6264021],"study_design_scores_gemma":[0.0014713896,0.00032418646,0.000005993871,0.0001917892,0.000110080175,0.00007356144,0.0008541739,0.5836284,0.00061085104,0.4113083,0.0010077927,0.0004134533],"about_ca_topic_score_codex":0.0000018636289,"about_ca_topic_score_gemma":9.2899046e-7,"teacher_disagreement_score":0.62598866,"about_ca_system_score_codex":0.00019627379,"about_ca_system_score_gemma":0.00006338169,"threshold_uncertainty_score":0.99993175},"labels":[],"label_agreement":null},{"id":"W2034011814","doi":"10.1115/detc2003/dac-48763","title":"A New Global Optimization Method for Simultaneous Computation on Expensive Black-Box Functions","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Global optimization; Mathematical optimization; Computation; Black box; Computer science; Continuous optimization; Sampling (signal processing); Optimization problem; Metaheuristic; Algorithm; Mathematics; Multi-swarm optimization; Artificial intelligence","score_opus":0.05613921593824059,"score_gpt":0.4165271954443426,"score_spread":0.360387979506102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034011814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019577621,0.000007855949,0.98465085,0.0003078587,0.00016080854,0.0011350628,0.000024837438,0.00022065005,0.0134725],"genre_scores_gemma":[0.0011508509,0.000005625478,0.9877687,0.00023524383,0.000064613945,0.0000477054,0.00005557992,0.000040693434,0.010630974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849725,0.0001515165,0.00032736387,0.000369561,0.00034986343,0.00030447362],"domain_scores_gemma":[0.99668735,0.002140424,0.00012537019,0.00023204887,0.0006442163,0.00017058571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022937804,0.00019121602,0.00022420463,0.000098417775,0.00017917535,0.00006470925,0.000092274866,0.00011147666,0.0005748237],"category_scores_gemma":[0.0040241266,0.0001822462,0.00008730454,0.0004758741,0.000027967968,0.00014351259,0.000020037734,0.00009840868,0.00006986721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005784527,0.00008645004,0.0000014626528,0.000014963091,0.000029289928,0.0000023394916,0.00010202649,0.9208744,0.000008754989,0.06051138,0.009129262,0.009181832],"study_design_scores_gemma":[0.0012740636,0.00019963273,4.0584425e-7,0.000011158854,0.000025313362,0.0000123390155,0.0005291866,0.94070184,0.00043134522,0.054711748,0.0019113211,0.00019165475],"about_ca_topic_score_codex":0.000009390837,"about_ca_topic_score_gemma":0.000013635992,"teacher_disagreement_score":0.019827437,"about_ca_system_score_codex":0.00025549837,"about_ca_system_score_gemma":0.0001601932,"threshold_uncertainty_score":0.7431785},"labels":[],"label_agreement":null},{"id":"W2035042610","doi":"10.1145/377626.377633","title":"An elementary solution of a minimax problem arising in algorithms for automatic mesh selection","year":2000,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Minimax; Mathematical proof; Factorization; Simple (philosophy); Selection (genetic algorithm); Computer science; Algorithm; Bivariate analysis; Mathematical optimization; Mathematics; Algebra over a field; Artificial intelligence; Pure mathematics; Machine learning","score_opus":0.04752711656673853,"score_gpt":0.3672985144051624,"score_spread":0.3197713978384239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035042610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3120034,0.00016587785,0.6742157,0.0048059733,0.00013041825,0.006474642,0.00012264891,0.0006563866,0.001424995],"genre_scores_gemma":[0.03924662,0.000034133693,0.959475,0.00007323657,0.000071280636,0.00028179426,0.000076071236,0.00005584759,0.00068602245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980723,0.00015350919,0.000643531,0.00035180835,0.00035902642,0.00041981335],"domain_scores_gemma":[0.9985989,0.00059154764,0.00017287329,0.00039086703,0.00016838186,0.00007744232],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007830653,0.00017637665,0.0003027616,0.00022008455,0.00011103728,0.000029317927,0.00031088793,0.000111005975,0.0027400502],"category_scores_gemma":[0.0006154067,0.0001874921,0.00006600335,0.00040185242,0.000052916403,0.00015012975,0.000044447133,0.00017394099,0.000027887505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004760689,0.0029377597,0.00092871184,0.0013463193,0.0001584182,0.000011227643,0.003614105,0.014978908,0.012336349,0.0015234844,0.02549624,0.9361924],"study_design_scores_gemma":[0.0044096997,0.0011653479,0.00045405055,0.0003610307,0.00006893483,0.000027081414,0.00070275675,0.9134675,0.015020536,0.052472714,0.011193483,0.00065681443],"about_ca_topic_score_codex":0.00010294242,"about_ca_topic_score_gemma":0.000048503884,"teacher_disagreement_score":0.9355356,"about_ca_system_score_codex":0.00018256021,"about_ca_system_score_gemma":0.0000701651,"threshold_uncertainty_score":0.99817157},"labels":[],"label_agreement":null},{"id":"W2035164723","doi":"10.1007/s10107-008-0256-3","title":"Generating and measuring instances of hard semidefinite programs","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Massachusetts Institute of Technology","keywords":"Mathematics; Semidefinite programming; Numerical analysis; Mathematical optimization; Combinatorics; Mathematical analysis","score_opus":0.17104321623886967,"score_gpt":0.33928467736829426,"score_spread":0.1682414611294246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035164723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42503634,0.0004006701,0.5715135,0.00008446032,0.000033563,0.0009838829,0.0000019737197,0.00031282843,0.0016328192],"genre_scores_gemma":[0.15725356,0.000040046052,0.8422312,0.000009497463,0.000039486542,0.00009926873,0.0000024599015,0.000043011318,0.00028142313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979433,0.0000754304,0.00063636794,0.00030133387,0.0006179431,0.00042562155],"domain_scores_gemma":[0.9986544,0.00048461472,0.00020573658,0.0002897401,0.00021315356,0.00015234294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065829075,0.00020080284,0.00043594162,0.00011077011,0.00023677603,0.000051143554,0.00016964825,0.00008629602,0.00003527274],"category_scores_gemma":[0.0016351425,0.00017234703,0.0000755609,0.00036830996,0.0003607016,0.0002129173,0.0001371743,0.00022823786,0.000008152487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073920906,0.001837992,0.00816643,0.005783739,0.0002924916,0.000150432,0.01244816,0.00066295476,0.0041435356,0.18467666,0.00009634512,0.78166735],"study_design_scores_gemma":[0.004746006,0.0010682797,0.00034639981,0.0032693015,0.00021667892,0.0012586582,0.0051249876,0.40816787,0.01964407,0.54998875,0.0036694275,0.00249955],"about_ca_topic_score_codex":0.0000022081138,"about_ca_topic_score_gemma":0.0000025525896,"teacher_disagreement_score":0.7791678,"about_ca_system_score_codex":0.000034650428,"about_ca_system_score_gemma":0.00003954116,"threshold_uncertainty_score":0.70281076},"labels":[],"label_agreement":null},{"id":"W2035396114","doi":"10.1023/b:jota.0000042522.65261.51","title":"Conic Formulation for l p -Norm Optimization","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Duality gap; Conic section; Mathematics; Duality (order theory); Conic optimization; Norm (philosophy); Strong duality; Theory of computation; Weak duality; Optimization problem; Perturbation function; Mathematical optimization; Interior point method; Wolfe duality; Applied mathematics; Discrete mathematics; Algorithm; Convex optimization; Geometry; Convex analysis","score_opus":0.03102397558523285,"score_gpt":0.36277640587176224,"score_spread":0.3317524302865294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035396114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017515007,0.00015001436,0.99790144,0.00041531335,0.00004644707,0.00086289865,0.000013365291,0.000039019153,0.00039634883],"genre_scores_gemma":[0.027898662,0.00040507392,0.97089,0.000096321244,0.0002114143,0.00014888644,0.00004063256,0.000041589647,0.00026744528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987446,0.000069632224,0.000626564,0.00015838776,0.00023072747,0.00017009662],"domain_scores_gemma":[0.9974738,0.00068052596,0.0006098713,0.00018289707,0.0009342975,0.000118641634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502472,0.00013513978,0.0002260048,0.00024092066,0.0003014677,0.0000681587,0.0001581712,0.00009750048,0.000082834595],"category_scores_gemma":[0.0007113233,0.000123726,0.00008715861,0.0003689509,0.000059783037,0.00058483914,0.000026745112,0.00013535214,0.0000013477226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069951064,0.00007536451,0.0000029911723,0.000023932498,0.00002099982,1.8289767e-7,0.00008811164,0.5994488,0.000024108476,0.3987788,0.00002090926,0.0014458646],"study_design_scores_gemma":[0.0030069791,0.00020217287,0.000006588147,0.000056331177,0.00011232633,0.00008000666,0.00037407127,0.25877422,0.0008564258,0.73498124,0.0013250256,0.00022465218],"about_ca_topic_score_codex":2.2910784e-7,"about_ca_topic_score_gemma":3.286418e-7,"teacher_disagreement_score":0.34067458,"about_ca_system_score_codex":0.00010999289,"about_ca_system_score_gemma":0.00012895951,"threshold_uncertainty_score":0.50454},"labels":[],"label_agreement":null},{"id":"W2035553949","doi":"10.1016/j.arcontrol.2011.10.003","title":"Gradient geodesic and Newton geodesic HMP algorithms for the optimization of hybrid systems","year":2011,"lang":"en","type":"article","venue":"Annual Reviews in Control","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Geodesic; Algorithm; Computer science; Geodesic map; Optimization algorithm; Solving the geodesic equations; Mathematics; Mathematical optimization; Geometry","score_opus":0.12061383193183377,"score_gpt":0.36535469506432405,"score_spread":0.24474086313249027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035553949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021059137,0.015232619,0.98001575,0.00014759546,0.00016478157,0.0039743264,0.00008387904,0.000025131529,0.00014531781],"genre_scores_gemma":[0.15342453,0.075193375,0.759599,0.0006416694,0.00052143866,0.006794662,0.000067799716,0.00030793285,0.003449605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800944,0.00027647204,0.0008350893,0.00029401705,0.00024872136,0.00033623385],"domain_scores_gemma":[0.9974922,0.0012599546,0.00039597237,0.00043356585,0.00033944473,0.00007885223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001950347,0.00020189106,0.0006275078,0.00012343528,0.0000944007,0.00002292328,0.00027893763,0.000050939358,0.000031093336],"category_scores_gemma":[0.0018742586,0.00013636415,0.000105628285,0.0002299105,0.00012327172,0.00022232436,0.000047736605,0.00015115453,0.000003769603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010326888,0.0015418186,0.00131002,0.006067246,0.0006349984,0.000039519386,0.0082448395,0.36604694,0.00007516269,0.11339013,0.014866371,0.48675025],"study_design_scores_gemma":[0.0021029827,0.00021884347,0.000053095497,0.0003141348,0.00010376081,0.00001778313,0.00030848396,0.9824992,0.00006417672,0.004155897,0.009939068,0.00022258899],"about_ca_topic_score_codex":0.000055803404,"about_ca_topic_score_gemma":0.000008242533,"teacher_disagreement_score":0.6164522,"about_ca_system_score_codex":0.000057568486,"about_ca_system_score_gemma":0.00004279688,"threshold_uncertainty_score":0.5560768},"labels":[],"label_agreement":null},{"id":"W2037152566","doi":"10.1016/j.amc.2007.11.054","title":"Generalization: One technique of computational and applied mathematical methodology","year":2007,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Generalization; Computer science; Algorithm; Mathematics; Mathematical optimization","score_opus":0.10490955056564834,"score_gpt":0.38796636872096785,"score_spread":0.2830568181553195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037152566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012843698,0.000027874556,0.9811854,0.000060353283,0.000013291062,0.00088605727,0.000004207484,0.000089138244,0.0048900265],"genre_scores_gemma":[0.12799385,0.000015191241,0.8717805,0.000036688823,0.000028454106,0.00006112678,0.000023682878,0.00003706139,0.00002341966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827814,0.000029401439,0.00075051864,0.00028890595,0.00041476657,0.00023828114],"domain_scores_gemma":[0.9972041,0.001970833,0.00034857454,0.00016352662,0.00020552304,0.000107401516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001589036,0.00019516695,0.00046793284,0.00024287314,0.00011719646,0.000029961688,0.00009735934,0.00014689975,0.000035857218],"category_scores_gemma":[0.00018049368,0.00019468956,0.000029406408,0.00032274422,0.00022141045,0.000056265413,0.00012132208,0.00014430116,0.0000035988373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025515394,0.00021918539,0.0000037087634,0.00059763173,0.000041904896,8.0723873e-7,0.0010060553,0.0039429977,0.005634122,0.9702171,0.000026164787,0.018284809],"study_design_scores_gemma":[0.00057757413,0.00004178237,0.000072054514,0.00003699928,0.00003836495,0.000032836542,0.00040556776,0.059431512,0.0092645455,0.9299078,0.0000098696255,0.00018108437],"about_ca_topic_score_codex":7.8705096e-7,"about_ca_topic_score_gemma":0.0000010966857,"teacher_disagreement_score":0.115150146,"about_ca_system_score_codex":0.000028783807,"about_ca_system_score_gemma":0.000029184503,"threshold_uncertainty_score":0.793921},"labels":[],"label_agreement":null},{"id":"W2037284017","doi":"10.1287/moor.1040.0116","title":"An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cutting-plane method; Mathematics; Interior point method; Ball (mathematics); Regular polygon; Dual cone and polar cone; Cone (formal languages); Convex set; Second-order cone programming; Center (category theory); Plane (geometry); Convex optimization; Feasible region; Point (geometry); Mathematical optimization; Mathematical analysis; Algorithm; Geometry; Integer programming","score_opus":0.19860811453338056,"score_gpt":0.49848181023595955,"score_spread":0.299873695702579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037284017","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021344287,0.000062791485,0.9714,0.00199723,0.000016852302,0.0037605064,0.0001605845,0.000075505915,0.0011822094],"genre_scores_gemma":[0.054263663,0.000017329561,0.94099593,0.00004275332,0.000091560876,0.0008861171,0.000039144365,0.000074493895,0.0035890199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651796,0.0005382583,0.00092128746,0.00040569718,0.0010436408,0.0005731612],"domain_scores_gemma":[0.99009216,0.00537776,0.00013047681,0.0010970364,0.003158314,0.00014428221],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007355988,0.00022876973,0.0004884144,0.00029060504,0.0006910523,0.00027348002,0.00071176834,0.00010605406,0.0009958373],"category_scores_gemma":[0.0034019002,0.00014970398,0.00006720442,0.0006338838,0.00045731114,0.0005481661,0.00018889808,0.0005326982,0.000015524387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005783581,0.0037928983,0.00010872561,0.005233023,0.0007032868,0.0000061121827,0.06534862,0.102478154,0.026077978,0.779214,0.0037597553,0.0126990825],"study_design_scores_gemma":[0.0013871883,0.00061481923,0.000007659731,0.00016483838,0.00003077655,0.000032259664,0.015804589,0.9253024,0.027000004,0.02881105,0.0005887411,0.00025569063],"about_ca_topic_score_codex":0.000037688525,"about_ca_topic_score_gemma":0.0007846544,"teacher_disagreement_score":0.82282424,"about_ca_system_score_codex":0.00016730845,"about_ca_system_score_gemma":0.0004003188,"threshold_uncertainty_score":0.9999174},"labels":[],"label_agreement":null},{"id":"W2037586972","doi":"10.1007/s11075-013-9767-y","title":"On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Ottawa","funders":"","keywords":"Theory of computation; Mathematics; Chebyshev filter; Applied mathematics; Order (exchange); Chebyshev iteration; Numerical analysis; Chebyshev polynomials; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.09780373790638307,"score_gpt":0.403758183934134,"score_spread":0.3059544460277509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037586972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001143403,0.000013677358,0.995588,0.0010298773,0.00011959234,0.0012681851,0.00005195505,0.00012917517,0.0006561532],"genre_scores_gemma":[0.019801712,0.0000039566776,0.9776044,0.00012998872,0.00008015421,0.0005543291,0.00010289485,0.00006615067,0.0016564479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804765,0.00021113335,0.00048295746,0.00043171673,0.00042262656,0.00040388785],"domain_scores_gemma":[0.99701923,0.001079903,0.00021117582,0.00045709315,0.001053332,0.00017926781],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031114687,0.00025707568,0.0005001399,0.00014682463,0.00021049382,0.00006411684,0.00020422669,0.00012182815,0.0017950961],"category_scores_gemma":[0.0007121759,0.00019359298,0.000085572115,0.00066493015,0.00025717175,0.0002588564,0.000047994294,0.0002705756,0.000069176334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066995615,0.004349098,0.00014331473,0.00047973485,0.0006059564,0.000005281267,0.0013837311,0.028474785,0.002224591,0.16612169,0.007011369,0.78853047],"study_design_scores_gemma":[0.0024362085,0.0011760107,0.0010459309,0.000050355713,0.0000636706,0.000013011158,0.00017849344,0.82122016,0.0032200837,0.16874148,0.0013887563,0.0004658283],"about_ca_topic_score_codex":0.00015532893,"about_ca_topic_score_gemma":0.000006530152,"teacher_disagreement_score":0.7927454,"about_ca_system_score_codex":0.00010292736,"about_ca_system_score_gemma":0.00009385847,"threshold_uncertainty_score":0.9991174},"labels":[],"label_agreement":null},{"id":"W2039616602","doi":"10.1016/j.endm.2010.05.094","title":"An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Cutting-plane method; Iterated function; Mathematics; Interior point method; Quadratic equation; Binary number; Point (geometry); Relaxation (psychology); Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming; Plane (geometry); Algorithm; Applied mathematics; Mathematical analysis; Integer programming; Geometry; Arithmetic","score_opus":0.020229416231673236,"score_gpt":0.3790834266210562,"score_spread":0.35885401038938297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039616602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090356385,0.000035502453,0.9882089,0.00035336625,0.00014290359,0.001777654,0.000028265242,0.00023387598,0.00018393114],"genre_scores_gemma":[0.04802754,0.000028744835,0.9508631,0.000053974716,0.00013173214,0.00040555254,0.00011232582,0.00016950657,0.00020749234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687374,0.0001637205,0.0009768999,0.0005859053,0.0003760119,0.0010237412],"domain_scores_gemma":[0.9958582,0.002293962,0.000419773,0.0010115249,0.0002484245,0.00016810205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020297675,0.00041817987,0.00061884517,0.00033889632,0.00018111298,0.00014629762,0.00066497765,0.00026320913,0.00034188133],"category_scores_gemma":[0.0043229195,0.00038741156,0.00013458208,0.0004992926,0.000110018475,0.00047323536,0.000128171,0.00088563416,0.00000926472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071807654,0.0032217621,0.00013394184,0.004195048,0.0004720461,0.000033158096,0.013233269,0.2401834,0.25455835,0.45118937,0.0003780951,0.031683464],"study_design_scores_gemma":[0.00089313474,0.00041615154,0.0000013701551,0.00006694519,0.000036554076,0.000028371267,0.00026764287,0.805956,0.009378995,0.1825414,0.000048305374,0.00036510307],"about_ca_topic_score_codex":0.0000115472485,"about_ca_topic_score_gemma":0.00020494565,"teacher_disagreement_score":0.56577265,"about_ca_system_score_codex":0.00023266098,"about_ca_system_score_gemma":0.0002438766,"threshold_uncertainty_score":0.9998578},"labels":[],"label_agreement":null},{"id":"W2043363748","doi":"10.1007/s10589-011-9406-2","title":"Local path-following property of inexact interior methods in nonlinear programming","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Iterated function; Nonlinear system; Tangent; Interior point method; Newton's method; Applied mathematics; Nonlinear programming; Sequence (biology); Path (computing); Nonlinear complementarity problem; Perturbation (astronomy); Mathematical optimization; Complementarity theory; Mathematical analysis; Geometry; Computer science","score_opus":0.08395092464994196,"score_gpt":0.41112397220285224,"score_spread":0.32717304755291027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043363748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020511608,0.00004959497,0.9978945,0.00006350648,0.000017628201,0.00077306654,0.0000076879605,0.000063279454,0.00092560495],"genre_scores_gemma":[0.023370314,0.000019712359,0.9761026,0.000026497639,0.000014505141,0.00028271356,0.000061257466,0.000026641655,0.000095770294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.00010369533,0.00051030266,0.00026095938,0.00019659099,0.00015618351],"domain_scores_gemma":[0.99906236,0.0002679794,0.00017110839,0.00015739021,0.0002620631,0.00007909864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037567274,0.00012767149,0.00022002075,0.0002167481,0.00008844677,0.000020812315,0.00013830145,0.000066145025,0.000078167446],"category_scores_gemma":[0.00016468704,0.00010752311,0.000050889856,0.0006427502,0.00013012852,0.00019090631,0.00008143501,0.00012747067,0.000002455782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030738756,0.00050707295,0.00075771415,0.00012576439,0.00004558033,0.0000023455164,0.001102588,0.82018507,0.000050352963,0.034120902,0.000017557106,0.1430543],"study_design_scores_gemma":[0.0004968954,0.00003786222,0.00015344234,0.0000446175,0.000013397604,0.0000051682205,0.00038608804,0.98739135,0.00018919485,0.010690924,0.00045381175,0.00013725105],"about_ca_topic_score_codex":0.000010297701,"about_ca_topic_score_gemma":0.0000022106622,"teacher_disagreement_score":0.16720627,"about_ca_system_score_codex":0.00004692791,"about_ca_system_score_gemma":0.00008138154,"threshold_uncertainty_score":0.43846655},"labels":[],"label_agreement":null},{"id":"W2045811671","doi":"10.1007/s12532-014-0067-x","title":"Optimization of algorithms with OPAL","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Theory of computation; Computer science; Algorithm; Parallel computing","score_opus":0.04018985705435785,"score_gpt":0.3494476894717266,"score_spread":0.30925783241736876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045811671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001925808,0.000005298952,0.99539274,0.00010376868,0.000026610232,0.0005971025,0.0000012533624,0.00022064948,0.0017267776],"genre_scores_gemma":[0.095267236,9.690992e-7,0.90444106,0.000011203431,0.00004408633,0.000049756196,0.000024491526,0.00004771376,0.00011346608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815035,0.00012947146,0.00051857135,0.00026969184,0.0006437173,0.00028822367],"domain_scores_gemma":[0.99812764,0.00082851975,0.00027067255,0.0002373549,0.00042742747,0.000108356326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006478122,0.00018099582,0.00034614935,0.0001591429,0.00009714557,0.000059432605,0.00016154388,0.0000789645,0.00006645242],"category_scores_gemma":[0.00088009814,0.00014586677,0.00005574652,0.0005031053,0.00016449353,0.00018219421,0.000055311488,0.00014754974,0.0000145363365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057848007,0.0006691723,0.000046887028,0.0007329526,0.00006295256,0.0000030837016,0.0007462752,0.64571285,0.000028245753,0.11079454,0.00005458594,0.24109063],"study_design_scores_gemma":[0.0006644024,0.00027187663,0.000008000239,0.00010690352,0.000027648812,0.000015866312,0.00009392016,0.89272267,0.00020530402,0.10563767,0.000085943146,0.00015981236],"about_ca_topic_score_codex":0.000001651959,"about_ca_topic_score_gemma":6.0639536e-7,"teacher_disagreement_score":0.24700981,"about_ca_system_score_codex":0.000044025794,"about_ca_system_score_gemma":0.000027839198,"threshold_uncertainty_score":0.5948274},"labels":[],"label_agreement":null},{"id":"W2046405851","doi":"10.1287/moor.2013.0590","title":"Exploiting Known Structures to Approximate Normal Cones","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Oracle; Mathematics; Simplex; Constraint (computer-aided design); Set (abstract data type); Independence (probability theory); Cone (formal languages); Mathematical optimization; Degeneracy (biology); Function (biology); Key (lock); Applied mathematics; Algorithm; Combinatorics; Computer science; Geometry","score_opus":0.17404089945024007,"score_gpt":0.45197394940292895,"score_spread":0.27793304995268886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046405851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36946172,0.00006362943,0.608378,0.001634622,0.00008881063,0.0043355864,0.00004984796,0.00019952451,0.01578827],"genre_scores_gemma":[0.19431224,0.000019696023,0.80047953,0.000022483402,0.000083782565,0.00072354695,0.000013464892,0.00007310622,0.004272131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649334,0.00021747909,0.000806003,0.00034686952,0.001428743,0.0007075764],"domain_scores_gemma":[0.9950621,0.0011520963,0.000062676125,0.000825018,0.0026210123,0.0002770734],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015339194,0.00020989003,0.0004014983,0.0007246105,0.000512903,0.00030932677,0.00069877855,0.00010697547,0.0025322041],"category_scores_gemma":[0.0054725744,0.00018100164,0.00007269012,0.0011343134,0.00025528035,0.0005542501,0.0005124318,0.00044952863,0.00041269444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002006038,0.0010093987,0.000058260917,0.0013311452,0.00013417457,0.00000777518,0.014396833,0.04388083,0.044317022,0.87618,0.010988409,0.007676117],"study_design_scores_gemma":[0.0009141345,0.00032732717,0.00007285264,0.0002752216,0.000017163862,0.000033184486,0.014364421,0.57410306,0.07864513,0.3301489,0.00048032583,0.0006182829],"about_ca_topic_score_codex":0.00009036687,"about_ca_topic_score_gemma":0.000038932612,"teacher_disagreement_score":0.54603106,"about_ca_system_score_codex":0.00009640416,"about_ca_system_score_gemma":0.0001607059,"threshold_uncertainty_score":0.9983796},"labels":[],"label_agreement":null},{"id":"W2048256983","doi":"10.1063/1.3455719","title":"Quasi-Newton parallel geometry optimization methods","year":2010,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; McMaster University","keywords":"Hessian matrix; Lanczos resampling; Cartesian coordinate system; Computer science; Applied mathematics; Mathematics; Algorithm; Minification; Mathematical optimization; Geometry; Eigenvalues and eigenvectors; Physics","score_opus":0.04965474630026939,"score_gpt":0.4137571121426707,"score_spread":0.3641023658424013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048256983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010414545,0.000049391714,0.98805654,0.0006550582,0.00017428631,0.00010669178,0.0000015930982,0.00002185666,0.000520014],"genre_scores_gemma":[0.012511068,0.00009286748,0.9864549,0.00008198665,0.0006327122,0.0000019144447,0.0000021401447,0.000039406583,0.0001830151],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985368,0.00016633265,0.00046961458,0.000087347566,0.0005184345,0.00022142877],"domain_scores_gemma":[0.9970539,0.0014901179,0.00046753685,0.00033667596,0.00052510324,0.00012664733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013027239,0.00013639932,0.00028402792,0.000053099935,0.00006523624,0.00002873661,0.0005147223,0.00010043119,0.00014929744],"category_scores_gemma":[0.00181851,0.00008921641,0.0001248616,0.00040865774,0.00015661112,0.00025256717,0.00009835427,0.0010100813,0.000006493646],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005681833,0.002359632,0.000033063323,0.00016080179,0.00037335558,0.000011223317,0.0013613533,0.2930815,0.5717307,0.046723396,0.0133914845,0.07020532],"study_design_scores_gemma":[0.0012522676,0.00015043089,0.0000032740943,0.00003671133,0.00013408168,0.00012880159,0.00011335745,0.25506616,0.3167598,0.42483646,0.0012295697,0.00028909737],"about_ca_topic_score_codex":7.98488e-7,"about_ca_topic_score_gemma":8.410716e-8,"teacher_disagreement_score":0.3781131,"about_ca_system_score_codex":0.00004092872,"about_ca_system_score_gemma":0.00007049078,"threshold_uncertainty_score":0.43883565},"labels":[],"label_agreement":null},{"id":"W2051890519","doi":"10.1007/s10107-003-0502-7","title":"An optimal adaptive algorithm for the approximation of concave functions","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Concave function; Knot (papermaking); Bellman equation; Mathematical optimization; Oracle; Parametric statistics; Convex function; Regular polygon; Piecewise; Algorithm; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.07302452284193485,"score_gpt":0.3786374860033176,"score_spread":0.30561296316138276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051890519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025729975,0.00005604362,0.99682623,0.0002689722,0.000034112385,0.0018907964,0.000022432481,0.0001544667,0.0004896656],"genre_scores_gemma":[0.020296872,0.000003101726,0.9782328,0.000020306627,0.00018543609,0.00070833566,0.000017043407,0.00005189994,0.00048422738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982332,0.000074025564,0.0005683564,0.00026677013,0.00046714168,0.00039048528],"domain_scores_gemma":[0.99687636,0.0019073626,0.00021849283,0.00045168705,0.0004277891,0.0001182922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009208569,0.00018505643,0.0003068549,0.0000875451,0.00027094677,0.00006983965,0.0003029927,0.000100041616,0.00021126558],"category_scores_gemma":[0.0007783672,0.00013068855,0.00013814478,0.00029295596,0.00025006218,0.00033083494,0.000059937363,0.00020206178,0.00002536164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034489163,0.0006272133,7.892182e-7,0.00009480741,0.00008222922,4.506678e-7,0.0011441149,0.0049832254,0.000050264545,0.0749463,0.0001481792,0.9178879],"study_design_scores_gemma":[0.0005509365,0.00025071393,0.0000011695663,0.000033271062,0.00007333779,0.000009850369,0.002328221,0.9618963,0.001234339,0.031636,0.0018361909,0.00014969106],"about_ca_topic_score_codex":9.807777e-7,"about_ca_topic_score_gemma":0.0000015627035,"teacher_disagreement_score":0.95691305,"about_ca_system_score_codex":0.00008047918,"about_ca_system_score_gemma":0.0000479922,"threshold_uncertainty_score":0.53293246},"labels":[],"label_agreement":null},{"id":"W2052557309","doi":"10.1142/s0217595909002171","title":"VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS","year":2009,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Differentiable function; Complementarity (molecular biology); Complementarity theory; Orthant; Lagrangian; Jacobian matrix and determinant; Applied mathematics; Trust region; Stationary point; Mathematical optimization; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.16022711289082814,"score_gpt":0.4544760530473624,"score_spread":0.29424894015653424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052557309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032233298,0.0017663003,0.86231834,0.053112656,0.00072305446,0.009213556,0.0005130308,0.00013498403,0.03998479],"genre_scores_gemma":[0.7734506,0.00012579862,0.22370473,0.00007441919,0.00047737116,0.00005436018,0.00006645043,0.000043509655,0.0020027317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522,0.00043062674,0.00096259237,0.00029040224,0.0023939118,0.00070247403],"domain_scores_gemma":[0.99263674,0.0017413666,0.00024740622,0.00030385054,0.004747245,0.0003234086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057577137,0.00019037222,0.00043215373,0.0009909931,0.00058545184,0.00026669164,0.00056419644,0.000106726715,0.00047225252],"category_scores_gemma":[0.003601077,0.00016182772,0.00017770338,0.0013559648,0.00015088833,0.0005168087,0.00006300474,0.00083272427,0.000026685151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068742345,0.0016514104,0.0004507881,0.00016522735,0.0003164936,0.000049699025,0.0011490282,0.0025868132,0.014997135,0.9036241,0.059991,0.014330859],"study_design_scores_gemma":[0.01763853,0.010007708,0.011184572,0.00053739105,0.00013031316,0.0009226344,0.0065638353,0.07506247,0.011246312,0.777336,0.08794284,0.001427399],"about_ca_topic_score_codex":0.000008719923,"about_ca_topic_score_gemma":0.000010284953,"teacher_disagreement_score":0.7412173,"about_ca_system_score_codex":0.00045136188,"about_ca_system_score_gemma":0.0006593451,"threshold_uncertainty_score":0.65991426},"labels":[],"label_agreement":null},{"id":"W2053093378","doi":"10.1016/s0898-1221(02)00202-x","title":"Min-max formulation of the balance number in multiobjective global optimization","year":2002,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Pareto principle; Mathematical optimization; Multi-objective optimization; Norm (philosophy); Set (abstract data type); Representation (politics); Pareto interpolation; Pareto optimal; Applied mathematics; Computer science; Statistics; Extreme value theory","score_opus":0.02741721576649902,"score_gpt":0.3147388651313603,"score_spread":0.28732164936486126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053093378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019545734,0.000017461794,0.9912437,0.0002319916,0.000026957896,0.0016279217,0.000022174629,0.00007070876,0.0048044804],"genre_scores_gemma":[0.15482664,0.000018182393,0.8445186,0.000025863132,0.000024849198,0.00035396445,0.0000087660455,0.000027977012,0.00019515614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985369,0.000048983537,0.0004943487,0.00026483435,0.00041811756,0.0002368391],"domain_scores_gemma":[0.99821603,0.00039451223,0.00037132515,0.0006468353,0.00031276132,0.000058557674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001427677,0.00017920045,0.00026250666,0.00006515135,0.000128081,0.000030335237,0.0003935598,0.00007720863,0.00008226545],"category_scores_gemma":[0.00012558943,0.0001364387,0.00005957985,0.0012190192,0.00011522599,0.00018266251,0.00010648189,0.0001445319,0.000021235075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016725246,0.0017432092,0.004194681,0.0003857946,0.00007357157,0.0000013487061,0.0025639178,0.7481329,0.000021061373,0.23500314,0.00068596,0.007177682],"study_design_scores_gemma":[0.0007133748,0.000018404966,0.00027464263,0.00011363446,0.000019803416,0.0000138964715,0.00012625435,0.95121384,0.00008115753,0.047162987,0.000108656386,0.00015336921],"about_ca_topic_score_codex":0.0000047438602,"about_ca_topic_score_gemma":0.000015362035,"teacher_disagreement_score":0.20308091,"about_ca_system_score_codex":0.00020907258,"about_ca_system_score_gemma":0.00003253152,"threshold_uncertainty_score":0.55638087},"labels":[],"label_agreement":null},{"id":"W2053136023","doi":"10.1007/s10915-011-9521-3","title":"The Chaotic Nature of Faster Gradient Descent Methods","year":2011,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Gradient descent; Mathematics; Chaotic; Descent (aeronautics); Residual; Constant (computer programming); Descent direction; Norm (philosophy); Applied mathematics; Gradient method; Monotone polygon; Method of steepest descent; Mathematical analysis; Mathematical optimization; Algorithm; Computer science; Geometry; Artificial intelligence; Artificial neural network; Physics","score_opus":0.11782208075050253,"score_gpt":0.42045844494362167,"score_spread":0.3026363641931191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053136023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118168235,0.00043545046,0.87775224,0.00014633448,0.0024716305,0.00018261073,8.955611e-7,0.000012593401,0.0008299987],"genre_scores_gemma":[0.33892554,0.000007395161,0.6605389,0.0000073091605,0.0000710388,2.3795359e-7,1.2956625e-7,0.000011468828,0.0004380025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803656,0.00023713014,0.00069473026,0.00013579924,0.000631787,0.00026397727],"domain_scores_gemma":[0.9970646,0.0007692438,0.00079150946,0.00028475435,0.0009897022,0.000100223166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045001544,0.00009060697,0.00021551132,0.00021376315,0.00033632937,0.00008930906,0.000536542,0.000052905092,0.000038749877],"category_scores_gemma":[0.0014386297,0.000055491277,0.00013338875,0.000533719,0.00026112952,0.0001193055,0.00018296238,0.00051235035,0.0000022597053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027819668,0.0015462923,0.0024643461,0.000538356,0.00057034875,0.00013725355,0.03565326,0.0058038956,0.013548726,0.06739083,0.0067822277,0.8652863],"study_design_scores_gemma":[0.003040947,0.0007311401,0.006745584,0.0015865307,0.0002307706,0.0012458073,0.010188368,0.66007423,0.109353594,0.19548061,0.010504136,0.00081826927],"about_ca_topic_score_codex":4.6440172e-7,"about_ca_topic_score_gemma":0.0000010391923,"teacher_disagreement_score":0.864468,"about_ca_system_score_codex":0.00006492854,"about_ca_system_score_gemma":0.00008640938,"threshold_uncertainty_score":0.25868073},"labels":[],"label_agreement":null},{"id":"W2054434508","doi":"10.1007/pl00011422","title":"On sensitivity of central solutions in semidefinite programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Semidefinite programming; Lipschitz continuity; Bounded function; Mathematical optimization; Solution set; Complementarity (molecular biology); Applied mathematics; Feasible region; Mathematical analysis; Set (abstract data type); Computer science","score_opus":0.08218327838542877,"score_gpt":0.3601488526812827,"score_spread":0.27796557429585395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054434508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0468877,0.00003171043,0.94766897,0.00042227906,0.000048875605,0.0013081824,0.0000052937094,0.0002607115,0.0033662932],"genre_scores_gemma":[0.50013834,0.000009277762,0.4993915,0.000020517986,0.00003380138,0.000102725564,0.0000067537617,0.000051088056,0.00024597472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971247,0.00024380485,0.00070918567,0.00034314688,0.00062868575,0.0009505296],"domain_scores_gemma":[0.9968064,0.002283547,0.00017044411,0.00041662308,0.00014053212,0.00018244814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015989139,0.00023187086,0.00046965465,0.0002657021,0.00011785917,0.000050393217,0.00015457594,0.00013046473,0.00013174061],"category_scores_gemma":[0.0048774867,0.00021388406,0.00013244429,0.00087764655,0.00020689785,0.00016170442,0.00013201946,0.0004129525,0.00004078081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010476488,0.0033738608,0.00086574146,0.00074039825,0.000058371275,0.00024734339,0.0016088384,0.0033342412,0.00026792858,0.6974428,0.00007656611,0.2918791],"study_design_scores_gemma":[0.0018987381,0.00035689515,0.00026729313,0.0011412968,0.0000536391,0.00017669253,0.0012108813,0.2878115,0.00076424214,0.7033828,0.002178536,0.0007574852],"about_ca_topic_score_codex":0.000015528161,"about_ca_topic_score_gemma":0.00004564274,"teacher_disagreement_score":0.45325065,"about_ca_system_score_codex":0.00015536227,"about_ca_system_score_gemma":0.000050323655,"threshold_uncertainty_score":0.8721939},"labels":[],"label_agreement":null},{"id":"W2054543516","doi":"10.1007/pl00011420","title":"Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Linear programming; Corollary; Condition number; Time complexity; Bounded function; Probabilistic logic; Matrix (chemical analysis); Combinatorics; Probabilistic analysis of algorithms; Discrete mathematics; Algorithm; Eigenvalues and eigenvectors; Statistics","score_opus":0.14892183901273565,"score_gpt":0.40443041444319067,"score_spread":0.255508575430455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054543516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020902438,0.000069874055,0.97560006,0.0001834641,0.000019988818,0.0028529044,0.000025241865,0.00021935391,0.00012667481],"genre_scores_gemma":[0.09436417,0.000018609353,0.9043634,0.000013975018,0.00005310006,0.00078603136,0.00008756525,0.00006662441,0.00024650912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729276,0.000110664725,0.00095949613,0.0004666869,0.00059359707,0.00057682575],"domain_scores_gemma":[0.99734163,0.0010346152,0.0003653343,0.00044975991,0.0006076769,0.00020095694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763797,0.00027858032,0.0008194586,0.00039786473,0.0002713669,0.00014503338,0.00024537247,0.00010066527,0.00007663849],"category_scores_gemma":[0.0032450317,0.0002441874,0.0002094837,0.001538046,0.0004623492,0.00021215822,0.00012783131,0.00018493831,0.0000029728267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018366044,0.0041383924,0.0035492599,0.007153422,0.002933061,0.000012909214,0.0047561927,0.0057257153,0.0010086431,0.67407966,0.000026247257,0.29643285],"study_design_scores_gemma":[0.001179525,0.00022979602,0.00014072802,0.00022995773,0.0012586836,0.00002211064,0.00032077738,0.7335758,0.000114398,0.25941038,0.0030530617,0.00046477708],"about_ca_topic_score_codex":0.000007652777,"about_ca_topic_score_gemma":0.000033594286,"teacher_disagreement_score":0.7278501,"about_ca_system_score_codex":0.000067673565,"about_ca_system_score_gemma":0.000050336785,"threshold_uncertainty_score":0.99576735},"labels":[],"label_agreement":null},{"id":"W2054567731","doi":"10.1007/s10898-004-0867-z","title":"Duality in Multivalued Complementarity Theory by Using Inversions and Scalar Derivatives","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Infinitesimal; Complementarity (molecular biology); Duality (order theory); Scalar (mathematics); Pure mathematics; Mathematical economics; Mathematical analysis; Geometry","score_opus":0.06516242544786878,"score_gpt":0.4082980049243089,"score_spread":0.34313557947644013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054567731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11520233,0.0001422653,0.8836099,0.0005633267,0.00003755148,0.00019263935,0.00002999098,0.000011009245,0.00021102683],"genre_scores_gemma":[0.21294534,0.00010398953,0.78677315,0.00010719174,0.00003727882,9.041302e-7,0.000006462815,0.000010233648,0.000015482125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998426,0.0003510852,0.0005569697,0.00012371664,0.00036326196,0.00017893672],"domain_scores_gemma":[0.99886537,0.00022869464,0.000386498,0.00009589869,0.00031257202,0.00011098824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008976172,0.00011479302,0.00023995014,0.00008542346,0.000104902196,0.00003865384,0.00011906218,0.000062865605,0.00012763223],"category_scores_gemma":[0.0009526245,0.00010599747,0.000040839594,0.00036509155,0.000100290694,0.0006491638,0.00008194818,0.00017336037,5.1358e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002023123,0.0004522903,0.014228719,0.000030585445,0.00005957973,0.000006138319,0.0004543957,0.97353303,0.0002234922,0.0072106305,0.0007791456,0.0028196927],"study_design_scores_gemma":[0.00273143,0.000075478616,0.001153842,0.00009522009,0.000033999808,0.000046656984,0.00089870335,0.9760826,0.00026346085,0.018272484,0.00017223076,0.00017386813],"about_ca_topic_score_codex":0.000012702463,"about_ca_topic_score_gemma":0.000015568137,"teacher_disagreement_score":0.09774301,"about_ca_system_score_codex":0.00050450343,"about_ca_system_score_gemma":0.0000760215,"threshold_uncertainty_score":0.43224514},"labels":[],"label_agreement":null},{"id":"W2055133561","doi":"10.1007/s11081-007-9030-2","title":"Spent potliner treatment process optimization using a MADS algorithm","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Mathematical optimization; Computer science; Algorithm; Set (abstract data type); Nonlinear system; Process (computing); Function (biology); Reduction (mathematics); Differentiable function; Mathematics","score_opus":0.03924008691482914,"score_gpt":0.3460628235775633,"score_spread":0.30682273666273413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055133561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019201492,0.00007329644,0.9968754,0.00004037609,0.00012112084,0.000391451,0.0000062660924,0.00024953464,0.00032238802],"genre_scores_gemma":[0.004521444,0.00019060604,0.9946069,0.000018902258,0.00013501634,0.000017267934,0.000040657997,0.00008619666,0.00038298522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986309,0.000015677731,0.00037582155,0.0003058611,0.00028506853,0.0003866711],"domain_scores_gemma":[0.9992164,0.00010659562,0.00009542019,0.00018814029,0.0002042931,0.00018919153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027402243,0.00024683448,0.00023216645,0.00030800517,0.00013628708,0.00007768684,0.000080693695,0.00011214948,0.00016196181],"category_scores_gemma":[0.00014970517,0.00023873158,0.000041989217,0.0005194252,0.000027248063,0.00032352554,0.000035452274,0.00010623764,0.000001991323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009254363,0.000068807996,0.000043801174,0.000038538998,0.00002617606,0.000009085344,0.00021626605,0.9955248,0.00003715404,0.00022268768,0.0000049059486,0.0037985183],"study_design_scores_gemma":[0.00075819885,0.00004800342,0.000013009839,0.000038063663,0.00002709544,0.00003672397,0.00013494988,0.99785554,0.00064922543,0.00005734675,0.0001297017,0.00025216577],"about_ca_topic_score_codex":0.0000054813427,"about_ca_topic_score_gemma":0.000001114327,"teacher_disagreement_score":0.0035463525,"about_ca_system_score_codex":0.00022805306,"about_ca_system_score_gemma":0.00003854324,"threshold_uncertainty_score":0.97351915},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09444654323418775,"score_gpt":0.4244460149172123,"score_spread":0.32999947168302457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055391493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005073875,0.00039655846,0.9960336,0.00007792659,0.0005370307,0.00091058825,0.000056849487,0.0011392909,0.00079739944],"genre_scores_gemma":[0.000017236454,0.0008628267,0.9919701,0.00017519596,0.00027042735,0.00009272228,0.00023593022,0.00018334444,0.006192172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585325,0.00107339,0.0008283785,0.0007562451,0.00084617623,0.0006425904],"domain_scores_gemma":[0.9950588,0.0018239117,0.00036398452,0.0009230621,0.0014750483,0.00035521734],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012168671,0.0004416592,0.00064734474,0.00037887206,0.0005776031,0.00007131897,0.00049980305,0.00031011793,0.0032768603],"category_scores_gemma":[0.010662939,0.00043555646,0.0001690688,0.0016035658,0.00022053615,0.00057566975,0.00018270938,0.0004994698,0.000070681104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019508004,0.0007568407,0.0018290285,0.0003455489,0.0003544713,0.00015442517,0.002467129,0.70153797,0.0001838308,0.0011743909,0.031581998,0.25941932],"study_design_scores_gemma":[0.0016241367,0.00020550376,0.00013923722,0.0001239636,0.000096916905,0.00021017676,0.0001059729,0.9763507,0.0016667222,0.007279507,0.011249516,0.00094762625],"about_ca_topic_score_codex":0.000005864567,"about_ca_topic_score_gemma":5.3320434e-7,"teacher_disagreement_score":0.2748128,"about_ca_system_score_codex":0.00023438896,"about_ca_system_score_gemma":0.00026199332,"threshold_uncertainty_score":0.9998096},"labels":[],"label_agreement":null},{"id":"W2056349109","doi":"10.1007/s10898-010-9586-9","title":"Remarks on solutions to a nonconvex quadratic programming test problem","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Quadratic programming; Mathematical optimization; Quadratic equation; Selection (genetic algorithm); Sequential quadratic programming; Test (biology); Optimization problem; Artificial intelligence; Computer science","score_opus":0.027216482384094128,"score_gpt":0.35534658734124475,"score_spread":0.3281301049571506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056349109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015908062,0.00001236,0.9918419,0.0025482178,0.00034156485,0.0006523106,0.000010682966,0.000060071703,0.002942079],"genre_scores_gemma":[0.040637977,0.0000135009095,0.9586912,0.00014410421,0.0002446045,0.000018748859,0.000004332756,0.000030606374,0.00021493723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978256,0.00007515826,0.00077143917,0.0001952532,0.00074879715,0.00038374346],"domain_scores_gemma":[0.9972432,0.0003634648,0.000553514,0.0002592408,0.0012602983,0.0003202597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083989545,0.00018630986,0.00030246266,0.00017988522,0.00020197128,0.0001414998,0.00031604277,0.00014044397,0.00015690537],"category_scores_gemma":[0.0047540176,0.0001620174,0.00011356388,0.00095738855,0.000058149377,0.0004139693,0.00007165669,0.00048710083,0.000025500383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013101664,0.0010049923,0.00060012843,0.000060594997,0.00005794666,0.000035712845,0.00021946043,0.95733494,0.00034669816,0.021618487,0.00440272,0.014187331],"study_design_scores_gemma":[0.0050420077,0.0042303237,0.00062324665,0.0008521977,0.00024260837,0.0011078505,0.00070048164,0.9338697,0.0006177589,0.04358987,0.007887705,0.0012361994],"about_ca_topic_score_codex":0.0000032099376,"about_ca_topic_score_gemma":0.00003726566,"teacher_disagreement_score":0.03904717,"about_ca_system_score_codex":0.00030901027,"about_ca_system_score_gemma":0.00028604883,"threshold_uncertainty_score":0.66068774},"labels":[],"label_agreement":null},{"id":"W2056369327","doi":"10.1007/s10107-006-0044-x","title":"How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Path (computing); Cube (algebra); Combinatorics; Upper and lower bounds; Point (geometry); Geometry; Mathematical analysis; Computer science","score_opus":0.08630873635903116,"score_gpt":0.3953461224436111,"score_spread":0.30903738608458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056369327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023182041,0.0000897724,0.9897692,0.0022713135,0.00009871829,0.00112097,0.000012396811,0.00054922793,0.0037701735],"genre_scores_gemma":[0.02572074,0.0000024144365,0.9682342,0.00004960931,0.00020438267,0.00030938908,0.000032597625,0.00010704335,0.00533966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661356,0.00033713836,0.0008484259,0.00060816226,0.0007646263,0.00082807324],"domain_scores_gemma":[0.9971581,0.0011026459,0.00036707782,0.0007411279,0.00040185015,0.00022920505],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013185616,0.00043692402,0.00073724467,0.0002199452,0.00038783942,0.0010543495,0.0004706874,0.00019399927,0.00047905734],"category_scores_gemma":[0.0024588436,0.00036516748,0.0002531912,0.0005429179,0.00040368998,0.0006074906,0.00030449842,0.00048651826,0.000091360715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046513658,0.0014044604,0.00018933411,0.0016775869,0.00016153857,0.00007625697,0.0013361705,0.00006551554,0.0010573509,0.89050734,0.0016410167,0.10183693],"study_design_scores_gemma":[0.00066469633,0.00010833012,0.000047958576,0.00026252613,0.00006331895,0.00007748628,0.0009055079,0.084789656,0.0035228822,0.8990337,0.009951236,0.0005726498],"about_ca_topic_score_codex":0.000008716275,"about_ca_topic_score_gemma":0.000022861179,"teacher_disagreement_score":0.101264276,"about_ca_system_score_codex":0.0002222025,"about_ca_system_score_gemma":0.000043917775,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W2059043079","doi":"10.5539/mas.v2n4p144","title":"Logarithmic Barrier Function Method for Convex Quadratic Programming Problem","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interior point method; Quadratic programming; Logarithm; Mathematical optimization; Function (biology); Simple (philosophy); Second-order cone programming; Penalty method; Mathematics; Quadratic equation; Convex optimization; Sequential quadratic programming; Point (geometry); Quadratic function; Regular polygon; Quadratically constrained quadratic program; Computer science; Mathematical analysis; Geometry","score_opus":0.0734569357767509,"score_gpt":0.37374758671860964,"score_spread":0.30029065094185875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059043079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005813137,0.000014435644,0.99478436,0.00008480512,0.00006350312,0.0019166662,0.0000043184027,0.00021095663,0.0023396595],"genre_scores_gemma":[0.10113979,0.0000030171477,0.89634633,0.00009191848,0.000046755027,0.0007784755,0.0000040021732,0.000035741108,0.00155399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975472,0.00003109318,0.0003331439,0.000635306,0.0008235073,0.0006297518],"domain_scores_gemma":[0.99861693,0.00027060122,0.00013755706,0.00041736153,0.00036259717,0.0001949553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013926784,0.000180648,0.00024839403,0.00022383477,0.00090157485,0.00009002288,0.00044212874,0.00007572103,0.000044323104],"category_scores_gemma":[0.0003797065,0.00016458218,0.000052328505,0.0007911983,0.0005501622,0.00032343017,0.00012179686,0.00019487675,0.000024870455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032292944,0.000627617,0.00008374947,0.00054729654,0.00006563533,0.0000117446925,0.009384482,0.023120984,0.35838875,0.23110998,0.0008491895,0.37548766],"study_design_scores_gemma":[0.00058228365,0.00006619667,0.000010764137,0.000008660146,0.000011182188,0.0000170981,0.00014048838,0.8138213,0.0059081763,0.17812383,0.0011006483,0.00020937536],"about_ca_topic_score_codex":0.0000030793412,"about_ca_topic_score_gemma":0.000004061975,"teacher_disagreement_score":0.7907003,"about_ca_system_score_codex":0.00018167717,"about_ca_system_score_gemma":0.0003747379,"threshold_uncertainty_score":0.69342756},"labels":[],"label_agreement":null},{"id":"W2061201811","doi":"10.1007/s11784-014-0171-6","title":"Erratum to: The approximation to a fixed point","year":2013,"lang":"en","type":"erratum","venue":"Journal of Fixed Point Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Fixed point; Fixed-point theorem; Point (geometry); Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical economics; Mathematical analysis; Geometry","score_opus":0.025227654283225036,"score_gpt":0.3327582127969147,"score_spread":0.30753055851368966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061201811","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041406045,0.0004815658,0.9671642,0.012166946,0.0014372852,0.002685314,0.000088903245,0.000052917596,0.015881415],"genre_scores_gemma":[0.0009317548,0.0014336009,0.4276757,0.004577086,0.00883111,0.0032590488,0.00021545992,0.0004051836,0.5526711],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997018,0.00045272327,0.0010958037,0.00035667315,0.00068487757,0.00039192315],"domain_scores_gemma":[0.9954888,0.0012391679,0.0009349031,0.0008385662,0.0010625299,0.00043601368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002637327,0.00036867606,0.0006187664,0.0004724735,0.0004350621,0.00023679408,0.0008485958,0.0003073516,0.0004124953],"category_scores_gemma":[0.002010982,0.00025272532,0.00021074696,0.0007285777,0.000117652926,0.0002834856,0.00026557271,0.0014970695,0.00020367147],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069679176,0.00013121868,2.725709e-7,0.000117472904,0.00010227839,0.0000021872827,0.0009911022,0.0003321901,0.00010578811,0.14216445,0.8453634,0.010619971],"study_design_scores_gemma":[0.00033419993,0.00017096079,0.000015197946,0.00027765348,0.00011759517,0.0001252442,0.0011070911,0.000696082,0.00013696251,0.43322942,0.5634635,0.00032608517],"about_ca_topic_score_codex":0.0000021685355,"about_ca_topic_score_gemma":0.000005973223,"teacher_disagreement_score":0.53948855,"about_ca_system_score_codex":0.00016406707,"about_ca_system_score_gemma":0.00026482446,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W2065776751","doi":"10.5539/jmr.v2n3p97","title":"Convergence of Symmetric Rank-One method based on Modified Quasi-Newton equation","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rank (graph theory); Convergence (economics); Positive definiteness; Rate of convergence; Applied mathematics; Quadratic equation; Zero (linguistics); Newton's method; Positive-definite matrix; Mathematical analysis; Combinatorics; Geometry","score_opus":0.28244270995744075,"score_gpt":0.49706688417563555,"score_spread":0.2146241742181948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065776751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02618583,0.000031920517,0.96886784,0.0008572269,0.0002175645,0.0006478098,0.000010776441,0.000021763815,0.0031592946],"genre_scores_gemma":[0.19940892,0.000073183845,0.7995337,0.000015262074,0.00014481909,0.000017841525,0.0000020813195,0.00006518218,0.00073901104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99245256,0.00078384625,0.0015550839,0.0002506263,0.004402089,0.00055580196],"domain_scores_gemma":[0.9813339,0.012352388,0.0010526323,0.00080002454,0.004155374,0.0003056408],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01666736,0.00021530414,0.0007478836,0.0023628306,0.00016443997,0.000073201,0.000958919,0.00024065973,0.00065773044],"category_scores_gemma":[0.028954212,0.00017913002,0.00023079632,0.0021424629,0.00023706401,0.0002701136,0.000130982,0.0019747545,0.00003930721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097068126,0.013507953,0.00014493863,0.0040388834,0.00040987998,0.000092160226,0.0026957616,0.048647117,0.0897618,0.8128139,0.00343513,0.023481788],"study_design_scores_gemma":[0.0014963347,0.0007235793,0.000025930012,0.00025116812,0.00003060782,0.0000257298,0.0003343701,0.7515616,0.03658801,0.20871773,0.00009549881,0.00014945888],"about_ca_topic_score_codex":0.0000087635,"about_ca_topic_score_gemma":0.000004266273,"teacher_disagreement_score":0.7029145,"about_ca_system_score_codex":0.00016442288,"about_ca_system_score_gemma":0.0005519891,"threshold_uncertainty_score":0.97922534},"labels":[],"label_agreement":null},{"id":"W2067834925","doi":"10.1007/s40314-013-0078-7","title":"Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem","year":2013,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Line search; Newton's method; Local convergence; Convergence (economics); Mathematics; Backtracking; Eigenvalues and eigenvectors; Quasi-Newton method; Mathematical optimization; Applied mathematics; Algebraic number; Computer science; Iterative method; Nonlinear system; Mathematical analysis","score_opus":0.06536729644531526,"score_gpt":0.3820831403677822,"score_spread":0.31671584392246693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067834925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077586423,0.00012265917,0.9935145,0.0024868187,0.000027817323,0.0019459367,0.000009968655,0.00006687132,0.001049581],"genre_scores_gemma":[0.003923101,0.00003529435,0.9934492,0.00015305323,0.00006623157,0.0005578887,0.000017642798,0.00004433091,0.0017532489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998711,0.00003374285,0.00042252548,0.0002720624,0.0002931137,0.00026756764],"domain_scores_gemma":[0.99557734,0.0037334994,0.00019428981,0.00018751378,0.00018829331,0.00011904008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056977064,0.0002149896,0.00029536607,0.00006778202,0.00031195095,0.00017292231,0.00015914446,0.00007399895,0.000061304905],"category_scores_gemma":[0.00018554991,0.00014663459,0.000043272306,0.00013955173,0.00015170156,0.000107045846,0.00015457193,0.00014576418,0.000016178245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020358191,0.0004365778,0.0000061143414,0.0008514441,0.0001479066,2.4407115e-7,0.0019393499,0.019039359,0.00039647825,0.7950996,0.0078010443,0.1742615],"study_design_scores_gemma":[0.00047990162,0.000038920927,0.000036795216,0.000021113821,0.00002449457,0.000007037602,0.0004757284,0.42084703,0.00012754687,0.57646173,0.0013527235,0.00012700232],"about_ca_topic_score_codex":0.000002777831,"about_ca_topic_score_gemma":4.7637172e-7,"teacher_disagreement_score":0.40180767,"about_ca_system_score_codex":0.00003933535,"about_ca_system_score_gemma":0.000042289197,"threshold_uncertainty_score":0.5979585},"labels":[],"label_agreement":null},{"id":"W2068133968","doi":"10.1007/s10107-006-0009-0","title":"Active-constraint variable ordering for faster feasibility of mixed integer linear programs","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Mathematics; Integer (computer science); Integer programming; Variable (mathematics); Constraint (computer-aided design); Linear programming; Mathematical optimization; Numerical analysis; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.08992158410743467,"score_gpt":0.37174853516017203,"score_spread":0.28182695105273736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068133968","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013467203,0.000012407161,0.9815734,0.000076285076,0.000050714818,0.0027042162,0.00001401188,0.0002252254,0.0018765364],"genre_scores_gemma":[0.09557659,3.8992516e-7,0.90315646,0.0000046798755,0.00008118602,0.0004717448,0.000027067705,0.00007016152,0.0006117441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974672,0.00007997391,0.00089032314,0.00043132034,0.00047975383,0.0006513847],"domain_scores_gemma":[0.99759674,0.0010147037,0.00026650267,0.00048301948,0.00051666907,0.0001223388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010066021,0.00027405084,0.0005788704,0.00011135429,0.00012275274,0.000070342656,0.00027776818,0.00015984879,0.00017573492],"category_scores_gemma":[0.0020314283,0.0002335526,0.0001886148,0.00042896814,0.00031269217,0.0002013527,0.00014589627,0.0002630383,0.000012094327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003237754,0.006051296,0.0005668802,0.007083346,0.00023039243,0.0000095991,0.0009911726,0.0012771513,0.0019781743,0.6930682,0.0001346193,0.2882854],"study_design_scores_gemma":[0.0020436072,0.00037516202,0.00001700182,0.000468419,0.000094576084,0.00002584555,0.0010277488,0.15699096,0.006721255,0.8297562,0.0019300781,0.0005491379],"about_ca_topic_score_codex":0.0000074219897,"about_ca_topic_score_gemma":0.0000063632015,"teacher_disagreement_score":0.28773627,"about_ca_system_score_codex":0.00011699196,"about_ca_system_score_gemma":0.000075119984,"threshold_uncertainty_score":0.95239985},"labels":[],"label_agreement":null},{"id":"W2069154666","doi":"10.1007/s10107-012-0594-z","title":"Improved semidefinite bounding procedure for solving Max-Cut problems to optimality","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Semidefinite programming; Mathematics; Embedding; Maximum cut; Quadratic programming; Semidefinite embedding; Quadratic equation; Regularization (linguistics); Relaxation (psychology); Mathematical optimization; Upper and lower bounds; Algorithm; Quadratically constrained quadratic program; Computer science; Combinatorics","score_opus":0.09471068804463127,"score_gpt":0.38996772183718376,"score_spread":0.29525703379255247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069154666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00631804,0.000083193234,0.9867674,0.0004846555,0.000120893266,0.004555604,0.00001203982,0.0005449929,0.0011131449],"genre_scores_gemma":[0.067193456,0.000002506818,0.9288529,0.00009858086,0.00027089956,0.0021205195,0.000014558266,0.00015654712,0.0012899946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636066,0.00005655469,0.000865771,0.00050886854,0.000594804,0.0016133571],"domain_scores_gemma":[0.99690676,0.001326149,0.0002328677,0.0005543115,0.00034146314,0.0006384629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024671184,0.00039556963,0.00059014873,0.00019402347,0.00044483345,0.00030011256,0.00040015086,0.00019472625,0.00013870173],"category_scores_gemma":[0.007827175,0.0003509865,0.00019670029,0.00059444184,0.00010583797,0.0005654493,0.0003054445,0.00036669036,0.00008647138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003538223,0.0059853527,0.001188678,0.027721634,0.0005726495,0.000011520852,0.02946118,0.0015420641,0.011611485,0.7369493,0.0030774123,0.18152484],"study_design_scores_gemma":[0.0032293627,0.0008467011,0.000030535266,0.0019192195,0.0003352988,0.00018594394,0.0039386065,0.4026566,0.0119849015,0.5407906,0.031184047,0.0028981296],"about_ca_topic_score_codex":0.0000019198174,"about_ca_topic_score_gemma":0.000003232586,"teacher_disagreement_score":0.40111455,"about_ca_system_score_codex":0.0002486975,"about_ca_system_score_gemma":0.00007044718,"threshold_uncertainty_score":0.9998942},"labels":[],"label_agreement":null},{"id":"W2069223201","doi":"10.1007/s10287-009-0101-z","title":"DrAmpl: a meta solver for optimization problem analysis","year":2009,"lang":"en","type":"article","venue":"Computational Management Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Solver; Computer science; Mathematical optimization; Problem solver; Mathematics; Software engineering; Programming language","score_opus":0.08396393811345566,"score_gpt":0.4034731677846484,"score_spread":0.3195092296711928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069223201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040779913,0.000015459435,0.9924688,0.00094662793,0.000028401671,0.0008620134,0.000007591265,0.00010943544,0.005520928],"genre_scores_gemma":[0.0327841,0.0000059262234,0.96554625,0.00027049298,0.000016878292,0.00009829465,0.000040780054,0.000008701251,0.0012285777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796957,0.000024149995,0.00029877658,0.00048052875,0.0009064688,0.00032048445],"domain_scores_gemma":[0.99879104,0.00022336678,0.00013693815,0.00025136425,0.00050218386,0.000095103154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008666416,0.00013086223,0.00021976802,0.0007914351,0.0004022891,0.00018915888,0.00046368726,0.000020837024,0.00013746454],"category_scores_gemma":[0.00016187209,0.00011848873,0.00014819921,0.0033276903,0.00015231829,0.00054644246,0.00009611344,0.000049275306,0.000007389985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005513232,0.00007009064,0.000005855098,0.000013285455,0.000256577,7.184857e-7,0.000036237805,0.74516034,0.0000014198631,0.2521416,0.00026659222,0.0020417415],"study_design_scores_gemma":[0.00021568162,0.000028611788,0.000174065,0.0000025877923,0.00049516856,4.0530819e-7,0.00002084896,0.6896598,0.000006375611,0.30916187,0.00013860341,0.00009602537],"about_ca_topic_score_codex":5.7482714e-7,"about_ca_topic_score_gemma":5.4271993e-7,"teacher_disagreement_score":0.05702027,"about_ca_system_score_codex":0.00011060653,"about_ca_system_score_gemma":0.000046167897,"threshold_uncertainty_score":0.48318303},"labels":[],"label_agreement":null},{"id":"W2070922270","doi":"10.1023/b:opte.0000033370.66768.a9","title":"Convergence Results for Generalized Pattern Search Algorithms are Tight","year":2004,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Differentiable function; Limit (mathematics); Mathematics; Convergence (economics); Limit point; Stationary point; Zero (linguistics); Mathematical optimization; Algorithm; Mathematical proof; Function (biology); Applied mathematics; Mathematical analysis","score_opus":0.04541959430167648,"score_gpt":0.31634148635927795,"score_spread":0.2709218920576015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070922270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013570342,0.00005357379,0.99729145,0.00046848095,0.00013066566,0.00040265193,0.000047889116,0.00016755158,0.00008073193],"genre_scores_gemma":[0.012230518,0.00032739944,0.9864584,0.00005072495,0.00010949466,0.00007645491,0.00007568598,0.000058943002,0.0006123317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989218,0.000013912883,0.00027884834,0.0002771434,0.00021574255,0.00029254952],"domain_scores_gemma":[0.9992874,0.00012300552,0.000060473893,0.00018714988,0.00020776641,0.00013418857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022304442,0.00015393022,0.00018177218,0.0001362478,0.0001148283,0.000058348294,0.000104223574,0.00008209331,0.000036473728],"category_scores_gemma":[0.00034306856,0.00015599943,0.00003787777,0.00024279974,0.000025058165,0.00018405895,0.000047381556,0.00010962512,0.0000037730044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014345764,0.00002356195,0.000012278429,0.00009480005,0.000015213088,0.000002980441,0.00019454237,0.99757123,0.00008133607,0.0012285477,0.00011125916,0.00064993097],"study_design_scores_gemma":[0.0021976014,0.000030564617,0.00003497909,0.00005498089,0.000009537885,0.000007158299,0.000052856252,0.995323,0.0013689816,0.00026621972,0.00045914226,0.00019499926],"about_ca_topic_score_codex":0.000006346571,"about_ca_topic_score_gemma":0.0000018478012,"teacher_disagreement_score":0.010873484,"about_ca_system_score_codex":0.00007354008,"about_ca_system_score_gemma":0.00002818282,"threshold_uncertainty_score":0.6361472},"labels":[],"label_agreement":null},{"id":"W2072337808","doi":"10.1007/s10957-010-9758-2","title":"Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Jacobian matrix and determinant; Mathematics; Theory of computation; Cone (formal languages); Interior point method; Constraint (computer-aided design); Applied mathematics; Mathematical optimization; Algorithm; Geometry","score_opus":0.033910721493332394,"score_gpt":0.3880796826192206,"score_spread":0.3541689611258882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072337808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035019938,0.000052578198,0.99488145,0.0003473706,0.000076741846,0.0008894611,0.000023199424,0.000018587614,0.00020859219],"genre_scores_gemma":[0.093432315,0.00009779831,0.90575475,0.00005271456,0.00019626175,0.00019249159,0.000024291747,0.000029786484,0.00021956702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884444,0.000095243086,0.0005569943,0.00014515482,0.00018165562,0.00017652378],"domain_scores_gemma":[0.9973401,0.0012876013,0.00040158213,0.00018016543,0.0006643106,0.00012626256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015865347,0.000106406296,0.00021711762,0.00044144737,0.00021920621,0.000052382646,0.00015084428,0.000098641045,0.00008343015],"category_scores_gemma":[0.0017130986,0.00010088187,0.00006693976,0.00065594097,0.00014414046,0.00019997738,0.000032184646,0.00034758623,0.0000010865219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009613747,0.0006382718,0.00014402806,0.000093837916,0.000044069053,0.0000021428348,0.00024762825,0.08604321,0.0010039188,0.89693326,0.00006667784,0.014686801],"study_design_scores_gemma":[0.0040059225,0.00026939262,0.0001837486,0.00010772365,0.00016615931,0.00021824027,0.0009736481,0.29230988,0.0014063314,0.6885334,0.0113630835,0.00046241324],"about_ca_topic_score_codex":4.1407827e-7,"about_ca_topic_score_gemma":0.0000032805474,"teacher_disagreement_score":0.20839982,"about_ca_system_score_codex":0.00003391847,"about_ca_system_score_gemma":0.00009320689,"threshold_uncertainty_score":0.41138434},"labels":[],"label_agreement":null},{"id":"W207322605","doi":"10.1007/978-3-540-77958-2_6","title":"Semidefinite Programming Approaches for Bounding Asian Option Prices","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Semidefinite programming; Bounding overwatch; Asian option; Mathematical optimization; Semidefinite embedding; Mathematics; Distribution (mathematics); Computer science; Valuation of options; Quadratically constrained quadratic program; Econometrics; Quadratic programming; Artificial intelligence","score_opus":0.24336469182831827,"score_gpt":0.3610202619662246,"score_spread":0.11765557013790634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207322605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.3765217e-7,0.0001682003,0.574289,0.00008872377,0.00006885662,0.0014632266,0.000017345585,0.000255179,0.4236489],"genre_scores_gemma":[0.000011148803,0.0002475259,0.5650095,0.000011211469,0.000183385,0.00017883923,0.00010950398,0.00013816281,0.43411076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978409,0.000012991395,0.00055142323,0.00056391483,0.0005732739,0.00045751143],"domain_scores_gemma":[0.9983346,0.00045372295,0.000396475,0.00043275292,0.00024688218,0.00013558888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003419821,0.00041622305,0.0005008399,0.0003599484,0.00032324134,0.000134173,0.00027436335,0.0004368291,0.00019184571],"category_scores_gemma":[0.0003413989,0.00039142123,0.00022863288,0.00007036196,0.0001397114,0.00023654362,0.000116934825,0.0004102228,0.000052069758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021990209,0.00004516225,8.6395295e-7,0.0005476677,0.00011982044,0.000007672706,0.00041584377,0.00020705574,9.384242e-7,0.85785574,0.001345118,0.13943215],"study_design_scores_gemma":[0.0007036363,0.00016179899,6.81895e-7,0.00036348403,0.000099682526,0.000064548454,0.00023472056,0.022858722,0.000048431804,0.32462856,0.6498779,0.00095780124],"about_ca_topic_score_codex":8.2309214e-7,"about_ca_topic_score_gemma":0.0000072170346,"teacher_disagreement_score":0.6485328,"about_ca_system_score_codex":0.000229632,"about_ca_system_score_gemma":0.00011656954,"threshold_uncertainty_score":0.9998538},"labels":[],"label_agreement":null},{"id":"W2074049387","doi":"10.1007/s10878-006-9625-0","title":"Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Theory of computation; Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic equation; Quadratic programming; Discrete mathematics; Mathematical optimization; Applied mathematics; Computer science; Algorithm; Geometry","score_opus":0.02051957195072803,"score_gpt":0.2957860368845196,"score_spread":0.2752664649337916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074049387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012112191,0.00021575259,0.9791534,0.00072556717,0.0025720324,0.0016711317,0.00001585149,0.000063888954,0.0034702038],"genre_scores_gemma":[0.3482143,0.000023493703,0.65107363,0.000011724816,0.00035434696,0.000010504145,0.0000049634305,0.000045395995,0.00026167548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972107,0.00025466134,0.0012846274,0.00013416621,0.00084400235,0.00027184872],"domain_scores_gemma":[0.99593914,0.0006546492,0.0016082419,0.0002447647,0.0014764874,0.00007671315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199566,0.00018425257,0.00046600902,0.00019617208,0.00017703696,0.00008553509,0.00034524166,0.00012110355,0.00007528115],"category_scores_gemma":[0.0014513752,0.00013318227,0.00019092119,0.0006719659,0.00021926334,0.00040556237,0.000063935135,0.0002882566,6.1433633e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003407516,0.0008050166,0.00044168392,0.00016546364,0.00010350149,0.000029940042,0.00019581677,0.87649643,0.00070287765,0.11859075,0.0012631677,0.0008646183],"study_design_scores_gemma":[0.0349713,0.0032609776,0.00010299585,0.0020148295,0.00094552874,0.0013712993,0.0016878606,0.3303717,0.03020843,0.5902644,0.003198746,0.0016019535],"about_ca_topic_score_codex":0.000021065765,"about_ca_topic_score_gemma":0.000004279258,"teacher_disagreement_score":0.5461247,"about_ca_system_score_codex":0.00018067077,"about_ca_system_score_gemma":0.0006863404,"threshold_uncertainty_score":0.5431015},"labels":[],"label_agreement":null},{"id":"W2074149593","doi":"10.1007/s10589-007-9159-0","title":"Improved convergence order for augmented penalty algorithms","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Convergence (economics); Multiplier (economics); Quadratic equation; Order (exchange); Penalty method; Compact convergence; Mathematical optimization; Normal convergence; Applied mathematics; Convergence tests; Algorithm; Rate of convergence; Computer science; Key (lock)","score_opus":0.060841206311371424,"score_gpt":0.363099416639977,"score_spread":0.3022582103286056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074149593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009168485,0.000059115428,0.9970656,0.0007126335,0.00003770093,0.001489491,0.00008520923,0.00016151246,0.0002970766],"genre_scores_gemma":[0.0061936034,0.00013561775,0.9901092,0.00022434596,0.000102266895,0.0011686468,0.0005214767,0.0000390978,0.0015057428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876034,0.000033020307,0.00037987877,0.00037125548,0.00024211546,0.00021340918],"domain_scores_gemma":[0.9979121,0.00051772664,0.00016280243,0.00018450225,0.0010778294,0.00014500499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014326832,0.00016059402,0.00018071955,0.00013074845,0.00062593125,0.000035265824,0.00014394309,0.000069963375,0.0001906439],"category_scores_gemma":[0.00020684808,0.00016736724,0.000045705146,0.0005483465,0.00017048947,0.00020195785,0.00005455607,0.00009327381,0.000008753356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017893193,0.0001721074,0.00004455296,0.00003939636,0.00003251486,4.1050606e-7,0.00010839045,0.93458223,0.000021541473,0.061277114,0.0011629066,0.002540948],"study_design_scores_gemma":[0.0009883177,0.000032722037,0.00005961518,0.00000541196,0.000013589417,0.000023326638,0.000047104924,0.9748398,0.00004780329,0.020174049,0.0035844622,0.00018381322],"about_ca_topic_score_codex":0.0000026339915,"about_ca_topic_score_gemma":9.584088e-7,"teacher_disagreement_score":0.041103065,"about_ca_system_score_codex":0.000051617524,"about_ca_system_score_gemma":0.00014780703,"threshold_uncertainty_score":0.68250376},"labels":[],"label_agreement":null},{"id":"W2074855022","doi":"10.1002/pamm.200700907","title":"Hybrid symbolic‐numeric algorithms for computational convex analysis","year":2007,"lang":"en","type":"article","venue":"PAMM","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Algorithm; Piecewise; Computation; Quadratic equation; Convex conjugate; Piecewise linear function; Convex optimization; Computer science; Operator (biology); Regular polygon; Symbolic data analysis; Convex analysis; Symbolic computation; Mathematics; Mathematical optimization; Theoretical computer science","score_opus":0.06733022151103386,"score_gpt":0.41220968059783936,"score_spread":0.3448794590868055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074855022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029734373,0.000051948467,0.99481964,0.00022770218,0.00007774015,0.00040007554,0.000065187676,0.00012303729,0.0012612408],"genre_scores_gemma":[0.0926603,0.00001414534,0.90401745,0.00018157471,0.00015121662,0.000059404807,0.00019941608,0.00004823685,0.0026682597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842864,0.000034125846,0.0003960061,0.00028942505,0.0004475437,0.0004042612],"domain_scores_gemma":[0.99782336,0.0012722525,0.00013310934,0.00024407083,0.0003759232,0.00015130953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068328285,0.00014418094,0.00033421992,0.00038011963,0.00014581865,0.00003711231,0.00018644183,0.000045797136,0.00028133095],"category_scores_gemma":[0.00029988823,0.00014341602,0.0001801811,0.0006784823,0.00007154802,0.00010134368,0.00004809703,0.000110636196,0.00004395725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026560028,0.0011275987,0.002539516,0.0003126284,0.0039465083,0.00013454053,0.0011294772,0.38332775,0.00011939253,0.14273536,0.013718833,0.45064276],"study_design_scores_gemma":[0.0008173938,0.000045784505,0.0005713049,0.0000055058636,0.00019764576,0.000016123857,0.00013317245,0.88556474,0.00069123774,0.106336646,0.0053553213,0.00026514893],"about_ca_topic_score_codex":0.0000063616903,"about_ca_topic_score_gemma":0.000004439457,"teacher_disagreement_score":0.50223696,"about_ca_system_score_codex":0.00008631939,"about_ca_system_score_gemma":0.00004842193,"threshold_uncertainty_score":0.58483356},"labels":[],"label_agreement":null},{"id":"W2075893026","doi":"10.1016/j.laa.2005.03.021","title":"Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Semidefinite programming; Distance matrix; Matrix norm; Matrix (chemical analysis); Euclidean geometry; Matrix completion; Large margin nearest neighbor; Diagonal; Mathematical optimization; Combinatorics; Applied mathematics; k-nearest neighbors algorithm; Computer science; Eigenvalues and eigenvectors; Geometry; Artificial intelligence","score_opus":0.07301771218730009,"score_gpt":0.36522123766108583,"score_spread":0.29220352547378575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075893026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011847602,0.0009352426,0.98446137,0.0003945955,0.0000074106683,0.0020298003,0.00006742324,0.00013372241,0.00012280827],"genre_scores_gemma":[0.049947698,0.0005115562,0.94799525,0.000049521124,0.00019104237,0.00081874995,0.00008486923,0.000053415602,0.00034790012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896085,0.000021008998,0.00030428902,0.00031185793,0.00015159452,0.00025042525],"domain_scores_gemma":[0.9991054,0.000290167,0.00014893898,0.00017935637,0.00017372929,0.00010239075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023127577,0.00014001713,0.00018142852,0.00008420064,0.00036737387,0.00008721185,0.00009337895,0.000059380665,0.0000120353425],"category_scores_gemma":[0.00010127853,0.00013336905,0.000028462908,0.00027010537,0.00006248055,0.00023448322,0.000059349888,0.00010373116,0.0000045757906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054450247,0.0006043729,0.0005708682,0.0023834652,0.00010551121,6.042231e-7,0.001410026,0.0056444015,0.003918587,0.7837479,0.00022660226,0.20133322],"study_design_scores_gemma":[0.0005991286,0.000037543323,0.000032109732,0.000060315786,0.000044908495,0.000014362001,0.00012908039,0.89826804,0.00045282408,0.024154337,0.07594686,0.0002604956],"about_ca_topic_score_codex":0.0000017900925,"about_ca_topic_score_gemma":0.0000062594113,"teacher_disagreement_score":0.8926236,"about_ca_system_score_codex":0.000031481253,"about_ca_system_score_gemma":0.000017597906,"threshold_uncertainty_score":0.5438632},"labels":[],"label_agreement":null},{"id":"W2076486048","doi":"10.1007/s10107-005-0627-y","title":"Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Semidefinite programming; Mathematics; Eigenvalues and eigenvectors; Positive-definite matrix; Semidefinite embedding; Applied mathematics; Matrix (chemical analysis); Linear matrix inequality; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.12128332009897753,"score_gpt":0.4346167466984115,"score_spread":0.313333426599434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076486048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008964711,0.00038738357,0.9867229,0.00047387957,0.000058504746,0.0020745923,0.00002572931,0.00037308587,0.0009192185],"genre_scores_gemma":[0.05350222,0.000012207901,0.94312304,0.000035460114,0.00022005671,0.00066631415,0.000018070452,0.000091630645,0.0023309735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975923,0.00011345334,0.0007694649,0.00039824608,0.0004973379,0.0006292432],"domain_scores_gemma":[0.99712485,0.0018148853,0.0001892689,0.00042192158,0.00020470748,0.00024439214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017508891,0.00026003877,0.00049842545,0.00012013079,0.00026391924,0.00026913,0.00020701096,0.00017376884,0.00007336358],"category_scores_gemma":[0.0027618639,0.0002248103,0.000093295785,0.00024088634,0.00016182459,0.00025142528,0.00013771505,0.00025233507,0.00005772963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006331661,0.0006785669,0.00008286979,0.0042829914,0.00012090157,0.0000070367496,0.0018079791,0.0009872576,0.00010272512,0.9224478,0.00079036306,0.06862817],"study_design_scores_gemma":[0.0015558442,0.00019692026,0.000005685269,0.00027074822,0.000101813544,0.000087924,0.0012666389,0.6551483,0.00019301404,0.2972993,0.04322894,0.00064485014],"about_ca_topic_score_codex":0.0000031237744,"about_ca_topic_score_gemma":0.0000028394943,"teacher_disagreement_score":0.65416104,"about_ca_system_score_codex":0.00011475881,"about_ca_system_score_gemma":0.000041201034,"threshold_uncertainty_score":0.9167498},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gauss; Computer science; Newton's method; Applied mathematics; Scaling; Nonlinear system; Mathematics; Physics","score_opus":0.07224147369964559,"score_gpt":0.4460038399389775,"score_spread":0.3737623662393319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077119768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079587626,0.0003080866,0.99649143,0.0007756292,0.00027196412,0.00071699056,0.000002569032,0.00043036052,0.00092336495],"genre_scores_gemma":[0.000043572338,0.0012164532,0.993541,0.00005827316,0.000093057395,0.00024726638,0.000029674882,0.00008485532,0.004685863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969694,0.00095937925,0.000624803,0.00043290146,0.00046213108,0.00055141066],"domain_scores_gemma":[0.99550474,0.0031869872,0.00025237934,0.00053197704,0.00040373957,0.00012015457],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0025335448,0.00024307841,0.00028011666,0.0002510989,0.0005185401,0.00019499456,0.00030541944,0.00016706303,0.00019730357],"category_scores_gemma":[0.009757185,0.00019736214,0.00008683981,0.0018087537,0.0001134912,0.00039362913,0.00011903899,0.0003934339,0.000013381397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005600652,0.00010329757,0.0016420933,0.00003088016,0.000019777284,0.000009898356,0.0002954819,0.5525414,0.00001728995,0.0018416292,0.00037239934,0.44306988],"study_design_scores_gemma":[0.0015176045,0.00010194808,0.0004369312,0.00015633878,0.000042075866,0.000068585,0.00068219926,0.8269869,0.00038587674,0.0351138,0.13378382,0.0007239009],"about_ca_topic_score_codex":0.000023339242,"about_ca_topic_score_gemma":0.000047320398,"teacher_disagreement_score":0.44234598,"about_ca_system_score_codex":0.0002295448,"about_ca_system_score_gemma":0.0000789213,"threshold_uncertainty_score":0.99858403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05516734349933614,"score_gpt":0.4375199633420161,"score_spread":0.38235261984267993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081215000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004101797,0.00027528516,0.99503815,0.0008083044,0.00038486603,0.0020470326,0.00022719007,0.0009429613,0.00027208443],"genre_scores_gemma":[0.000011172928,0.0004947693,0.99433404,0.00049980154,0.00012441518,0.00055640546,0.00050327135,0.0003190659,0.0031570836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485433,0.0012078395,0.0012418695,0.0010769443,0.0006486574,0.0009703327],"domain_scores_gemma":[0.9941136,0.0024832143,0.00065718964,0.0009941986,0.0014218612,0.00032992705],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029314228,0.00060577015,0.00084121746,0.0005590385,0.0005812924,0.00019744835,0.0005256149,0.0004137915,0.005531531],"category_scores_gemma":[0.01097087,0.0006214057,0.00032339754,0.0012988617,0.00010987044,0.0008643472,0.00033405158,0.00048781346,0.00004267502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007902721,0.00022009693,0.000009373057,0.00019824087,0.000097903474,0.000005136492,0.00053480925,0.9578587,0.000042589214,0.0013583744,0.0012854411,0.038310353],"study_design_scores_gemma":[0.0020459825,0.00014854824,0.0000012149546,0.000080458296,0.00012046992,0.000028922817,0.00017482157,0.9863851,0.0004496338,0.005472664,0.004442617,0.0006495508],"about_ca_topic_score_codex":0.000002098364,"about_ca_topic_score_gemma":0.000003353567,"teacher_disagreement_score":0.0376608,"about_ca_system_score_codex":0.00037685796,"about_ca_system_score_gemma":0.00009119398,"threshold_uncertainty_score":0.9996237},"labels":[],"label_agreement":null},{"id":"W2086286112","doi":"10.1007/s10589-008-9175-8","title":"Efficient preprocessing for VLSI optimization problems","year":2008,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Preprocessor; Solver; Very-large-scale integration; Computer science; Integer programming; Mathematical optimization; Linear programming; Constraint (computer-aided design); Algorithm; Mathematics; Programming language","score_opus":0.06567202607348327,"score_gpt":0.356399427834244,"score_spread":0.29072740176076073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086286112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018296481,0.000118642056,0.99637544,0.0004002983,0.000026399404,0.0018499875,0.00003824512,0.00022828105,0.0007797295],"genre_scores_gemma":[0.016893627,0.00007011375,0.9804755,0.0001191794,0.0001037884,0.0013381157,0.0003677828,0.000053316842,0.00057861855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984752,0.000038142058,0.00045691113,0.0004611468,0.00033455572,0.00023406342],"domain_scores_gemma":[0.9980359,0.00051677023,0.00022541077,0.00020318247,0.0008812757,0.0001374568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020296224,0.00018222858,0.00019756817,0.00019920093,0.0008888117,0.00006731071,0.0001401352,0.00008621303,0.000077278775],"category_scores_gemma":[0.00022802297,0.00019211447,0.000053541204,0.0005867439,0.00017288951,0.00013968482,0.00005709299,0.000096418175,0.000005385491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008670632,0.00016203796,0.00003512352,0.00007492244,0.000014443156,1.9313993e-7,0.0001868611,0.9753579,0.0000035378664,0.022925638,0.0002004232,0.0010302374],"study_design_scores_gemma":[0.0007877912,0.000024968944,0.000025485151,0.000019649555,0.000016080237,0.00002832625,0.000048318027,0.9837219,0.000014922075,0.014329448,0.00077813974,0.00020497748],"about_ca_topic_score_codex":7.55881e-7,"about_ca_topic_score_gemma":2.680949e-7,"teacher_disagreement_score":0.016710663,"about_ca_system_score_codex":0.000069082715,"about_ca_system_score_gemma":0.00013299032,"threshold_uncertainty_score":0.78342},"labels":[],"label_agreement":null},{"id":"W2087975652","doi":"10.1016/j.disopt.2008.10.002","title":"On the polyhedral lift-and-project methods and the fractional stable set polytope","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Mathematics; Conjecture; Combinatorics; Lift (data mining); Operator (biology); Polyhedral combinatorics; Set (abstract data type); Polyhedron; Symmetry (geometry); Birkhoff polytope; Discrete mathematics; Computer science; Geometry; Regular polygon","score_opus":0.08774811797470744,"score_gpt":0.42137295086084653,"score_spread":0.3336248328861391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087975652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013215509,0.00016765489,0.9901849,0.0036554504,0.00007191705,0.00074253546,0.000027725036,0.00007199442,0.0037562742],"genre_scores_gemma":[0.023766117,0.0013433121,0.9690571,0.00085416145,0.00013337225,0.00018805086,0.00007312296,0.000078516074,0.0045062415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982032,0.000601595,0.00026668076,0.00028302387,0.00039551142,0.00024996558],"domain_scores_gemma":[0.99701595,0.0022997065,0.00014566218,0.00033778782,0.0001415978,0.000059289043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094412616,0.00017989027,0.00021190106,0.000102017315,0.0007858965,0.000100422265,0.00016392542,0.00007937811,0.0002807364],"category_scores_gemma":[0.0019418538,0.00009985884,0.000049908052,0.0003824595,0.00043689352,0.00028958637,0.00012357031,0.00029178915,0.0000050362573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079566997,0.000094091796,0.00013932174,0.00004510434,0.0001848745,0.000009507422,0.0045531197,0.45610914,0.000042191532,0.5285299,0.006890368,0.0026067595],"study_design_scores_gemma":[0.0011295275,0.000047242294,0.000053261927,0.00001573974,0.000024909348,0.00005404987,0.000532626,0.9769164,0.00014296161,0.020290464,0.0006310538,0.00016177337],"about_ca_topic_score_codex":0.000042407002,"about_ca_topic_score_gemma":0.0000025465856,"teacher_disagreement_score":0.52080727,"about_ca_system_score_codex":0.000041151252,"about_ca_system_score_gemma":0.00007267009,"threshold_uncertainty_score":0.604456},"labels":[],"label_agreement":null},{"id":"W2088422447","doi":"10.1007/s10589-007-9095-z","title":"Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Line search; Interior point method; Mathematical optimization; Nonlinear system; Convergence (economics); Dual (grammatical number); Computer science; Residual; Nonlinear programming; Newton's method; Local convergence; Rate of convergence; Point (geometry); Newton's method in optimization; Algorithm; Function (biology); Linear programming; Mathematics; Iterative method; Key (lock); Path (computing)","score_opus":0.03415400168738806,"score_gpt":0.43124444737366485,"score_spread":0.39709044568627677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088422447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040981887,0.000054485074,0.9976377,0.00028265722,0.000020205573,0.0014452084,0.00003372681,0.00003172593,0.00008448648],"genre_scores_gemma":[0.0058965054,0.000011790845,0.99345446,0.00007010569,0.000017168046,0.00028233445,0.00012194819,0.0000224406,0.00012324813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.0000573136,0.00045093958,0.00021786649,0.00016411503,0.0001691078],"domain_scores_gemma":[0.9975513,0.0016620654,0.00018704287,0.00016365924,0.0003804084,0.000055513636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065178116,0.00010343898,0.00015140988,0.0001421632,0.00015106272,0.000027522754,0.00012612036,0.00006411722,0.00002140977],"category_scores_gemma":[0.00049021136,0.000087038,0.000049817696,0.00057777594,0.00014065015,0.00010065492,0.00006384892,0.000100423844,5.0523096e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015693913,0.0001477723,0.00019910173,0.00005281636,0.00001521305,6.417882e-8,0.00014844483,0.9119959,0.0000407278,0.03506496,0.000013253795,0.052306052],"study_design_scores_gemma":[0.00046518678,0.000013577433,0.0002459132,0.000012992421,0.000011861307,0.0000032812843,0.000103387545,0.9545054,0.00020332987,0.042549323,0.0017938225,0.00009195933],"about_ca_topic_score_codex":8.397373e-7,"about_ca_topic_score_gemma":0.0000040237383,"teacher_disagreement_score":0.052214094,"about_ca_system_score_codex":0.000047961326,"about_ca_system_score_gemma":0.00006990114,"threshold_uncertainty_score":0.35493067},"labels":[],"label_agreement":null},{"id":"W2089331999","doi":"10.1137/130933691","title":"Numerical Analysis of $\\mathcal{V}\\mathcal{U}$-Decomposition, $\\mathcal{U}$-Gradient, and $\\mathcal{U}$-Hessian Approximations","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hessian matrix; Mathematics; Combinatorics; Function (biology); Approximations of π; Mathematical analysis; Applied mathematics","score_opus":0.029057031083962268,"score_gpt":0.3622389667632777,"score_spread":0.3331819356793154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089331999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060086525,0.00011354379,0.98807704,0.0014567486,0.0002370638,0.00059352396,0.000064515654,0.00019081586,0.0032580665],"genre_scores_gemma":[0.27883214,0.00058486563,0.7188894,0.00033321092,0.00031947473,0.00007876391,0.0002782223,0.00018435334,0.00049956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944841,0.0007919204,0.0018241267,0.0007286139,0.0014203485,0.00075085316],"domain_scores_gemma":[0.99495506,0.0011821418,0.0013010646,0.000808412,0.0010982631,0.0006550628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016626841,0.00057479256,0.0012441127,0.002010171,0.00073163403,0.00032040544,0.0005441701,0.0003510582,0.00057925325],"category_scores_gemma":[0.0019000632,0.00052381743,0.00046366203,0.00310534,0.00029675,0.00078791706,0.00012867937,0.00086309056,0.000024895407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014185118,0.00082185457,0.00065737485,0.0001467391,0.00078679575,0.000012235256,0.0007412837,0.9105509,0.00010267973,0.0801693,0.00048989675,0.005379099],"study_design_scores_gemma":[0.001407302,0.00040590635,0.00086463144,0.00018137867,0.0006333967,0.00012104144,0.00018103853,0.9781839,0.00026430388,0.01667535,0.0005488375,0.000532863],"about_ca_topic_score_codex":0.000006324701,"about_ca_topic_score_gemma":0.0000042416173,"teacher_disagreement_score":0.2728235,"about_ca_system_score_codex":0.00027773972,"about_ca_system_score_gemma":0.000118562,"threshold_uncertainty_score":0.99972135},"labels":[],"label_agreement":null},{"id":"W2091864717","doi":"10.1007/s00209-010-0831-1","title":"Positivstellensätze for real function algebras","year":2011,"lang":"de","type":"article","venue":"Mathematische Zeitschrift","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Variety (cybernetics); Algebra over a field; Representation theorem; Algebraic number; Function (biology); Quadratic equation; Polynomial; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.08171555221565997,"score_gpt":0.32466396997189023,"score_spread":0.24294841775623027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091864717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008102009,0.0021342388,0.86408615,0.00021134617,0.0015465787,0.003738091,0.00030348363,0.0005779418,0.12659195],"genre_scores_gemma":[0.02147245,0.0017612912,0.9490815,0.00023917812,0.0015609235,0.00092497957,0.0002627211,0.00068774144,0.024009217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481136,0.00029238008,0.0014481604,0.0011011974,0.0009830483,0.0013638462],"domain_scores_gemma":[0.9950975,0.0013067854,0.00073432736,0.0014459562,0.00092137733,0.0004940218],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014540287,0.0008451039,0.001068975,0.00043938187,0.000601489,0.00018264943,0.00075486687,0.0006830765,0.004859799],"category_scores_gemma":[0.0012911545,0.00082782406,0.00049820385,0.0006603365,0.00028908954,0.0006802455,0.00037143982,0.00069162046,0.0036398573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074002246,0.0015978685,0.00006940186,0.0023731706,0.0012323838,0.00004068506,0.0086798165,0.000049960512,0.00078649895,0.94920754,0.022586351,0.01263628],"study_design_scores_gemma":[0.018390236,0.0065345564,0.0010028776,0.0034921581,0.0063604913,0.0002254458,0.0075521753,0.12769653,0.055408336,0.40607524,0.35933644,0.007925493],"about_ca_topic_score_codex":0.000040038703,"about_ca_topic_score_gemma":0.000011750957,"teacher_disagreement_score":0.5431323,"about_ca_system_score_codex":0.000040954987,"about_ca_system_score_gemma":0.00025872438,"threshold_uncertainty_score":0.99941725},"labels":[],"label_agreement":null},{"id":"W2093605433","doi":"10.1007/s10107-006-0072-6","title":"Invariance and efficiency of convex representations","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conic optimization; Dual cone and polar cone; Representation (politics); Regular polygon; Duality (order theory); Invariant (physics); Complementarity (molecular biology); Convex analysis; Convex set; Conic section; Path (computing); Smoothness; Convex hull; Convex optimization; Pure mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.04243372711367955,"score_gpt":0.36150817230085497,"score_spread":0.3190744451871754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093605433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016230216,0.00007426733,0.97465897,0.00019903453,0.000016141852,0.0005606796,0.0000026416872,0.00011055646,0.008147477],"genre_scores_gemma":[0.24289687,0.000003444241,0.75612444,0.0000069306125,0.000027000166,0.000058085076,0.000003134056,0.00002266351,0.0008574247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870694,0.000047788122,0.00045055407,0.00020862215,0.00033927982,0.00024681687],"domain_scores_gemma":[0.998587,0.00081308506,0.00013320887,0.00026411642,0.00013895202,0.000063599284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038437886,0.000107085754,0.00024786318,0.00008350125,0.00009014264,0.000041150794,0.00012428695,0.000053999298,0.00012838791],"category_scores_gemma":[0.0012813081,0.00009437802,0.000040959043,0.0003343144,0.00026292208,0.00011228183,0.00009023124,0.000114351526,0.000013123418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073680044,0.00048071274,0.0003202188,0.0005437678,0.000014866791,0.0000074487775,0.00039275087,0.00012996238,0.00048252722,0.98732805,0.0001536332,0.010138674],"study_design_scores_gemma":[0.00052983424,0.00005744809,0.000095451185,0.00009862958,0.00002514082,0.00002609142,0.00034823516,0.047450043,0.002895998,0.947902,0.00039339482,0.00017772637],"about_ca_topic_score_codex":0.0000083287,"about_ca_topic_score_gemma":0.000002073727,"teacher_disagreement_score":0.22666666,"about_ca_system_score_codex":0.00001775741,"about_ca_system_score_gemma":0.000021195983,"threshold_uncertainty_score":0.3848624},"labels":[],"label_agreement":null},{"id":"W2093738865","doi":"10.1016/j.na.2011.03.025","title":"The exact penalty principle","year":2011,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Penalty method; Mathematical optimization; Optimization problem; Mathematics; Property (philosophy); Exact solutions in general relativity; Constrained optimization; Constrained optimization problem; Multi-objective optimization","score_opus":0.10654582264462287,"score_gpt":0.3986200811838369,"score_spread":0.29207425853921404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093738865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03262171,0.00015383663,0.9175504,0.00038475954,0.00010209027,0.0004885348,0.000048781294,0.0002939291,0.04835599],"genre_scores_gemma":[0.05163785,0.00017469947,0.9064051,0.00008436215,0.00017726187,0.000045326793,0.00003412323,0.00005829051,0.041383006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871063,0.00009634383,0.00028966888,0.00021439961,0.00040797528,0.00028098247],"domain_scores_gemma":[0.99853283,0.00034224804,0.00011353475,0.0006624132,0.00024818254,0.000100794685],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057191605,0.000110605775,0.00021045942,0.00016530803,0.00028161448,0.00004020443,0.00036972153,0.000048947888,0.0015415039],"category_scores_gemma":[0.00066326256,0.00007122113,0.00023061073,0.0013198897,0.00008633396,0.00008890883,0.000108925604,0.00017665976,0.00013910656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016936208,0.009629796,0.18560499,0.00057643733,0.062100627,0.0005783122,0.023360807,0.031231042,0.0008009047,0.38857403,0.017443828,0.27840558],"study_design_scores_gemma":[0.0006582502,0.000086981796,0.0044386224,0.0000076248075,0.0013758068,0.0000060518123,0.00059781666,0.90013844,0.0030468625,0.030152453,0.05897566,0.0005154166],"about_ca_topic_score_codex":0.000024708868,"about_ca_topic_score_gemma":0.00023694892,"teacher_disagreement_score":0.8689074,"about_ca_system_score_codex":0.000042762276,"about_ca_system_score_gemma":0.00004309042,"threshold_uncertainty_score":0.99937123},"labels":[],"label_agreement":null},{"id":"W2094132822","doi":"10.1145/1916461.1916468","title":"Algorithm 909","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":627,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Software; Mathematical optimization; Algorithm; Programming language; Mathematics","score_opus":0.11982763132035752,"score_gpt":0.3502867428089378,"score_spread":0.23045911148858028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094132822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017279264,0.000011888571,0.99723536,0.00014365435,0.000093064795,0.00046690615,0.000042833613,0.00069893355,0.0011345539],"genre_scores_gemma":[0.0005609176,0.000020604168,0.99514085,0.00011576668,0.000032864446,0.00016904571,0.0000043297723,0.00009060906,0.003865012],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791056,0.00008550988,0.00048235222,0.0004066282,0.00061672175,0.00049823633],"domain_scores_gemma":[0.99718606,0.0011136193,0.00008662282,0.0011421758,0.00019242297,0.0002791214],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00028865837,0.00028542522,0.00036011141,0.0001960584,0.0002721433,0.000034491586,0.00063316734,0.00017933817,0.009935072],"category_scores_gemma":[0.001257513,0.00024826243,0.00019241724,0.00046797254,0.00016367238,0.00024184764,0.00002356071,0.000489202,0.0013110084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003935643,0.0015718971,0.000007545175,0.00016555774,0.00011828654,0.000038861355,0.0012354292,0.00010185388,0.000007863947,0.0053399503,0.00010659004,0.9912668],"study_design_scores_gemma":[0.0004593733,0.00014192081,0.000017225353,0.00006946546,0.000047270998,0.000039844443,0.00019685504,0.0013407862,0.0017086784,0.9953488,0.00033656915,0.00029317435],"about_ca_topic_score_codex":0.0000033688996,"about_ca_topic_score_gemma":0.0000018423501,"teacher_disagreement_score":0.99097365,"about_ca_system_score_codex":0.00009476496,"about_ca_system_score_gemma":0.000046337576,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W2096331293","doi":"10.1080/03081080701336545","title":"Geometry of higher-rank numerical ranges","year":2007,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo; University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Geometry; Combinatorics","score_opus":0.04091341204955833,"score_gpt":0.38009723967408976,"score_spread":0.3391838276245314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096331293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21757473,0.00076999963,0.7783238,0.00028696368,0.00026249606,0.0005291363,0.000038680733,0.0002214461,0.001992724],"genre_scores_gemma":[0.40834767,0.00017233804,0.58577335,0.000115753675,0.0003373219,0.000006620531,0.000017784881,0.00006720473,0.005161939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858016,0.000039177557,0.00041662483,0.00026157065,0.00036525892,0.00033721523],"domain_scores_gemma":[0.99850607,0.0007246816,0.00010670584,0.0002864343,0.00020055044,0.00017555583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060287,0.00016256247,0.00032057622,0.00018279943,0.00006905251,0.00001115291,0.00014588125,0.00013143392,0.0003331221],"category_scores_gemma":[0.00062289526,0.00014130515,0.00007562059,0.0004037036,0.00014502862,0.00009556697,0.00010081385,0.00023798454,0.000025678359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029064803,0.004589059,0.021622894,0.0028004318,0.001001355,0.00034263474,0.0054058856,0.0019937519,0.027751278,0.091192864,0.00631201,0.83408135],"study_design_scores_gemma":[0.018194642,0.0012848591,0.028123071,0.00032533958,0.00030803907,0.00012925794,0.0016728507,0.40388557,0.34411454,0.025730506,0.17353135,0.002699966],"about_ca_topic_score_codex":0.000016040009,"about_ca_topic_score_gemma":0.000003120526,"teacher_disagreement_score":0.8313814,"about_ca_system_score_codex":0.000017572136,"about_ca_system_score_gemma":0.00002183007,"threshold_uncertainty_score":0.5762257},"labels":[],"label_agreement":null},{"id":"W2096547979","doi":"10.1287/moor.1060.0212","title":"Computation of the Lasserre Ranks of Some Polytopes","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Computation; Lift (data mining); Mathematical optimization; Discrete mathematics; Applied mathematics; Algorithm; Computer science","score_opus":0.17158579478364877,"score_gpt":0.4919333757813225,"score_spread":0.32034758099767374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096547979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4629253,0.00020092847,0.5290035,0.0005350445,0.00009280776,0.0017884562,0.000050193015,0.000032880485,0.0053709233],"genre_scores_gemma":[0.69989717,0.00003319809,0.29886958,0.000004184979,0.000027958678,0.000018479437,0.000004319488,0.000029777471,0.0011153085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967458,0.00021241348,0.0009963225,0.00016727361,0.0015552151,0.0003229691],"domain_scores_gemma":[0.99531275,0.0016969173,0.00017508976,0.0006318158,0.0021176336,0.000065805616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038082602,0.000117331,0.00035641456,0.00045994724,0.00020635047,0.000023790195,0.00060119067,0.000101954836,0.000094235285],"category_scores_gemma":[0.0040195156,0.00008572132,0.000108953034,0.0012209855,0.00056295097,0.00021687453,0.00028170078,0.00034599775,0.0000065527947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006033386,0.0020689126,0.00028133442,0.0021379641,0.00014986709,0.0000023930568,0.007698478,0.05172866,0.06334552,0.86813605,0.00074509945,0.0036453865],"study_design_scores_gemma":[0.0013930589,0.00026582257,0.0007099123,0.0006650225,0.0000374807,0.000012379384,0.0061409003,0.29775783,0.47099742,0.22169225,0.00007493384,0.0002529768],"about_ca_topic_score_codex":0.000035111578,"about_ca_topic_score_gemma":0.0000717081,"teacher_disagreement_score":0.6464438,"about_ca_system_score_codex":0.000063742205,"about_ca_system_score_gemma":0.0002273887,"threshold_uncertainty_score":0.48120257},"labels":[],"label_agreement":null},{"id":"W2097828930","doi":"10.1287/ijoc.1100.0425","title":"An Improved Primal Simplex Algorithm for Degenerate Linear Programs","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Degeneracy (biology); Simplex algorithm; Simplex; Linear programming; Degenerate energy levels; Criss-cross algorithm; Algorithm; Mathematics; Mathematical optimization; Linear-fractional programming; Function (biology); Sequence (biology); Computer science; Combinatorics","score_opus":0.05516187897734527,"score_gpt":0.3963921387197743,"score_spread":0.34123025974242904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097828930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07247016,0.000003822595,0.9258223,0.00008789045,0.0005707641,0.0006559177,0.00000802819,0.00016248795,0.00021858349],"genre_scores_gemma":[0.030081233,0.0000034184734,0.9677952,0.00017966572,0.0016674342,0.000013620944,0.000024654613,0.00007096705,0.00016380586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978646,0.000030500178,0.00073286734,0.00022875382,0.00046140555,0.0006818913],"domain_scores_gemma":[0.99765337,0.00032468518,0.00047124736,0.00032357502,0.00084712176,0.00037999667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013312607,0.00024512774,0.00029663526,0.0002037717,0.00061309483,0.0003845265,0.00047017104,0.00015324877,0.000050890205],"category_scores_gemma":[0.00057833013,0.00018960035,0.00014559245,0.00025295958,0.00006784635,0.0005708247,0.000083899344,0.0011207467,0.000012292783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003746594,0.00017449552,0.000024822171,0.000021891174,0.000034398607,0.000008760821,0.00024229805,0.0044656205,0.0008930521,0.001675323,0.00007058669,0.9923513],"study_design_scores_gemma":[0.0013772788,0.0006987337,0.000013181567,0.000029465764,0.000008925023,0.00018000306,0.00010046896,0.98285574,0.0035680498,0.0052553806,0.005649528,0.00026324586],"about_ca_topic_score_codex":0.0000015764434,"about_ca_topic_score_gemma":0.0000043694286,"teacher_disagreement_score":0.992088,"about_ca_system_score_codex":0.000079475285,"about_ca_system_score_gemma":0.00020040419,"threshold_uncertainty_score":0.7731678},"labels":[],"label_agreement":null},{"id":"W2098024031","doi":"10.1007/s10589-014-9708-2","title":"Linear equalities in blackbox optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Convergence (economics); Simplex; Optimization problem; Simplex algorithm; Linear programming; Combinatorics","score_opus":0.044976527383543866,"score_gpt":0.3669998117124803,"score_spread":0.32202328432893645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098024031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012656584,0.00003495772,0.9951264,0.0007489552,0.000023677823,0.0006183716,0.000014918942,0.00015917457,0.003146947],"genre_scores_gemma":[0.024063542,0.00008198684,0.9742299,0.00029087954,0.000118020595,0.00032855378,0.00031737649,0.000044218894,0.00052556896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984565,0.00013487764,0.00049739826,0.00036631658,0.00032373282,0.00022121282],"domain_scores_gemma":[0.9983675,0.0007872804,0.00015829505,0.00021546024,0.0003543519,0.00011711498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003890903,0.0001712916,0.00021375658,0.00031337317,0.00021755014,0.000070364134,0.00014797399,0.00009331203,0.00020483257],"category_scores_gemma":[0.0003425497,0.00018660464,0.00003420588,0.00069884805,0.00012983696,0.00027673144,0.00006930103,0.00014956188,0.00001668013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004749199,0.00007514763,0.000081446364,0.000024369312,0.000005096954,1.4088991e-7,0.00009941306,0.7787421,8.245657e-7,0.21939123,0.00007571145,0.0014997788],"study_design_scores_gemma":[0.0006352829,0.000019131805,0.000054339496,0.000016465334,0.0000068477098,0.0000043922037,0.00010398537,0.9190057,0.000006677585,0.078700826,0.0012661171,0.00018021483],"about_ca_topic_score_codex":0.0000031542454,"about_ca_topic_score_gemma":0.0000027154083,"teacher_disagreement_score":0.1406904,"about_ca_system_score_codex":0.00006556077,"about_ca_system_score_gemma":0.000057881887,"threshold_uncertainty_score":0.76095164},"labels":[],"label_agreement":null},{"id":"W2098609180","doi":"10.1007/s10208-003-0116-8","title":"On the Curvature of the Central Path of Linear Programming Theory","year":2005,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Curvature; Path (computing); Linear programming; Linear-fractional programming; Linear system; Numerical analysis","score_opus":0.0413287192296841,"score_gpt":0.35281150476278966,"score_spread":0.31148278553310554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098609180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04621891,0.000030948097,0.950067,0.0013339925,0.000072156785,0.0009040421,0.0000694632,0.000031514413,0.0012720143],"genre_scores_gemma":[0.39211327,0.0000036555512,0.6075161,0.000032550754,0.00003803676,0.000020013344,0.000015323105,0.000021325453,0.0002397491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981405,0.00013685637,0.0006723648,0.00011416367,0.00077166565,0.0001644063],"domain_scores_gemma":[0.9940728,0.0041262214,0.0006443026,0.0004213341,0.00070358656,0.00003177029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006145526,0.0001276627,0.0002330503,0.00009074109,0.00016242717,0.000013391304,0.00044886806,0.00005594585,0.0001822122],"category_scores_gemma":[0.002680972,0.000077442004,0.00014157691,0.0004953502,0.00033305417,0.00009892792,0.00009528303,0.00018975421,0.0000063122375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010305274,0.0004842442,0.000022437862,0.00015144289,0.00006211004,5.899807e-8,0.0013861174,0.12100336,0.000026745705,0.8745398,0.00023877848,0.002074631],"study_design_scores_gemma":[0.00025641482,0.00004490355,0.00019705492,0.00018196821,0.000036003705,0.0000030371227,0.00035208653,0.17747675,0.00094271824,0.82013243,0.00029990482,0.00007674796],"about_ca_topic_score_codex":7.9058066e-7,"about_ca_topic_score_gemma":0.0000016456481,"teacher_disagreement_score":0.34589437,"about_ca_system_score_codex":0.000044470304,"about_ca_system_score_gemma":0.0001715638,"threshold_uncertainty_score":0.32095677},"labels":[],"label_agreement":null},{"id":"W2100210445","doi":"10.1287/moor.27.3.567.317","title":"Approximating Subdifferentials by Random Sampling of Gradients","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Almost everywhere; Subderivative; Convex hull; Euclidean space; Function (biology); Euclidean geometry; Applied mathematics; Convex function; Point (geometry); Mathematical analysis; Regular polygon; Pure mathematics; Mathematical optimization; Convex optimization; Geometry","score_opus":0.3146180574641937,"score_gpt":0.465711267282209,"score_spread":0.15109320981801533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100210445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1960595,0.00029584416,0.7964155,0.00019802991,0.00004569768,0.0016899471,0.00011103939,0.00006320276,0.0051212106],"genre_scores_gemma":[0.34882802,0.00016061925,0.64763474,0.0000029161115,0.000028251296,0.00015180555,0.000024656454,0.00006248232,0.0031065368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960477,0.000324881,0.0012529257,0.00029011886,0.0015806915,0.0005037149],"domain_scores_gemma":[0.9953815,0.0021654821,0.00016550622,0.00071985,0.0014374488,0.00013021145],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002582384,0.00018146311,0.00059472094,0.00052394666,0.00033964985,0.00008390332,0.0005783876,0.0001104521,0.0012991204],"category_scores_gemma":[0.0073119886,0.00016211305,0.00011251651,0.00097580557,0.0003548115,0.00024497084,0.00023648226,0.0003888319,0.0000365999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015113816,0.016990239,0.00034624126,0.01039734,0.0010032319,0.000009919021,0.049342047,0.03623422,0.3446092,0.5003008,0.021581143,0.019034455],"study_design_scores_gemma":[0.0020805073,0.0001567599,0.000004495143,0.00032908088,0.000027367752,0.000007772808,0.0019778498,0.88073945,0.06961699,0.044703823,0.00009475474,0.00026113153],"about_ca_topic_score_codex":0.00001984293,"about_ca_topic_score_gemma":0.0000091228785,"teacher_disagreement_score":0.84450525,"about_ca_system_score_codex":0.00007864443,"about_ca_system_score_gemma":0.000040509207,"threshold_uncertainty_score":0.9996138},"labels":[],"label_agreement":null},{"id":"W2101538582","doi":"10.1007/s10107-016-1043-1","title":"Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Lipschitz continuity; Simplex; Ball (mathematics); Hypercube; Rate of convergence; Lebesgue measure; Infimum and supremum; Polynomial; Measure (data warehouse); Degree (music); Discrete mathematics; Lebesgue integration; Mathematical analysis","score_opus":0.07414095966189453,"score_gpt":0.37185180066735857,"score_spread":0.297710841005464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101538582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006667441,0.00002264767,0.996555,0.00050810556,0.00005445806,0.001912157,0.000056010318,0.00012907172,0.000095844385],"genre_scores_gemma":[0.08167061,0.00000288672,0.91677505,0.000019651688,0.00006159542,0.00088882947,0.00002562741,0.0000650741,0.0004906725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764246,0.00007723372,0.0007878725,0.0004026136,0.0005404647,0.0005493679],"domain_scores_gemma":[0.99527764,0.0030158802,0.00031300465,0.00046070683,0.00076464104,0.00016812468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011544448,0.00023225175,0.00061475864,0.0003685082,0.0001595313,0.000057979494,0.00031188852,0.00014814547,0.00027704836],"category_scores_gemma":[0.005407899,0.00016706882,0.00045782476,0.00073236274,0.00022884071,0.00019572524,0.000051037914,0.000074369316,0.0000050655863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004307924,0.007055981,0.0037684096,0.010939304,0.0063249813,0.000007054156,0.0021523663,0.12542647,0.0067090783,0.51211095,0.0026874917,0.31851],"study_design_scores_gemma":[0.0027876198,0.00036757626,0.0000100734405,0.00019903152,0.0006142347,0.0000013763432,0.000102370075,0.92096084,0.008422837,0.064672455,0.0014468938,0.00041471157],"about_ca_topic_score_codex":0.000001196884,"about_ca_topic_score_gemma":0.0000027406913,"teacher_disagreement_score":0.7955344,"about_ca_system_score_codex":0.000123962,"about_ca_system_score_gemma":0.00012947575,"threshold_uncertainty_score":0.6812869},"labels":[],"label_agreement":null},{"id":"W2102483896","doi":"10.1145/1151446.1151453","title":"Symbolic computation of Fenchel conjugates","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Subderivative; Conic optimization; Convex analysis; Convex optimization; Proper convex function; Mathematical optimization; Mathematics; Optimization problem; Computation; Computer science; Linear matrix inequality; Symbolic regression; Regular polygon; Algorithm; Genetic programming; Artificial intelligence","score_opus":0.07513176899859404,"score_gpt":0.3909259048507741,"score_spread":0.3157941358521801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102483896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055670064,0.0005424004,0.9389855,0.0017777503,0.00008519521,0.0005900602,0.000012472838,0.00018387575,0.002152671],"genre_scores_gemma":[0.4314937,0.00006882894,0.5682381,0.000037187267,0.000027351298,0.000030218263,0.000045398283,0.00001857381,0.000040687766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842656,0.00024462593,0.0006502787,0.00020275712,0.00025750324,0.00021827451],"domain_scores_gemma":[0.9958081,0.0016274935,0.00021273807,0.0020106537,0.00030497467,0.00003603693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038102595,0.00014027282,0.00027827005,0.00030969715,0.00011376369,0.000034945613,0.0015071292,0.00007742423,0.000022251303],"category_scores_gemma":[0.00027559468,0.00015209531,0.000057686146,0.0007196546,0.0002534578,0.0001918549,0.0010241043,0.00025675865,0.000020603804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030049117,0.0028997927,0.015414012,0.00030607142,0.000115490366,0.000007668309,0.0022877622,0.054711204,0.00079967844,0.82039577,0.006809381,0.0962231],"study_design_scores_gemma":[0.00074803305,0.000038666705,0.005861507,0.000102231024,0.000009749474,0.000008149006,0.000048506845,0.41066426,0.000537354,0.5814433,0.00034341202,0.0001948063],"about_ca_topic_score_codex":0.00010110662,"about_ca_topic_score_gemma":0.00008705429,"teacher_disagreement_score":0.37582365,"about_ca_system_score_codex":0.000080204634,"about_ca_system_score_gemma":0.000057470068,"threshold_uncertainty_score":0.6202267},"labels":[],"label_agreement":null},{"id":"W2105100124","doi":"10.1007/s00013-010-0179-0","title":"Lower bounds for a polynomial in terms of its coefficients","year":2010,"lang":"en","type":"article","venue":"Archiv der Mathematik","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Polynomial; Explained sum of squares; Upper and lower bounds; Term (time); Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.03805556594669443,"score_gpt":0.3650332123544502,"score_spread":0.32697764640775573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105100124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3673937,0.00002314274,0.60625285,0.00046676808,0.00056280283,0.0028997886,0.00015340476,0.000153131,0.022094429],"genre_scores_gemma":[0.5331996,0.0000063450175,0.4642526,0.00003957191,0.00008244711,0.00016331249,0.00001290802,0.00007717641,0.0021660442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984467,0.000033495977,0.00051167473,0.00027016882,0.0003401897,0.0003977438],"domain_scores_gemma":[0.9982783,0.00091563375,0.00016908896,0.00044997418,0.00009137144,0.000095603085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044080586,0.00016969054,0.0003354326,0.00026584696,0.00006692919,0.000028081422,0.00036897356,0.00008243703,0.00021568195],"category_scores_gemma":[0.001423021,0.00015151182,0.00010372027,0.00024314923,0.00012708349,0.00012961832,0.0001258182,0.00026899093,0.00002790973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012083324,0.009932109,0.0016558989,0.005343221,0.0003617643,0.000060768674,0.023444664,0.0018354049,0.15726529,0.7343971,0.014928388,0.04956704],"study_design_scores_gemma":[0.0069448547,0.0003802854,0.0006211351,0.00038477042,0.000052584466,0.0000610711,0.00023490381,0.20303187,0.043879222,0.73752815,0.0059763254,0.0009048209],"about_ca_topic_score_codex":0.0000017002087,"about_ca_topic_score_gemma":0.000034163557,"teacher_disagreement_score":0.20119646,"about_ca_system_score_codex":0.000022552635,"about_ca_system_score_gemma":0.000055343076,"threshold_uncertainty_score":0.61784726},"labels":[],"label_agreement":null},{"id":"W2106602995","doi":"10.1016/j.jmaa.2006.08.091","title":"A derivative-free optimization algorithm based on conditional moments","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Convergence (economics); Algorithm; Derivative (finance); Function (biology); Second derivative; Newton's method; Trust region; Mathematical optimization; Feature (linguistics); Applied mathematics; Local convergence; Newton's method in optimization; Derivative-free optimization; Optimization problem; Iterative method; Computer science; Nonlinear system; Mathematical analysis; Meta-optimization","score_opus":0.020078314146929045,"score_gpt":0.3261034888069023,"score_spread":0.30602517465997325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106602995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024212105,0.00001901769,0.9972465,0.0008397132,0.0000050515296,0.0002357174,0.000050420073,0.000018724653,0.0013427576],"genre_scores_gemma":[0.016239017,0.000016404349,0.98295844,0.0000842281,0.00013405492,0.00007926681,0.000051748288,0.00002021221,0.00041662654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816597,0.00006917527,0.0007354731,0.00017319046,0.0006940495,0.0001621648],"domain_scores_gemma":[0.9977292,0.0008285809,0.00049863604,0.00030452467,0.0005156644,0.00012341561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045581008,0.0001455152,0.0004133421,0.0005327686,0.00016426116,0.00006890267,0.00022901983,0.00006360428,0.00051002146],"category_scores_gemma":[0.0003000678,0.00011351928,0.00020426088,0.0010834284,0.00011129345,0.00013678313,0.000041119845,0.00017248707,0.000007052591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030014367,0.0023676096,0.00020344461,0.000091742266,0.0006723053,0.000008372893,0.000038388782,0.70819896,0.0000629501,0.28138402,0.0018609347,0.005081269],"study_design_scores_gemma":[0.0005248746,0.000045372293,0.00015191772,0.000016610102,0.0003238244,0.0000075760186,0.00003011304,0.6299908,0.00011020058,0.36845928,0.0002489015,0.000090543435],"about_ca_topic_score_codex":0.0000010277666,"about_ca_topic_score_gemma":7.968125e-7,"teacher_disagreement_score":0.08707524,"about_ca_system_score_codex":0.0000647616,"about_ca_system_score_gemma":0.00004214865,"threshold_uncertainty_score":0.5584377},"labels":[],"label_agreement":null},{"id":"W2107220907","doi":"","title":"Identifying Active Manifolds","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subgradient method; Smoothness; Manifold (fluid mechanics); Projection (relational algebra); Identification (biology); Computer science; Mathematics; Mathematical optimization; Point (geometry); Applied mathematics; Algorithm; Mathematical analysis; Geometry; Biology","score_opus":0.1062241948173817,"score_gpt":0.43748435963029814,"score_spread":0.3312601648129164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107220907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029883091,0.0000063903594,0.89864427,0.000046433295,0.000057750007,0.00012915763,8.0665274e-7,0.00013692628,0.09798997],"genre_scores_gemma":[0.08701527,0.000010267253,0.881946,0.00007939509,0.00008468351,0.0000055865917,0.0000024779163,0.000031088337,0.030825226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991757,0.00001319263,0.00015511837,0.00013286828,0.00027843908,0.00024467794],"domain_scores_gemma":[0.9993113,0.00028915415,0.0000380284,0.00017481329,0.000111874724,0.00007478775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034644234,0.00006577811,0.00008517418,0.00010780254,0.00007154968,0.000022469709,0.000114041846,0.00004254651,0.0013363278],"category_scores_gemma":[0.0002754999,0.00005904892,0.000029824367,0.00022445385,0.000023315035,0.00017477373,0.00006569507,0.00010626533,0.00017120712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009136652,0.00030028503,0.00029856077,0.0000987795,0.000073985815,0.00014610017,0.0018349522,0.00012555382,0.0053032264,0.8725747,0.006171044,0.11298146],"study_design_scores_gemma":[0.0016650866,0.00008347902,0.0023289938,0.000048508595,0.00002573516,0.00006513651,0.0065546734,0.009160694,0.25945064,0.7125656,0.0073525324,0.00069890916],"about_ca_topic_score_codex":0.000004311541,"about_ca_topic_score_gemma":0.000022458931,"teacher_disagreement_score":0.2541474,"about_ca_system_score_codex":0.00007138339,"about_ca_system_score_gemma":0.000013403276,"threshold_uncertainty_score":0.99957657},"labels":[],"label_agreement":null},{"id":"W2108318806","doi":"","title":"Separation property of continuously differentiable functions","year":2013,"lang":"en","type":"article","venue":"Hrčak Portal of scientific journals of Croatia (University Computing Centre)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differentiable function; Mathematics; Lipschitz continuity; Directional derivative; Derivative (finance); Separation property; Property (philosophy); Fréchet derivative; Convex function; Pure mathematics; Function (biology); Mathematical analysis; Quadratic equation; Concave function; Applied mathematics; Regular polygon; Banach space; Geometry","score_opus":0.041185596357052885,"score_gpt":0.3003441258963801,"score_spread":0.2591585295393272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108318806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84466314,0.000034815526,0.15221809,0.00016156882,0.00022330183,0.00038955448,0.000026581418,0.000029734869,0.0022532074],"genre_scores_gemma":[0.94752604,0.000007716028,0.037700314,0.0000019999443,0.000018260076,5.2875457e-8,0.00001880555,0.000012805735,0.014714001],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794513,0.000113148635,0.00061464246,0.00026359988,0.0007614307,0.000302041],"domain_scores_gemma":[0.9961903,0.00018753362,0.0011244608,0.00033500028,0.0020182573,0.00014443387],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006289389,0.00013791857,0.0004221717,0.0004979039,0.00029157108,0.00006445485,0.00038026506,0.00007175514,0.0016701325],"category_scores_gemma":[0.00024787354,0.000119805096,0.00017416305,0.0008535826,0.0004314696,0.0006542476,0.00017821585,0.00017745038,0.00001744244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005003367,0.009927076,0.10880974,0.0032310686,0.002381296,0.00009814313,0.03245837,0.06222558,0.48219302,0.03244471,0.20269237,0.06303827],"study_design_scores_gemma":[0.008631615,0.0005421471,0.08030742,0.0026117833,0.0007042481,0.00011116109,0.047228776,0.75464356,0.08370503,0.01696703,0.002864543,0.0016826685],"about_ca_topic_score_codex":0.0001024481,"about_ca_topic_score_gemma":0.000033208333,"teacher_disagreement_score":0.692418,"about_ca_system_score_codex":0.00004233827,"about_ca_system_score_gemma":0.00015459841,"threshold_uncertainty_score":0.9992425},"labels":[],"label_agreement":null},{"id":"W2110344857","doi":"10.1287/ijoc.1090.0323","title":"Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Inequality; Mathematical optimization; Matrix (chemical analysis); Constraint (computer-aided design); Linear programming; Linear inequality; Algorithm; Computer science","score_opus":0.09771958865612318,"score_gpt":0.431514757271499,"score_spread":0.33379516861537584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110344857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8055472,0.000046739005,0.19364871,0.000072142764,0.000025659807,0.00010263837,0.000012682048,0.00001584726,0.0005284288],"genre_scores_gemma":[0.84812164,0.00002852779,0.1517666,0.000035196572,0.000021559797,8.663665e-8,0.0000020204975,0.000004459869,0.000019910702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840385,0.0000496634,0.0008610954,0.000086298416,0.00042554198,0.000173532],"domain_scores_gemma":[0.99804515,0.0006291374,0.0006293602,0.00016005819,0.00044511826,0.00009118055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054477,0.00010082923,0.0004366934,0.0004704914,0.000091241556,0.00002620005,0.00012444916,0.000050310347,0.000040061444],"category_scores_gemma":[0.0010987674,0.00007736307,0.00012668283,0.0005533246,0.00009652112,0.00014536425,0.000043335,0.0002723799,4.798433e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004078174,0.0006822082,0.028213058,0.00047120944,0.0017272355,0.00004035826,0.012450294,0.6246954,0.00033025967,0.082202666,0.000090679794,0.2486888],"study_design_scores_gemma":[0.0014672709,0.00056187896,0.012600483,0.00024862663,0.00019047073,0.00008389054,0.0022433067,0.9443959,0.001115453,0.03682974,0.000030295536,0.0002326808],"about_ca_topic_score_codex":0.0000022958625,"about_ca_topic_score_gemma":8.602673e-7,"teacher_disagreement_score":0.31970048,"about_ca_system_score_codex":0.000056635294,"about_ca_system_score_gemma":0.00006527655,"threshold_uncertainty_score":0.31547743},"labels":[],"label_agreement":null},{"id":"W2111507332","doi":"10.1002/nla.1837","title":"Steepest descent preconditioning for nonlinear GMRES optimization","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Generalized minimal residual method; Mathematics; Gradient descent; Method of steepest descent; Nonlinear conjugate gradient method; Mathematical optimization; Conjugate gradient method; Optimization problem; Line search; Convergence (economics); Nonlinear system; Applied mathematics; Iterative method; Computer science; Artificial neural network","score_opus":0.04170620897805142,"score_gpt":0.35198990765666077,"score_spread":0.31028369867860933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111507332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029565336,0.00006831001,0.9961181,0.0003816674,0.00003710671,0.0019963388,0.000116737305,0.00027094348,0.0007151336],"genre_scores_gemma":[0.01178745,0.000023468452,0.9833593,0.00013751174,0.0005581589,0.0028483463,0.0004822027,0.00009843528,0.0007051202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831086,0.000049202194,0.0003951069,0.00034713352,0.0003565834,0.00054110884],"domain_scores_gemma":[0.99799746,0.00059683435,0.00019699216,0.000460731,0.00043050217,0.00031749453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024654734,0.00021696546,0.0002536621,0.00011582225,0.00038711895,0.00006541651,0.00024866188,0.0001043963,0.00026322991],"category_scores_gemma":[0.00032831533,0.00018959405,0.000074191084,0.0006316193,0.00010225128,0.00064563105,0.00005592491,0.00020992695,0.00006505623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003097042,0.0040544327,0.002777867,0.00046555971,0.00033912528,9.215976e-7,0.00073409826,0.5936372,0.00012356322,0.36541003,0.0026916275,0.02945586],"study_design_scores_gemma":[0.0019661325,0.00029451016,0.00028289665,0.000056895176,0.00016897613,0.000035736284,0.00029592947,0.914285,0.002033533,0.0066419505,0.073089495,0.00084896246],"about_ca_topic_score_codex":0.000002050919,"about_ca_topic_score_gemma":0.0000011327633,"teacher_disagreement_score":0.35876808,"about_ca_system_score_codex":0.00011112079,"about_ca_system_score_gemma":0.000080180056,"threshold_uncertainty_score":0.7731421},"labels":[],"label_agreement":null},{"id":"W2111997007","doi":"10.1007/s12532-012-0050-3","title":"Trajectory-following methods for large-scale degenerate convex quadratic programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Mathematical optimization; Degenerate energy levels; Mathematics; Complementarity (molecular biology); Quadratic programming; Regular polygon; Complementarity theory; Degeneracy (biology); Convex optimization; Quadratic growth; Convergence (economics); Applied mathematics; Computer science; Algorithm; Geometry","score_opus":0.06588397214478896,"score_gpt":0.4300520505632912,"score_spread":0.36416807841850224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111997007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006828111,0.000078167584,0.9869622,0.000278872,0.00019566808,0.0047732336,0.0000029164853,0.0006724117,0.00020841026],"genre_scores_gemma":[0.028708229,0.0000012900374,0.9681252,0.000057638532,0.000118435346,0.0022904065,0.00006208887,0.0001395488,0.00049711735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964116,0.00039432602,0.0010361962,0.00061545655,0.0005536961,0.0009887178],"domain_scores_gemma":[0.9962233,0.0022647318,0.0003148064,0.00036966216,0.00052705844,0.00030047473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021090033,0.00040328302,0.00070590933,0.00022567454,0.00047101887,0.00050908735,0.00030417656,0.00020133457,0.0001235888],"category_scores_gemma":[0.00236474,0.0003668642,0.00033199173,0.0006265629,0.000088075125,0.0005038466,0.00010849845,0.00031088403,0.00012222523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986276,0.0014546156,0.00006428789,0.0020012276,0.0002679926,0.000006098116,0.004978357,0.0025217913,0.0008781272,0.03916806,0.0005582945,0.94807315],"study_design_scores_gemma":[0.0010436674,0.0001623665,0.0000087396475,0.00011578896,0.00008383405,0.000009928768,0.0010425157,0.76033175,0.0006873612,0.23495305,0.0011599571,0.00040102247],"about_ca_topic_score_codex":0.0000036140561,"about_ca_topic_score_gemma":0.0000023844173,"teacher_disagreement_score":0.9476721,"about_ca_system_score_codex":0.00015788896,"about_ca_system_score_gemma":0.000077572986,"threshold_uncertainty_score":0.99987835},"labels":[],"label_agreement":null},{"id":"W2112079301","doi":"10.1007/s101070200296","title":"Self-regular functions and new search directions for linear and semidefinite optimization","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":210,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Function (biology); Upper and lower bounds; Kernel (algebra); Interior point method; Polynomial; Semidefinite programming; Discrete mathematics; Algorithm; Mathematical analysis; Mathematical optimization","score_opus":0.10303372611590725,"score_gpt":0.3484202648766631,"score_spread":0.24538653876075586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112079301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045928365,0.00034836732,0.9955627,0.00081156567,0.000031859396,0.0012114389,0.00000678283,0.00041248693,0.0011555501],"genre_scores_gemma":[0.0008771002,0.00017378415,0.99278224,0.0000207012,0.0001132561,0.00019012025,0.0000102893655,0.00006683824,0.0057656844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984905,0.000056974164,0.0003718527,0.00036026764,0.0003044927,0.00041591443],"domain_scores_gemma":[0.99811715,0.001076155,0.00006808392,0.0002547448,0.00018574565,0.0002981515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041871142,0.00019418616,0.0002780098,0.00016838918,0.0004182046,0.00015641027,0.00008692866,0.00012218922,0.00022451331],"category_scores_gemma":[0.0013343832,0.00018069735,0.000060379192,0.0004012708,0.0001190408,0.00023654656,0.00010248394,0.00020463835,0.000022672068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008024943,0.0026747668,0.00020550819,0.005426398,0.0006427486,0.000016620414,0.008944921,0.01947155,0.000091669164,0.2821529,0.004407222,0.67588544],"study_design_scores_gemma":[0.00072301255,0.00012002281,0.0000011931545,0.000066151435,0.000080078884,0.000048464146,0.00036889655,0.9571442,0.000051758183,0.031408537,0.009768886,0.00021878716],"about_ca_topic_score_codex":0.0000020639172,"about_ca_topic_score_gemma":0.0000015436999,"teacher_disagreement_score":0.9376727,"about_ca_system_score_codex":0.00004960578,"about_ca_system_score_gemma":0.000019888997,"threshold_uncertainty_score":0.73686236},"labels":[],"label_agreement":null},{"id":"W2112394655","doi":"10.1287/opre.1110.0951","title":"An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Computer science; Algorithm; Interior point method; Point (geometry); Constraint (computer-aided design); Linear programming; Branch and bound; Mathematics","score_opus":0.15512991551741845,"score_gpt":0.44455638657097624,"score_spread":0.2894264710535578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112394655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072811695,0.0000623764,0.99369913,0.0004960879,0.00005091467,0.0038247667,0.00015934584,0.00016142314,0.00081785035],"genre_scores_gemma":[0.038075674,0.000061900675,0.95724,0.00010922927,0.00022780235,0.0027129303,0.0011203593,0.000099174526,0.00035296447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968152,0.0004886962,0.0005968571,0.00068488135,0.00077333895,0.0006410136],"domain_scores_gemma":[0.995301,0.00018707314,0.00008503192,0.00081793556,0.0032939294,0.00031504335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669747,0.00023391149,0.00028409457,0.00054505985,0.0011927059,0.00027439327,0.0003909325,0.00014323501,0.00041588765],"category_scores_gemma":[0.00035200967,0.00021229644,0.000052975178,0.0008545515,0.00029521607,0.0008344809,0.00007727783,0.00040180032,0.00002913266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022606373,0.0013454112,0.00004362304,0.00033673225,0.00017832409,0.000009812711,0.0325089,0.29079023,0.0048737046,0.06433777,0.0022049618,0.60314447],"study_design_scores_gemma":[0.0009358244,0.001006653,0.000004972116,0.00003560799,0.000008500396,0.000015865387,0.0051454813,0.98641294,0.005371665,0.00038369326,0.00043198882,0.0002467934],"about_ca_topic_score_codex":0.00013697898,"about_ca_topic_score_gemma":0.00057333184,"teacher_disagreement_score":0.69562274,"about_ca_system_score_codex":0.00048709838,"about_ca_system_score_gemma":0.0007446797,"threshold_uncertainty_score":0.91734505},"labels":[],"label_agreement":null},{"id":"W2114650657","doi":"10.1016/j.tcs.2006.05.011","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","score_opus":0.056029897949023626,"score_gpt":0.36187059965159923,"score_spread":0.3058407017025756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114650657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009720004,0.000020970027,0.98853695,0.00056231115,0.00007528468,0.00052869896,0.000014599896,0.000017767028,0.0005233869],"genre_scores_gemma":[0.6948952,0.0000025525633,0.3049225,0.00005256787,0.00007393103,0.000014596588,0.0000011430354,0.000008907412,0.00002856926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856645,0.000083513565,0.00035512156,0.00019316304,0.00054750673,0.00025422516],"domain_scores_gemma":[0.9953566,0.0035810252,0.00015824051,0.0004795907,0.00038828372,0.000036218964],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013271444,0.00008869352,0.00016893541,0.00007039626,0.00022375694,0.00004122682,0.0008499746,0.000031224397,0.00009707497],"category_scores_gemma":[0.0008657702,0.00004658186,0.00006630485,0.0006256764,0.0031899593,0.00010196941,0.00024518196,0.000070050744,0.000001203966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025150326,0.00004934711,0.000014974241,0.00001721657,0.0000047820736,1.1549159e-7,0.00013524888,0.0057815197,0.00033788572,0.9842334,0.00037656867,0.0090238],"study_design_scores_gemma":[0.00026021872,0.00005849629,0.00063974806,0.0000112517055,0.000011193266,0.0000015789059,0.000016846529,0.6617353,0.008867264,0.32824245,0.00010182664,0.000053845928],"about_ca_topic_score_codex":0.0000061294427,"about_ca_topic_score_gemma":0.0000016424641,"teacher_disagreement_score":0.68517524,"about_ca_system_score_codex":0.000023513956,"about_ca_system_score_gemma":0.00008803463,"threshold_uncertainty_score":0.9995228},"labels":[],"label_agreement":null},{"id":"W211549749","doi":"10.1007/978-0-387-88843-9_10","title":"A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Interior point method; Linear programming; Mathematical optimization; Dual (grammatical number); Set (abstract data type); Scheme (mathematics); Point (geometry); Computer science; Feasible region; Algorithm; Mathematics","score_opus":0.14377201130579662,"score_gpt":0.4553076691734314,"score_spread":0.3115356578676348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W211549749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1840514e-7,0.000045233184,0.7097359,0.00019958791,0.000054823373,0.0030780132,0.000013951155,0.00031643888,0.28655577],"genre_scores_gemma":[5.6092006e-7,0.000009968147,0.6168125,0.00015340278,0.00018625641,0.00021034814,0.000051999094,0.0001738146,0.3824011],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967048,0.00006779022,0.0010657341,0.0009164987,0.0004970611,0.0007481242],"domain_scores_gemma":[0.9970924,0.0007504776,0.00038404134,0.00072052295,0.0007228864,0.00032962734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016451805,0.0006171151,0.0009430741,0.00040750095,0.00016465652,0.00013368888,0.00041556958,0.00043808873,0.00026999658],"category_scores_gemma":[0.0017804883,0.00055223395,0.0003543929,0.00012022856,0.00008208974,0.00015480646,0.0003772805,0.0006843027,0.00005467795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011180337,0.00010494436,6.621308e-8,0.00059806235,0.00015223637,0.00000467997,0.0009385477,0.00051465124,0.00007634905,0.17457198,0.0015986132,0.8213281],"study_design_scores_gemma":[0.0010531911,0.000704793,5.6733757e-8,0.00044946355,0.00014707491,0.00004299336,0.00033261665,0.16623828,0.0013199961,0.18142869,0.6468982,0.0013846516],"about_ca_topic_score_codex":0.0000016455607,"about_ca_topic_score_gemma":0.000001971136,"teacher_disagreement_score":0.8199434,"about_ca_system_score_codex":0.00031469084,"about_ca_system_score_gemma":0.00014706995,"threshold_uncertainty_score":0.9996929},"labels":[],"label_agreement":null},{"id":"W2116208947","doi":"10.1287/ijoc.1030.0065","title":"The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach","year":2005,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Quadratic equation; Cutting-plane method; Quadratic programming; Feasible region; Quadratically constrained quadratic program; Quadratic function; Active set method; Isotropic quadratic form; Plane (geometry); Variational inequality; Applied mathematics; Mathematical optimization; Binary quadratic form; Geometry; Nonlinear programming; Nonlinear system; Integer programming","score_opus":0.07408299595125604,"score_gpt":0.40876509385333865,"score_spread":0.3346820979020826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116208947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062122283,0.000021494228,0.9937358,0.00113682,0.00018482248,0.0004001628,0.000013448188,0.000060287686,0.00382595],"genre_scores_gemma":[0.008302797,0.000015545716,0.9885465,0.0006696544,0.0012000749,0.000014173665,0.00001897011,0.000040344636,0.0011919494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997246,0.0001604141,0.0010490074,0.00018324725,0.0008003998,0.00056089956],"domain_scores_gemma":[0.9931087,0.0052133617,0.00066863315,0.0002575757,0.0005916517,0.00016008528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00469586,0.00021523834,0.00030008375,0.00020252539,0.0010630491,0.00048433428,0.00045316073,0.00008475519,0.000044006905],"category_scores_gemma":[0.0032641054,0.0001365229,0.00017043322,0.0002651767,0.000044467914,0.00038593687,0.000097267395,0.0006318947,0.000019457832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025485703,0.0003751522,0.0001382583,0.0001335074,0.00041943672,0.0000055420032,0.005175033,0.5091495,0.000009613942,0.26374558,0.0077599953,0.21283352],"study_design_scores_gemma":[0.0012695675,0.000101272046,0.000012131204,0.000058654416,0.000014818087,0.00021155327,0.0008889678,0.96140385,0.000040308252,0.01663681,0.019184325,0.00017774188],"about_ca_topic_score_codex":0.0000013130517,"about_ca_topic_score_gemma":0.0000027213766,"teacher_disagreement_score":0.45225435,"about_ca_system_score_codex":0.00026086066,"about_ca_system_score_gemma":0.00017506648,"threshold_uncertainty_score":0.8176221},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07167003668825579,"score_gpt":0.42188048575709164,"score_spread":0.35021044906883586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117753887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027183758,0.000030677504,0.99646527,0.00007750423,0.00022439577,0.0019947311,0.0004141072,0.00038604654,0.00013544076],"genre_scores_gemma":[0.00092477084,0.000012859798,0.99652195,0.00027629084,0.00008024527,0.0005330462,0.001174266,0.00017031518,0.00030627495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958552,0.0010728702,0.0009161038,0.00076748076,0.0008283692,0.00055994705],"domain_scores_gemma":[0.99322206,0.0037315832,0.00061927416,0.000764984,0.001377244,0.0002848429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014156044,0.0004679926,0.0007809319,0.0005398953,0.00046350897,0.00007755374,0.0003272926,0.00027502023,0.0005198866],"category_scores_gemma":[0.0036878926,0.0004814629,0.00033726235,0.0009253292,0.0002324463,0.0007074991,0.000042826083,0.00032728125,0.000004070125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001338146,0.000672259,0.00070615846,0.00016040842,0.00008109023,0.000014941941,0.0004020517,0.97736573,0.00007525196,0.0002005331,0.0002459076,0.019941855],"study_design_scores_gemma":[0.0037314089,0.00063681975,0.00008712736,0.00015473194,0.00008399872,0.000005629958,0.000117011856,0.9858537,0.008077078,0.00069078547,0.00009880348,0.0004629471],"about_ca_topic_score_codex":0.0000042505885,"about_ca_topic_score_gemma":0.0000014797884,"teacher_disagreement_score":0.019478908,"about_ca_system_score_codex":0.00028056375,"about_ca_system_score_gemma":0.00067303627,"threshold_uncertainty_score":0.9997637},"labels":[],"label_agreement":null},{"id":"W2118213888","doi":"10.1007/s11856-011-0056-y","title":"Closures of quadratic modules","year":2011,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Closure (psychology); Semidefinite programming; Quadratic equation; Discrete mathematics; Set (abstract data type); Polynomial; Space (punctuation); Algebra over a field; Regular polygon; Pure mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.14636450832630046,"score_gpt":0.36717903247462497,"score_spread":0.2208145241483245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118213888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21579091,0.0003162958,0.7777027,0.00006287908,0.0001799526,0.0002631828,0.000009179824,0.000031733336,0.005643148],"genre_scores_gemma":[0.15789387,0.00010348243,0.8415709,0.000013624353,0.00006193326,0.0000022879065,2.8942668e-7,0.000041764288,0.0003118287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761385,0.00008729101,0.0012336603,0.000090817324,0.000753274,0.00022108328],"domain_scores_gemma":[0.99679977,0.000624446,0.0012413994,0.00036835394,0.0008426173,0.00012340181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018324,0.00016339023,0.0005583712,0.00028483078,0.000041296567,0.000014709457,0.00048425348,0.0000862417,0.00020876869],"category_scores_gemma":[0.0019351607,0.00012555708,0.00019063476,0.00025255114,0.00014218432,0.00019121828,0.00007001278,0.00025659587,0.000013175049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025447097,0.0075150453,0.0020024364,0.0042737736,0.0012775157,0.0003152457,0.037650082,0.0013986137,0.005509859,0.9172355,0.0042785862,0.01828888],"study_design_scores_gemma":[0.0013160296,0.00055256934,0.00020279652,0.0005963942,0.00017283506,0.00044244024,0.006964509,0.009664062,0.029147128,0.9504944,0.0001459168,0.00030090247],"about_ca_topic_score_codex":0.000003020019,"about_ca_topic_score_gemma":0.0000037768443,"teacher_disagreement_score":0.06386821,"about_ca_system_score_codex":0.000037975824,"about_ca_system_score_gemma":0.00008591691,"threshold_uncertainty_score":0.51200694},"labels":[],"label_agreement":null},{"id":"W2118688118","doi":"10.5539/mas.v2n6p81","title":"Study on the Duality between MFP and ACP","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Duality (order theory); Convexity; Mathematics; Strong duality; Constraint (computer-aided design); Wolfe duality; Combinatorics; Weak duality; Mathematical optimization; Optimization problem; Geometry","score_opus":0.2602841048850594,"score_gpt":0.412935777909475,"score_spread":0.15265167302441562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118688118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7031128,0.0000036873266,0.28636622,0.00034606972,0.000015496342,0.00078023307,0.0000038868397,0.000074444586,0.009297175],"genre_scores_gemma":[0.98760015,0.0000029106714,0.011873912,0.00007950283,0.000026738546,0.000051667812,2.786295e-7,0.000011344029,0.0003534914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981808,0.000043400116,0.0001643762,0.0003866023,0.00093349745,0.00029130353],"domain_scores_gemma":[0.9987367,0.00051209313,0.00005559543,0.0005146127,0.000078118916,0.00010290962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012471456,0.00010462767,0.0001380575,0.00007585386,0.00083340413,0.000055715715,0.000473519,0.000023699742,0.00001639383],"category_scores_gemma":[0.0003488091,0.00006854268,0.000012240345,0.0005114209,0.0007961205,0.00010216254,0.00026637953,0.00019787114,0.000028624381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025510704,0.0053088316,0.06499511,0.00012596596,0.00019973454,0.00015345996,0.21147414,0.005615655,0.06460091,0.54497373,0.003114644,0.0991827],"study_design_scores_gemma":[0.0027029053,0.00045503065,0.12227381,0.000023458857,0.000035900415,0.000030084719,0.008027928,0.15973616,0.019378422,0.6859287,0.00030966406,0.0010979595],"about_ca_topic_score_codex":0.000002132975,"about_ca_topic_score_gemma":0.0000014561949,"teacher_disagreement_score":0.28448737,"about_ca_system_score_codex":0.00005201096,"about_ca_system_score_gemma":0.00007701904,"threshold_uncertainty_score":0.6409955},"labels":[],"label_agreement":null},{"id":"W2119430905","doi":"10.1155/2014/108184","title":"Numerical Reduced Variable Optimization Methods via Implicit Functional Dependence with Applications","year":2014,"lang":"en","type":"article","venue":"Abstract and Applied Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University Belfast; Universiti Malaya; Queen's University; University of Cambridge","keywords":"Maxima and minima; Mathematics; Function (biology); Variable (mathematics); Metric (unit); Focus (optics); Applied mathematics; Basis (linear algebra); Algorithm; Optimization problem; Set (abstract data type); Computer science; Mathematical analysis; Geometry","score_opus":0.025857944221398362,"score_gpt":0.3465817959785838,"score_spread":0.32072385175718543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119430905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036825988,0.000011095967,0.9913876,0.000073622665,0.000007018416,0.00028063403,0.0000039254064,0.00009965149,0.007768164],"genre_scores_gemma":[0.25575763,0.000010182541,0.7436275,0.000044253004,0.00005864317,0.000208199,0.00007353538,0.000023267521,0.00019679632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985604,0.000047514484,0.000329632,0.00045147666,0.000348,0.00026295596],"domain_scores_gemma":[0.998465,0.00062225654,0.00019105758,0.00038158664,0.0001807652,0.00015935527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054285384,0.00018504121,0.00035919683,0.00024558997,0.00030110535,0.00008030181,0.00013943392,0.00009848491,0.00057540165],"category_scores_gemma":[0.00007297095,0.00015625122,0.00006337822,0.0015654772,0.00006896788,0.00013397331,0.000039453982,0.00020543238,0.000011807078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003470529,0.000114541486,0.00008929934,0.000024724457,0.0004372596,2.2949713e-7,0.00003259543,0.9513972,0.0020573172,0.028396158,0.000026187736,0.017389815],"study_design_scores_gemma":[0.0006575938,0.00003941301,0.0014856817,0.0000062450413,0.00103979,0.000011394534,0.00011319436,0.9487357,0.003274364,0.043556083,0.0006067791,0.00047372436],"about_ca_topic_score_codex":0.000016306916,"about_ca_topic_score_gemma":0.0000030286053,"teacher_disagreement_score":0.2553894,"about_ca_system_score_codex":0.000038493585,"about_ca_system_score_gemma":0.00003482471,"threshold_uncertainty_score":0.63717395},"labels":[],"label_agreement":null},{"id":"W2121094316","doi":"10.1287/ijoc.1030.0046","title":"The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extreme point; Mathematical optimization; Constraint (computer-aided design); Point (geometry); Feasible region; Nonlinear programming; Nonlinear system; Mathematics; Projection (relational algebra); Computer science; Algorithm; Combinatorics","score_opus":0.1117965981494792,"score_gpt":0.4271677390108882,"score_spread":0.31537114086140905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121094316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030174015,0.000024325187,0.96624744,0.0012738633,0.00025223952,0.0009893476,0.000004031336,0.00007405778,0.00096066936],"genre_scores_gemma":[0.015423387,0.000012757,0.98415446,0.00013197876,0.00016122343,0.000012350142,0.0000030461265,0.000035313693,0.00006550954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997787,0.00006335428,0.0008518789,0.00016876527,0.00047416004,0.00065485295],"domain_scores_gemma":[0.99684423,0.0019905407,0.00047342633,0.00018805783,0.00035473052,0.0001489931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364642,0.00019013317,0.00028256772,0.00021173507,0.00067150523,0.00034656076,0.0003242248,0.00008803368,0.0000048976553],"category_scores_gemma":[0.0026402858,0.00012500634,0.00012708466,0.00037855044,0.00010958086,0.00012605962,0.000088057255,0.00075657194,0.000008759758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029646303,0.00031510094,0.00023904003,0.00013603276,0.00010509482,0.00010366318,0.0019661363,0.20799416,0.000038985338,0.091599636,0.00008476693,0.6971209],"study_design_scores_gemma":[0.005985667,0.0004943135,0.000046716264,0.00074341433,0.000011557814,0.001266915,0.002476512,0.7734799,0.0012234094,0.21157269,0.0023158216,0.00038307885],"about_ca_topic_score_codex":0.0000032890878,"about_ca_topic_score_gemma":0.000008071106,"teacher_disagreement_score":0.6967378,"about_ca_system_score_codex":0.00035649285,"about_ca_system_score_gemma":0.00028738516,"threshold_uncertainty_score":0.5164743},"labels":[],"label_agreement":null},{"id":"W2122997413","doi":"10.1016/j.cor.2006.08.002","title":"Improving solver success in reaching feasibility for sets of nonlinear constraints","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Northwestern University","keywords":"Solver; Nonlinear system; Heuristic; Mathematical optimization; Computer science; Point (geometry); Constraint (computer-aided design); Set (abstract data type); Nonlinear programming; Range (aeronautics); Algorithm; Mathematics","score_opus":0.1459447074724677,"score_gpt":0.46232237544746196,"score_spread":0.3163776679749942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122997413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669187,0.00003761496,0.83030343,0.0002945795,0.00007623639,0.0017788981,0.00007247441,0.000044239943,0.00047382762],"genre_scores_gemma":[0.41033643,0.000005248217,0.5891837,0.000008867426,0.00007566402,0.00010132185,0.00007091223,0.000028099052,0.00018972934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973557,0.00037360608,0.000627952,0.00044324683,0.00065468915,0.0005448332],"domain_scores_gemma":[0.9965765,0.0015735911,0.000048567323,0.00050176104,0.0012137011,0.00008587408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027731715,0.00013926525,0.00029086566,0.0005474792,0.00033987607,0.00013411324,0.00044133927,0.00010233936,0.00005167988],"category_scores_gemma":[0.0017002122,0.00014012882,0.00007192533,0.0007661267,0.00042143816,0.0003605597,0.00024739467,0.0004707499,0.0000050393564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040186202,0.0047936738,0.013250096,0.0019171725,0.00011141642,0.000059135502,0.0037316883,0.6504254,0.023822062,0.16028893,0.0032344118,0.1379642],"study_design_scores_gemma":[0.0013199133,0.000090470756,0.0006170936,0.00007606917,0.000003102676,0.0000043604987,0.00018912226,0.9867593,0.002888857,0.007842032,0.0000607158,0.00014893676],"about_ca_topic_score_codex":0.0004852961,"about_ca_topic_score_gemma":0.0008635885,"teacher_disagreement_score":0.33633396,"about_ca_system_score_codex":0.000322584,"about_ca_system_score_gemma":0.00039123563,"threshold_uncertainty_score":0.5714287},"labels":[],"label_agreement":null},{"id":"W2126428803","doi":"10.1007/s10114-005-0815-y","title":"Penalty Algorithms in Hilbert Spaces","year":2006,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Hilbert space; Convergence (economics); Mathematics; Algorithm; Nonlinear system; Modes of convergence (annotated index); Applied mathematics; Weak convergence; Mathematical optimization; Computer science; Mathematical analysis; Discrete mathematics","score_opus":0.031028192481361475,"score_gpt":0.3227050366139593,"score_spread":0.2916768441325978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126428803","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25919166,0.0010323436,0.064632125,0.023865545,0.0022424445,0.007930222,0.00027436545,0.0049745683,0.6358567],"genre_scores_gemma":[0.2450636,0.00017380776,0.7353441,0.00011835417,0.00064577634,0.0003129486,0.00005832095,0.00023462268,0.018048462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967059,0.00016901779,0.0010381127,0.00056096143,0.00077291945,0.0007531116],"domain_scores_gemma":[0.9965234,0.0016915412,0.00030239162,0.0009217854,0.0004174079,0.00014347697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086141017,0.000404208,0.00072342926,0.00029456016,0.0001615946,0.00023985017,0.0006071073,0.00021075811,0.00080380455],"category_scores_gemma":[0.004643119,0.00036710632,0.00014020143,0.0007932773,0.00032083874,0.0011577498,0.00026781406,0.00045394158,0.000060433256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030286264,0.0041675675,0.0012515837,0.001890879,0.00021471962,0.00026852134,0.013073006,0.00072810025,0.0007644197,0.89677787,0.07767622,0.0028842387],"study_design_scores_gemma":[0.0026714597,0.00025504603,0.00070712826,0.0004943159,0.00006964689,0.00009157735,0.0049870554,0.008346888,0.0041597043,0.9134188,0.06333952,0.0014588056],"about_ca_topic_score_codex":0.000030377243,"about_ca_topic_score_gemma":0.00013648129,"teacher_disagreement_score":0.670712,"about_ca_system_score_codex":0.00014048863,"about_ca_system_score_gemma":0.00011520676,"threshold_uncertainty_score":0.9998781},"labels":[],"label_agreement":null},{"id":"W2126636640","doi":"","title":"O(m) Bound on Number of Iterations in Sphere Methods for LP","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical proof; Mathematics; Matrix (chemical analysis); Subject (documents); Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Geometry","score_opus":0.26597364242412347,"score_gpt":0.6091308202330554,"score_spread":0.34315717780893196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126636640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02233015,0.00017544988,0.9665691,0.00080264476,0.0002293098,0.002754692,0.00009403332,0.00005563852,0.0069889794],"genre_scores_gemma":[0.036768682,0.00006770313,0.9539785,0.000033064745,0.00025950593,0.0011771793,0.000057762183,0.00006883655,0.007588783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965589,0.00092829525,0.00064586976,0.000344416,0.00067882997,0.00084371114],"domain_scores_gemma":[0.994665,0.0032674356,0.00004087304,0.00063348754,0.0011945755,0.00019858607],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045396565,0.00018106026,0.00033380074,0.00051317055,0.00043695114,0.00010875618,0.0003698446,0.00015887569,0.0010747733],"category_scores_gemma":[0.00464744,0.00017209406,0.00008939821,0.0014884496,0.00021023887,0.0005730483,0.00013574597,0.00058259146,0.00012949848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018555945,0.004258368,0.0016450397,0.00038334352,0.00018435204,0.0000046194555,0.008871954,0.018294467,0.006499687,0.7882805,0.007207853,0.16418427],"study_design_scores_gemma":[0.0041602035,0.00051207776,0.00074838585,0.0002443966,0.000031577503,0.000033015287,0.0042114,0.8518767,0.029118223,0.086979665,0.021243481,0.00084091845],"about_ca_topic_score_codex":0.00007341408,"about_ca_topic_score_gemma":0.00011565959,"teacher_disagreement_score":0.83358216,"about_ca_system_score_codex":0.00029965685,"about_ca_system_score_gemma":0.0003116917,"threshold_uncertainty_score":0.99983835},"labels":[],"label_agreement":null},{"id":"W2127758564","doi":"10.1007/s11590-015-0959-3","title":"On the cardinality of positively linearly independent sets","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Upper and lower bounds; Computational intelligence; Independent set; Discrete mathematics; Computer science; Graph; Artificial intelligence; Data mining","score_opus":0.09613552248103259,"score_gpt":0.35432996337673606,"score_spread":0.2581944408957035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127758564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01995827,0.000008582262,0.96962637,0.0071978755,0.00010254692,0.00044380355,0.000024767698,0.00005978979,0.0025780138],"genre_scores_gemma":[0.38353628,0.000015947151,0.6121388,0.0032457123,0.000109674416,0.0000790562,0.000059129132,0.00009200184,0.00072342285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833417,0.0002541678,0.0002974424,0.00020405109,0.0007180851,0.00019209427],"domain_scores_gemma":[0.99843687,0.00048992876,0.0001881638,0.00036585287,0.0004206368,0.00009857101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069006276,0.00013134906,0.00017985619,0.000104661536,0.00008095398,0.000040051913,0.00023492286,0.000057695852,0.00013629496],"category_scores_gemma":[0.0013362813,0.00009788637,0.00006258032,0.0003536271,0.00010725619,0.00015894655,0.00006927999,0.00018894975,0.000019574722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000545699,0.00007466869,0.00012375422,0.000011273811,0.00003839535,0.000004695797,0.00050214905,0.98246455,0.000092709626,0.009513677,0.0069408757,0.00017865036],"study_design_scores_gemma":[0.0025183922,0.00027777036,0.00038447528,0.000104827624,0.000066303466,0.000019332114,0.0008057949,0.9784907,0.005141804,0.011180935,0.00045943988,0.0005501905],"about_ca_topic_score_codex":0.000012315332,"about_ca_topic_score_gemma":8.873083e-7,"teacher_disagreement_score":0.363578,"about_ca_system_score_codex":0.0001242262,"about_ca_system_score_gemma":0.00006279872,"threshold_uncertainty_score":0.39916903},"labels":[],"label_agreement":null},{"id":"W2128228429","doi":"10.1021/ie0341000","title":"Nonlinear Optimization with Many Degrees of Freedom in Process Engineering","year":2004,"lang":"en","type":"article","venue":"Industrial & Engineering Chemistry Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Honeywell (Canada)","funders":"Carnegie Mellon University","keywords":"Degrees of freedom (physics and chemistry); Robustness (evolution); Nonlinear system; Computer science; Nonlinear programming; Mathematical optimization; Process (computing); Convergence (economics); Interior point method; Point (geometry); Algorithm; Mathematics","score_opus":0.09377246056000574,"score_gpt":0.3684465583282857,"score_spread":0.27467409776828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128228429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.829047,0.00013344931,0.16732281,0.00029817183,0.000139097,0.001773992,0.00005740517,0.00042710075,0.0008009382],"genre_scores_gemma":[0.6636644,0.000050874318,0.33442622,0.0000011037785,0.00089615193,0.00028488156,0.00006441165,0.0002631384,0.00034878348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729466,0.00002516505,0.0005003971,0.00038396372,0.0011172144,0.0006786108],"domain_scores_gemma":[0.9983562,0.00041464248,0.00008367773,0.0004148177,0.0005501407,0.00018046946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008798359,0.00024156598,0.00036248984,0.00035131173,0.00005090713,0.000049943315,0.0004739655,0.00031202642,0.00008412549],"category_scores_gemma":[0.0030434232,0.00023974622,0.000042988424,0.0018261526,0.000104349936,0.00022375472,0.00011670454,0.0013109593,0.0000024443075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073431256,0.00015508967,0.00012277748,0.0003302783,0.00002716296,0.00003702452,0.00013190038,0.982137,0.016731882,0.00017994826,0.000008788661,0.000064684784],"study_design_scores_gemma":[0.0027974513,0.00008312431,0.0000138972855,0.00066154986,0.000006679585,0.000021509422,0.00016341268,0.82348394,0.17239536,0.00005101943,0.000045863624,0.00027619384],"about_ca_topic_score_codex":0.00004073155,"about_ca_topic_score_gemma":0.000002801152,"teacher_disagreement_score":0.16710341,"about_ca_system_score_codex":0.0003914012,"about_ca_system_score_gemma":0.00041036514,"threshold_uncertainty_score":0.9776567},"labels":[],"label_agreement":null},{"id":"W2129200137","doi":"10.5539/mas.v4n10p133","title":"A New Method for Unconstrained Optimization Problem","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematical optimization; Convergence (economics); Optimization problem; Current (fluid); Scale (ratio); Optimization algorithm; Algorithm; Mathematics","score_opus":0.04018548817521325,"score_gpt":0.3930405509756252,"score_spread":0.3528550628004119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129200137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003337059,0.0000016171367,0.98558706,0.00030623787,0.000082162944,0.0011047195,0.0000059600516,0.00016537787,0.012713469],"genre_scores_gemma":[0.0067395363,7.40452e-7,0.9913451,0.000067783105,0.00007293516,0.00015852593,0.0000042430424,0.000030272286,0.0015808836],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819475,0.000010888913,0.0002491363,0.0005104146,0.0005796323,0.00045518042],"domain_scores_gemma":[0.99862635,0.00031310142,0.00011186762,0.0004186967,0.00028983568,0.00024014147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867204,0.00014074842,0.00016837376,0.00019083817,0.00034709525,0.00014172951,0.00056782214,0.00007593727,0.00015620487],"category_scores_gemma":[0.0005675358,0.00012911065,0.000035632354,0.00075832126,0.0002453105,0.0002521226,0.000115910625,0.00021727233,0.0000085930105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034710938,0.00006754001,0.0000023276846,0.000036656726,0.000006659826,4.521026e-7,0.00084167696,0.17882797,0.3390804,0.33766294,0.00045401164,0.14298467],"study_design_scores_gemma":[0.00042035928,0.0000120691275,5.9864465e-7,0.0000025548068,0.000004194668,0.0000035199453,0.000026250584,0.70221597,0.010706162,0.28626817,0.00022658921,0.00011357955],"about_ca_topic_score_codex":0.0000037141835,"about_ca_topic_score_gemma":0.000012720849,"teacher_disagreement_score":0.52338797,"about_ca_system_score_codex":0.000055501227,"about_ca_system_score_gemma":0.000607643,"threshold_uncertainty_score":0.5264979},"labels":[],"label_agreement":null},{"id":"W2129835959","doi":"10.1007/s10589-010-9336-4","title":"A secant method for nonlinear least-squares minimization","year":2010,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secant method; Nonlinear system; Newton's method; Minification; Mathematics; Non-linear least squares; Quasi-Newton method; Mathematical optimization; Nonlinear programming; Gauss; Applied mathematics; Algorithm; Estimation theory","score_opus":0.03627713515898895,"score_gpt":0.4004326502422642,"score_spread":0.36415551508327526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129835959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007612951,0.000019999787,0.9963696,0.0011799692,0.000063405074,0.0014484326,0.00016213793,0.00017828372,0.0005020262],"genre_scores_gemma":[0.0013445084,0.000019277757,0.99581796,0.00022421495,0.00023252181,0.0009571797,0.00081028236,0.00005137267,0.0005426907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864495,0.000046310688,0.00041279432,0.0004090751,0.00027426827,0.00021257943],"domain_scores_gemma":[0.9975022,0.0010541514,0.00019056306,0.00023176908,0.00086337986,0.00015791025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027919683,0.00017706344,0.0001966588,0.00020250253,0.00043801803,0.000107738124,0.00016434351,0.00011782489,0.00018814727],"category_scores_gemma":[0.000405682,0.00018363897,0.000060160586,0.000460153,0.00010070216,0.00021032502,0.000055539356,0.00018117487,0.000007892886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013225889,0.00012666556,0.00002019396,0.0000410795,0.000017902423,1.2084847e-7,0.00008784332,0.7847134,0.000063265354,0.20211652,0.00064413174,0.0121556735],"study_design_scores_gemma":[0.0006898961,0.000024471998,0.00002388478,0.0000058143437,0.000022688606,0.000012974407,0.00007196906,0.9095058,0.0000814714,0.07415765,0.015219003,0.00018441063],"about_ca_topic_score_codex":0.0000019181969,"about_ca_topic_score_gemma":0.000007057629,"teacher_disagreement_score":0.12795888,"about_ca_system_score_codex":0.000025814832,"about_ca_system_score_gemma":0.0001246737,"threshold_uncertainty_score":0.748858},"labels":[],"label_agreement":null},{"id":"W2130895332","doi":"10.1007/s10107-008-0258-1","title":"A retrospective trust-region method for unconstrained optimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Trust region; Mathematics; Convergence (economics); Current (fluid); Mathematical optimization; Function (biology); Order (exchange); Numerical analysis; Applied mathematics; Value (mathematics); RADIUS; Computer science; Statistics; Mathematical analysis","score_opus":0.09041040462034387,"score_gpt":0.39166233116929994,"score_spread":0.30125192654895605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130895332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002593013,0.00001424543,0.9948793,0.0003301182,0.000047147605,0.0020174414,0.0000053803224,0.00042588898,0.0020211574],"genre_scores_gemma":[0.0069897617,0.0000062214813,0.9907253,0.000037670052,0.00011246828,0.00062106526,0.000016342456,0.00008819031,0.0014030114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779165,0.00010606083,0.000581225,0.00045300514,0.0005018901,0.0005661898],"domain_scores_gemma":[0.9978603,0.00089980074,0.00020549436,0.00038928565,0.0004587467,0.00018634771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006946327,0.000261023,0.0004895896,0.00016409013,0.00038862237,0.000059572445,0.00022809679,0.00016269404,0.00014886416],"category_scores_gemma":[0.0047144615,0.00023267261,0.0001902007,0.00052416406,0.00021220002,0.00022740765,0.00007457566,0.00023513302,0.000016546603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028966856,0.0021289438,0.00038737315,0.0015227682,0.00035748087,0.0001370973,0.0054455805,0.027605595,0.000103892206,0.83182865,0.0019429848,0.12824997],"study_design_scores_gemma":[0.0011541332,0.00016856146,0.00000461776,0.000063562824,0.00004270447,0.00022435123,0.00037091834,0.7262796,0.0002812436,0.270522,0.0005847208,0.00030357065],"about_ca_topic_score_codex":0.0000018880752,"about_ca_topic_score_gemma":0.0000013049226,"teacher_disagreement_score":0.698674,"about_ca_system_score_codex":0.00022280637,"about_ca_system_score_gemma":0.00007993283,"threshold_uncertainty_score":0.9488114},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06043185546229511,"score_gpt":0.4208278119046966,"score_spread":0.36039595644240147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131570268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022104217,0.0001580931,0.9956643,0.0000697243,0.00018733855,0.0011183484,0.000014273366,0.00019863831,0.0003788886],"genre_scores_gemma":[0.0011547831,0.00005690417,0.99800044,0.000079806094,0.00004352875,0.000105838604,0.000033548393,0.00010383791,0.00042130245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964453,0.0007253576,0.0010910648,0.00045287266,0.0006858975,0.000599502],"domain_scores_gemma":[0.995392,0.0026308731,0.0006029648,0.0006652965,0.00058350794,0.00012534515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033342561,0.0002896701,0.00044508654,0.00035908958,0.000209921,0.00005204214,0.00045792767,0.00025890503,0.00020422832],"category_scores_gemma":[0.007005816,0.00024319855,0.00015894855,0.0021479507,0.00015729495,0.00031458566,0.0002463714,0.0004671688,0.0000021399158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011249652,0.00088806095,0.04337154,0.00040100963,0.0000619855,0.000037638554,0.0028975466,0.2904308,0.00068181363,0.0054453993,0.0000909386,0.65558076],"study_design_scores_gemma":[0.007975701,0.00043627838,0.009022817,0.0020067682,0.0005318376,0.00014985529,0.0044387737,0.8573525,0.07819389,0.029159006,0.00766582,0.0030667342],"about_ca_topic_score_codex":0.000023989443,"about_ca_topic_score_gemma":0.00003058839,"teacher_disagreement_score":0.65251404,"about_ca_system_score_codex":0.0002071542,"about_ca_system_score_gemma":0.0001170175,"threshold_uncertainty_score":0.9917349},"labels":[],"label_agreement":null},{"id":"W2132896555","doi":"10.1007/978-3-642-30850-5_8","title":"Compact Relaxations for Polynomial Programming Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Linearization; Relaxation (psychology); Extension (predicate logic); Mathematical optimization; Computer science; Quadratic programming; Constraint programming; Integer programming; Constraint (computer-aided design); Polynomial; Regular polygon; Constraint satisfaction; Linear programming; Class (philosophy); Linear inequality; Quadratic equation; Convex optimization; Mathematics; Stochastic programming; Inequality; Nonlinear system; Programming language; Artificial intelligence","score_opus":0.06770075026149787,"score_gpt":0.34969639258899227,"score_spread":0.2819956423274944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132896555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062269314,0.00021666192,0.99580693,0.00041286624,0.0005136362,0.0016910221,0.000019421239,0.00013028526,0.0012029696],"genre_scores_gemma":[0.003600881,0.000022099677,0.9938355,0.00009764468,0.0007178791,0.00004950072,0.000022725686,0.000082526385,0.0015712561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974082,0.000019934458,0.00047704548,0.0006631651,0.0007089127,0.0007227093],"domain_scores_gemma":[0.99723315,0.0012477136,0.00033000982,0.0006149035,0.0003913788,0.00018286044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007417373,0.00035186336,0.00042355215,0.00056407583,0.00032031804,0.00019888878,0.00080128195,0.0002640297,0.000058314872],"category_scores_gemma":[0.0006378214,0.00031883002,0.00011965766,0.00033322859,0.00055295613,0.00033531192,0.00023830541,0.0006215578,0.000017815642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016444661,0.00010540421,0.00003756496,0.00024701247,0.000027052994,0.000004175573,0.0011453277,0.08987256,0.000049428447,0.017984672,0.00020830426,0.89030206],"study_design_scores_gemma":[0.0009086241,0.00027770235,0.000014115863,0.00064738456,0.00003810237,0.000048252863,7.711235e-7,0.5408062,0.0006124621,0.41969568,0.035904214,0.0010465293],"about_ca_topic_score_codex":0.000005341906,"about_ca_topic_score_gemma":0.000038970436,"teacher_disagreement_score":0.8892555,"about_ca_system_score_codex":0.00041159044,"about_ca_system_score_gemma":0.00036465217,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W2133898219","doi":"10.1007/s10589-007-9124-y","title":"The piecewise linear-quadratic model for computational convex analysis","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Piecewise; Quadratic equation; Piecewise linear function; Regular polygon; Convex optimization; Convex analysis; Class (philosophy); Mathematical optimization; Convex combination; Applied mathematics; Proper convex function; Convergence (economics); Convex function; Algorithm; Computer science; Mathematical analysis","score_opus":0.05266449761261748,"score_gpt":0.39673410809380244,"score_spread":0.34406961048118495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133898219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006488705,0.000106327316,0.9968308,0.0011551981,0.000021249267,0.001269709,0.00008130824,0.00012231803,0.00034816095],"genre_scores_gemma":[0.03268479,0.000052445306,0.9646841,0.00027629742,0.00007672631,0.00047985013,0.00070652436,0.00003621958,0.0010030209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825346,0.00003829175,0.00061912613,0.0003667377,0.00043104848,0.00029132154],"domain_scores_gemma":[0.9950738,0.0031695215,0.00025548565,0.00023625491,0.0010962685,0.00016867109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396338,0.00017983202,0.00023122647,0.00026931503,0.0011078266,0.00012401417,0.00021136428,0.00008102654,0.000024891857],"category_scores_gemma":[0.00022975376,0.00015614864,0.000117315205,0.001159516,0.00022442982,0.00016419607,0.000058429083,0.00012578693,0.0000059065314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016344946,0.00006414932,0.000034485776,0.000011502828,0.00010892552,1.0245928e-7,0.00007188494,0.7610538,5.181347e-7,0.23575787,0.00023101186,0.0026493876],"study_design_scores_gemma":[0.00047902035,0.000011744913,0.000063373955,0.0000027374656,0.000107555636,0.0000023469333,0.00007926541,0.81861943,0.0000029315984,0.1796981,0.00079100253,0.00014249384],"about_ca_topic_score_codex":8.3384947e-7,"about_ca_topic_score_gemma":0.00000966858,"teacher_disagreement_score":0.05756561,"about_ca_system_score_codex":0.000070871065,"about_ca_system_score_gemma":0.00013366545,"threshold_uncertainty_score":0.85206187},"labels":[],"label_agreement":null},{"id":"W2137267864","doi":"10.1007/s10107-014-0775-z","title":"On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Integer (computer science); Quadrilateral; Combinatorics; Intersection (aeronautics); Type (biology); Hull; Closure (psychology); Integer programming; Triangle inequality; Discrete mathematics; Mathematical optimization","score_opus":0.04689228043785602,"score_gpt":0.31881724676128953,"score_spread":0.2719249663234335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137267864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25714737,0.0000091737675,0.73900557,0.00006368558,0.00003899832,0.0008562192,0.0000064762653,0.00004377705,0.002828705],"genre_scores_gemma":[0.7576433,0.0000016717505,0.24223563,0.0000031357827,0.000007759379,0.000047476515,0.000005891295,0.000024193858,0.000030969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767315,0.00031052023,0.00095799315,0.00024044189,0.0005337254,0.00028416974],"domain_scores_gemma":[0.9942085,0.004611923,0.0005065938,0.00038072866,0.00023884364,0.000053398802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012201504,0.00019113686,0.0005624461,0.00019155293,0.000041566134,0.000019569006,0.00024177584,0.00012165495,0.00011675634],"category_scores_gemma":[0.00669939,0.00013310771,0.00012429255,0.00050475786,0.00074661063,0.00012674496,0.0001071918,0.00038332085,0.0000042616043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013542788,0.0021352929,0.0007835206,0.0010654645,0.00020459098,0.0000023669402,0.011463505,0.0004907723,0.00083400134,0.71157247,0.000017815682,0.27129477],"study_design_scores_gemma":[0.00094793685,0.00052884384,0.0001042673,0.0025047471,0.000054347267,0.0000020161872,0.012974805,0.12187008,0.0130224805,0.84773934,0.00002790718,0.00022321884],"about_ca_topic_score_codex":0.000033533917,"about_ca_topic_score_gemma":0.000027027321,"teacher_disagreement_score":0.5004959,"about_ca_system_score_codex":0.00006682046,"about_ca_system_score_gemma":0.000033523862,"threshold_uncertainty_score":0.80202794},"labels":[],"label_agreement":null},{"id":"W2138009368","doi":"10.5539/jmr.v4n1p116","title":"Modified Simplex Splitting Algorithm for Finding Feasible Solution of Systems of Linear Inequalities","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simplex algorithm; Simplex; Vertex (graph theory); Algorithm; Mathematical optimization; Linear programming; Work (physics); Graph; Combinatorics","score_opus":0.44004034754890253,"score_gpt":0.5106836536696572,"score_spread":0.07064330612075465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138009368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05191312,0.0005457903,0.94593036,0.000057710487,0.00018011757,0.00084231875,0.000057201778,0.000013797589,0.0004595803],"genre_scores_gemma":[0.21057294,0.00012127701,0.7879509,0.0000014770322,0.00041320658,0.000029581552,0.0000041738517,0.000066082655,0.0008404095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945474,0.0004182043,0.001975776,0.00012912096,0.0021755793,0.0007538699],"domain_scores_gemma":[0.98775643,0.0063498537,0.0015051457,0.0003925605,0.0037734641,0.00022252677],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.014802801,0.00017768766,0.000840328,0.0009868456,0.00019640285,0.00004100663,0.00052474544,0.00016754135,0.000038335504],"category_scores_gemma":[0.008793012,0.000148709,0.00023349308,0.00065914146,0.00020261313,0.00048755424,0.00019866387,0.00055997196,0.000003031675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006975552,0.011461275,0.0008279445,0.0569307,0.0023150148,0.000028013175,0.059266377,0.04561485,0.0465535,0.711998,0.009427862,0.054878943],"study_design_scores_gemma":[0.002020801,0.00060378487,0.000013357797,0.0014962269,0.000074201926,0.00009824822,0.017667193,0.8930913,0.02607276,0.058289602,0.00031513866,0.00025737952],"about_ca_topic_score_codex":0.000015254871,"about_ca_topic_score_gemma":7.791493e-7,"teacher_disagreement_score":0.8474765,"about_ca_system_score_codex":0.00023799982,"about_ca_system_score_gemma":0.00028470583,"threshold_uncertainty_score":0.99955636},"labels":[],"label_agreement":null},{"id":"W2141538908","doi":"10.1109/tip.2005.864173","title":"On global and local convergence of half-quadratic algorithms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Rate of convergence; Iterated function; Convergence (economics); Quadratic equation; Algorithm; Compact convergence; Mathematics; Convergence tests; Computer science; Mathematical optimization; Applied mathematics; Mathematical analysis; Channel (broadcasting); Geometry","score_opus":0.02327523305287105,"score_gpt":0.33508939413970174,"score_spread":0.3118141610868307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141538908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035970563,0.00006885884,0.9947889,0.00012760177,0.000076516444,0.00021817473,0.000027144304,0.000100160156,0.0009955815],"genre_scores_gemma":[0.74053437,0.000016325304,0.25895116,0.000029158004,0.00001863756,0.000025628728,0.0000014365567,0.00002618234,0.0003970838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861205,0.00004896479,0.00035894153,0.00029879788,0.000422511,0.00025871582],"domain_scores_gemma":[0.9991822,0.00019190222,0.00012061173,0.00019108664,0.00023742717,0.00007673596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014550686,0.0001800857,0.00022864861,0.00011328774,0.0002138016,0.000056902412,0.00011806785,0.000077454744,0.00010750155],"category_scores_gemma":[0.00003108104,0.00017329468,0.00005068525,0.0004568399,0.00032163647,0.00032505428,0.0000018973537,0.00021041831,0.000015119988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005145038,0.0033877443,0.000038990747,0.0025208723,0.000119888085,0.00010027508,0.00082305295,0.15642731,0.009612696,0.008762577,0.0004216776,0.8172704],"study_design_scores_gemma":[0.0016386126,0.00028821515,0.00005250537,0.00039553002,0.000073095565,0.00006410514,0.00039217446,0.82139087,0.10026335,0.0749449,0.000032397562,0.0004642245],"about_ca_topic_score_codex":0.000037691658,"about_ca_topic_score_gemma":0.000023272263,"teacher_disagreement_score":0.8168062,"about_ca_system_score_codex":0.00010752835,"about_ca_system_score_gemma":0.00009142011,"threshold_uncertainty_score":0.70667523},"labels":[],"label_agreement":null},{"id":"W2142435614","doi":"10.1017/s0004972711002334","title":"THE GENERALIZED SYLVESTER MATRIX EQUATION, RANK MINIMIZATION AND ROTH’S EQUIVALENCE THEOREM","year":2011,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Sylvester equation; Sylvester matrix; Equivalence (formal languages); Sylvester's law of inertia; Rank (graph theory); Pure mathematics; Applied mathematics; Combinatorics; Algebra over a field; Mathematical analysis; Symmetric matrix; Eigenvalues and eigenvectors; Matrix polynomial","score_opus":0.09082908140697524,"score_gpt":0.3383889755654172,"score_spread":0.24755989415844196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142435614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057444505,0.0003453471,0.8825049,0.042303283,0.00046643277,0.0059589823,0.000073607785,0.00042928942,0.010473656],"genre_scores_gemma":[0.062061246,0.00026775524,0.8852787,0.0002873938,0.00011139866,0.00015916786,0.0000040452037,0.00010329381,0.051726975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977189,0.0002931964,0.0006803611,0.00027784807,0.0006238966,0.00040582474],"domain_scores_gemma":[0.9974425,0.0011167971,0.0003645873,0.00071560475,0.0002460402,0.000114478775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012556505,0.00022950013,0.0003092275,0.000017570303,0.00040795197,0.00007290054,0.0006637956,0.00015471756,0.0016904115],"category_scores_gemma":[0.0013092182,0.00013009268,0.00025840793,0.00021925298,0.0008316134,0.000059939655,0.00030181932,0.00025239855,0.000051860057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009145013,0.00034023664,0.000243266,0.0007266254,0.00023067034,0.0000010623908,0.0068001105,0.00016178013,0.00041037626,0.93910575,0.05103274,0.0008559096],"study_design_scores_gemma":[0.0013701508,0.000072490344,0.00043140934,0.00024560431,0.000152965,0.000026945017,0.0017567053,0.01156576,0.0059956224,0.9707097,0.0072782296,0.0003944235],"about_ca_topic_score_codex":0.000008266658,"about_ca_topic_score_gemma":4.8254566e-7,"teacher_disagreement_score":0.04375451,"about_ca_system_score_codex":0.000048950824,"about_ca_system_score_gemma":0.000036268742,"threshold_uncertainty_score":0.99922216},"labels":[],"label_agreement":null},{"id":"W2142847239","doi":"10.1007/s10288-005-0065-y","title":"Sensitivity of trust-region algorithms to their parameters","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Sensitivity (control systems); Trust region; Context (archaeology); Algorithm; Computer science; Basis (linear algebra); Mathematics; Engineering; Computer security","score_opus":0.07648040350217998,"score_gpt":0.3576830103733677,"score_spread":0.2812026068711877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142847239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10081301,0.000019106084,0.89619356,0.001336181,0.00006168592,0.00045107177,0.000020363244,0.00009944393,0.0010055883],"genre_scores_gemma":[0.21182488,0.000016457576,0.7857874,0.00020960554,0.000095998796,0.00002364089,0.0000040136965,0.00003772266,0.002000285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897003,0.00010326486,0.00022766841,0.00020003147,0.0002540614,0.00024492186],"domain_scores_gemma":[0.99883586,0.00046058642,0.00007677323,0.00034980063,0.0001592377,0.00011773111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237124,0.00011780496,0.00021823119,0.000118030184,0.00004459876,0.000012532883,0.000106959495,0.00005830286,0.000054174827],"category_scores_gemma":[0.0007195105,0.00010120111,0.00006670739,0.0002787277,0.00005546161,0.00011872539,0.00007407666,0.00011231708,0.00005817181],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014654039,0.0006976979,0.00037636078,0.00014600644,0.000119905126,0.0000442213,0.004543606,0.04252972,0.0045861243,0.006447425,0.0072195814,0.9331428],"study_design_scores_gemma":[0.0019740455,0.00035602917,0.00079015095,0.00015358752,0.00004088809,0.00010427896,0.0014571884,0.7511777,0.20057909,0.01904519,0.02346187,0.0008599488],"about_ca_topic_score_codex":0.000012229638,"about_ca_topic_score_gemma":0.000015565607,"teacher_disagreement_score":0.93228287,"about_ca_system_score_codex":0.00007119999,"about_ca_system_score_gemma":0.000028591574,"threshold_uncertainty_score":0.41268617},"labels":[],"label_agreement":null},{"id":"W2143375247","doi":"10.1109/tpwrs.2003.811006","title":"Medium-term hydrothermal coordination by semidefinite programming","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Power Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Arizona State University","keywords":"Semidefinite programming; Mathematical optimization; Relaxation (psychology); Mathematics; Integer programming; Integer (computer science); Convex optimization; Lagrangian relaxation; Polynomial; Regular polygon; Computer science","score_opus":0.03044916406546083,"score_gpt":0.3128030320301395,"score_spread":0.28235386796467865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143375247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014357147,0.00011690928,0.9926364,0.00008555997,0.0010140288,0.00097488426,0.00004796591,0.00030181857,0.003386751],"genre_scores_gemma":[0.9758068,0.000020192576,0.012075117,0.00003279073,0.0000121519115,0.00044077064,0.000006992606,0.00010281376,0.011502423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.997779,0.00027184215,0.0004923143,0.00037061435,0.00064904796,0.00043717978],"domain_scores_gemma":[0.99868065,0.00036431852,0.00015298354,0.00042592137,0.00020405043,0.0001720697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330958,0.00025010042,0.0002902586,0.00023593122,0.0002665183,0.00011623484,0.00017735136,0.00016816605,0.0003307718],"category_scores_gemma":[0.0000639652,0.00024400507,0.00010508571,0.0004883085,0.00007279907,0.00028904388,8.780809e-7,0.00035110157,0.00013696279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001264677,0.024700653,0.0005940435,0.005955598,0.004977099,0.0005284984,0.030738097,0.531109,0.08024996,0.14645725,0.10095949,0.07246564],"study_design_scores_gemma":[0.020987837,0.0033311313,0.000034998797,0.0023358439,0.00060322694,0.001263522,0.008307425,0.1991161,0.3498035,0.0052742218,0.401662,0.007280198],"about_ca_topic_score_codex":0.000012198499,"about_ca_topic_score_gemma":0.0000058767746,"teacher_disagreement_score":0.98056126,"about_ca_system_score_codex":0.00020561511,"about_ca_system_score_gemma":0.00006922481,"threshold_uncertainty_score":0.99502385},"labels":[],"label_agreement":null},{"id":"W2143904249","doi":"10.1007/s10107-004-0545-4","title":"?Cone-free? primal-dual path-following and potential-reduction polynomial time interior-point methods","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Mathematics; Conic section; Logarithm; Mathematical optimization; Path (computing); Convex optimization; Dual (grammatical number); Applied mathematics; Regular polygon; Mathematical analysis; Geometry; Computer science","score_opus":0.03074848561589642,"score_gpt":0.3701164102202075,"score_spread":0.3393679246043111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143904249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03893228,0.00009560818,0.95765555,0.0008500672,0.00017118208,0.0011031991,0.000004088628,0.00045151002,0.0007365403],"genre_scores_gemma":[0.034509107,0.000006438292,0.96454626,0.000023905128,0.00014434742,0.000121761565,0.000008258434,0.000100865036,0.0005390522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971915,0.00020119817,0.0007711053,0.0005536464,0.00058674155,0.0006958403],"domain_scores_gemma":[0.9985,0.00027966595,0.0001987405,0.0005961875,0.00012494515,0.00030047158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015815392,0.0003540836,0.00059524045,0.00019069419,0.00028710844,0.0002845804,0.00029383265,0.00019679045,0.00022358401],"category_scores_gemma":[0.0025797933,0.0003211951,0.00021649693,0.00034489442,0.0002540074,0.00046756625,0.0004923029,0.00043905582,0.00009361774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034912705,0.0026914913,0.00001873968,0.0025157067,0.0010420299,0.00055761315,0.014798377,0.0011182829,0.1275692,0.107235834,0.0007537289,0.7413499],"study_design_scores_gemma":[0.006249285,0.00068778254,0.000012111265,0.0009388415,0.0004057144,0.001340383,0.0029851194,0.04548426,0.028880863,0.9106055,0.0009726247,0.0014375478],"about_ca_topic_score_codex":0.000004712043,"about_ca_topic_score_gemma":3.337637e-7,"teacher_disagreement_score":0.80336964,"about_ca_system_score_codex":0.00023352998,"about_ca_system_score_gemma":0.00007722283,"threshold_uncertainty_score":0.999924},"labels":[],"label_agreement":null},{"id":"W2145896656","doi":"10.1007/s10589-013-9547-6","title":"A derivative-free approximate gradient sampling algorithm for finite minimax problems","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Line search; Minimax; Proximal Gradient Methods; Gradient descent; Gradient method; Stationary point; Directional derivative; Subderivative; Function (biology); Simplex; Descent direction; Mathematical optimization; Applied mathematics; Convergence (economics); Algorithm; Mathematical analysis; Convex function; Combinatorics; Convex optimization; Regular polygon; Geometry; RADIUS; Computer science","score_opus":0.06588151631744103,"score_gpt":0.3432997407118499,"score_spread":0.27741822439440883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145896656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003297755,0.00007112358,0.9949391,0.0009620431,0.000025542895,0.0032471574,0.00013926119,0.00019336506,0.0003894177],"genre_scores_gemma":[0.00064205,0.00005398237,0.99279463,0.00019636763,0.00009200583,0.005120901,0.0005945203,0.00005505732,0.00045046158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.00003973916,0.0004927842,0.00044654313,0.00029383524,0.0002954634],"domain_scores_gemma":[0.997183,0.001181594,0.00022773116,0.00029744304,0.0009383827,0.0001718071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018385937,0.00021266978,0.00022753836,0.0002008246,0.00048803425,0.0001783803,0.00024762333,0.00008095853,0.00015111548],"category_scores_gemma":[0.0003012079,0.00021590192,0.00006159822,0.0005055596,0.00013769757,0.0003329583,0.0001257211,0.00011331262,0.000015595535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022723968,0.00014693102,0.0000128070205,0.00006767759,0.000030544732,5.8724602e-8,0.00015013601,0.9034006,0.000007811922,0.06301945,0.000673446,0.032488275],"study_design_scores_gemma":[0.0007338643,0.000027680855,0.000030213416,0.000016180378,0.000013079927,0.000004065199,0.00008892521,0.74462736,0.000011781856,0.25252968,0.0017385648,0.00017857771],"about_ca_topic_score_codex":0.000003103951,"about_ca_topic_score_gemma":6.5875514e-7,"teacher_disagreement_score":0.18951024,"about_ca_system_score_codex":0.000064034444,"about_ca_system_score_gemma":0.00006504853,"threshold_uncertainty_score":0.8804225},"labels":[],"label_agreement":null},{"id":"W2150116987","doi":"10.1017/s0962492904000248","title":"Numerical methods for large-scale nonlinear optimization","year":2005,"lang":"en","type":"article","venue":"Acta Numerica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":148,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Differentiable function; Mathematical optimization; Nonlinear system; Constrained optimization; Nonlinear programming; Optimization problem; Software; Scale (ratio); Algorithm; Mathematics; Physics","score_opus":0.04505452329796039,"score_gpt":0.4372005856818338,"score_spread":0.3921460623838734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150116987","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002795057,0.000053979944,0.99457264,0.0021209822,0.000097899225,0.000617085,0.000026480591,0.00024136815,0.0022416115],"genre_scores_gemma":[0.00075234676,0.00006106674,0.9959157,0.00039805364,0.00032773722,0.00016818724,0.000065200504,0.00009593338,0.0022157677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822927,0.00014974822,0.0004140413,0.00039541055,0.00026981116,0.00054169935],"domain_scores_gemma":[0.9979228,0.00096687226,0.00016694443,0.00046567648,0.0002964532,0.00018127672],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005501451,0.00020161811,0.00034180566,0.000117767784,0.00020887169,0.00005066483,0.00031271257,0.000118857686,0.00091770757],"category_scores_gemma":[0.0015317688,0.00019706438,0.0001306174,0.0005215316,0.00003868403,0.0003259585,0.00008290813,0.00020170456,0.00004529826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036140578,0.0026565017,0.000092564755,0.00022575242,0.00024984818,0.0000036084332,0.0025719004,0.49317536,0.0010345263,0.0051686326,0.035162706,0.45929718],"study_design_scores_gemma":[0.0006082638,0.000056845165,0.0000030826443,0.0000061626806,0.000017495306,0.0000052925734,0.000077275676,0.79580384,0.0010828533,0.0014136853,0.20073132,0.00019387528],"about_ca_topic_score_codex":0.0000015850644,"about_ca_topic_score_gemma":7.199594e-7,"teacher_disagreement_score":0.45910332,"about_ca_system_score_codex":0.00012902504,"about_ca_system_score_gemma":0.00006717029,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W2151460223","doi":"10.1287/ijoc.1090.0321","title":"Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; National Science Foundation","keywords":"Convexity; Solver; Mathematical optimization; Computer science; Tree (set theory); Nonlinear programming; Optimization problem; Constraint satisfaction problem; Mathematics; Nonlinear system; Artificial intelligence; Combinatorics","score_opus":0.052302519371251174,"score_gpt":0.39954861114794427,"score_spread":0.3472460917766931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151460223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22789426,0.000010528686,0.77046704,0.00036780446,0.0001522673,0.00041416503,0.0000043194827,0.00004786729,0.00064174965],"genre_scores_gemma":[0.81406224,0.000010398049,0.18548965,0.00032277105,0.00007946582,0.000003361469,0.0000048804836,0.000011453146,0.00001577461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982386,0.00007036859,0.00067943643,0.00018663182,0.0004746458,0.00035026594],"domain_scores_gemma":[0.9979003,0.001047634,0.00039895685,0.0001068238,0.00038681502,0.00015945916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014415126,0.00017780777,0.00031175945,0.0003224159,0.00038606854,0.00016449855,0.00013799481,0.00010065622,0.000012276892],"category_scores_gemma":[0.0005678706,0.00015531277,0.00008514396,0.00026281842,0.00007605212,0.0003926905,0.00004019085,0.0006786549,0.0000015430936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032295185,0.0004112037,0.003211818,0.0001072352,0.00007177668,0.000032734646,0.00082628743,0.11775224,0.000118039796,0.060168758,0.00015214653,0.8168248],"study_design_scores_gemma":[0.0025671073,0.0004574717,0.027004493,0.00008305001,0.0000062139434,0.00011090871,0.00014311839,0.70418847,0.00017100574,0.2649834,0.000109634944,0.00017516756],"about_ca_topic_score_codex":0.0000022546737,"about_ca_topic_score_gemma":0.000008769184,"teacher_disagreement_score":0.8166496,"about_ca_system_score_codex":0.00027601485,"about_ca_system_score_gemma":0.0001154926,"threshold_uncertainty_score":0.63334703},"labels":[],"label_agreement":null},{"id":"W2152362622","doi":"10.13140/rg.2.2.14344.01289","title":"Symbolic Convex Analysis","year":2005,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Convex analysis; Proper convex function; Conic optimization; Convex optimization; Mathematical optimization; Regular polygon; Computer science; Ellipsoid method; Dimension (graph theory); Optimization problem; Theoretical computer science; Visualization; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.02342506958919623,"score_gpt":0.2974570233452823,"score_spread":0.2740319537560861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152362622","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19702679,0.00085359113,0.0686384,0.0005096632,0.0013969201,0.0031787362,0.00081349834,0.001984683,0.72559774],"genre_scores_gemma":[0.0693045,0.0012816325,0.034010053,0.00009365723,0.00034005495,0.000008828818,0.0052331686,0.0002663701,0.88946176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975798,0.0001495808,0.0003563678,0.00069284905,0.00071383326,0.00050758384],"domain_scores_gemma":[0.99776065,0.00028657092,0.00036062236,0.0007683632,0.0005563977,0.0002673773],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015241488,0.0004388648,0.00080136285,0.00253068,0.00025337967,0.00006348564,0.00077614246,0.0005559125,0.0030063195],"category_scores_gemma":[0.00016562248,0.0005273056,0.0004876812,0.0038394334,0.00007447546,0.0003290197,0.00008466096,0.00068752584,0.00025980535],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032057285,0.004560202,0.20247704,0.0033673737,0.040419813,0.0038511625,0.0020611123,0.04013616,0.000026868993,0.2536793,0.36172855,0.084486686],"study_design_scores_gemma":[0.005189492,0.000194096,0.0012644172,0.0003379412,0.011462944,2.479058e-8,0.14767118,0.024878602,0.0028068845,0.008795579,0.79322654,0.0041723195],"about_ca_topic_score_codex":0.00004730144,"about_ca_topic_score_gemma":0.071606465,"teacher_disagreement_score":0.43149796,"about_ca_system_score_codex":0.00042488196,"about_ca_system_score_gemma":0.0002336264,"threshold_uncertainty_score":0.99971783},"labels":[],"label_agreement":null},{"id":"W2153170581","doi":"10.4153/cjm-2009-010-4","title":"Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Degree (music); Set (abstract data type); Polynomial; Point (geometry); Explained sum of squares; Section (typography); Discrete mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Statistics; Computer science; Geometry","score_opus":0.0592822340303602,"score_gpt":0.36392876643305666,"score_spread":0.30464653240269646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153170581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004620082,0.00006610147,0.9909447,0.0009361618,0.000036240675,0.00053289725,0.00003336461,0.000007710497,0.002822764],"genre_scores_gemma":[0.072077446,0.000034068213,0.9273343,0.000084274885,0.00008893224,0.00001197615,0.0000027265503,0.000023952962,0.00034230045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864715,0.00003708755,0.0007016344,0.00011868443,0.00027189427,0.0002235327],"domain_scores_gemma":[0.9974494,0.000420371,0.00047651658,0.0002843737,0.000818468,0.00055087416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331172,0.00012527946,0.00033047245,0.0005560288,0.00014933443,0.000059979957,0.0002550563,0.0000691339,0.00007649109],"category_scores_gemma":[0.0017197566,0.00012142519,0.00006090323,0.0005502119,0.00010246752,0.00020768133,0.000015559848,0.00016000179,0.0000035543924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010710492,0.0014526381,0.0011583802,0.001141944,0.0007353922,0.00013927648,0.04473715,0.56319195,0.0026071214,0.26212084,0.028824687,0.09378353],"study_design_scores_gemma":[0.005110906,0.0018786988,0.0036732496,0.0014347531,0.0005968448,0.0010108731,0.01910044,0.21424769,0.011149526,0.7362507,0.003916262,0.0016300436],"about_ca_topic_score_codex":0.000081884675,"about_ca_topic_score_gemma":0.00060674374,"teacher_disagreement_score":0.4741299,"about_ca_system_score_codex":0.0001315945,"about_ca_system_score_gemma":0.0006004793,"threshold_uncertainty_score":0.49515754},"labels":[],"label_agreement":null},{"id":"W2153235257","doi":"10.4086/toc.2009.v005a011","title":"","year":2009,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":198,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematical proof; TRACE (psycholinguistics); Bounded function; Mathematics; Semidefinite programming; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical optimization; Mathematical analysis","score_opus":0.06200837786253834,"score_gpt":0.38890946106747765,"score_spread":0.3269010832049393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153235257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38237062,0.000028867655,0.6161327,0.00015891282,0.000023457445,0.00018038251,6.1216366e-7,0.00015132142,0.00095313287],"genre_scores_gemma":[0.6156945,0.000002514289,0.38409805,0.00008792955,0.000048628397,4.6523368e-7,8.092049e-7,0.000012807197,0.000054263266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977635,0.00041001255,0.00063384144,0.0002552506,0.0004916137,0.0004457709],"domain_scores_gemma":[0.9960346,0.0027336727,0.00033299383,0.00046841332,0.00032146755,0.00010880684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025861175,0.00017405653,0.00040632306,0.00018912401,0.00019110923,0.000019970998,0.00045395782,0.000058300677,0.000023411087],"category_scores_gemma":[0.0023679847,0.00016723524,0.000099064244,0.0004741068,0.00014888866,0.00018585003,0.00010981166,0.00023525947,0.0000014964079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001203119,0.00021197971,0.00007097495,0.00004024189,0.000021923883,0.0000066167613,0.0035294334,0.02830519,0.0025169188,0.81738937,0.000011319162,0.14777575],"study_design_scores_gemma":[0.00076509855,0.00018962706,0.0012705498,0.00009173111,0.000009682896,0.000014782879,0.0008345613,0.0684809,0.01222209,0.9159558,0.0000035603866,0.00016164995],"about_ca_topic_score_codex":5.303733e-7,"about_ca_topic_score_gemma":1.6565184e-7,"teacher_disagreement_score":0.23332389,"about_ca_system_score_codex":0.00003842685,"about_ca_system_score_gemma":0.000035345558,"threshold_uncertainty_score":0.68196553},"labels":[],"label_agreement":null},{"id":"W2153413094","doi":"10.48550/arxiv.1210.3039","title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming","year":2012,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Lipschitz continuity; Nonlinear programming; Mathematical optimization; Convex optimization; Class (philosophy); Sequence (biology); Convergence (economics); Mathematics; Regular polygon; Scheme (mathematics); Computer science; Nonlinear system; Artificial intelligence","score_opus":0.18194296520099315,"score_gpt":0.47746450849377,"score_spread":0.2955215432927768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153413094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029979326,0.00039900444,0.96387696,0.00012365374,0.000836697,0.004325445,0.00009801564,0.00028279604,0.000078098594],"genre_scores_gemma":[0.015631849,0.000032815627,0.9817697,0.000020331881,0.0006463157,0.00092470134,0.00027845174,0.00020478417,0.00049105886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963362,0.0003752443,0.0010989079,0.0007532931,0.0005137335,0.00092261913],"domain_scores_gemma":[0.9957538,0.00089220423,0.0009986178,0.0010574866,0.001040663,0.00025723016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016431167,0.000535475,0.0010678088,0.00027005162,0.0001525579,0.00007875223,0.0007222534,0.00069300295,0.00011917407],"category_scores_gemma":[0.0025943192,0.00051587843,0.00043831283,0.00034127242,0.00028902522,0.00017335839,0.0010223757,0.0010830566,0.0000071671575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052050455,0.0014866935,0.012274709,0.014703234,0.0022408348,0.00001959689,0.0056743026,0.002868065,0.008608022,0.0069110794,0.00023407699,0.9444589],"study_design_scores_gemma":[0.012914107,0.0011718628,0.0015539605,0.002860439,0.003325731,0.00011198498,0.004010225,0.3835431,0.24812026,0.095137514,0.24011326,0.0071375393],"about_ca_topic_score_codex":0.000018250985,"about_ca_topic_score_gemma":0.000010104211,"teacher_disagreement_score":0.93732136,"about_ca_system_score_codex":0.00020594883,"about_ca_system_score_gemma":0.00037008376,"threshold_uncertainty_score":0.9997293},"labels":[],"label_agreement":null},{"id":"W2154558981","doi":"10.1287/moor.1040.0124","title":"A Conic Programming Approach to Generalized Tchebycheff Inequalities","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Conic section; Mathematics; Semidefinite programming; Piecewise; Mathematical optimization; Class (philosophy); Applied mathematics; Mathematical analysis; Computer science","score_opus":0.2856956413919422,"score_gpt":0.4884137580789195,"score_spread":0.2027181166869773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154558981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090981014,0.00014910873,0.8855104,0.0016012696,0.000032394033,0.0033892875,0.000036013666,0.00019071659,0.018109797],"genre_scores_gemma":[0.07811609,0.000033384036,0.91088,0.000031628937,0.00012218842,0.0008871465,0.000023798979,0.00007524947,0.009830497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590504,0.0003691616,0.00093810825,0.00040424647,0.0016476938,0.0007357244],"domain_scores_gemma":[0.9960974,0.00084608403,0.00006181585,0.0009333544,0.001797027,0.00026434904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036493351,0.00022215082,0.0004856216,0.0007701702,0.00041207005,0.00022371681,0.0007169063,0.00012750196,0.00029707837],"category_scores_gemma":[0.0047797463,0.00019988701,0.00010118985,0.0014829208,0.00026617077,0.00032944072,0.00039095237,0.0004868019,0.00012386749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030882373,0.0026222076,0.000009562689,0.0009189011,0.00011550759,0.000001935027,0.021289187,0.0912891,0.0035611435,0.8680344,0.0030886095,0.009038512],"study_design_scores_gemma":[0.0017205034,0.00030414,0.0000060529997,0.00023351693,0.000028194094,0.000031005406,0.010532458,0.91750455,0.022622744,0.03634788,0.010033026,0.00063592265],"about_ca_topic_score_codex":0.000038115082,"about_ca_topic_score_gemma":0.00006369074,"teacher_disagreement_score":0.83168656,"about_ca_system_score_codex":0.00023953685,"about_ca_system_score_gemma":0.00029710605,"threshold_uncertainty_score":0.81511563},"labels":[],"label_agreement":null},{"id":"W2157555448","doi":"10.1287/moor.1090.0419","title":"A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Quadratic assignment problem; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Dimension (graph theory); Quadratic equation; Positive-definite matrix; Majorization; Upper and lower bounds; Optimization problem; Combinatorics; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.15589598525044532,"score_gpt":0.4509045053540539,"score_spread":0.29500852010360856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157555448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008561924,0.00013961339,0.9781038,0.0058729206,0.000049979146,0.004725069,0.00004854678,0.000080872516,0.0024172692],"genre_scores_gemma":[0.13243018,0.00005969416,0.86103487,0.00006192194,0.00008345745,0.00085800537,0.00003829605,0.000051165272,0.005382388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965124,0.00022891835,0.00084886217,0.0003096245,0.0015987142,0.0005014542],"domain_scores_gemma":[0.9924354,0.0046163695,0.00011935349,0.00078983844,0.0019311421,0.00010790399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033467,0.00018489802,0.00031455344,0.0003453297,0.00084634806,0.0001632348,0.0005273325,0.00011096188,0.00020437397],"category_scores_gemma":[0.0053491797,0.00012872166,0.00011599488,0.0008595352,0.00022827825,0.00026674903,0.000111699206,0.0004197195,0.000043194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058324225,0.0018582384,0.0000033719757,0.0004841113,0.00010562029,0.0000022743882,0.0035173092,0.18618315,0.011568181,0.78273225,0.0076153316,0.005871815],"study_design_scores_gemma":[0.00070440094,0.0003715957,0.000014910357,0.00019816664,0.000025059291,0.000008640113,0.0008641835,0.7040795,0.009099464,0.28421482,0.00025328554,0.00016597158],"about_ca_topic_score_codex":0.000007478956,"about_ca_topic_score_gemma":0.000024046292,"teacher_disagreement_score":0.51789635,"about_ca_system_score_codex":0.00017549424,"about_ca_system_score_gemma":0.00032561927,"threshold_uncertainty_score":0.6509511},"labels":[],"label_agreement":null},{"id":"W2159287598","doi":"10.1109/ccece.1997.614844","title":"Sequential methods in solving economic power flow problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Linearization; Power flow; Mathematical optimization; Computer science; Point (geometry); Linear programming; Quadratic programming; Sequential quadratic programming; Flow (mathematics); Power (physics); Electric power system; Algorithm; Mathematics; Nonlinear system","score_opus":0.1243421382782495,"score_gpt":0.4293747036377453,"score_spread":0.30503256535949586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159287598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005424529,0.00005176048,0.94137096,0.00026494075,0.00012256243,0.00031621818,0.000002289087,0.00011056117,0.05721825],"genre_scores_gemma":[0.0028641026,0.00003772026,0.98402107,0.000040672585,0.00003184496,0.000032511824,0.0000013434826,0.000033625864,0.012937087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889404,0.00012887437,0.0003202486,0.00023013618,0.0001201042,0.00030661907],"domain_scores_gemma":[0.9992929,0.00029540155,0.000051733743,0.00025563693,0.000035741075,0.00006860078],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005342744,0.00010902873,0.00017915046,0.00016431065,0.00004439963,0.000045188226,0.00016086068,0.000070106675,0.016735094],"category_scores_gemma":[0.00027080916,0.00010282001,0.00004537329,0.00013994209,0.000035096647,0.0002333749,0.00009404103,0.00017799718,0.0002983299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000371115,0.0012344171,0.00086566654,0.00037489904,0.00022327065,0.00008860595,0.009724456,0.5998161,0.0061093913,0.122927696,0.035922475,0.22267592],"study_design_scores_gemma":[0.00045617842,0.000019879013,0.000006602868,0.000012678675,0.0000023204725,0.000007033264,0.00007487762,0.9677879,0.0012987637,0.027835792,0.0023480873,0.00014988825],"about_ca_topic_score_codex":0.00001167579,"about_ca_topic_score_gemma":0.0000456861,"teacher_disagreement_score":0.3679718,"about_ca_system_score_codex":0.00019141048,"about_ca_system_score_gemma":0.000018900459,"threshold_uncertainty_score":0.98416376},"labels":[],"label_agreement":null},{"id":"W2162995463","doi":"10.1016/j.dam.2008.06.021","title":"On the choice of explicit stabilizing terms in column generation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Kronos (Canada)","funders":"","keywords":"Column generation; Mathematical optimization; Mathematics; Term (time); Quadratic equation; Flexibility (engineering); Limit (mathematics); Scheduling (production processes); Column (typography); Crew scheduling; Augmented Lagrangian method; Computer science","score_opus":0.13741534245869144,"score_gpt":0.3559697696159796,"score_spread":0.21855442715728815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162995463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783593,0.000017041286,0.2956317,0.00024788463,0.000048626003,0.0019672986,0.000021932017,0.00010173143,0.023604488],"genre_scores_gemma":[0.7851156,0.000042595726,0.21389765,0.00008962114,0.0000641353,0.00033592305,0.000015543743,0.000076558514,0.00036239286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816644,0.0000425934,0.00062920403,0.0002523435,0.0006081505,0.00030125203],"domain_scores_gemma":[0.99726135,0.0016590796,0.00027088352,0.0006708602,0.000082000544,0.00005582211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044966245,0.0001995318,0.0003538345,0.00013336822,0.00015616031,0.000021011192,0.00033217802,0.000087324595,0.00016169046],"category_scores_gemma":[0.0009625753,0.00014585201,0.000063407955,0.0004465153,0.00012984026,0.000084604326,0.00009932942,0.0002565381,0.000025107825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020112115,0.0004564234,0.00008636881,0.00026013926,0.00003271992,0.000005404337,0.006065526,0.004042412,0.01753077,0.9699774,0.0010822384,0.00044052902],"study_design_scores_gemma":[0.0023697217,0.00017710438,0.00022914463,0.0002661823,0.000041850664,0.000017170612,0.0038463117,0.3397158,0.08376182,0.5684635,0.00026540784,0.00084594556],"about_ca_topic_score_codex":0.000005270149,"about_ca_topic_score_gemma":0.000021986976,"teacher_disagreement_score":0.40151384,"about_ca_system_score_codex":0.00008851462,"about_ca_system_score_gemma":0.000040916308,"threshold_uncertainty_score":0.5947673},"labels":[],"label_agreement":null},{"id":"W2165150777","doi":"","title":"Estimating convexifiers in continuous optimization","year":2003,"lang":"en","type":"article","venue":"University of Zagreb University Computing Centre (SRCE)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Nonlinear programming; Simple (philosophy); Convex optimization; Mathematical optimization; Regular polygon; Applied mathematics; Nonlinear system; Quadratic programming; Convex function; Sequential quadratic programming; Convex analysis; Derivative (finance); Quadratic equation; Function (biology); Geometry","score_opus":0.016747565850607386,"score_gpt":0.24649455711816223,"score_spread":0.22974699126755485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165150777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21533002,0.000009515815,0.7793912,0.00008923803,0.000113761256,0.0002919838,0.000008402117,0.00012094391,0.004644906],"genre_scores_gemma":[0.52097934,0.000010827572,0.4773185,0.00000806806,0.00000863358,4.6014377e-12,0.000009961537,0.000013404657,0.0016512809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998389,0.00031687674,0.00020935219,0.00036890057,0.000318,0.00039785335],"domain_scores_gemma":[0.9985261,0.00045127046,0.0002899388,0.00027341224,0.00032005305,0.00013921392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003685137,0.00018183478,0.00035460552,0.0003980925,0.0002737408,0.00001473479,0.00035856038,0.0001331561,0.0003670743],"category_scores_gemma":[0.00043369713,0.00025764905,0.00009759859,0.00073444593,0.00021094427,0.00026005588,0.00016884392,0.00026479983,0.000011488894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008241992,0.00027011556,0.001046392,0.000110358866,0.00006640466,0.00024010833,0.053502366,0.922412,0.000029604911,0.020250611,0.00047157623,0.0015180409],"study_design_scores_gemma":[0.0025328035,0.000037024256,0.000095331234,0.00015082776,0.000038517224,0.000010109685,0.19078043,0.80515826,0.00008083135,0.0005812909,0.00022208899,0.00031251312],"about_ca_topic_score_codex":0.00010577305,"about_ca_topic_score_gemma":0.000049973765,"teacher_disagreement_score":0.3056493,"about_ca_system_score_codex":0.0003579006,"about_ca_system_score_gemma":0.00013324071,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W2166798101","doi":"10.1137/050623802","title":"Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":462,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Semidefinite programming; Mathematics; Explained sum of squares; Polynomial; Graph; Constraint (computer-aided design); Mathematical optimization; Combinatorics","score_opus":0.028642549120394125,"score_gpt":0.3143879728623788,"score_spread":0.2857454237419847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166798101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049658,0.00006505015,0.99243003,0.00029153045,0.00008784881,0.001555155,0.000050831593,0.00010520659,0.00044855004],"genre_scores_gemma":[0.040710952,0.00015081928,0.9582954,0.00001908062,0.00016419345,0.000084188345,0.00017408737,0.00007462774,0.00032667513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981179,0.000110586545,0.0006494523,0.00028807076,0.00051341637,0.00032056004],"domain_scores_gemma":[0.9975785,0.00033202732,0.00080496003,0.00021637771,0.0009509992,0.00011712846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034947845,0.00024025919,0.00033321982,0.00038736154,0.00038964994,0.00015337783,0.00014362724,0.0001516016,0.00006354244],"category_scores_gemma":[0.00045024508,0.00020078551,0.000072820214,0.0005159615,0.00013600993,0.00047215092,0.000030436877,0.00026639883,4.124326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027413492,0.00019654402,0.0003426814,0.000093073955,0.000040959614,0.0000015887982,0.00011235346,0.99426425,0.000056371504,0.002772247,0.00050001644,0.0013457716],"study_design_scores_gemma":[0.0029342994,0.0010630881,0.00018594114,0.00017561232,0.000079298086,0.00007252345,0.00009641839,0.9884124,0.00066459854,0.0057460205,0.00028199854,0.0002878333],"about_ca_topic_score_codex":0.000007377095,"about_ca_topic_score_gemma":0.000016154334,"teacher_disagreement_score":0.03574515,"about_ca_system_score_codex":0.00012510034,"about_ca_system_score_gemma":0.00013035536,"threshold_uncertainty_score":0.8187795},"labels":[],"label_agreement":null},{"id":"W2169266532","doi":"10.4236/ajcm.2011.14036","title":"First Order Convergence Analysis for Sparse Grid Method in Stochastic Two-Stage Linear Optimization Problem","year":2011,"lang":"en","type":"article","venue":"American Journal of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematical optimization; Stochastic programming; Convexity; Piecewise linear function; Rate of convergence; Mathematics; Linear programming; Grid; Convergence (economics); Convex optimization; Piecewise; Convex function; Stochastic optimization; Computer science; Regular polygon","score_opus":0.07535166600716416,"score_gpt":0.38598627600332386,"score_spread":0.3106346099961597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169266532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002145392,0.000012769654,0.99701315,0.00012269807,0.00006712304,0.0004904445,0.00003421489,0.000023912009,0.000090297166],"genre_scores_gemma":[0.027486075,0.000010968807,0.97221005,0.000043511012,0.000067816465,0.000032673335,0.00001644888,0.000048950624,0.000083501305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730957,0.00014411517,0.0013398923,0.00022183375,0.0006799374,0.0003046708],"domain_scores_gemma":[0.993803,0.0025193342,0.0015696373,0.00020770765,0.0017429147,0.00015737076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313558,0.00022750886,0.00077336706,0.00084952277,0.000095157455,0.000028598326,0.00036104923,0.0000413439,0.00027224483],"category_scores_gemma":[0.0013355366,0.00020836049,0.0002119571,0.0021788175,0.00016978895,0.00028115622,0.00005631293,0.0002391749,0.0000046226323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008665655,0.00041762227,0.00014551861,0.00008288512,0.00036161835,0.000008027433,0.002352998,0.98486674,0.0000013116374,0.011265621,0.000023369817,0.00038765784],"study_design_scores_gemma":[0.0009200878,0.0002729945,0.00006185576,0.00007305395,0.00022388609,0.000035106914,0.0009268728,0.9205854,0.000014092829,0.07668213,0.000012010554,0.00019253668],"about_ca_topic_score_codex":0.000014327581,"about_ca_topic_score_gemma":0.000017278251,"teacher_disagreement_score":0.06541651,"about_ca_system_score_codex":0.00013027429,"about_ca_system_score_gemma":0.0002333012,"threshold_uncertainty_score":0.8496694},"labels":[],"label_agreement":null},{"id":"W2169696642","doi":"10.1287/moor.1090.0416","title":"Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Ministerio de Economía y Competitividad","keywords":"Mathematics; Linear programming; Bellman equation; Mathematical optimization; Function (biology); Partition (number theory); Sensitivity (control systems); Applied mathematics; Convex function; Extension (predicate logic); Linear-fractional programming; Domain (mathematical analysis); Regular polygon; Combinatorics; Mathematical analysis; Computer science","score_opus":0.12241455602479392,"score_gpt":0.46007608964743907,"score_spread":0.33766153362264517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169696642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10357989,0.000033285345,0.89183,0.0009914327,0.000020042722,0.0013023006,0.00003559185,0.000095616844,0.002111808],"genre_scores_gemma":[0.50932074,0.000029162615,0.4896587,0.000010408905,0.000028884511,0.00008215037,0.000037344103,0.0000211209,0.00081149343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641985,0.00049515796,0.0008728449,0.0003640035,0.0012334926,0.0006146308],"domain_scores_gemma":[0.9960883,0.001454566,0.00007312615,0.0008272082,0.001398779,0.00015801864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041068215,0.00018288003,0.00053229707,0.0017737728,0.0003304166,0.00010646107,0.00027582553,0.0001318701,0.00023055013],"category_scores_gemma":[0.004024879,0.00017638279,0.00015674648,0.0054233605,0.00022501043,0.0003401351,0.00012311357,0.00062062003,0.000048271857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039787734,0.006066272,0.0008631377,0.00040091985,0.000462232,0.00009699267,0.007817193,0.8496003,0.008953818,0.11455737,0.0003604397,0.010781513],"study_design_scores_gemma":[0.00038833419,0.00012852,0.00036261737,0.00007889288,0.000060423234,0.000008812363,0.0008014633,0.9582901,0.0029919546,0.036604308,0.00008212532,0.00020244472],"about_ca_topic_score_codex":0.00007385692,"about_ca_topic_score_gemma":0.0008880094,"teacher_disagreement_score":0.40574083,"about_ca_system_score_codex":0.00015537009,"about_ca_system_score_gemma":0.00016548566,"threshold_uncertainty_score":0.71926814},"labels":[],"label_agreement":null},{"id":"W2171487610","doi":"10.1007/s10107-007-0134-4","title":"Symbolic Fenchel Conjugation","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Duality (order theory); Mathematics; Maple; Convex analysis; Fenchel's duality theorem; Convex conjugate; Class (philosophy); Symbolic data analysis; Regular polygon; Algebra over a field; Convex optimization; Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.06832498750919115,"score_gpt":0.4043783178552574,"score_spread":0.33605333034606627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171487610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007870935,0.00002750516,0.97373223,0.00017772036,0.000051811967,0.0006870434,9.188318e-7,0.0004195054,0.017032318],"genre_scores_gemma":[0.13962442,0.0000029454159,0.8584719,0.00005695826,0.00012514845,0.000055760258,0.0000062697277,0.000059854923,0.0015967581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978396,0.000043766217,0.00057538267,0.0002800054,0.0006288572,0.00063237746],"domain_scores_gemma":[0.9979884,0.0010851368,0.00012991455,0.0003688281,0.00019946738,0.00022823396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016527781,0.00018677671,0.00028080083,0.00015810347,0.0001652503,0.000088808134,0.00022585256,0.00012285539,0.00046033927],"category_scores_gemma":[0.002568444,0.00016503844,0.000089137175,0.00048768357,0.00014414286,0.0001819672,0.00009740557,0.0002760742,0.00031334048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023614755,0.0005196576,0.00010642021,0.00041080615,0.000042603795,0.00003957829,0.0012133043,0.00002335637,0.000384386,0.7745627,0.00026291754,0.22241062],"study_design_scores_gemma":[0.0007740372,0.000097983655,0.00006666612,0.00013510721,0.00003627471,0.000069939255,0.0010196575,0.016027799,0.0042292816,0.97073704,0.006359107,0.00044712218],"about_ca_topic_score_codex":0.000001187028,"about_ca_topic_score_gemma":0.0000022926524,"teacher_disagreement_score":0.2219635,"about_ca_system_score_codex":0.00010418556,"about_ca_system_score_gemma":0.000027638685,"threshold_uncertainty_score":0.6730072},"labels":[],"label_agreement":null},{"id":"W2177439500","doi":"10.1109/pacrim.2015.7334874","title":"A comparison of conventional and meta-model based global optimization methods","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Global optimization; Computer science; Limit (mathematics); Metamodeling; Function (biology); Optimization problem; Set (abstract data type); Convex optimization; Regular polygon; Algorithm; Mathematics","score_opus":0.3954858930737304,"score_gpt":0.5624465609457515,"score_spread":0.16696066787202113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177439500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062260646,0.000098744364,0.9945624,0.00024259773,0.000017316705,0.00021049641,0.000020405903,0.000049395883,0.004736385],"genre_scores_gemma":[0.00808277,0.0000017804897,0.99115956,0.00004366078,0.0000051241664,0.000020844107,0.000015219419,0.000010603116,0.00066043244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885243,0.00016888072,0.00033016084,0.0001600952,0.00036669482,0.00012174289],"domain_scores_gemma":[0.998837,0.00024377972,0.00013122625,0.0001643072,0.00049782614,0.0001258955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007156842,0.00009956788,0.0003588237,0.000056117242,0.000029662086,0.00001657947,0.00008961727,0.000058042628,0.0003701465],"category_scores_gemma":[0.0008141419,0.00008138469,0.000061086495,0.000221835,0.000086005755,0.00012883179,0.000060432936,0.000058225756,0.0000016109541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026703981,0.0001473744,0.00014635752,0.000030360607,0.00012963093,1.7543617e-7,0.000041062405,0.9434105,0.000008501625,0.05467993,0.00091081817,0.00046854524],"study_design_scores_gemma":[0.0006871108,0.0000389393,0.000003263745,0.0000016397229,0.00025682573,0.0000011641899,0.00009321127,0.95557356,0.0007354433,0.042482182,0.000052299252,0.00007435278],"about_ca_topic_score_codex":0.0000041680346,"about_ca_topic_score_gemma":0.0000027873925,"teacher_disagreement_score":0.012197747,"about_ca_system_score_codex":0.000052934705,"about_ca_system_score_gemma":0.00012985217,"threshold_uncertainty_score":0.40528446},"labels":[],"label_agreement":null},{"id":"W2188787758","doi":"","title":"On the Extension of a Mehrotra-Type Algorithm for Semidefinite Optimization","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Extension (predicate logic); Mathematics; Interior point method; Algorithm; Linear programming; Semidefinite programming; Optimization problem; Mathematical optimization; Computer science","score_opus":0.09413531355603784,"score_gpt":0.3896482803722172,"score_spread":0.2955129668161794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188787758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039468097,0.000017694774,0.99402773,0.00023950433,0.0000870905,0.0007947102,0.000008910198,0.00006818988,0.0043614698],"genre_scores_gemma":[0.0025813915,0.000034460605,0.9947691,0.00022043465,0.00004231861,0.00002204609,0.000014797803,0.0000397327,0.0022757212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987618,0.00004144025,0.00036074483,0.00019981558,0.00038165876,0.0002545735],"domain_scores_gemma":[0.995703,0.003029023,0.00014034225,0.0003752217,0.00069571775,0.000056695782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825877,0.00012006481,0.00017150589,0.00013195282,0.00011833921,0.00001427901,0.00016127151,0.00008111789,0.0004184674],"category_scores_gemma":[0.0022304424,0.000078241086,0.00006486486,0.00045949515,0.00006812626,0.00007788496,0.000039639555,0.000113811264,0.0000102315125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039439203,0.0007283301,0.000009768295,0.0001271397,0.00012124885,0.0000071111454,0.000556751,0.254473,0.001534616,0.59379643,0.01438721,0.133864],"study_design_scores_gemma":[0.000570898,0.0002312323,0.0000054158677,0.000037895916,0.000013732954,0.0000037060013,0.00023992149,0.92451775,0.012833817,0.06102145,0.00039999932,0.0001242002],"about_ca_topic_score_codex":0.000002767604,"about_ca_topic_score_gemma":0.0000024713313,"teacher_disagreement_score":0.6700447,"about_ca_system_score_codex":0.000043876014,"about_ca_system_score_gemma":0.000036479167,"threshold_uncertainty_score":0.45819244},"labels":[],"label_agreement":null},{"id":"W2195470006","doi":"10.1287/ijoc.2015.0656","title":"Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Simplex; Identification (biology); Computer science; Linear programming; Simplex algorithm; Set (abstract data type); Mathematics; Algorithm","score_opus":0.052930139662826864,"score_gpt":0.42609743697313057,"score_spread":0.37316729731030374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195470006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4871342,0.000028144226,0.5119555,0.000098067074,0.000084439045,0.00013450423,0.000002179088,0.000059876405,0.00050309865],"genre_scores_gemma":[0.59633535,0.0000023714629,0.4030825,0.00021908942,0.0003066318,0.0000016892419,0.0000038893677,0.000021509892,0.000026985772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979959,0.00008449161,0.00057254464,0.00022333772,0.00066490733,0.00045878894],"domain_scores_gemma":[0.9982335,0.00031797757,0.0002728044,0.00026953293,0.00030911536,0.0005970884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095313875,0.00021595361,0.00037093277,0.0003394193,0.00027780648,0.0003370001,0.0002696254,0.0001238423,0.0001211655],"category_scores_gemma":[0.0009530613,0.00016164703,0.00012188848,0.00048489988,0.0001983754,0.00043337108,0.00019974452,0.0007279279,0.000003447963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013719257,0.0011718236,0.0018542495,0.000043451546,0.0014148483,0.000267218,0.022022158,0.10070611,0.00040662798,0.7646234,0.00031091756,0.10580728],"study_design_scores_gemma":[0.0009720045,0.0006056772,0.00017871444,0.000024966443,0.000051329644,0.00016324827,0.0018817332,0.94379723,0.0005980944,0.05143171,0.000055280565,0.00024003799],"about_ca_topic_score_codex":0.0000018143305,"about_ca_topic_score_gemma":3.6348376e-7,"teacher_disagreement_score":0.8430911,"about_ca_system_score_codex":0.00018677735,"about_ca_system_score_gemma":0.00011018872,"threshold_uncertainty_score":0.6591775},"labels":[],"label_agreement":null},{"id":"W2203411556","doi":"10.1007/s10589-016-9867-4","title":"Local nonglobal minima for solving large-scale extended trust-region subproblems","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Guilan","keywords":"Trust region; Mathematics; Maxima and minima; Eigenvalues and eigenvectors; Mathematical optimization; Quadratic equation; Constraint (computer-aided design); Scale (ratio); Duality (order theory); Norm (philosophy); Optimization problem; Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.03189552798021421,"score_gpt":0.3360019964161395,"score_spread":0.30410646843592526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203411556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009442306,0.000053178766,0.99618554,0.0016134769,0.00003448622,0.0012546278,0.0001215517,0.00017888218,0.00046381558],"genre_scores_gemma":[0.049420256,0.00007721314,0.94742566,0.00018807528,0.00012653996,0.0010718064,0.00022658631,0.000055839973,0.001408029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984837,0.00003208766,0.0004318711,0.00045236156,0.00028614272,0.00031380393],"domain_scores_gemma":[0.9980355,0.00073364837,0.00018446113,0.0002218962,0.00065660867,0.00016790329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020643568,0.00018532899,0.00020460755,0.0001429896,0.00043442025,0.00006710155,0.00016619317,0.000103206934,0.00010398588],"category_scores_gemma":[0.00014366854,0.00015485927,0.0000703507,0.0003582247,0.00017361798,0.00028567674,0.000075948315,0.00006540781,0.000014239288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004052006,0.00030613094,0.00011899453,0.00006173633,0.00003192283,5.524333e-7,0.00012247724,0.7173851,0.000026523088,0.2528226,0.0018161265,0.027267262],"study_design_scores_gemma":[0.0016245693,0.000039226,0.00009452914,0.000028299915,0.000019649055,0.000016061449,0.00013490664,0.873274,0.000051165902,0.11975317,0.0047532166,0.00021119135],"about_ca_topic_score_codex":6.154779e-7,"about_ca_topic_score_gemma":0.0000031028435,"teacher_disagreement_score":0.15588889,"about_ca_system_score_codex":0.00010980367,"about_ca_system_score_gemma":0.000096199605,"threshold_uncertainty_score":0.63149774},"labels":[],"label_agreement":null},{"id":"W2234116669","doi":"10.1007/s11590-007-0074-1","title":"Exact L 2-norm plane separation","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Norm (philosophy); Quadratic equation; Computation; Exact solutions in general relativity; Mathematics; Regular polygon; Heuristic; Plane (geometry); Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.047499468453573064,"score_gpt":0.3420442142460877,"score_spread":0.29454474579251466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234116669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005261724,0.000014252212,0.98816687,0.0019991018,0.00013226212,0.00035306046,0.000008815787,0.0002679737,0.0037959556],"genre_scores_gemma":[0.021223282,0.00017184949,0.9730252,0.0014377256,0.00021841025,0.00006563323,0.00022799378,0.00008435198,0.0035455287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985077,0.0000836664,0.0003367811,0.00029280738,0.00047757107,0.00030148737],"domain_scores_gemma":[0.9990652,0.00019467273,0.00014639708,0.00033543503,0.00014899197,0.00010929933],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015801482,0.00017532302,0.00018859243,0.00020112525,0.000291522,0.000038013655,0.00017096894,0.00007883593,0.0010668866],"category_scores_gemma":[0.00030712067,0.00017887937,0.00005481203,0.0004414064,0.000099558485,0.00048568367,0.000040569066,0.00016358247,0.000112753885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002369627,0.000063549,0.00020298395,0.000015206986,0.000019812238,0.000028340972,0.00032948318,0.9742158,0.00044472807,0.0009177786,0.023497408,0.00024118248],"study_design_scores_gemma":[0.0015742509,0.00006609525,0.00018179292,0.000026094916,0.000021551174,0.0001675262,0.00006738335,0.9891018,0.0021606062,0.0006146943,0.0054425285,0.00057563116],"about_ca_topic_score_codex":0.0000045620104,"about_ca_topic_score_gemma":0.0000014081513,"teacher_disagreement_score":0.01805488,"about_ca_system_score_codex":0.00011950875,"about_ca_system_score_gemma":0.000044527515,"threshold_uncertainty_score":0.9998463},"labels":[],"label_agreement":null},{"id":"W2238847421","doi":"10.1007/978-1-4614-0769-0_1","title":"Introduction to Semidefinite, Conic and Polynomial Optimization","year":2011,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Conic optimization; Conic section; Semidefinite programming; Cone (formal languages); Convex cone; Intersection (aeronautics); Semidefinite embedding; Quadratically constrained quadratic program; Affine transformation; Mathematics; Convex optimization; Second-order cone programming; Affine space; Positive-definite matrix; Optimization problem; Focus (optics); Mathematical optimization; Regular polygon; Convex analysis; Pure mathematics; Quadratic programming; Algorithm; Physics; Geometry; Engineering","score_opus":0.08885040654642669,"score_gpt":0.4228350703547089,"score_spread":0.33398466380828223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238847421","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012327849,0.00012575237,0.031405658,0.036384955,0.0039186166,0.008899514,0.00025456143,0.00026842323,0.91750973],"genre_scores_gemma":[0.017317066,0.0103066005,0.23601852,0.00022817218,0.0010901155,0.0026315763,0.0004048451,0.00021007191,0.73179305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9825845,0.0003970198,0.0019107423,0.0033306703,0.009735785,0.0020412798],"domain_scores_gemma":[0.9919797,0.0003308942,0.0001369812,0.0018315385,0.0051061264,0.0006147435],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.017070726,0.0007536931,0.00061801274,0.017707331,0.0031264229,0.0038264652,0.0060443603,0.00027498085,0.004839642],"category_scores_gemma":[0.0040445086,0.0008175953,0.000111327885,0.006044341,0.008304665,0.008055778,0.0072868387,0.0020239684,0.0004168462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026885807,0.0002601014,0.000038447415,0.00007777794,0.00008983369,0.00011567689,0.0008563587,0.24399127,0.00015576296,0.7470176,0.0039398996,0.003188364],"study_design_scores_gemma":[0.004067925,0.001068841,0.0014934622,0.002034993,0.00006471313,0.00020531451,0.009149502,0.32544765,0.0009046186,0.17819831,0.47392946,0.0034352015],"about_ca_topic_score_codex":0.00041506175,"about_ca_topic_score_gemma":0.0032258378,"teacher_disagreement_score":0.56881934,"about_ca_system_score_codex":0.0059013236,"about_ca_system_score_gemma":0.0008759328,"threshold_uncertainty_score":0.9994275},"labels":[],"label_agreement":null},{"id":"W2239439492","doi":"10.1007/s11590-016-1023-7","title":"On the convergence rate of grid search for polynomial optimization over the simplex","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Simplex; Mathematics; Polynomial; Grid; Convergence (economics); Minification; Computational intelligence; Simplex algorithm; Rate of convergence; Combinatorics; Mathematical optimization; Applied mathematics; Linear programming; Mathematical analysis; Geometry; Computer science","score_opus":0.048723286617892415,"score_gpt":0.33309953971401396,"score_spread":0.2843762530961215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239439492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026573993,0.0000056487906,0.9719941,0.023501266,0.00025160747,0.0012664091,0.0000994944,0.00005739745,0.00016668926],"genre_scores_gemma":[0.15018219,0.00050614285,0.8277182,0.015186845,0.0012616817,0.0011352759,0.00020764701,0.0004578906,0.0033441049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980634,0.00033413843,0.00046549013,0.0003275687,0.00042962263,0.0003798093],"domain_scores_gemma":[0.99469745,0.003987058,0.00027010363,0.00060040323,0.000377823,0.00006715567],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009686311,0.0002048981,0.00021095177,0.00013548898,0.00033016977,0.000056515517,0.0004951764,0.00007739697,0.0015848238],"category_scores_gemma":[0.0015159725,0.00010522659,0.000116449075,0.00046007292,0.00031897082,0.00026512763,0.00009023164,0.00013011132,0.000013023329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013398798,0.00004052469,0.000020989179,0.000019182191,0.000038196344,4.247765e-7,0.00013040367,0.95615983,0.00087322906,0.0131472545,0.029047685,0.00038827088],"study_design_scores_gemma":[0.0014172688,0.000084489155,0.000025341033,0.000053712276,0.000025547264,0.0000015357934,0.00007116646,0.989193,0.0067232866,0.00094117026,0.0012427062,0.0002207475],"about_ca_topic_score_codex":0.0000064385245,"about_ca_topic_score_gemma":0.0000012206445,"teacher_disagreement_score":0.14752479,"about_ca_system_score_codex":0.00011376667,"about_ca_system_score_gemma":0.00007506653,"threshold_uncertainty_score":0.99932784},"labels":[],"label_agreement":null},{"id":"W2269291726","doi":"10.1023/a:1017514422146","title":"New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Semidefinite programming; Theory of computation; Mathematics; Mathematical optimization; Point (geometry); Dual (grammatical number); Algorithm","score_opus":0.06823277375741253,"score_gpt":0.38709290536516644,"score_spread":0.3188601316077539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269291726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008360781,0.000043683627,0.9964458,0.0018226675,0.000041600822,0.00080167834,0.000029003344,0.00001992087,0.0007120524],"genre_scores_gemma":[0.0060061566,0.00016019843,0.9926005,0.00036172252,0.00012391026,0.00009492773,0.000031548778,0.000032018954,0.000589013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806213,0.00055067457,0.0006819448,0.00018188865,0.00037752007,0.00014580987],"domain_scores_gemma":[0.99421614,0.00353867,0.0010088233,0.00040149555,0.00074883073,0.00008601578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020958518,0.00015116,0.00033183588,0.00035690315,0.00041034416,0.00006306036,0.00026702965,0.000081981176,0.00027258752],"category_scores_gemma":[0.0011246724,0.00009569065,0.00023081996,0.0018442236,0.0001262172,0.00018626223,0.000039495066,0.0001967266,3.1884468e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016673538,0.00011272005,0.00007373725,0.000013234485,0.00016671768,9.337073e-8,0.000090521266,0.88494986,0.000027258371,0.11201298,0.00015944507,0.0022267115],"study_design_scores_gemma":[0.00055913144,0.00006863936,0.00012182036,0.000027562784,0.0006329171,0.0000100745365,0.00015921943,0.9547228,0.00024559585,0.042465046,0.00089036,0.0000968129],"about_ca_topic_score_codex":0.0000023368343,"about_ca_topic_score_gemma":0.0000029862265,"teacher_disagreement_score":0.06977297,"about_ca_system_score_codex":0.00006372293,"about_ca_system_score_gemma":0.000118824464,"threshold_uncertainty_score":0.39021516},"labels":[],"label_agreement":null},{"id":"W2276338813","doi":"","title":"Remarks on Solutions to a Nonconvex Quadratic Programming Test Problem","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Quadratic programming; Mathematical optimization; Quadratic equation; Selection (genetic algorithm); Test (biology); Sequential quadratic programming; Computer science; Artificial intelligence","score_opus":0.034620780592233336,"score_gpt":0.30302698289296637,"score_spread":0.26840620230073303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276338813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005064302,0.00010855967,0.98188084,0.006180893,0.00005588433,0.003015873,0.00003221769,0.0013857381,0.0022757046],"genre_scores_gemma":[0.10328027,0.00007803804,0.8869374,0.0011394122,0.00014046938,0.002388546,0.000020324052,0.0001570734,0.005858469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628145,0.00016696934,0.000734707,0.00066165905,0.0008501665,0.0013050456],"domain_scores_gemma":[0.99673367,0.00090190594,0.00023493734,0.0010900316,0.00038612814,0.00065335876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084543484,0.00043938533,0.0004948298,0.0007382923,0.00081420277,0.0001308816,0.0006191323,0.00028146003,0.00009651677],"category_scores_gemma":[0.0031638294,0.0004380773,0.00017694438,0.0014614672,0.00016362315,0.0003316777,0.0003068848,0.00072496926,0.00013994986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009019588,0.014358311,0.024373211,0.0011296874,0.0005362519,0.002048666,0.011380482,0.100616716,0.016921189,0.49547613,0.13587494,0.19638248],"study_design_scores_gemma":[0.005180982,0.004830702,0.007995959,0.001357761,0.00017770292,0.0021913752,0.0013679414,0.81633526,0.023249222,0.0981866,0.034325305,0.004801207],"about_ca_topic_score_codex":0.00061306066,"about_ca_topic_score_gemma":0.0010633328,"teacher_disagreement_score":0.7157185,"about_ca_system_score_codex":0.0008932647,"about_ca_system_score_gemma":0.00044501526,"threshold_uncertainty_score":0.9998071},"labels":[],"label_agreement":null},{"id":"W2279368206","doi":"10.1007/978-3-319-07046-9_24","title":"Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Quadratic programming; Solver; Binary number; Ellipsoid; Algorithm; Mathematical optimization; Local search (optimization); Theoretical computer science; Mathematics","score_opus":0.045436997734418755,"score_gpt":0.33138075023975544,"score_spread":0.28594375250533666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279368206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021392856,0.00020511878,0.9969257,0.0005991956,0.00014371253,0.001688423,0.0000071090867,0.00009691812,0.000119869765],"genre_scores_gemma":[0.04449499,0.00003618622,0.9544181,0.00019392873,0.00015735113,0.00008096426,0.000016182667,0.0000915899,0.0005106776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971346,0.00005407869,0.00045282845,0.0009778821,0.0007460404,0.00063457305],"domain_scores_gemma":[0.99660313,0.0022357705,0.0001635456,0.0005165573,0.0002919053,0.00018906928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013669037,0.00039966585,0.00054188736,0.00054902775,0.00038465182,0.00034913118,0.000539933,0.00023016422,0.000008198178],"category_scores_gemma":[0.0004287197,0.00035015398,0.00006528948,0.00027635487,0.0010930556,0.00017024364,0.0004126507,0.00064800866,0.0000023241503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034433844,0.000039337938,0.000054864893,0.0017158248,0.00002176797,0.000011638324,0.0012530235,0.24141487,0.00012409568,0.014616697,0.0000065473573,0.7407069],"study_design_scores_gemma":[0.0005778475,0.0004309105,0.0000037057653,0.00075433555,0.000011621707,0.000013871684,6.954826e-7,0.8596634,0.00029453693,0.13759291,0.00028342547,0.00037273028],"about_ca_topic_score_codex":0.00000606747,"about_ca_topic_score_gemma":0.000041875017,"teacher_disagreement_score":0.74033415,"about_ca_system_score_codex":0.000121911,"about_ca_system_score_gemma":0.00027128027,"threshold_uncertainty_score":0.99989504},"labels":[],"label_agreement":null},{"id":"W2294401501","doi":"10.1016/j.dam.2015.12.015","title":"Influence of the normalization constraint on the integral simplex using decomposition","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Normalization (sociology); Simplex; Linear programming; Simplex algorithm; Mathematical optimization; Polytope; Solution set; Algorithm; Combinatorics; Set (abstract data type); Computer science","score_opus":0.049102594228262575,"score_gpt":0.35655257004164476,"score_spread":0.3074499758133822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294401501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40296125,0.0000018726525,0.59327734,0.0005244971,0.000020979298,0.0007972487,0.000033729175,0.00004731847,0.0023357582],"genre_scores_gemma":[0.88719785,0.00000739502,0.11247535,0.00013336731,0.000027130718,0.000048856306,0.0000028213324,0.000041002353,0.00006624506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984355,0.00006027129,0.0005112248,0.00018374395,0.00055314845,0.00025612128],"domain_scores_gemma":[0.99746746,0.0012176308,0.00040654652,0.0006585406,0.00019009184,0.000059752867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294686,0.0001889248,0.0002275331,0.0000645296,0.00020146591,0.000028026561,0.00044335716,0.00007571489,0.0000966114],"category_scores_gemma":[0.0010613042,0.000083805004,0.00008533313,0.0003288822,0.0003980959,0.00010159056,0.0001585093,0.0001462775,0.000015084796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016999675,0.00008094027,0.000017978737,0.00009735517,0.000032317515,3.8639925e-7,0.000720948,0.01018661,0.036807008,0.9509712,0.000104376384,0.00096389884],"study_design_scores_gemma":[0.0008794573,0.00005239988,0.000098494755,0.0007012727,0.00007768376,0.000018549508,0.001378201,0.07234287,0.17265205,0.7512771,0.00014191023,0.00038004058],"about_ca_topic_score_codex":0.0000020530513,"about_ca_topic_score_gemma":0.000002338538,"teacher_disagreement_score":0.48423657,"about_ca_system_score_codex":0.000102235485,"about_ca_system_score_gemma":0.00007431827,"threshold_uncertainty_score":0.3417469},"labels":[],"label_agreement":null},{"id":"W2307638459","doi":"","title":"Heuristics for generating additive spanners","year":2004,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Data science; Information retrieval; Operating system","score_opus":0.029371144648088068,"score_gpt":0.30109481307396047,"score_spread":0.2717236684258724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2307638459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029210541,0.00035370135,0.88681126,0.00021110645,0.00274737,0.005909154,0.0041612387,0.0011231884,0.069472454],"genre_scores_gemma":[0.0066313427,0.0007153977,0.5788302,0.00010503153,0.0008973026,0.000044681034,0.014722381,0.0005067584,0.39754692],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979791,0.00007347989,0.0003217212,0.0006259389,0.00046810578,0.00053167605],"domain_scores_gemma":[0.9975632,0.0005655154,0.00037844144,0.00039290404,0.00088977494,0.00021016227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013509084,0.00042211136,0.00048461006,0.00065919774,0.0004205427,0.00006416568,0.00049917004,0.00047843938,0.00026353847],"category_scores_gemma":[0.00100521,0.0005199413,0.00024292413,0.00069604994,0.00007452998,0.0002481564,0.000061100494,0.0005281457,0.000035964345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040078545,0.0023100078,0.0024192692,0.0070461896,0.0033716832,0.0021650568,0.0018498098,0.091271676,0.000088923865,0.35745022,0.45770225,0.07031705],"study_design_scores_gemma":[0.011875627,0.00081789255,0.000030869996,0.0017215981,0.0015447702,4.602116e-8,0.26538122,0.040252358,0.01435691,0.06397165,0.5953606,0.004686487],"about_ca_topic_score_codex":0.000029170931,"about_ca_topic_score_gemma":0.017759232,"teacher_disagreement_score":0.32807446,"about_ca_system_score_codex":0.00071495294,"about_ca_system_score_gemma":0.00056202966,"threshold_uncertainty_score":0.9997252},"labels":[],"label_agreement":null},{"id":"W2315426537","doi":"10.3934/jimo.2013.9.153","title":"Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function","year":2012,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Nonlinear complementarity problem; Monotone polygon; Complementarity (molecular biology); Mathematics; Mathematical optimization; Nonlinear system; Function (biology); Convergence (economics); Point (geometry); Algorithm; Complementarity theory; Applied mathematics; Computer science","score_opus":0.11975807756597052,"score_gpt":0.33815403403588506,"score_spread":0.21839595646991455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315426537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025309905,0.000021619302,0.99435383,0.0028423325,0.00035055008,0.0016532063,0.000024795885,0.000019128689,0.000481456],"genre_scores_gemma":[0.0006632369,0.00007048997,0.9973057,0.00043895683,0.00087905244,0.00009602493,0.00005620153,0.00003314472,0.0004571981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832886,0.00017317741,0.00059282134,0.00013991256,0.00048510288,0.00028012498],"domain_scores_gemma":[0.9986909,0.00024055348,0.00051293685,0.00015168377,0.0002955057,0.00010841535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016388788,0.0001702926,0.00023899366,0.00018682361,0.00022572227,0.000096084645,0.00014028575,0.00008791531,0.0002420176],"category_scores_gemma":[0.00015844402,0.0001148137,0.000097773656,0.00023170859,0.000044591394,0.00040459118,0.000063512314,0.00023935753,9.496312e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034117424,0.003335011,0.0005034473,0.00037268363,0.0012005696,0.000008108216,0.00047147617,0.62174594,0.000044310545,0.04264548,0.082583174,0.24367803],"study_design_scores_gemma":[0.005914161,0.0006423856,0.000012192778,0.00010615555,0.00022421562,0.000005324111,0.00027358925,0.9668429,0.00015795369,0.0017391286,0.023895508,0.00018647045],"about_ca_topic_score_codex":0.0000021117232,"about_ca_topic_score_gemma":6.2042295e-7,"teacher_disagreement_score":0.34509695,"about_ca_system_score_codex":0.000106593805,"about_ca_system_score_gemma":0.00003162183,"threshold_uncertainty_score":0.4681967},"labels":[],"label_agreement":null},{"id":"W2317840886","doi":"10.2514/6.2006-7080","title":"On the Common Structure of MDO Problems: A Comparison of Architectures","year":2006,"lang":"en","type":"article","venue":"11th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.03915755282704465,"score_gpt":0.34940074383311526,"score_spread":0.3102431910060706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317840886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25765678,0.00011164035,0.7406907,0.00032955047,0.000018581259,0.0005205631,0.00011590439,0.000036514695,0.0005197558],"genre_scores_gemma":[0.8758191,0.000034178007,0.12382093,0.000007892423,0.000016385526,0.000014863862,0.000117562515,0.000020207903,0.00014890142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976419,0.00027771355,0.0008738293,0.00039168895,0.0005661505,0.00024868123],"domain_scores_gemma":[0.9970054,0.0010888156,0.0007234424,0.00056329084,0.00054787664,0.00007119564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027689146,0.00026823764,0.00074086565,0.00046908567,0.0002756259,0.000052977164,0.0003473537,0.00012300022,0.0004445288],"category_scores_gemma":[0.0002816663,0.00018310307,0.00016386001,0.0014040275,0.0003642744,0.000092669114,0.00018082696,0.0002825662,5.2585136e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006618179,0.00027636669,0.009754914,0.000104801205,0.00020937175,6.264979e-7,0.0009044072,0.9660866,0.00046828887,0.021497218,0.000038453712,0.000592727],"study_design_scores_gemma":[0.00039826788,0.0001462747,0.003831794,0.00007572749,0.0003019949,0.0000011234696,0.00045042316,0.960257,0.004537226,0.029805424,0.0000041948692,0.00019055631],"about_ca_topic_score_codex":0.00009224295,"about_ca_topic_score_gemma":0.00037164227,"teacher_disagreement_score":0.6181623,"about_ca_system_score_codex":0.000024602146,"about_ca_system_score_gemma":0.00005766321,"threshold_uncertainty_score":0.74667263},"labels":[],"label_agreement":null},{"id":"W2320627379","doi":"10.3934/naco.2014.4.39","title":"Some useful inequalities via trace function method in Euclidean Jordan algebras","year":2013,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"TRACE (psycholinguistics); Convexity; Mathematical proof; Function (biology); Mathematics; Key (lock); Euclidean geometry; Cone (formal languages); Algebra over a field; Pure mathematics; Computer science; Algorithm; Geometry","score_opus":0.023505110162694798,"score_gpt":0.3033407763515031,"score_spread":0.2798356661888083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320627379","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040906817,0.00038100878,0.9926919,0.0014253878,0.00011504536,0.00094486756,0.0000070788424,0.00018153283,0.00016255022],"genre_scores_gemma":[0.3007824,0.00018414046,0.69652426,0.0009572683,0.00022709565,0.00038243426,0.000045532044,0.00010263368,0.00079421647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729234,0.00050722546,0.0007244291,0.0005100693,0.00045721466,0.00050870795],"domain_scores_gemma":[0.9979951,0.00098283,0.00022329482,0.0002864756,0.00028409113,0.00022825804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056021404,0.00030966374,0.00053888786,0.00030709282,0.00016299049,0.00015847388,0.00016349155,0.00019435359,0.0006605741],"category_scores_gemma":[0.00082032726,0.00028072184,0.000079753,0.0005881535,0.00008567274,0.0012190435,0.00006279641,0.00034865795,0.000043155116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004038877,0.0006999187,0.00205376,0.00019276426,0.00017407954,0.000012146689,0.0010356122,0.7414843,0.00043962136,0.1369585,0.0006840015,0.11586145],"study_design_scores_gemma":[0.0020499371,0.00014698689,0.0014869183,0.000019414816,0.000030883733,0.000007937827,0.00023173903,0.8205683,0.000040962546,0.17501804,0.00010649579,0.0002923776],"about_ca_topic_score_codex":0.00013222228,"about_ca_topic_score_gemma":0.000012126742,"teacher_disagreement_score":0.29669172,"about_ca_system_score_codex":0.00009965441,"about_ca_system_score_gemma":0.00004058304,"threshold_uncertainty_score":0.9999645},"labels":[],"label_agreement":null},{"id":"W2328172603","doi":"10.1142/9789812778031_0006","title":"RECONCILIATION OF VARIOUS COMPLEXITY AND CONDITION MEASURES FOR LINEAR PROGRAMMING PROBLEMS AND A GENERALIZATION OF TARDOS' THEOREM","year":2002,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Linear programming; Algebra over a field; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Calculus (dental); Mathematical economics; Mathematical optimization; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.14504855921771406,"score_gpt":0.370322374475493,"score_spread":0.22527381525777893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328172603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042614795,0.00008147588,0.9558643,0.00012450534,0.000022344499,0.001046055,0.00010861775,0.00002855258,0.00010937104],"genre_scores_gemma":[0.2906004,0.00003388287,0.7091034,0.0000042890656,0.000014158847,0.000053117124,0.00013179488,0.000017886337,0.000041069547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984878,0.00006318689,0.0007744665,0.00016139436,0.0003993222,0.00011385147],"domain_scores_gemma":[0.99656653,0.0011284235,0.0007096919,0.00014481142,0.001408815,0.00004170021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089195,0.0001236122,0.0003285173,0.0002103697,0.00011643332,0.00002016689,0.00008414988,0.0000646983,0.000042740026],"category_scores_gemma":[0.001268783,0.00012475268,0.00004947285,0.00026580459,0.00032879176,0.00020769532,0.00003647429,0.000055785673,5.394188e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023957884,0.0007730398,0.00021199025,0.003104448,0.00016662071,1.1380874e-7,0.005870465,0.10331634,0.00046420228,0.8738462,0.00008934877,0.012133286],"study_design_scores_gemma":[0.00050810433,0.000098485405,0.00008565702,0.00009101812,0.00003680418,0.0000048550714,0.00012268341,0.53274524,0.00031349843,0.4658689,0.00005566839,0.00006911197],"about_ca_topic_score_codex":0.000005092183,"about_ca_topic_score_gemma":0.00000852129,"teacher_disagreement_score":0.4294289,"about_ca_system_score_codex":0.000030983007,"about_ca_system_score_gemma":0.00003795401,"threshold_uncertainty_score":0.50872666},"labels":[],"label_agreement":null},{"id":"W2328963229","doi":"10.11159/ijecs.2012.001","title":"Constrained Nonlinear Least Squares: A Superlinearly Convergent Projected Structured Secant Method","year":2012,"lang":"en","type":"article","venue":"International Journal of Electrical and Computer Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Mathematics; Non-linear least squares; Nonlinear programming; Mathematical optimization; Least-squares function approximation; Nonlinear system; Line search; Quasi-Newton method; Secant method; Robustness (evolution); Applied mathematics; Convergence (economics); Algorithm; Newton's method; Computer science; Estimation theory","score_opus":0.03507410735842744,"score_gpt":0.35716051876252375,"score_spread":0.32208641140409633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328963229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021630585,0.0005211677,0.97538656,0.00023043055,0.0018769145,0.0002461565,0.000019253233,0.000028336295,0.000060582985],"genre_scores_gemma":[0.5010404,0.00007892364,0.4939018,0.00011377201,0.0046084053,0.000009536253,0.000011411099,0.000034931552,0.0002008218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776953,0.00024611023,0.00072180334,0.00014211093,0.00082662946,0.00029382025],"domain_scores_gemma":[0.9975736,0.00046465173,0.000358971,0.0000946988,0.001260649,0.00024740872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057214976,0.00016222779,0.0003626877,0.00029398652,0.00004937208,0.00012487124,0.0003252492,0.00008562526,0.000041037576],"category_scores_gemma":[0.00023970581,0.00012010849,0.00010257536,0.0002249778,0.000043696968,0.0002814906,0.00007628355,0.00034123682,0.000003230492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003608725,0.0056731883,0.02293557,0.00076718244,0.009202682,0.001222582,0.011892134,0.012784387,0.0099294195,0.47693333,0.021046683,0.4240041],"study_design_scores_gemma":[0.002908911,0.0005804064,0.0006431058,0.00015239145,0.0000536416,0.0045812596,0.00016258129,0.9778771,0.00073406164,0.0012713012,0.010714423,0.00032083588],"about_ca_topic_score_codex":0.000019952027,"about_ca_topic_score_gemma":0.0000011562048,"teacher_disagreement_score":0.9650927,"about_ca_system_score_codex":0.00016461585,"about_ca_system_score_gemma":0.000141251,"threshold_uncertainty_score":0.4897882},"labels":[],"label_agreement":null},{"id":"W2329498028","doi":"10.3934/dcdsb.2008.10.997","title":"A generalized projective dynamic for solving extreme and interior eigenvalue problems","year":2008,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems - B","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rayleigh quotient; Eigenvalues and eigenvectors; Unit sphere; Mathematics; Pencil (optics); Applied mathematics; Projective test; Ball (mathematics); Mathematical optimization; Mathematical analysis; Pure mathematics; Physics","score_opus":0.05200537860291371,"score_gpt":0.3197728275055973,"score_spread":0.2677674489026836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329498028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43352997,0.0008780268,0.5619429,0.00010892642,0.00012740074,0.0028935112,0.000093486175,0.00016180168,0.0002639919],"genre_scores_gemma":[0.95305955,0.00026045737,0.040143237,0.000023462024,0.000081290294,0.00088844774,0.000049090835,0.000094039184,0.005400395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980947,0.00011186354,0.000512808,0.0005310029,0.00027220577,0.0004774131],"domain_scores_gemma":[0.99888986,0.0002919486,0.00018399394,0.0002453106,0.00021682958,0.00017203974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031590613,0.00027486376,0.0005820502,0.000114811904,0.00032037764,0.00011040513,0.00014455756,0.00014657283,0.0000071249015],"category_scores_gemma":[0.00034185464,0.00022738971,0.00008912423,0.00014302171,0.00022050885,0.0001982473,0.00013752113,0.00017861421,0.000001224931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050652763,0.0022699505,0.026758883,0.02219993,0.0054622595,0.00083569007,0.078838706,0.004138323,0.12620157,0.59843457,0.0036757402,0.1261191],"study_design_scores_gemma":[0.0020688348,0.00027652158,0.00023390954,0.00024673203,0.00004819612,0.00023376469,0.0009458725,0.9892287,0.000033612803,0.005842376,0.00040692955,0.0004345139],"about_ca_topic_score_codex":0.0001053242,"about_ca_topic_score_gemma":0.000063873806,"teacher_disagreement_score":0.98509043,"about_ca_system_score_codex":0.00010143462,"about_ca_system_score_gemma":0.000042930955,"threshold_uncertainty_score":0.9272683},"labels":[],"label_agreement":null},{"id":"W2335583346","doi":"10.2514/6.2008-6022","title":"Method of Regular Simplexes: A Difference-Assisted Simplex-Based Search Algorithm","year":2008,"lang":"en","type":"article","venue":"12th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simplex algorithm; Simplex; Algorithm; Computation; Computer science; Function (biology); Path (computing); Set (abstract data type); Gradient descent; Pattern search; Mathematical optimization; Mathematics; Linear programming; Combinatorics; Artificial intelligence","score_opus":0.09351532284594812,"score_gpt":0.38810759047774884,"score_spread":0.29459226763180074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335583346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008847829,0.000081530794,0.98948514,0.00035164107,0.000027187887,0.0006368964,0.00018040022,0.00014834487,0.00024105262],"genre_scores_gemma":[0.13787116,0.00038065642,0.86021394,0.000027626087,0.000033225337,0.00007043872,0.0004068406,0.000056172383,0.00093992567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953259,0.0006358803,0.0012292572,0.001027369,0.0011225152,0.0006590602],"domain_scores_gemma":[0.9949093,0.0013488061,0.0005757821,0.0009659262,0.0017843748,0.00041579665],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093018624,0.0005227396,0.0012679246,0.0012575508,0.0007578759,0.00009674028,0.00054199254,0.0002777845,0.0012083107],"category_scores_gemma":[0.0004824117,0.0004773392,0.00038071047,0.0034972103,0.0005873274,0.00038000665,0.00036445283,0.000399115,0.0000035723206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017725467,0.0009090995,0.0042818296,0.0002089442,0.0009276824,0.000050954466,0.0016949401,0.9300783,0.0006302498,0.0018172378,0.000050714516,0.059172787],"study_design_scores_gemma":[0.0013826443,0.00018258566,0.0058122524,0.000054194163,0.00052898575,0.000020741794,0.00059900316,0.9863999,0.0026843003,0.0017998411,0.000030374455,0.00050516287],"about_ca_topic_score_codex":0.00011629713,"about_ca_topic_score_gemma":0.000051225266,"teacher_disagreement_score":0.12927116,"about_ca_system_score_codex":0.000096999596,"about_ca_system_score_gemma":0.0003802599,"threshold_uncertainty_score":0.99976784},"labels":[],"label_agreement":null},{"id":"W2337333577","doi":"","title":"Using schur complement theorem to prove convexity of some SOC-functions","year":2012,"lang":"en","type":"article","venue":"Journal of nonlinear and convex analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convexity; Schur complement; Complement (music); TRACE (psycholinguistics); Mathematics; Key (lock); Order (exchange); Schur's theorem; Pure mathematics; Algebra over a field; Computer science; Economics","score_opus":0.11571081486195213,"score_gpt":0.41786638552484795,"score_spread":0.30215557066289583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337333577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2628602,0.00023506537,0.7360551,0.00041512153,0.00008716441,0.00016717437,0.000053864387,0.000007803637,0.00011848551],"genre_scores_gemma":[0.6223239,0.00006711132,0.37694997,0.00011150817,0.00029061615,0.00000196712,0.000006702828,0.000019177041,0.00022908609],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846697,0.00010748505,0.00063566264,0.00009690681,0.0004691643,0.00022382654],"domain_scores_gemma":[0.99821657,0.00022223714,0.0004587193,0.00018304019,0.0006810953,0.00023834291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093660335,0.000112652866,0.000516271,0.0005061177,0.0000956598,0.00002359063,0.00012529637,0.00004544052,0.00034308227],"category_scores_gemma":[0.00028089192,0.00008862707,0.00023563992,0.0007169487,0.0000820172,0.00028608294,0.00007672207,0.00018441552,0.0000033418805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031472908,0.015876828,0.40816382,0.002006534,0.07284564,0.00010795983,0.027043898,0.14637399,0.04322044,0.18755767,0.005654635,0.08800129],"study_design_scores_gemma":[0.0049641104,0.0010159651,0.0062455055,0.0002149516,0.010431418,0.00018911867,0.012245393,0.913392,0.01639465,0.027720664,0.006119878,0.0010663518],"about_ca_topic_score_codex":0.000009800123,"about_ca_topic_score_gemma":0.0000046278938,"teacher_disagreement_score":0.767018,"about_ca_system_score_codex":0.000057655892,"about_ca_system_score_gemma":0.00007796679,"threshold_uncertainty_score":0.37565103},"labels":[],"label_agreement":null},{"id":"W2343774897","doi":"10.1088/978-1-627-05419-5ch3","title":"Equation solving with and without Solver","year":2014,"lang":"en","type":"book-chapter","venue":"Morgan & Claypool Publishers eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Problem solver; Solver; Computer science; Applied mathematics; Mathematics; Computational science; Programming language","score_opus":0.05593074504972567,"score_gpt":0.29016639399759314,"score_spread":0.23423564894786747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343774897","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009750212,0.00005893019,0.24213736,0.00023492023,0.00014097184,0.00111472,0.000013887096,0.00039950936,0.7558022],"genre_scores_gemma":[0.0022524586,0.000007575592,0.09319075,0.00029840425,0.00037168412,0.00006137486,0.00007553337,0.00049133983,0.9032509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661046,0.00006059048,0.0006387833,0.0009136626,0.001161344,0.00061515084],"domain_scores_gemma":[0.9970741,0.00032410637,0.0005773212,0.0009693022,0.0006936987,0.00036142024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006372573,0.0007032625,0.0007936554,0.0004970156,0.000293321,0.0009949384,0.00045828708,0.0006142505,0.0007028078],"category_scores_gemma":[0.00044537816,0.0006258503,0.00010387361,0.000050678835,0.00043532238,0.0005780692,0.00029968275,0.0010900022,0.000056865312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042621265,0.00008897323,0.00047624225,0.0015297225,0.001515766,0.00010134319,0.0031596,0.000420006,0.00017730835,0.7953153,0.09993487,0.09685466],"study_design_scores_gemma":[0.007018921,0.0009262894,0.00005388351,0.0017535237,0.00093064556,0.0002464752,0.00049086276,0.026848199,0.00046305606,0.5582486,0.3981355,0.004884048],"about_ca_topic_score_codex":0.000012431871,"about_ca_topic_score_gemma":0.00006307939,"teacher_disagreement_score":0.29820064,"about_ca_system_score_codex":0.00025042857,"about_ca_system_score_gemma":0.0003112079,"threshold_uncertainty_score":0.9996193},"labels":[],"label_agreement":null},{"id":"W2345492474","doi":"10.1007/s10589-016-9847-8","title":"On handling indicator constraints in mixed integer programming","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Integer programming; Context (archaeology); Mathematics; Mathematical optimization; Class (philosophy); Exploit; Integer (computer science); Block (permutation group theory); Linear programming; Upper and lower bounds; Nonlinear programming; IBM; Nonlinear system; Computer science; Artificial intelligence; Combinatorics","score_opus":0.03306497820491706,"score_gpt":0.34590252527156534,"score_spread":0.3128375470666483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345492474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005907861,0.000018100545,0.9971275,0.00085712486,0.000020196356,0.00068806997,0.000020412377,0.00009849873,0.00057934097],"genre_scores_gemma":[0.34312737,0.000038744543,0.655776,0.00014953836,0.00004448863,0.000547043,0.00006393085,0.000033174034,0.00021970054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988411,0.00005596606,0.00034442567,0.0003183093,0.00025216021,0.000188039],"domain_scores_gemma":[0.99835247,0.0011084019,0.00012620454,0.00014156275,0.0001639288,0.000107430154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021480542,0.00012886047,0.00014627047,0.00028569496,0.00014757385,0.00004686991,0.0001101839,0.00006795514,0.00021885411],"category_scores_gemma":[0.00032790974,0.00010345503,0.000026224327,0.00038665236,0.00020807734,0.00013986976,0.00004415666,0.00010208243,0.000031364867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013491276,0.00020159052,0.00026658332,0.000018277246,0.000013028391,0.0000011026372,0.0000791522,0.5523328,0.00001420858,0.36058104,0.00010662858,0.086372055],"study_design_scores_gemma":[0.002540103,0.000060558268,0.00051218853,0.00015961783,0.000011469624,0.000014978505,0.0001580163,0.7599111,0.000082662555,0.234542,0.001621265,0.00038601022],"about_ca_topic_score_codex":6.544719e-7,"about_ca_topic_score_gemma":0.0000020511438,"teacher_disagreement_score":0.3425366,"about_ca_system_score_codex":0.00008560547,"about_ca_system_score_gemma":0.00007377089,"threshold_uncertainty_score":0.42187735},"labels":[],"label_agreement":null},{"id":"W2401606618","doi":"10.1080/03155986.2006.11732745","title":"Sensitivity Analysis In Linear And Convex Quadratic Optimization: Invariant Active Constraint Set And Invariant Set Intervals<sup>*</sup>","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Invariant (physics); Quadratic equation; Sensitivity (control systems); Range (aeronautics); Mathematical optimization; Solution set; Regular polygon; Convex optimization; Applied mathematics; Set (abstract data type); Computer science","score_opus":0.06811401176435691,"score_gpt":0.37061929858539266,"score_spread":0.3025052868210357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401606618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18849583,0.00018220347,0.7988588,0.0018616301,0.00009047766,0.004176285,0.0011329344,0.00011204151,0.005089799],"genre_scores_gemma":[0.97405857,0.00013736486,0.024190683,0.00012239821,0.00009000311,0.0001956101,0.00079302496,0.000018938961,0.0003934231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963488,0.00062093826,0.0011501394,0.0003119256,0.0011318105,0.00043638013],"domain_scores_gemma":[0.9963034,0.0015142972,0.00020972399,0.00026272147,0.0015034636,0.00020640732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043079318,0.0002478341,0.0005284325,0.0013177785,0.00046486466,0.0008390924,0.00011017627,0.00021274434,0.00009485059],"category_scores_gemma":[0.0018175958,0.00022210773,0.00004463274,0.0012997267,0.0004111128,0.0026885178,0.00024473656,0.00050803175,0.000015172891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013362429,0.000053671105,0.0026386564,0.0003866138,0.00019780757,0.000019501165,0.0064028916,0.8817414,0.0000145304475,0.107109725,0.0005152673,0.00078629516],"study_design_scores_gemma":[0.0011941321,0.00007471322,0.0017215105,0.000093831,0.000025374646,0.00009204849,0.007464559,0.98775935,0.000028708577,0.000610903,0.0007008234,0.00023407361],"about_ca_topic_score_codex":0.0012392184,"about_ca_topic_score_gemma":0.0002584164,"teacher_disagreement_score":0.7855627,"about_ca_system_score_codex":0.00020178047,"about_ca_system_score_gemma":0.00036138197,"threshold_uncertainty_score":0.90572906},"labels":[],"label_agreement":null},{"id":"W2408426379","doi":"","title":"Linear transformations preserving log-convexity.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convexity; Mathematics; Applied mathematics","score_opus":0.08703235223288698,"score_gpt":0.33744867054440647,"score_spread":0.2504163183115195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408426379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25404793,0.00026124177,0.3735683,0.0010666059,0.00311796,0.0030197839,0.000055812412,0.0019374784,0.36292487],"genre_scores_gemma":[0.72173685,0.00008055867,0.27428046,0.00010132307,0.00002021685,0.00012615234,0.000019466686,0.000096508746,0.0035384437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987083,0.00008255248,0.00033401398,0.00019851756,0.00033819544,0.00033840715],"domain_scores_gemma":[0.9988524,0.00020688729,0.00008162974,0.00047051383,0.0002481091,0.00014050012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032009007,0.00014535377,0.00018905348,0.00012659139,0.00018017522,0.000021685086,0.00039337907,0.000098085155,0.001160919],"category_scores_gemma":[0.0004646727,0.00014463229,0.00006900292,0.0003758246,0.000074929485,0.00047853915,0.000092737784,0.00026373696,0.00019412952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020028072,0.00029924384,0.00037607082,0.000073900505,0.0000406268,0.000009057886,0.0029552085,0.00004610849,0.00004521953,0.993048,0.0023069584,0.00077954703],"study_design_scores_gemma":[0.00075692375,0.00006183773,0.0002037167,0.000021628506,0.000014133953,0.000005596481,0.00019082947,0.015027393,0.0031722223,0.97922975,0.0011331614,0.00018283278],"about_ca_topic_score_codex":0.000017053968,"about_ca_topic_score_gemma":0.000005904674,"teacher_disagreement_score":0.46768892,"about_ca_system_score_codex":0.000054969296,"about_ca_system_score_gemma":0.00005694379,"threshold_uncertainty_score":0.99975216},"labels":[],"label_agreement":null},{"id":"W2468783835","doi":"","title":"A Short Proof on the Cardinality of Maximal Positive Bases","year":2010,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cardinality (data modeling); Mathematical proof; Mathematics; Bounded function; Simple (philosophy); Discrete mathematics; Basis (linear algebra); Combinatorics; Linear programming; Linear span; Set (abstract data type); Property (philosophy); Upper and lower bounds; Algorithm; Computer science","score_opus":0.025367167461608414,"score_gpt":0.2993742612800309,"score_spread":0.2740070938184225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468783835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08914497,0.0011813669,0.862931,0.034846555,0.0005442083,0.0039604274,0.0010461143,0.00032298843,0.006022335],"genre_scores_gemma":[0.6633685,0.00024052469,0.32381362,0.0011296225,0.0004033595,0.00092774373,0.000041604166,0.00019586462,0.009879138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954697,0.0006412832,0.00093594944,0.00066039857,0.0011555201,0.001137156],"domain_scores_gemma":[0.9945467,0.0018687102,0.00038386093,0.0019094402,0.00086348504,0.000427769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023090634,0.00058021105,0.0007486069,0.00038759387,0.00041576248,0.00016321844,0.0009978447,0.0006103441,0.0005942344],"category_scores_gemma":[0.0035046283,0.00048738436,0.00043087304,0.0010048092,0.0009107998,0.00037911496,0.0004633567,0.002108494,0.000034486162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006124385,0.0030330336,0.00856787,0.0004974,0.00048728872,0.00021849196,0.0011038124,0.0075447974,0.013170047,0.8462055,0.0095983,0.108961076],"study_design_scores_gemma":[0.0012169266,0.0012786982,0.024603967,0.0008516054,0.00039564315,0.0005635342,0.0009716026,0.49469602,0.3887023,0.07524503,0.009834256,0.0016404106],"about_ca_topic_score_codex":0.0029446168,"about_ca_topic_score_gemma":0.0017993872,"teacher_disagreement_score":0.77096045,"about_ca_system_score_codex":0.00050766085,"about_ca_system_score_gemma":0.00054532813,"threshold_uncertainty_score":0.99975777},"labels":[],"label_agreement":null},{"id":"W2469729643","doi":"","title":"A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs","year":2012,"lang":"en","type":"article","venue":"Pacific Journal of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Complementarity (molecular biology); Smoothing; Mathematical optimization; Complementarity theory; Residual; Mathematics; Regular polygon; Applied mathematics; Computer science; Mixed complementarity problem; Convex function; Algorithm; Statistics; Geometry","score_opus":0.1889772870255407,"score_gpt":0.46561618041548986,"score_spread":0.2766388933899492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469729643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008513097,0.00028463083,0.99771947,0.0002940224,0.00023311102,0.0003347206,0.000038961705,0.000015246043,0.00022851201],"genre_scores_gemma":[0.040168226,0.00029894695,0.9590173,0.000020427477,0.00013039175,0.0000118130465,0.000052662836,0.000027993825,0.00027226112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.0004138182,0.00044356842,0.00012322109,0.00021642467,0.0002564346],"domain_scores_gemma":[0.9973817,0.0014142345,0.00038332137,0.000110017856,0.0005509447,0.00015977996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033240216,0.00012669097,0.00025077094,0.00019925843,0.00028609822,0.000057266785,0.000059757167,0.00007325873,0.000070918126],"category_scores_gemma":[0.0015654663,0.00011430444,0.00004986721,0.00018316113,0.00008008127,0.0004520885,0.000036349396,0.00018796747,7.8155597e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003569352,0.0049573164,0.068353936,0.0010515571,0.0018169284,0.0000038563094,0.013469903,0.36660114,0.0019918885,0.045489732,0.05470362,0.43799078],"study_design_scores_gemma":[0.0043444606,0.0008553328,0.007406524,0.00009914052,0.00022427794,0.00010299119,0.0025152788,0.96754855,0.00048471187,0.012916961,0.0029915923,0.0005101959],"about_ca_topic_score_codex":0.0000043214554,"about_ca_topic_score_gemma":0.0000038012658,"teacher_disagreement_score":0.6009474,"about_ca_system_score_codex":0.00010544705,"about_ca_system_score_gemma":0.00004295964,"threshold_uncertainty_score":0.46611997},"labels":[],"label_agreement":null},{"id":"W2475971337","doi":"10.1090/cln/020/06","title":"Description of the global set of solutions","year":2010,"lang":"en","type":"book-chapter","venue":"Courant lecture notes in mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Set (abstract data type); Computer science; Programming language","score_opus":0.08618779161396714,"score_gpt":0.33422315411977344,"score_spread":0.2480353625058063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475971337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002562498,0.00036778944,0.9702126,0.00031231804,0.0003422885,0.0011343728,0.0004453977,0.000047048306,0.02688193],"genre_scores_gemma":[0.034504484,0.00038474036,0.9537885,0.00004213943,0.00023696136,0.00003735895,0.00005304874,0.00022089695,0.010731848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975374,0.000045295208,0.000994961,0.000258281,0.00085681136,0.00030728793],"domain_scores_gemma":[0.9963845,0.0010707288,0.00093605625,0.0010178436,0.00053637207,0.000054527525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056247425,0.00036411628,0.0007576046,0.00015952569,0.000090429814,0.000016631906,0.0006494837,0.0006909723,0.0003250274],"category_scores_gemma":[0.0027601442,0.00026505935,0.00029082777,0.0002099541,0.00048944843,0.000059720245,0.00025794355,0.0009809482,0.0000085152005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050722243,0.00039117347,0.00010025491,0.004953157,0.00030933134,0.000010612746,0.0032184164,0.010527101,0.0027575498,0.97226226,0.00026748626,0.0051519014],"study_design_scores_gemma":[0.00030076018,0.000028556915,0.000008603865,0.00091161137,0.00010897594,0.000031344378,0.000018500557,0.008574802,0.0011202263,0.98808604,0.00058019604,0.00023037077],"about_ca_topic_score_codex":0.0000050894164,"about_ca_topic_score_gemma":0.000259056,"teacher_disagreement_score":0.034248233,"about_ca_system_score_codex":0.0002005468,"about_ca_system_score_gemma":0.00024913726,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W2478833398","doi":"","title":"Un algorithme pour la bipartition d'un graphe en sous-graphes de cardinalité fixée","year":2001,"lang":"fr","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Humanities; Philosophy; Combinatorics; Physics; Mathematics","score_opus":0.017361170334261388,"score_gpt":0.26573282135843457,"score_spread":0.2483716510241732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478833398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02268266,0.0072560245,0.8605096,0.00770134,0.0007050996,0.0017902391,0.001717953,0.0013351424,0.09630195],"genre_scores_gemma":[0.02102538,0.0049449084,0.87274235,0.0003381889,0.0011962486,0.00031122734,0.00056990254,0.0006436243,0.09822815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936205,0.0005775961,0.0016683501,0.0009978605,0.0013375655,0.0017981279],"domain_scores_gemma":[0.99336666,0.0033759132,0.0006463258,0.0014296325,0.0002790461,0.0009024064],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008070328,0.0010840129,0.0012067336,0.0006838112,0.00039951413,0.0016741299,0.0012600868,0.00080042164,0.003929071],"category_scores_gemma":[0.0013829643,0.0011321758,0.000766297,0.0021856828,0.00064593105,0.0050019394,0.00073544803,0.0010886726,0.0011674007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683286,0.015167291,0.010634124,0.0073805735,0.003562279,0.0045049754,0.017694917,0.0046635945,0.00029811158,0.54429644,0.13104033,0.26063052],"study_design_scores_gemma":[0.0016369334,0.0002349988,0.00041099126,0.0010826121,0.0002451793,0.0016259777,0.0013076157,0.072366156,0.002329632,0.8588247,0.05851951,0.0014157491],"about_ca_topic_score_codex":0.000013740765,"about_ca_topic_score_gemma":0.0000015747694,"teacher_disagreement_score":0.3145282,"about_ca_system_score_codex":0.00017944409,"about_ca_system_score_gemma":0.00044781348,"threshold_uncertainty_score":0.9996103},"labels":[],"label_agreement":null},{"id":"W2487610327","doi":"10.1137/1.9781611974362.ch9","title":"Chapter 9: R&amp;D Directions","year":2016,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Global Risk Institute in Financial Services; University of Waterloo","funders":"","keywords":"Automatic differentiation; MATLAB; Computer science; Minification; Nonlinear system; Algorithm; Operating system; Programming language; Physics","score_opus":0.1649873845764309,"score_gpt":0.33392768340045703,"score_spread":0.16894029882402614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487610327","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010132717,0.00006446159,0.0960171,0.00020614875,0.0002418734,0.002778325,0.000499531,0.00029301347,0.8998894],"genre_scores_gemma":[0.000011664885,0.00013935639,0.24489278,0.000055782384,0.0009547867,0.0003109412,0.000031185224,0.00023840075,0.7533651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976901,0.0000039474785,0.00074683176,0.00057631487,0.00050773256,0.00047507175],"domain_scores_gemma":[0.9974308,0.0010655967,0.0005233434,0.00055162085,0.00020502596,0.00022361713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004796815,0.00059073634,0.0008279235,0.00009667832,0.00046536574,0.000090926085,0.00025334297,0.0010393019,0.00036376066],"category_scores_gemma":[0.00013671786,0.00047524588,0.0006294001,0.000020789435,0.00040482264,0.00004019638,0.00022591645,0.00066127407,0.00005284166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020974583,0.000024875499,1.76597e-8,0.00022098904,0.0003265389,2.7342523e-7,0.00045394662,6.8392865e-7,0.000098914825,0.96107,0.006353114,0.03142965],"study_design_scores_gemma":[0.0010836931,0.000030203648,3.2288696e-9,0.00021245351,0.00017463345,0.000005867786,0.00006891549,0.000044679753,0.0001794053,0.66243595,0.33534378,0.00042041607],"about_ca_topic_score_codex":3.427588e-7,"about_ca_topic_score_gemma":0.000002513679,"teacher_disagreement_score":0.32899067,"about_ca_system_score_codex":0.00012210409,"about_ca_system_score_gemma":0.0001062011,"threshold_uncertainty_score":0.9997699},"labels":[],"label_agreement":null},{"id":"W2488047402","doi":"","title":"PythNon : A PSE for the Numerical Solution of Nonlinear Algebraic Equations","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Solver; Computer science; A priori and a posteriori; Software; Nonlinear system; Algebraic number; Algebraic equation; Newton's method; Convergence (economics); Numerical analysis; Process (computing); Applied mathematics; Calculus (dental); Mathematical optimization; Mathematics; Programming language","score_opus":0.13693615081524574,"score_gpt":0.39377913190855557,"score_spread":0.25684298109330983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488047402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053467427,0.00003210575,0.9966073,0.0015861099,0.00003533313,0.0005422633,0.0000126230525,0.000059330057,0.0005902354],"genre_scores_gemma":[0.05925706,0.000044378645,0.93562764,0.00008740166,0.000086170425,0.00013293333,0.000014124008,0.000028106637,0.004722185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991716,0.000027557748,0.0002462057,0.00011725536,0.00026533843,0.00017204703],"domain_scores_gemma":[0.99759656,0.0017449614,0.00007935088,0.00025880782,0.00028037012,0.000039926126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020180258,0.00007056838,0.00012336398,0.00005658644,0.00021006615,0.0000050783538,0.0001477124,0.0000427629,0.00023482493],"category_scores_gemma":[0.0017631449,0.00004743244,0.00007481004,0.00028509318,0.00010726395,0.00008664905,0.00004490146,0.00008162164,0.000018489272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045046804,0.0033389817,0.0002765525,0.00041173716,0.0005096498,0.000009785489,0.009562647,0.06343657,0.0058866916,0.80517834,0.03923234,0.07170625],"study_design_scores_gemma":[0.00046450231,0.0000678164,0.000027831085,0.0000048433053,0.000013738692,0.000006135164,0.00011218358,0.9832003,0.0018654106,0.012581933,0.001585251,0.000070072296],"about_ca_topic_score_codex":0.000013706456,"about_ca_topic_score_gemma":0.0000051828256,"teacher_disagreement_score":0.91976374,"about_ca_system_score_codex":0.000031562235,"about_ca_system_score_gemma":0.00007833785,"threshold_uncertainty_score":0.25711682},"labels":[],"label_agreement":null},{"id":"W2489524361","doi":"10.1142/9789812813220_0002","title":"Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix","year":2008,"lang":"en","type":"book-chapter","venue":"Statistical science and interdisciplinary research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of New Brunswick","funders":"","keywords":"Unimodular matrix; Coefficient matrix; Matrix (chemical analysis); Mathematics; Combinatorics; Physics; Chemistry","score_opus":0.13246351186516667,"score_gpt":0.46348078738345616,"score_spread":0.3310172755182895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489524361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010464056,0.00034135376,0.8633461,0.0009739859,0.00015430048,0.0052672867,0.00069976563,0.00018850669,0.1279823],"genre_scores_gemma":[0.014049454,0.0007028785,0.71909034,0.00002758492,0.00045969992,0.00042964792,0.0003226219,0.0003317097,0.26458606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929038,0.00006972585,0.0006198044,0.0013729107,0.003624958,0.0014087928],"domain_scores_gemma":[0.9938305,0.0014114892,0.00014755967,0.0006583045,0.003270947,0.00068119547],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0030475939,0.00044294386,0.0006677139,0.0007270132,0.0019581364,0.00032457756,0.0009159908,0.00023592991,0.0002347002],"category_scores_gemma":[0.0010729703,0.0003362429,0.0000759382,0.0005698882,0.0068223756,0.00031911087,0.0021168743,0.0011959493,0.0000524081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001064052,0.00078997423,0.000016329088,0.0015947955,0.00015837181,0.0008392347,0.002158944,0.0010459009,0.00030529662,0.91377443,0.00877505,0.06947761],"study_design_scores_gemma":[0.0022318265,0.008763472,0.00004376423,0.0020128356,0.00008507676,0.00042924806,0.0013588265,0.47234765,0.00023955962,0.4732728,0.037401367,0.0018135773],"about_ca_topic_score_codex":0.000005133808,"about_ca_topic_score_gemma":0.000014388381,"teacher_disagreement_score":0.47130176,"about_ca_system_score_codex":0.00045705875,"about_ca_system_score_gemma":0.0011763788,"threshold_uncertainty_score":0.999909},"labels":[],"label_agreement":null},{"id":"W2503579525","doi":"10.4208/nmtma.2015.w08si","title":"Multigrid Methods with Newton-Gauss-Seidel Smoothing and Constraint Preserving Interpolation for Obstacle Problems","year":2015,"lang":"en","type":"article","venue":"Numerical Mathematics Theory Methods and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multigrid method; Discretization; Gauss–Seidel method; Interpolation (computer graphics); Mathematics; Obstacle problem; Mathematical optimization; Operator (biology); Smoothing; Grid; Convergence (economics); Applied mathematics; Computer science; Partial differential equation; Iterative method; Mathematical analysis; Variational inequality; Geometry; Artificial intelligence","score_opus":0.14320648616150364,"score_gpt":0.48257838369173195,"score_spread":0.33937189753022834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503579525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018915834,0.00025543766,0.9956262,0.0003756205,0.00002118929,0.0021405437,0.000024302444,0.0001528368,0.0012147248],"genre_scores_gemma":[0.0008150563,0.000028122924,0.9970816,0.00005686645,0.000059178787,0.0014131656,0.000011168872,0.00007474278,0.00046014413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978469,0.00054462807,0.0005807153,0.0004574267,0.00023350069,0.000336818],"domain_scores_gemma":[0.99109435,0.0073907627,0.00032127657,0.0004772255,0.00039427032,0.00032213712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400698,0.00026257962,0.00047188965,0.00011698727,0.00027185,0.0001354609,0.00022548156,0.000117904034,0.000025524625],"category_scores_gemma":[0.003246996,0.00020493254,0.000053035295,0.00033866073,0.00030815133,0.00023256717,0.00018654174,0.00026162528,0.000001579144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045740017,0.00024299472,0.00002490376,0.0005307689,0.0000864621,3.1398608e-7,0.003487115,0.0005972027,0.0015316202,0.80761325,0.000068877795,0.18577074],"study_design_scores_gemma":[0.0005122236,0.000079111014,0.000004221978,0.00005984039,0.00005789702,0.00002659452,0.0022738806,0.34111372,0.0006197621,0.6520011,0.0030571863,0.00019444959],"about_ca_topic_score_codex":0.000005100845,"about_ca_topic_score_gemma":9.564839e-7,"teacher_disagreement_score":0.3405165,"about_ca_system_score_codex":0.000051449748,"about_ca_system_score_gemma":0.00006959386,"threshold_uncertainty_score":0.8356906},"labels":[],"label_agreement":null},{"id":"W2507740005","doi":"10.1007/s11590-016-1080-y","title":"Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; University of Guilan","keywords":"Trust region; Conic section; Mathematical optimization; Lemma (botany); Parametrization (atmospheric modeling); Mathematics; Computational intelligence; Class (philosophy); Nonlinear system; Relaxation (psychology); Nonlinear programming; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.06480907493608071,"score_gpt":0.34428207647009645,"score_spread":0.2794730015340158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507740005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017334839,0.000011258561,0.9884798,0.00719107,0.00014720958,0.001536242,0.000026661373,0.0002726611,0.0006016109],"genre_scores_gemma":[0.15286463,0.00008093377,0.8410815,0.0009595456,0.00028605602,0.00052928616,0.00014757056,0.00019152403,0.0038589383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978658,0.000114144896,0.000575315,0.00049435184,0.00042638875,0.00052397465],"domain_scores_gemma":[0.9979053,0.00071316434,0.00036226437,0.0004968725,0.00038674474,0.00013566455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003848357,0.00027229136,0.0003031243,0.0002746022,0.00026448516,0.0000905142,0.0002469879,0.00012300568,0.00019281938],"category_scores_gemma":[0.000669727,0.00021741653,0.00013574131,0.00036848348,0.00006974967,0.00083159766,0.00005576602,0.00010846214,0.000019782638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021100833,0.0000994303,0.000121531535,0.00009442851,0.00006239217,0.0000041189933,0.00021016227,0.94176006,0.002236215,0.04343552,0.005629482,0.0061356523],"study_design_scores_gemma":[0.0058686584,0.00008502856,0.000019062005,0.00010639535,0.00004367143,0.000012947997,0.000040158444,0.978802,0.0015843606,0.011919971,0.0010551162,0.0004626082],"about_ca_topic_score_codex":0.0000039867273,"about_ca_topic_score_gemma":0.0000037151322,"teacher_disagreement_score":0.15113115,"about_ca_system_score_codex":0.00035618542,"about_ca_system_score_gemma":0.00006789496,"threshold_uncertainty_score":0.8865989},"labels":[],"label_agreement":null},{"id":"W25085825","doi":"10.1023/a:1008328726430","title":"A Decomposition Method for Global and Local Quadratic Minimization","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maxima and minima; Mathematics; Dimension (graph theory); Mathematical optimization; Decomposition; Linear programming; Decomposition method (queueing theory); Quadratic programming; Quadratic equation; Applied mathematics; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02473843642493805,"score_gpt":0.4079432596196537,"score_spread":0.38320482319471566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25085825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014903825,0.00014900626,0.99640024,0.0006430813,0.000105537205,0.0004137981,0.000033958102,0.00003178976,0.00073221436],"genre_scores_gemma":[0.010509007,0.00018371874,0.988913,0.00012836188,0.00011870427,0.000010156338,0.00002108755,0.00001883653,0.0000971071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998232,0.00017812137,0.000734293,0.00019154076,0.00042872087,0.00023530929],"domain_scores_gemma":[0.9982778,0.0002430576,0.00042558898,0.00012932738,0.00075354485,0.00017069507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004998717,0.00017318089,0.00033969598,0.00005767019,0.00013883434,0.00009505205,0.00014362589,0.00013329575,0.00020032049],"category_scores_gemma":[0.0004453015,0.00016094395,0.000105854626,0.00050541945,0.00006310657,0.0005847186,0.00002034015,0.00009332052,0.0000021339165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040447278,0.0001502599,0.00017688685,0.000052368418,0.00005688653,0.0000053977196,0.00004970567,0.92016757,0.000004948588,0.008662635,0.000886592,0.0693823],"study_design_scores_gemma":[0.0018776937,0.00033309546,0.00015276254,0.000066434855,0.0001015792,0.00033287998,0.00009211994,0.9576825,0.000034136625,0.038777668,0.00039373524,0.00015540223],"about_ca_topic_score_codex":0.0000036256667,"about_ca_topic_score_gemma":0.0000072533912,"teacher_disagreement_score":0.069226906,"about_ca_system_score_codex":0.0004508712,"about_ca_system_score_gemma":0.000136941,"threshold_uncertainty_score":0.6563104},"labels":[],"label_agreement":null},{"id":"W2511419272","doi":"10.1109/cicn.2015.237","title":"An Interior Point Method for Large Scale Linear Feasibility Problems","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Linear programming; Convergence (economics); Mathematical optimization; Point (geometry); Computer science; Set (abstract data type); Scale (ratio); Algorithm; Mathematics","score_opus":0.16666261114684908,"score_gpt":0.4805207972896432,"score_spread":0.31385818614279415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511419272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013969959,0.000009195421,0.994791,0.00040475736,0.0000711221,0.0013529246,0.00004276374,0.00022840868,0.0017028317],"genre_scores_gemma":[0.0024756673,0.0000014957548,0.9927006,0.000115801464,0.00008204885,0.0001426715,0.000023928511,0.000044737943,0.0044130823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985075,0.00016193763,0.0003330637,0.00035185754,0.0002911862,0.000354429],"domain_scores_gemma":[0.9981397,0.0002550921,0.000074881624,0.0005621363,0.0006733827,0.00029485597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002285292,0.00013323616,0.00024514028,0.0000723878,0.00006981301,0.000042094638,0.00024749996,0.00008262025,0.0002891977],"category_scores_gemma":[0.0014944401,0.000107423366,0.000068975394,0.00017845434,0.000026717142,0.00031523276,0.00010880548,0.00013026563,0.000035021872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052478597,0.027552636,0.011137597,0.0068204342,0.00087766,0.00004355605,0.09112338,0.05232104,0.02732588,0.487003,0.14983398,0.14071298],"study_design_scores_gemma":[0.0017424321,0.00034752997,0.000009472131,0.000013775779,0.000009701462,0.0000057489106,0.0013727313,0.8632616,0.0042811814,0.12512475,0.0036489405,0.00018217198],"about_ca_topic_score_codex":0.000009094696,"about_ca_topic_score_gemma":0.00010812106,"teacher_disagreement_score":0.8109405,"about_ca_system_score_codex":0.00013447496,"about_ca_system_score_gemma":0.00009640239,"threshold_uncertainty_score":0.43805978},"labels":[],"label_agreement":null},{"id":"W2513208540","doi":"10.1155/2016/5017369","title":"Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions","year":2016,"lang":"en","type":"article","venue":"Advances in Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subadditivity; Knapsack problem; Integer (computer science); Integer programming; Mathematics; Generator (circuit theory); Duality (order theory); Linear programming; Class (philosophy); Discrete mathematics; Mathematical optimization; Combinatorics; Computer science; Power (physics)","score_opus":0.24570995910870164,"score_gpt":0.5069657763647945,"score_spread":0.2612558172560928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513208540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031773277,0.0005157312,0.96449155,0.0005897496,0.0001468721,0.0019182032,0.00039674446,0.00005602443,0.000111821355],"genre_scores_gemma":[0.08545673,0.00058282085,0.9098945,0.000008418979,0.0001907648,0.0014684862,0.0000932605,0.000072200084,0.0022327893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683934,0.0005561779,0.00074537547,0.0005328814,0.0006669833,0.00065925386],"domain_scores_gemma":[0.99471587,0.0020732044,0.00007476595,0.00053421047,0.0024693739,0.00013256604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019988064,0.0001871858,0.00035450762,0.00060074177,0.00045793917,0.00006002654,0.00036326915,0.00012288503,0.00026599667],"category_scores_gemma":[0.0068328776,0.00013929061,0.00009617006,0.0012597999,0.00057057146,0.0009791869,0.00015918243,0.00028476457,0.00001319882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010823462,0.0026182625,0.0016822388,0.0006403267,0.00024050797,0.00001506517,0.0017295785,0.5364303,0.13975176,0.14713354,0.001976683,0.1666994],"study_design_scores_gemma":[0.0037010193,0.00046162072,0.00003484739,0.00037822692,0.000027382232,0.000009682259,0.00187914,0.7923366,0.15436018,0.017034376,0.02914264,0.00063431106],"about_ca_topic_score_codex":0.000051040905,"about_ca_topic_score_gemma":0.00047934087,"teacher_disagreement_score":0.25590628,"about_ca_system_score_codex":0.00036504216,"about_ca_system_score_gemma":0.00033246313,"threshold_uncertainty_score":0.8180086},"labels":[],"label_agreement":null},{"id":"W2517321039","doi":"10.1007/s10589-018-0020-4","title":"A progressive barrier derivative-free trust-region algorithm for constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Trust region; Mathematical optimization; Mathematics; Quadratic equation; Domain (mathematical analysis); Quadratic programming; Constrained optimization; Constrained optimization problem; Derivative (finance); Software; Optimization problem; Algorithm; Computer science","score_opus":0.038247387429913716,"score_gpt":0.3552282416599088,"score_spread":0.31698085422999506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517321039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027148611,0.000067781366,0.99499214,0.00081425725,0.00005610909,0.0026338648,0.00018673258,0.00026737896,0.00095457915],"genre_scores_gemma":[0.0020030015,0.000027058379,0.99420553,0.00027620723,0.00037536694,0.001787284,0.0006483751,0.00007079022,0.000606383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980991,0.00007729104,0.00054984103,0.0005773253,0.00036925805,0.00032719673],"domain_scores_gemma":[0.99642235,0.0006831753,0.00034034663,0.00036859652,0.0019709368,0.00021459606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021462506,0.00027219823,0.00027479517,0.00021474452,0.0008168879,0.0001546114,0.0002888298,0.00014525645,0.0002776116],"category_scores_gemma":[0.00053588336,0.00028390135,0.00007491846,0.0007259966,0.00059422944,0.00038412993,0.00012209434,0.00012218622,0.000007172837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002877297,0.00016992015,0.000020331876,0.000037093138,0.000059518617,0.0000010233401,0.00020513387,0.87972105,0.0000039193014,0.08901005,0.0012195188,0.029523661],"study_design_scores_gemma":[0.0017893475,0.0001111727,0.000011790395,0.00002374848,0.000036084686,0.000039078473,0.00015219902,0.9209937,0.0000627295,0.07493804,0.0015583085,0.00028379646],"about_ca_topic_score_codex":8.370119e-7,"about_ca_topic_score_gemma":5.2320445e-7,"teacher_disagreement_score":0.041272655,"about_ca_system_score_codex":0.0000885112,"about_ca_system_score_gemma":0.00019428185,"threshold_uncertainty_score":0.9999613},"labels":[],"label_agreement":null},{"id":"W2521729967","doi":"10.1016/j.dam.2016.09.008","title":"On semidefinite least squares and minimal unsatisfiability","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjunctive normal form; Satisfiability; Semidefinite programming; Semidefinite embedding; Positive-definite matrix; Quadratically constrained quadratic program; Combinatorics; Connection (principal bundle); Explained sum of squares; Discrete mathematics; Mathematical optimization; Quadratic programming","score_opus":0.03465292663337363,"score_gpt":0.3217420098769667,"score_spread":0.28708908324359306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521729967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16644917,0.00003290306,0.7914923,0.0009255947,0.00006857916,0.0014598699,0.00019645455,0.0004589757,0.038916156],"genre_scores_gemma":[0.42285362,0.00006113527,0.5749473,0.000103499966,0.000068132846,0.00020524791,0.000009105074,0.00012786989,0.0016240797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790823,0.000038541326,0.0005344847,0.0004736475,0.00058808544,0.00045699682],"domain_scores_gemma":[0.99600536,0.002768749,0.00020316895,0.0007259503,0.00009847377,0.00019829985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913098,0.00031710963,0.0004282265,0.00012853503,0.00015214103,0.000058702793,0.00024491697,0.00012968018,0.0005390171],"category_scores_gemma":[0.0013197146,0.00020686178,0.00006771484,0.00020721057,0.0003143426,0.00012292633,0.00018318217,0.00017433622,0.00016021737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006630986,0.00018969733,0.00004769754,0.00033667742,0.000042523152,0.000004243373,0.0007404341,0.000027807151,0.003666181,0.9826235,0.00090696703,0.011347916],"study_design_scores_gemma":[0.0012804787,0.00011460238,0.00012957201,0.0001822424,0.000033281034,0.0000108082795,0.00055697496,0.002485753,0.0037996522,0.99062806,0.000338218,0.0004403328],"about_ca_topic_score_codex":9.285572e-7,"about_ca_topic_score_gemma":0.0000025893498,"teacher_disagreement_score":0.25640443,"about_ca_system_score_codex":0.000081110695,"about_ca_system_score_gemma":0.000036550737,"threshold_uncertainty_score":0.84355783},"labels":[],"label_agreement":null},{"id":"W2533553031","doi":"10.1007/s10107-020-01484-3","title":"Outer-product-free sets for polynomial optimization and oracle-based cuts","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Polyhedron; Intersection (aeronautics); Mathematics; Cutting-plane method; Oracle; Extreme point; Relaxation (psychology); Dimension (graph theory); Product (mathematics); Combinatorics; Set (abstract data type); Convex polytope; Feasible region; Point (geometry); Regular polygon; Convex set; Mathematical optimization; Integer programming; Convex optimization; Computer science; Geometry","score_opus":0.11206493720119073,"score_gpt":0.39028093408065234,"score_spread":0.27821599687946164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533553031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019135381,0.00013545668,0.98958755,0.004262137,0.00019100211,0.0046225255,0.00012156567,0.0006281406,0.00026025373],"genre_scores_gemma":[0.002361012,0.000013073165,0.9952979,0.0001163324,0.00034847428,0.0011746449,0.0002162417,0.00023677289,0.0002355646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961905,0.00014215756,0.0010134241,0.0011573285,0.0007649323,0.0007316787],"domain_scores_gemma":[0.99608415,0.0013226406,0.00048182564,0.0012693324,0.00043994753,0.00040210586],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008583447,0.0006137067,0.0009924554,0.0002199304,0.00024722863,0.00049339246,0.0007952077,0.0004081666,0.000111956164],"category_scores_gemma":[0.008901063,0.0005938863,0.00024827535,0.00027455745,0.00024982783,0.00016186142,0.0014554111,0.00083754474,0.000015833846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015335493,0.004097148,0.00006978488,0.089985594,0.0016458775,0.00025644482,0.0073152864,0.32411715,0.00021504848,0.08641233,0.03267076,0.45168102],"study_design_scores_gemma":[0.0012847717,0.00011834621,4.8910636e-7,0.0003796355,0.00014653878,0.000010335527,0.00008021881,0.76474714,0.0002913468,0.23099135,0.0014002096,0.0005496112],"about_ca_topic_score_codex":0.0000030653184,"about_ca_topic_score_gemma":0.0000018839248,"teacher_disagreement_score":0.4511314,"about_ca_system_score_codex":0.00022093917,"about_ca_system_score_gemma":0.00029013236,"threshold_uncertainty_score":0.99965125},"labels":[],"label_agreement":null},{"id":"W2533886758","doi":"10.82308/22860","title":"Numerical methods for box-constrained integer least squares problems","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Mathematics; Lattice reduction; Mathematical optimization; Reduction (mathematics); Integer (computer science); Search algorithm; Integer programming; Computer science; MIMO","score_opus":0.08742524092735149,"score_gpt":0.37654768218254436,"score_spread":0.2891224412551929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533886758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07005994,0.0007879397,0.7811812,0.0010184934,0.0023530673,0.014188825,0.002752428,0.004811917,0.12284619],"genre_scores_gemma":[0.15029633,0.000077091565,0.84422195,0.00022706614,0.00006337175,0.000629896,0.000052111744,0.00024901255,0.004183137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953135,0.0007163444,0.0010626103,0.0010152032,0.0007476137,0.0011447079],"domain_scores_gemma":[0.9949431,0.002369286,0.00036542962,0.00088245544,0.0008957722,0.00054399815],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017975334,0.0005986103,0.00082806667,0.00038018334,0.0014252762,0.0000627047,0.0007569992,0.00038319777,0.00055697846],"category_scores_gemma":[0.008191552,0.0005714285,0.000407166,0.00092713296,0.00035065814,0.0008778107,0.00025412018,0.0010828417,0.00015189574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036816145,0.0013160863,0.00005237316,0.00066735665,0.00043026687,0.00009482045,0.00006462808,0.0045487476,0.02040679,0.54013014,0.00010547893,0.43181515],"study_design_scores_gemma":[0.005787461,0.00088010717,0.00006054352,0.00030285274,0.00014850406,0.00073930336,0.00033337952,0.03726288,0.10495125,0.67980886,0.16736393,0.0023609658],"about_ca_topic_score_codex":0.000026076767,"about_ca_topic_score_gemma":0.000012212837,"teacher_disagreement_score":0.42945418,"about_ca_system_score_codex":0.00052820315,"about_ca_system_score_gemma":0.0000922012,"threshold_uncertainty_score":0.9998747},"labels":[],"label_agreement":null},{"id":"W2535613293","doi":"10.1007/s00332-017-9421-2","title":"Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz System","year":2017,"lang":"en","type":"article","venue":"Journal of Nonlinear Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Mathematical Sciences","keywords":"Bounding overwatch; Upper and lower bounds; Interval (graph theory); Chaotic; Parametric statistics; Quartic function; Nonlinear system; Interval arithmetic; Lyapunov function","score_opus":0.11443453599138853,"score_gpt":0.4174617237783121,"score_spread":0.30302718778692356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535613293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90632725,0.00006378612,0.09148343,0.00021665798,0.00094381336,0.0003296777,0.000007344379,0.000017411796,0.0006106358],"genre_scores_gemma":[0.55138,0.0000110167275,0.44832546,0.0000058776977,0.00012686779,6.1479506e-7,5.975502e-8,0.000013483535,0.0001366634],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746144,0.00006147617,0.0005661529,0.00014886902,0.001460731,0.00030131717],"domain_scores_gemma":[0.9965464,0.00013950575,0.0016213936,0.0005878431,0.0009778573,0.00012698406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025791076,0.00010563046,0.0002584417,0.00020397619,0.0009481655,0.00032644407,0.0015776061,0.000036854548,0.000005203514],"category_scores_gemma":[0.0025816949,0.000067297944,0.00010460892,0.00039602435,0.00074525696,0.0008216399,0.00036539775,0.00027438835,0.0000014029858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008927774,0.0054647364,0.16190691,0.0066185985,0.0012628732,0.001325733,0.04440724,0.19826749,0.32735607,0.072873004,0.0006688198,0.17895575],"study_design_scores_gemma":[0.0026421014,0.0004141217,0.00277384,0.0034188428,0.00014717289,0.0013213205,0.0037918228,0.9152773,0.0631316,0.005203508,0.0013179765,0.0005604043],"about_ca_topic_score_codex":0.000008626382,"about_ca_topic_score_gemma":0.000003303367,"teacher_disagreement_score":0.7170098,"about_ca_system_score_codex":0.0002616521,"about_ca_system_score_gemma":0.00047501543,"threshold_uncertainty_score":0.7292618},"labels":[],"label_agreement":null},{"id":"W2546659876","doi":"10.1007/s11228-016-0394-3","title":"Computing Proximal Points of Convex Functions with Inexact Subgradients","year":2016,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Bounded function; Mathematical optimization; Function (biology); Subderivative; Saddle point; Point (geometry); Regular polygon; Convex function; Oracle; Minification; Convex optimization; Applied mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.03364518097489857,"score_gpt":0.32039651373612477,"score_spread":0.2867513327612262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546659876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073005766,0.0000114355025,0.92590576,0.0004099842,0.000018295463,0.00015355219,0.00010154412,0.000033844786,0.000359808],"genre_scores_gemma":[0.8661506,0.000006971979,0.13266575,0.000024768473,0.000044864104,0.000008284064,0.00006377477,0.000014725211,0.0010202429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868184,0.0000965791,0.00031980954,0.00025906804,0.00046163416,0.0001810935],"domain_scores_gemma":[0.9985776,0.00047688265,0.00021922072,0.00018103671,0.00045667222,0.0000885958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036877958,0.00012015459,0.00029867695,0.00034976634,0.00013646037,0.00001919468,0.0000870454,0.00004585605,0.0003958217],"category_scores_gemma":[0.00037395058,0.00007543944,0.000079938,0.0010084329,0.0000953223,0.00016141946,0.00005122465,0.00006662599,0.0000075354824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007687297,0.0013520928,0.4218049,0.0002864735,0.013274384,0.000014650109,0.0024673624,0.022243736,0.0015265114,0.524666,0.0008577983,0.010737327],"study_design_scores_gemma":[0.00388961,0.00028357547,0.113736495,0.000113697904,0.0017981232,0.000012969238,0.00032695732,0.8302359,0.0003378157,0.04861663,0.00014842358,0.0004998153],"about_ca_topic_score_codex":0.000018700823,"about_ca_topic_score_gemma":0.000020493962,"teacher_disagreement_score":0.80799216,"about_ca_system_score_codex":0.00004443591,"about_ca_system_score_gemma":0.00006173089,"threshold_uncertainty_score":0.433397},"labels":[],"label_agreement":null},{"id":"W2551276386","doi":"10.1007/978-3-319-66616-7_8","title":"Exact Separation of k-Projection Polytope Constraints","year":2017,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Mathematics; Cutting-plane method; Relaxation (psychology); Cone (formal languages); Projection (relational algebra); Combinatorics; Integer (computer science); Constraint (computer-aided design); Mathematical optimization; Plane (geometry); Algorithm; Integer programming; Geometry; Computer science","score_opus":0.06469526552271893,"score_gpt":0.38120393244586415,"score_spread":0.3165086669231452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551276386","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006754683,0.00008489947,0.36042538,0.0000409802,0.0002712707,0.0017974883,0.00044158247,0.00013618392,0.63673466],"genre_scores_gemma":[0.0007024879,0.0005583531,0.7923712,0.0000072359,0.00015012427,0.00005375165,0.000037969687,0.00024054029,0.20587835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959652,0.000010114043,0.0015028167,0.00059681665,0.0014416159,0.0004834249],"domain_scores_gemma":[0.99492586,0.0005334518,0.0021867435,0.0005743953,0.0016479989,0.00013155382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012467798,0.000612842,0.0011256066,0.0006626786,0.00017224324,0.00015941508,0.0006187524,0.00053937885,0.0005577561],"category_scores_gemma":[0.0037840488,0.00064779486,0.00012582964,0.00005955744,0.00062806235,0.0002938594,0.00027025887,0.0009095231,0.000065377026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002510492,0.00015288264,0.000018566825,0.003230886,0.00011218522,0.000026732427,0.0014835651,0.00001580704,0.00014356589,0.9844432,0.0019212837,0.0084262295],"study_design_scores_gemma":[0.00065184844,0.00010467958,0.000013388653,0.0017264419,0.00013686792,0.00003378555,0.00018248479,0.011160492,0.0006072442,0.9802347,0.0044579315,0.00069016655],"about_ca_topic_score_codex":0.000006226549,"about_ca_topic_score_gemma":0.000033293865,"teacher_disagreement_score":0.4319458,"about_ca_system_score_codex":0.0004511052,"about_ca_system_score_gemma":0.00032457325,"threshold_uncertainty_score":0.9995973},"labels":[],"label_agreement":null},{"id":"W2551861186","doi":"","title":"On the H-differentiability of löwner function with application in symmetric cone complementarity problem","year":2013,"lang":"en","type":"article","venue":"Journal of nonlinear and convex analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Differentiable function; Complementarity theory; Complementarity (molecular biology); Cone (formal languages); Mathematics; Pure mathematics; Stationary point; Function (biology); Class (philosophy); Mathematical analysis; Computer science; Physics; Algorithm","score_opus":0.025304616571688643,"score_gpt":0.30566496768958024,"score_spread":0.2803603511178916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551861186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6913834,0.000023158414,0.30756035,0.0006160103,0.0000056660974,0.00028630198,0.000005332699,0.0000031206714,0.000116597694],"genre_scores_gemma":[0.97365844,0.000025999994,0.026197145,0.000040011455,0.000014631424,0.000011592059,0.0000062170243,0.0000058577257,0.000040077462],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988277,0.00012302764,0.0004763491,0.000103739236,0.0003732893,0.000095904434],"domain_scores_gemma":[0.9982799,0.0005300082,0.00041576958,0.00017411441,0.0005533204,0.00004685225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088088,0.000078866084,0.00032334935,0.00040600178,0.00004211506,0.000022090573,0.00009962662,0.000030630796,0.00028575968],"category_scores_gemma":[0.0001154867,0.000043246437,0.00008158327,0.0011944606,0.00007364074,0.00010429723,0.000023013708,0.00020245263,0.0000016176656],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016698041,0.006775354,0.7836836,0.0006719514,0.009543972,0.000007685709,0.0017549578,0.030616973,0.0019466254,0.058574323,0.00069306005,0.1040617],"study_design_scores_gemma":[0.0026756027,0.0009014016,0.11962869,0.000058694335,0.0014369125,0.000007784826,0.001441234,0.8003031,0.0008112676,0.072366916,0.00013444267,0.00023395132],"about_ca_topic_score_codex":0.00008552016,"about_ca_topic_score_gemma":0.000109745364,"teacher_disagreement_score":0.7696861,"about_ca_system_score_codex":0.00003995642,"about_ca_system_score_gemma":0.000027496844,"threshold_uncertainty_score":0.3128868},"labels":[],"label_agreement":null},{"id":"W2555169043","doi":"10.1287/opre.2018.1728","title":"Vector Space Decomposition for Solving Large-Scale Linear Programs","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Scale (ratio); Mathematics; Space (punctuation); Computer science; Mathematical optimization; Geography; Cartography","score_opus":0.1455778524276668,"score_gpt":0.5040118269124058,"score_spread":0.35843397448473896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555169043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017305579,0.00003348212,0.9752764,0.002153986,0.00012493243,0.002433607,0.00004934318,0.00016490679,0.0024577454],"genre_scores_gemma":[0.075192615,0.000025800833,0.9091544,0.000030280495,0.0008306718,0.0010443293,0.00015334974,0.00008016769,0.013488339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975457,0.00018934684,0.0002972826,0.0004207931,0.00076620246,0.00078065624],"domain_scores_gemma":[0.9959335,0.00049574993,0.000021817737,0.0005170103,0.0028457881,0.0001861789],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019174475,0.00013443384,0.00017439859,0.00030374515,0.0016097769,0.00028265265,0.00032719754,0.0001175598,0.00053284096],"category_scores_gemma":[0.001717894,0.00012754896,0.00006677859,0.000915309,0.00025655705,0.0003788786,0.00018654318,0.00035867022,0.00030685792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010495912,0.00865045,0.00081719575,0.0011175023,0.00044702773,0.000032275362,0.026703048,0.020353753,0.11713475,0.6842357,0.07884958,0.06060912],"study_design_scores_gemma":[0.00089791365,0.0005629374,0.000023787727,0.000061139275,0.0000071704194,0.0000064509486,0.0009262818,0.9555349,0.01752693,0.0053368416,0.018912986,0.00020269441],"about_ca_topic_score_codex":0.00002229492,"about_ca_topic_score_gemma":0.00073129375,"teacher_disagreement_score":0.93518114,"about_ca_system_score_codex":0.0002019634,"about_ca_system_score_gemma":0.00023929332,"threshold_uncertainty_score":0.99969},"labels":[],"label_agreement":null},{"id":"W2559883687","doi":"10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of the Secretary of Defense; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Bounded function; Quadratically constrained quadratic program; Mathematical optimization; Quadratic growth; Quadratic programming; Hermitian matrix; Rank (graph theory); Feasible region; Second-order cone programming; Trust region; Constraint (computer-aided design); Convex optimization; Regular polygon; Algorithm; Combinatorics; Computer science","score_opus":0.07666032763318521,"score_gpt":0.3906559550134406,"score_spread":0.3139956273802554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559883687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043145148,0.000013360249,0.99555826,0.0010503246,0.000023625467,0.0016878506,0.0000157689,0.00026338542,0.0009559781],"genre_scores_gemma":[0.014753688,0.0000037232621,0.98321736,0.000059590304,0.000107147585,0.0005638541,0.000006024205,0.00009522614,0.0011934008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977649,0.00011297379,0.0005058868,0.00046866317,0.00049310224,0.0006544621],"domain_scores_gemma":[0.99527335,0.0036443544,0.0001731231,0.00040481795,0.0002677842,0.00023655633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010025295,0.00028606772,0.00055030483,0.00010616196,0.0002385087,0.00014944727,0.00023206825,0.00012329806,0.00038632535],"category_scores_gemma":[0.0020150498,0.00017159022,0.00008710234,0.00020826173,0.00027785543,0.00020266853,0.00013198932,0.00013670445,0.000026557682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021096662,0.00048763346,0.00005055996,0.0013220328,0.00019848168,0.000010301928,0.00069704745,0.000008991032,0.001395908,0.48162425,0.00026534716,0.5137285],"study_design_scores_gemma":[0.0033439642,0.0004150762,0.000009517919,0.00036955322,0.000104550156,0.00009350951,0.00016319462,0.074788496,0.0021115476,0.90911424,0.009032388,0.0004539516],"about_ca_topic_score_codex":0.0000068970858,"about_ca_topic_score_gemma":0.000017425928,"teacher_disagreement_score":0.51327455,"about_ca_system_score_codex":0.00008189345,"about_ca_system_score_gemma":0.00006869569,"threshold_uncertainty_score":0.6997246},"labels":[],"label_agreement":null},{"id":"W2563370187","doi":"10.1007/s13675-018-0101-2","title":"Alternative SDP and SOCP approximations for polynomial optimization","year":2018,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Civil, Mechanical and Manufacturing Innovation","keywords":"Semidefinite programming; Set (abstract data type); Polynomial; Explained sum of squares; Linear programming; Optimization problem; Second-order cone programming","score_opus":0.06303692224109246,"score_gpt":0.37694731334257414,"score_spread":0.31391039110148167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563370187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004405944,0.000020564537,0.9957344,0.0016455424,0.0004572623,0.0007031211,0.00005329251,0.000093374394,0.0008518404],"genre_scores_gemma":[0.011185654,0.000053859017,0.9864866,0.0004492403,0.001094415,0.000042502594,0.00013014078,0.000082854946,0.00047469191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978311,0.00019465171,0.0006406059,0.00037532445,0.0006370893,0.0003212023],"domain_scores_gemma":[0.99620193,0.0011126227,0.00051214884,0.00015011059,0.0018183794,0.00020483248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005988026,0.00025186973,0.00026031648,0.00048544243,0.00088128966,0.0002935758,0.00020555303,0.000097173244,0.00026286967],"category_scores_gemma":[0.0015478757,0.00024745928,0.00008940794,0.0004362482,0.0001897634,0.0006594807,0.00006067946,0.00026979294,0.0000135469645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018278668,0.0001396858,0.000009705452,0.00001902845,0.000053083215,0.0000023768569,0.00027739382,0.9776669,0.0000032348294,0.017619789,0.002192539,0.001833459],"study_design_scores_gemma":[0.0019052112,0.000462994,0.000023017132,0.000049488135,0.000025066754,0.00008881429,0.000053160566,0.95597994,0.000050268998,0.04038565,0.00074277853,0.00023361693],"about_ca_topic_score_codex":6.9770186e-7,"about_ca_topic_score_gemma":4.815045e-7,"teacher_disagreement_score":0.022765858,"about_ca_system_score_codex":0.0001846854,"about_ca_system_score_gemma":0.0001622676,"threshold_uncertainty_score":0.9999978},"labels":[],"label_agreement":null},{"id":"W2580510829","doi":"10.1007/s10589-017-9892-y","title":"Visualization of the $$\\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Subderivative; Mathematics; Piecewise; Piecewise linear function; Convex conjugate; Convex function; Applied mathematics; Quadratic equation; Proper convex function; Univariate; Convex analysis; Function (biology); Regular polygon; Quadratic function; Convex optimization; Mathematical analysis; Multivariate statistics; Geometry","score_opus":0.05253497987322648,"score_gpt":0.38480674944649573,"score_spread":0.33227176957326926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580510829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022529643,0.00003443886,0.99550897,0.00036757052,0.00006159848,0.0007067988,0.000060072805,0.00003485061,0.000972712],"genre_scores_gemma":[0.72533953,0.0000644713,0.27335918,0.000035374436,0.00008164064,0.0001771415,0.00015315459,0.00003533442,0.0007541714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987212,0.00006616082,0.0004979952,0.0002228184,0.0003795087,0.00011234426],"domain_scores_gemma":[0.99766874,0.0002780199,0.00069970085,0.00052114716,0.0007707185,0.00006169283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015736172,0.00012437171,0.00020268119,0.000112067355,0.0007225949,0.000049643895,0.00032058195,0.000069404334,0.00010388283],"category_scores_gemma":[0.00044726057,0.00010492373,0.00007160543,0.00027448832,0.00036907662,0.00021672716,0.00016079715,0.00008727753,0.0000026793834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011231017,0.00021494772,0.0013414836,0.000087362634,0.000032808868,5.0315155e-8,0.00010788084,0.84027743,0.00008007541,0.1556254,0.00012532047,0.0020960344],"study_design_scores_gemma":[0.00062520045,0.00002522742,0.00385495,0.000041740335,0.000052091684,0.0000024826236,0.00006358602,0.95637363,0.00041677948,0.038186423,0.00023774574,0.000120123324],"about_ca_topic_score_codex":0.000005835899,"about_ca_topic_score_gemma":0.0000041814933,"teacher_disagreement_score":0.7230866,"about_ca_system_score_codex":0.000024725912,"about_ca_system_score_gemma":0.00010092493,"threshold_uncertainty_score":0.5557689},"labels":[],"label_agreement":null},{"id":"W2589061561","doi":"10.1007/s11590-017-1117-x","title":"Compositions of convex functions and fully linear models","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Regular polygon; Mathematics; Convex analysis; Computer science; Convex optimization; Artificial intelligence; Geometry","score_opus":0.06278987189070842,"score_gpt":0.346609635309974,"score_spread":0.2838197634192656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589061561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023388132,0.000012656712,0.9900341,0.004252988,0.000080053695,0.00026033615,0.000041027724,0.000058559668,0.0029214676],"genre_scores_gemma":[0.07551537,0.0000844708,0.92283297,0.00027299853,0.00006633341,0.00003383314,0.000056615114,0.000042453663,0.0010949494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990978,0.000043346572,0.00026538706,0.00020114762,0.0002309679,0.00016133946],"domain_scores_gemma":[0.99878514,0.00013451645,0.00025199013,0.00050054793,0.0002460054,0.00008180575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013826333,0.00011335935,0.00018970283,0.00012494666,0.00052209396,0.00007582128,0.00018987918,0.000056404537,0.00016296458],"category_scores_gemma":[0.00023987147,0.000118067626,0.0000415231,0.00008616071,0.0002784404,0.00056847953,0.00010090688,0.000115054965,0.000005643145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014662883,0.00005189775,0.00008690196,0.000031682765,0.000029881876,0.0000018041856,0.00012074111,0.9899375,0.0005154738,0.007634386,0.0013013221,0.00027377286],"study_design_scores_gemma":[0.00059868407,0.00002268622,0.000044897224,0.00002753852,0.000025379191,0.0000064414135,0.00006411796,0.9966655,0.00026513074,0.0020372076,0.000117574746,0.00012488026],"about_ca_topic_score_codex":0.000009275339,"about_ca_topic_score_gemma":0.0000020601485,"teacher_disagreement_score":0.073176555,"about_ca_system_score_codex":0.00002692633,"about_ca_system_score_gemma":0.000024518957,"threshold_uncertainty_score":0.4814658},"labels":[],"label_agreement":null},{"id":"W2591870952","doi":"","title":"LANCELOT_SIMPLE: A Simple Interface for LANCELOT B","year":2008,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Simple (philosophy); Computer science; Epistemology; Philosophy","score_opus":0.03906775485191053,"score_gpt":0.3252721716975093,"score_spread":0.2862044168455988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591870952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066650263,0.010190065,0.9644684,0.012196212,0.0004903997,0.0031329468,0.00087728834,0.0010356512,0.0009440188],"genre_scores_gemma":[0.046238907,0.004345644,0.86961806,0.0017145039,0.0008624602,0.0023139403,0.00014849243,0.00043203356,0.07432596],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946175,0.00029949212,0.0011643547,0.00095730193,0.00077980343,0.00218153],"domain_scores_gemma":[0.99513024,0.0012817039,0.00052451313,0.0015727723,0.0007530676,0.00073770044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010449238,0.0007737283,0.0010372485,0.0005300387,0.00083584024,0.0001763318,0.0010740125,0.0007264945,0.0006789909],"category_scores_gemma":[0.0023997128,0.00088403485,0.00042237213,0.001131014,0.00052806357,0.0007331659,0.0004983566,0.0010203165,0.00016661815],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001376275,0.0035896685,0.012366161,0.002494925,0.00075515,0.0006251052,0.0044032107,0.096442305,0.005176771,0.23293936,0.5349714,0.10485966],"study_design_scores_gemma":[0.00276234,0.0005784188,0.0010458778,0.0002427629,0.00009046484,0.00077116425,0.0003336211,0.66649574,0.014724507,0.04092073,0.27079996,0.0012343945],"about_ca_topic_score_codex":0.0026145927,"about_ca_topic_score_gemma":0.0018867782,"teacher_disagreement_score":0.57005346,"about_ca_system_score_codex":0.0015093513,"about_ca_system_score_gemma":0.0008552004,"threshold_uncertainty_score":0.99936104},"labels":[],"label_agreement":null},{"id":"W2591955687","doi":"10.1145/3055282.3055287","title":"Efficient detection of hessian matrix sparsity pattern","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"China Scholarship Council","keywords":"Hessian matrix; Scalar (mathematics); Matrix (chemical analysis); Algorithm; Computer science; Sparse matrix; Graph; Mathematics; Mathematical optimization; Applied mathematics; Theoretical computer science; Physics","score_opus":0.09837801155960461,"score_gpt":0.4108543438131306,"score_spread":0.31247633225352595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591955687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115361854,0.00007990435,0.8822903,0.001239209,0.00012540596,0.00036678146,0.000008845421,0.00007002361,0.00045769458],"genre_scores_gemma":[0.64479357,0.000043545362,0.35505605,0.000014197037,0.000022227561,0.000019609899,0.0000044827993,0.000014292911,0.000032010103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987464,0.00019222373,0.00040701777,0.00020401568,0.00024762572,0.00020269814],"domain_scores_gemma":[0.9926254,0.0006504553,0.0003385396,0.006146299,0.00018585764,0.000053448108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004945351,0.00012011737,0.00022907916,0.00019701442,0.00047374007,0.00007605586,0.003293914,0.00007760487,0.000022258999],"category_scores_gemma":[0.0005848535,0.00012732825,0.00006201238,0.00017293182,0.00027156534,0.00011613104,0.002860044,0.0003184131,0.000022562652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004486348,0.002603346,0.022097081,0.00031539483,0.00016137345,0.000014038107,0.0037310456,0.023867443,0.00096917606,0.024232863,0.0003772575,0.9215861],"study_design_scores_gemma":[0.00077461917,0.000044217228,0.030030932,0.00012245853,0.000012431242,0.000008109273,0.00004507109,0.9350383,0.00085110374,0.032546617,0.00032028774,0.00020582147],"about_ca_topic_score_codex":0.00009299827,"about_ca_topic_score_gemma":0.00023374506,"teacher_disagreement_score":0.9213803,"about_ca_system_score_codex":0.000096551776,"about_ca_system_score_gemma":0.000034781133,"threshold_uncertainty_score":0.61209667},"labels":[],"label_agreement":null},{"id":"W2593994861","doi":"10.1007/s10589-017-9905-x","title":"Two wide neighborhood interior-point methods for symmetric cone optimization","year":2017,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"School of Mathematics, Institute for Research in Fundamental Sciences; Shahrekord University; York University","keywords":"Mathematics; Interior point method; Cone (formal languages); Dual cone and polar cone; Point (geometry); Optimization problem; Mathematical optimization; Geometry; Tangent cone; Second-order cone programming; Mathematical analysis; Applied mathematics; Algorithm; Convex optimization; Regular polygon","score_opus":0.06638302178571971,"score_gpt":0.45208287204924824,"score_spread":0.38569985026352854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593994861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008687277,0.00011343043,0.9927944,0.001869073,0.00008920451,0.001900548,0.00006189807,0.00017526468,0.0029874768],"genre_scores_gemma":[0.0068087606,0.00013577896,0.9905801,0.00027791876,0.00011570005,0.0011620426,0.0003891171,0.000071324575,0.0004592822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818796,0.00010762662,0.0006030231,0.0005521312,0.00025742332,0.00029184864],"domain_scores_gemma":[0.9957953,0.0017502209,0.00058773975,0.0005850035,0.0010765454,0.0002052059],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00060148386,0.00025606414,0.00033878695,0.00033329596,0.0014253696,0.0004640132,0.00042608735,0.000104261584,0.0001666804],"category_scores_gemma":[0.0019336801,0.0002722234,0.000093922674,0.00037345398,0.0002446796,0.00061645306,0.00020525618,0.00015406556,0.000007823417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016233465,0.00007560417,0.000047263835,0.000038135306,0.000035739075,1.7395145e-7,0.00004661182,0.7720528,0.000006370166,0.21067588,0.00017068961,0.016834494],"study_design_scores_gemma":[0.001485705,0.00003868008,0.000051032413,0.000021224814,0.00004384111,0.0000085260235,0.000059724473,0.87406254,0.000044571683,0.12275152,0.001180117,0.0002525142],"about_ca_topic_score_codex":0.00000323187,"about_ca_topic_score_gemma":0.0000012571593,"teacher_disagreement_score":0.102009736,"about_ca_system_score_codex":0.00010029664,"about_ca_system_score_gemma":0.00011661992,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W259673802","doi":"10.1023/a:1026465906067","title":"Duality of Nonscalarized Multiobjective Linear Programs: Dual Balance, Level Sets, and Dual Clusters of Optimal Vectors","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Duality (order theory); Mathematics; Duality gap; Mathematical optimization; Minimax; Theory of computation; Dual (grammatical number); Linear programming; Parametric statistics; Weak duality; Set (abstract data type); Strong duality; Computation; Perturbation function; Pareto principle; Applied mathematics; Optimization problem; Combinatorics; Computer science; Algorithm; Convex analysis","score_opus":0.048862642972942884,"score_gpt":0.3625795594452303,"score_spread":0.3137169164722874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W259673802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036989998,0.00012442814,0.9618558,0.0001145217,0.000024617517,0.00060917734,0.00005748593,0.000017537697,0.00020640956],"genre_scores_gemma":[0.22828163,0.0007369496,0.7704788,0.00002255729,0.00008695335,0.000055081455,0.00003383832,0.00003506168,0.0002691188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998205,0.00028188634,0.0008283473,0.00018157208,0.0003360502,0.00016716191],"domain_scores_gemma":[0.99699855,0.0008259777,0.0009030051,0.00019878152,0.00094164617,0.00013205636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935422,0.00015561872,0.00041301973,0.00022819002,0.0001378349,0.000022399423,0.00011107449,0.0001106202,0.000058939837],"category_scores_gemma":[0.0005909343,0.00013782342,0.00008203825,0.0005072524,0.00038896376,0.0003105314,0.00007374389,0.00022724022,3.8266396e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003206622,0.002888666,0.0031823374,0.00055287103,0.00075015944,0.000014142623,0.005085135,0.8371874,0.0014303277,0.12018154,0.0001275628,0.025393207],"study_design_scores_gemma":[0.014588726,0.0015544118,0.0024009158,0.00053653005,0.0007692689,0.0011114287,0.012099841,0.8844923,0.0068973484,0.073263854,0.0011823477,0.0011030575],"about_ca_topic_score_codex":0.0000018572382,"about_ca_topic_score_gemma":8.5422454e-7,"teacher_disagreement_score":0.19137701,"about_ca_system_score_codex":0.000035042485,"about_ca_system_score_gemma":0.0000976797,"threshold_uncertainty_score":0.5620276},"labels":[],"label_agreement":null},{"id":"W2598694453","doi":"","title":"A New Version of the Improved Primal Simplex for Degenerate Linear Programs","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex algorithm; Degenerate energy levels; Simplex; Linear programming; Mathematical optimization; Reduction (mathematics); Mathematics; Constraint (computer-aided design); Algorithm; Computer science; Combinatorics","score_opus":0.03488851187246014,"score_gpt":0.30011103452010635,"score_spread":0.26522252264764623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598694453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04563364,0.00014410673,0.94972235,0.0013745894,0.00007344643,0.0025727982,0.000049943086,0.00032179832,0.000107329026],"genre_scores_gemma":[0.0858368,0.0000717227,0.9093337,0.0002204472,0.00015122579,0.00045039656,0.000028386226,0.000096945114,0.0038103447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795413,0.00009584045,0.0005242517,0.0003501374,0.000450724,0.0006248932],"domain_scores_gemma":[0.9979637,0.00023197409,0.00032986404,0.00084501226,0.00038844507,0.00024098498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040200114,0.00026363367,0.00035883428,0.00017483825,0.00034237205,0.00003136,0.0006259562,0.00022230242,0.000053983116],"category_scores_gemma":[0.0008569359,0.0002078117,0.0002573619,0.00066181214,0.00014520093,0.0002053543,0.00028402425,0.00030499167,0.0000033501085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038254843,0.0042781,0.020685686,0.0014481283,0.00080906344,0.000075660064,0.00439718,0.03756599,0.19702566,0.17499356,0.09027155,0.46462393],"study_design_scores_gemma":[0.0023306655,0.00042853598,0.00078152225,0.000067883215,0.0000511577,0.00008093948,0.00008487288,0.7831887,0.19111478,0.012573017,0.008845621,0.00045229896],"about_ca_topic_score_codex":0.0007534526,"about_ca_topic_score_gemma":0.00039252025,"teacher_disagreement_score":0.7456227,"about_ca_system_score_codex":0.00027459676,"about_ca_system_score_gemma":0.00060337456,"threshold_uncertainty_score":0.8474315},"labels":[],"label_agreement":null},{"id":"W2599948275","doi":"","title":"Reduction of symmetric semidefinite programs using the regular*-representation","year":2007,"lang":"en","type":"preprint","venue":"Research portal (Tilburg University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Waterloo; Deutsche Forschungsgemeinschaft","keywords":"Reduction (mathematics); Representation (politics); Semidefinite programming; Mathematics; Mathematical optimization; Computer science; Political science; Geometry","score_opus":0.2810286703909184,"score_gpt":0.4458543316447002,"score_spread":0.16482566125378179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599948275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46789056,0.0011876636,0.3977059,0.00086115557,0.0014029163,0.012859679,0.00019421108,0.000753401,0.117144525],"genre_scores_gemma":[0.6784642,0.0032609412,0.26222748,0.000010629891,0.0010061064,0.000040486306,0.00068754377,0.00039741883,0.05390523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940149,0.00096846634,0.0006264564,0.0007968148,0.0027289286,0.00086443],"domain_scores_gemma":[0.99391365,0.0009748326,0.0006072129,0.0013367198,0.0029137572,0.00025382012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036266255,0.00031649185,0.00051815645,0.0034927763,0.000473811,0.00010963605,0.0011468027,0.0005112872,0.00015730616],"category_scores_gemma":[0.0016416677,0.00029484121,0.00030638414,0.006403977,0.0009854661,0.00033279668,0.001889475,0.00226087,0.000008400322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021429004,0.0045365035,0.0035962777,0.005974806,0.00314311,0.0031911249,0.006916416,0.10479904,0.007626204,0.7122881,0.008335451,0.1374501],"study_design_scores_gemma":[0.006573673,0.0013341698,0.0007495804,0.0051369886,0.0012290189,0.0005910438,0.093578674,0.28429702,0.043270484,0.5344167,0.024716739,0.004105942],"about_ca_topic_score_codex":0.00041847033,"about_ca_topic_score_gemma":0.000027020886,"teacher_disagreement_score":0.21057363,"about_ca_system_score_codex":0.00055684685,"about_ca_system_score_gemma":0.0008360957,"threshold_uncertainty_score":0.99995035},"labels":[],"label_agreement":null},{"id":"W2603318542","doi":"","title":"Polynomially Solvable Cases of the Constant Rank Unconstrained Quadratic 0-1 Programming Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic programming; Quadratic equation; Quadratic function; Matrix (chemical analysis); Function (biology); Mathematical optimization; Computer science; Geometry","score_opus":0.019421498859845596,"score_gpt":0.27469018667941114,"score_spread":0.2552686878195655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603318542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37200812,0.00068987167,0.5859966,0.003353377,0.00047192196,0.00583603,0.00015134952,0.00064837397,0.030844327],"genre_scores_gemma":[0.45754668,0.0000125620245,0.5383373,0.000052717583,0.00010073533,0.00008587388,0.000011452033,0.00005442463,0.0037982613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816626,0.00015404145,0.000556077,0.00025171298,0.00045086816,0.0004210563],"domain_scores_gemma":[0.9983064,0.00070843875,0.00029115693,0.00039803315,0.00022812137,0.0000678504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037909398,0.00020431945,0.00032527518,0.000101674894,0.00034742878,0.000063552725,0.00030032912,0.00013112875,0.00009442349],"category_scores_gemma":[0.0005918615,0.00015039009,0.0001344058,0.00045878068,0.00085187535,0.00013032161,0.00006265293,0.00030053448,0.0000044401845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016291378,0.0007665411,0.0030493725,0.00076440716,0.00018985265,0.0001504103,0.0022217713,0.00519674,0.005824605,0.9605024,0.004572352,0.016598633],"study_design_scores_gemma":[0.013397497,0.0008291743,0.00050347554,0.0009326637,0.00048079455,0.0011668657,0.00957552,0.028137976,0.052140668,0.8678838,0.022292107,0.0026594787],"about_ca_topic_score_codex":0.00016819076,"about_ca_topic_score_gemma":0.0002205743,"teacher_disagreement_score":0.09261862,"about_ca_system_score_codex":0.00016459274,"about_ca_system_score_gemma":0.00027213778,"threshold_uncertainty_score":0.61327296},"labels":[],"label_agreement":null},{"id":"W2603865942","doi":"","title":"Exact L 2 -Norm Plane Separation","year":2007,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Norm (philosophy); Quadratic equation; Exact solutions in general relativity; Regular polygon; Mathematics; Computation; Heuristic; Mathematical optimization; Applied mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.02163674034757463,"score_gpt":0.31973817022479833,"score_spread":0.2981014298772237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603865942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006500116,0.006599391,0.96750104,0.007525905,0.00068339385,0.0018294257,0.00017359623,0.000957087,0.0082300445],"genre_scores_gemma":[0.042876955,0.002284723,0.8511023,0.001610599,0.0011156066,0.00029018664,0.00021838737,0.0003317606,0.10016949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415934,0.00030636686,0.0013636253,0.00082186196,0.001211415,0.002137368],"domain_scores_gemma":[0.9953471,0.0011017479,0.00058412954,0.0014689276,0.0005493836,0.0009487132],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031741431,0.000724079,0.00073160254,0.00096475525,0.00051748287,0.00034301323,0.0007712238,0.0010104019,0.0013028423],"category_scores_gemma":[0.00151437,0.000836681,0.00028920197,0.001532375,0.00033334974,0.0010410291,0.0003541625,0.0013931034,0.00047507236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010486247,0.003472919,0.009334212,0.0011681172,0.00053563423,0.0017724714,0.0030230691,0.056080543,0.00949916,0.46005106,0.073860064,0.3801541],"study_design_scores_gemma":[0.0028235735,0.0008145272,0.007335901,0.0005669296,0.00022705896,0.0012616806,0.000990796,0.73279583,0.051315248,0.047490306,0.15210813,0.0022700108],"about_ca_topic_score_codex":0.0037598223,"about_ca_topic_score_gemma":0.0061921673,"teacher_disagreement_score":0.6767153,"about_ca_system_score_codex":0.0022726706,"about_ca_system_score_gemma":0.00054580247,"threshold_uncertainty_score":0.9996101},"labels":[],"label_agreement":null},{"id":"W2607241396","doi":"10.5540/03.2017.005.01.0477","title":"MMDA na resolucao da relaxacao por Programacao Semidefinida do Problema Quadratico de Alocacao","year":2017,"lang":"en","type":"article","venue":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Humanities; Chemistry; Philosophy","score_opus":0.039988316583318986,"score_gpt":0.32306694038175343,"score_spread":0.28307862379843446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607241396","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62451106,0.00032636896,0.34497118,0.009093952,0.00021462247,0.0060907574,0.00018363429,0.00042744135,0.014180969],"genre_scores_gemma":[0.25030145,0.0000342797,0.74888355,0.000037109206,0.000043601485,0.000076397584,0.0000050897315,0.000046884616,0.0005716125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977695,0.000014848669,0.0007691393,0.00030695632,0.000774995,0.0003646064],"domain_scores_gemma":[0.9973162,0.000445756,0.001211584,0.0004292318,0.00048680068,0.00011041902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829366,0.00027680982,0.00053333025,0.000041257994,0.0008620812,0.00022101312,0.00076122786,0.00014230834,0.000021327785],"category_scores_gemma":[0.0005209977,0.00022162042,0.00019604315,0.00019463147,0.001040706,0.0003296158,0.000494511,0.00030678345,0.0000019299064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008040675,0.00059145305,0.0012254752,0.007279776,0.0003592813,4.0542588e-7,0.012990564,0.0054882686,0.00300403,0.9606769,0.0033460837,0.0049573495],"study_design_scores_gemma":[0.0008049077,0.00006297599,0.00042817474,0.0005289723,0.00006820113,0.000027141547,0.0044241967,0.03753858,0.005534868,0.9501715,0.00013146175,0.00027905882],"about_ca_topic_score_codex":0.0000034958694,"about_ca_topic_score_gemma":6.724512e-7,"teacher_disagreement_score":0.4039124,"about_ca_system_score_codex":0.000053090436,"about_ca_system_score_gemma":0.00017050399,"threshold_uncertainty_score":0.90374184},"labels":[],"label_agreement":null},{"id":"W2611598631","doi":"10.24200/squjs.vol17iss1pp22-29","title":"The Squared Slacks Transformation in Nonlinear Programming","year":2012,"lang":"en","type":"article","venue":"Maǧallaẗ ǧāmiʿaẗ al-Sulṭān Qābūs li-l-ʿulūm/Sultan Qaboos University journal for science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Implementation; Transformation (genetics); Nonlinear programming; Computer science; Quadratic programming; Mathematical optimization; Quadratic equation; Nonlinear system; Sequential quadratic programming; Algorithm; Mathematics; Programming language","score_opus":0.04341174417373324,"score_gpt":0.36029870620277965,"score_spread":0.3168869620290464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611598631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24858712,0.0006167271,0.7247614,0.01026213,0.002818128,0.0054801065,0.00013985939,0.00047337983,0.00686113],"genre_scores_gemma":[0.5791077,0.0011652798,0.4118613,0.00028171556,0.00062920677,0.000029020044,0.00002672163,0.0001432027,0.0067558647],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952552,0.00022176946,0.00074197445,0.0004628203,0.0015828568,0.0017353845],"domain_scores_gemma":[0.99616283,0.00084707787,0.0004780163,0.0005314126,0.001284783,0.0006958964],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004959283,0.0003641509,0.00038657011,0.0010119836,0.0032168524,0.00054427877,0.0017480411,0.0001539358,0.000039530532],"category_scores_gemma":[0.0017633403,0.00030639436,0.00021605512,0.0034581714,0.00087561907,0.0036089737,0.00022422745,0.0008763465,0.000025557138],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037312151,0.0034744272,0.0042370334,0.00059276144,0.00037916837,0.00025927625,0.08156904,0.018240469,0.009285957,0.25469422,0.008543015,0.6149934],"study_design_scores_gemma":[0.01085742,0.0009369095,0.0012824972,0.0004635692,0.00015849303,0.0005882317,0.044326067,0.28023377,0.004778698,0.010714098,0.6436304,0.0020298278],"about_ca_topic_score_codex":0.000020433557,"about_ca_topic_score_gemma":0.00010520832,"teacher_disagreement_score":0.6350874,"about_ca_system_score_codex":0.0011468725,"about_ca_system_score_gemma":0.00060735457,"threshold_uncertainty_score":0.99993885},"labels":[],"label_agreement":null},{"id":"W2613057276","doi":"","title":"Decomposition theorems for linear programs","year":2014,"lang":"en","type":"article","venue":"RWTH Publications (RWTH Aachen)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Linear programming; Bounded function; Decomposition; Residual; Class (philosophy); Discrete mathematics; Combinatorics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.08614434952072335,"score_gpt":0.42507239011381476,"score_spread":0.3389280405930914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613057276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011527423,0.000027475033,0.9817141,0.003572482,0.000092334245,0.0016043084,0.000031210686,0.0006122558,0.011193043],"genre_scores_gemma":[0.031048648,0.000013417403,0.9573458,0.000210935,0.00038171746,0.0018620468,0.00072542374,0.000102554266,0.00830947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980712,0.00013163198,0.00046330193,0.00044475606,0.0003881899,0.0005009303],"domain_scores_gemma":[0.99711484,0.0007093465,0.00021519056,0.0008204116,0.00090661115,0.00023357883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009895226,0.00020741623,0.0002443428,0.00028980762,0.00038817053,0.0001612849,0.00048899074,0.00014764938,0.00023135537],"category_scores_gemma":[0.0020972195,0.00019628185,0.00012962801,0.00079351896,0.00012684353,0.0005006592,0.0000879963,0.00021873489,0.00016852947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027039085,0.0006538466,0.00024602382,0.000115419876,0.00006009977,1.1199481e-7,0.00033414792,0.00027340426,0.00013797493,0.9008105,0.0054807486,0.09186069],"study_design_scores_gemma":[0.0013785439,0.00022503994,0.00018838963,0.000036143,0.000053794563,0.00001149776,0.000076835284,0.34677705,0.00083860854,0.3500231,0.29994208,0.00044891378],"about_ca_topic_score_codex":0.0000033331755,"about_ca_topic_score_gemma":0.000008957988,"teacher_disagreement_score":0.5507874,"about_ca_system_score_codex":0.0001199586,"about_ca_system_score_gemma":0.00009948751,"threshold_uncertainty_score":0.80041414},"labels":[],"label_agreement":null},{"id":"W2615873886","doi":"10.1145/3096730.3096740","title":"Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Reduction (mathematics); Semidefinite programming; Rank (graph theory); Mathematics; Matrix (chemical analysis); Moment (physics); Positive-definite matrix; Mathematical optimization; Dimension (graph theory); Algorithm; Computer science; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.0893228140613989,"score_gpt":0.39748519678033445,"score_spread":0.30816238271893553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615873886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24436715,0.0005538224,0.73290426,0.015899802,0.00083206483,0.0023926683,0.00006687514,0.00031563183,0.002667702],"genre_scores_gemma":[0.27341098,0.0010795373,0.7247072,0.000073550524,0.00015127209,0.0001594739,0.000115334355,0.000037779704,0.0002648578],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857014,0.00013718432,0.00043291986,0.0003030031,0.0002972262,0.00025951306],"domain_scores_gemma":[0.9961756,0.0004539132,0.0003007273,0.0028830643,0.000119920944,0.000066783134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049725786,0.00018096132,0.00021986302,0.00024951977,0.0010656642,0.00044266152,0.0016418769,0.000104062725,0.000025159454],"category_scores_gemma":[0.0002855544,0.00018751797,0.000040346113,0.00012985834,0.00019130395,0.0007987104,0.001518912,0.0003914241,0.000015551794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015529829,0.0011716273,0.0019788549,0.00015654904,0.00012012289,0.0000046691293,0.008617066,0.0009865736,0.0003898314,0.06259852,0.008402675,0.9154182],"study_design_scores_gemma":[0.005520955,0.0005046719,0.0051350486,0.0004617944,0.000055257195,0.00006326367,0.00037729484,0.47428402,0.0014284439,0.48444027,0.026584964,0.0011440167],"about_ca_topic_score_codex":0.000024398736,"about_ca_topic_score_gemma":0.00002340912,"teacher_disagreement_score":0.9142742,"about_ca_system_score_codex":0.00019256979,"about_ca_system_score_gemma":0.000031431315,"threshold_uncertainty_score":0.81963354},"labels":[],"label_agreement":null},{"id":"W2621127975","doi":"","title":"A Primal-Dual Regularized Interior-Point Method for Semidefinite Programming","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; McGill University","funders":"","keywords":"Interior point method; Semidefinite programming; Mathematics; Mathematical optimization; Linear programming; Robustness (evolution); Quadratic programming; Dual (grammatical number); Regular polygon; Factorization; Regularization (linguistics); Convex optimization; Sequence (biology); Quadratic equation; Rank (graph theory); Applied mathematics; Algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.03673722428571607,"score_gpt":0.3438302092704082,"score_spread":0.3070929849846921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621127975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019930957,0.00040344545,0.99114907,0.001824808,0.00015231362,0.0029279273,0.000060556707,0.0011342958,0.0003544826],"genre_scores_gemma":[0.009379464,0.000047522197,0.9834143,0.00064016023,0.00032413736,0.0033856868,0.000056331184,0.00021252876,0.0025398743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961275,0.0003319388,0.00084959436,0.0005333597,0.0005796139,0.0015779987],"domain_scores_gemma":[0.99642456,0.0011624043,0.0004181512,0.001016357,0.00040310487,0.00057541503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031452938,0.0004719965,0.000660539,0.0005304732,0.00033493194,0.0002046351,0.0004718166,0.00037749633,0.00010061317],"category_scores_gemma":[0.0034625053,0.00046234098,0.000325397,0.00071282376,0.00011148493,0.0007436221,0.00040720453,0.00057779823,0.000016061938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013620931,0.0019233697,0.0045123966,0.0010141797,0.0005895881,0.000051395433,0.0048146597,0.0016168627,0.049299985,0.5689708,0.011409125,0.35443556],"study_design_scores_gemma":[0.0052400096,0.0007263122,0.00066736195,0.00036704808,0.00029440806,0.0007288448,0.0014960546,0.74272144,0.088416636,0.105745755,0.051360082,0.0022360263],"about_ca_topic_score_codex":0.00026973692,"about_ca_topic_score_gemma":0.00013313623,"teacher_disagreement_score":0.7411046,"about_ca_system_score_codex":0.00071882113,"about_ca_system_score_gemma":0.00020434344,"threshold_uncertainty_score":0.99978286},"labels":[],"label_agreement":null},{"id":"W2621282418","doi":"","title":"The convex hull of the disjunction of polymatroids","year":2000,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Convex hull; Orthogonal convex hull; Convex polytope; Combinatorics; Characterization (materials science); Mathematics; Polyhedron; Convex set; Convex combination; Hull; Matroid; Cardinality (data modeling); Convex analysis; Subderivative; Discrete mathematics; Regular polygon; Computer science; Convex body; Convex optimization; Geometry","score_opus":0.015342301214509068,"score_gpt":0.26416345253556034,"score_spread":0.24882115132105126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621282418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3343554,0.0012690995,0.44728866,0.024019275,0.00029437846,0.0015782333,0.00007610062,0.00024226938,0.19087656],"genre_scores_gemma":[0.87445706,0.00067943684,0.059634794,0.000038582817,0.000014444546,0.00003614724,0.000016859718,0.000042529642,0.06508016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966408,0.0021155216,0.00041392146,0.00018008397,0.00045724146,0.00019241236],"domain_scores_gemma":[0.9948531,0.002333786,0.00028683295,0.0013098363,0.0011630486,0.00005339465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025486592,0.00010533062,0.00016352814,0.000043742322,0.000340046,0.00004350811,0.0007594689,0.000060186994,0.00044157033],"category_scores_gemma":[0.0020341994,0.000069872694,0.00011632159,0.0005151241,0.00046597343,0.00009694198,0.00016744368,0.00017945864,0.0000129563305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077383505,0.0009798586,0.0025691648,0.0001661558,0.00012619211,6.084845e-7,0.009044887,0.00049134105,0.009714352,0.7118263,0.0024329084,0.2625708],"study_design_scores_gemma":[0.0027724921,0.0000034271243,0.010398867,0.001312255,0.00010775757,0.000026079928,0.0013245329,0.10202974,0.6867154,0.1337061,0.06096715,0.00063619576],"about_ca_topic_score_codex":0.00011550098,"about_ca_topic_score_gemma":0.00021292428,"teacher_disagreement_score":0.67700106,"about_ca_system_score_codex":0.00003820703,"about_ca_system_score_gemma":0.000091545124,"threshold_uncertainty_score":0.48348853},"labels":[],"label_agreement":null},{"id":"W2623996453","doi":"","title":"Linear Equalities in Blackbox Optimization","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; Mathematics; Convergence (economics); Optimization problem; Linear inequality; Simplex; Computer science; Inequality","score_opus":0.02904059575472225,"score_gpt":0.31175951082759196,"score_spread":0.2827189150728697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623996453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053183874,0.00010143911,0.9891236,0.0018357699,0.000062019535,0.00070076226,0.000015547483,0.00068095245,0.002161538],"genre_scores_gemma":[0.07944729,0.00015583547,0.91588783,0.0007334362,0.00015672126,0.00038162756,0.00003677173,0.00012399438,0.0030764644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971518,0.00040348218,0.0006837657,0.0004428034,0.0005508996,0.0007672612],"domain_scores_gemma":[0.9977836,0.00071375497,0.00021923777,0.00081813964,0.00022767512,0.00023757758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015673509,0.00031070333,0.00042776842,0.0006870906,0.00015476899,0.000104084334,0.00046765327,0.00028515185,0.00019116639],"category_scores_gemma":[0.0029143498,0.0003248295,0.00010474863,0.0008591134,0.000115156196,0.0004380919,0.00020298442,0.0004965916,0.00002810799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069717324,0.00029325523,0.0027061233,0.00009737579,0.000020797246,0.000016836886,0.00058268633,0.77889365,0.00022916879,0.20957278,0.0011475952,0.0063700094],"study_design_scores_gemma":[0.0006908024,0.00008248019,0.0003113514,0.000058178553,0.000008758243,0.000017271124,0.0001802721,0.9534223,0.0017059325,0.042068474,0.0011107969,0.0003433471],"about_ca_topic_score_codex":0.0006916814,"about_ca_topic_score_gemma":0.000705437,"teacher_disagreement_score":0.17452869,"about_ca_system_score_codex":0.00047026025,"about_ca_system_score_gemma":0.00013642923,"threshold_uncertainty_score":0.99992037},"labels":[],"label_agreement":null},{"id":"W2724113590","doi":"10.13140/rg.2.2.11830.29769","title":"A simple pooling model with application in the feed industry and its global solution analysis","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Simple (philosophy); Pooling; Econometrics; Computer science; Industrial organization; Economics; Mathematical economics; Business; Mathematics; Artificial intelligence; Epistemology; Philosophy","score_opus":0.0426157434239558,"score_gpt":0.3306794592765721,"score_spread":0.2880637158526163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724113590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07076174,0.00025393962,0.9177389,0.004452876,0.000010941314,0.000847862,0.0000892898,0.00009189334,0.005752533],"genre_scores_gemma":[0.8686288,0.00019417267,0.12972163,0.00003580362,0.000011725024,0.00021825708,0.00032047596,0.000027766986,0.00084138714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958908,0.002058472,0.00042978823,0.00067991274,0.0006082759,0.00033273382],"domain_scores_gemma":[0.99482214,0.00082957017,0.0006315659,0.0020453339,0.0015587198,0.00011264364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00473041,0.00027241075,0.00038934554,0.00022784689,0.0004982324,0.00044618486,0.0011970589,0.00042732537,0.000012344267],"category_scores_gemma":[0.0020287072,0.0002319947,0.00010013131,0.00072585756,0.00017291123,0.00019697874,0.00092058134,0.0010381418,0.0000031609195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014633899,0.0023351493,0.029104028,0.0010041968,0.0012647045,0.000019624515,0.02529204,0.36351934,0.0004465926,0.52031285,0.000537696,0.05601746],"study_design_scores_gemma":[0.00037622923,2.39219e-7,0.0025559647,0.00023583185,0.00015413528,0.0000044996227,0.00014026507,0.94980836,0.0002999556,0.04612588,0.000068877416,0.00022978756],"about_ca_topic_score_codex":0.00066696724,"about_ca_topic_score_gemma":0.0052930354,"teacher_disagreement_score":0.79786706,"about_ca_system_score_codex":0.00021710392,"about_ca_system_score_gemma":0.00027600047,"threshold_uncertainty_score":0.9460469},"labels":[],"label_agreement":null},{"id":"W2730291569","doi":"","title":"Solving Variational Inequalities with a Quadratic Cut Method: A Primal-Dual, Jacobian-Free Approach","year":2002,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Jacobian matrix and determinant; Variational inequality; Mathematics; Quadratic equation; Variety (cybernetics); Dual (grammatical number); Mathematical optimization; Applied mathematics; Variational analysis; Geometry","score_opus":0.060038660424786935,"score_gpt":0.3105596200361779,"score_spread":0.2505209596113909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730291569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019934447,0.000120422585,0.98467165,0.00095022866,0.000048070528,0.00056060596,0.00003543528,0.00025103675,0.011369084],"genre_scores_gemma":[0.0052549113,0.000045747198,0.9844016,0.0002537921,0.0001995714,0.00018242502,0.00003308415,0.00008997127,0.009538897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971548,0.00044324854,0.0004934059,0.0004665097,0.000911104,0.00053097337],"domain_scores_gemma":[0.997108,0.0015178571,0.00023689886,0.0006638647,0.00030347527,0.00016992868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008779484,0.0003127618,0.00042175304,0.00026497562,0.00046558157,0.0001651212,0.0003877152,0.00019581198,0.0007079154],"category_scores_gemma":[0.002052961,0.00026923246,0.00008839914,0.00056984305,0.0002548412,0.00045664207,0.00011053034,0.00056610984,0.000028621389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000796267,0.00059717166,0.00017058865,0.00048738805,0.00030371596,0.000056631623,0.026010549,0.008756565,0.00013759374,0.95102465,0.008467279,0.003908244],"study_design_scores_gemma":[0.0032069664,0.0002254759,0.0000759289,0.00008216104,0.00010997035,0.0002909182,0.00505632,0.78914046,0.00032380357,0.19790652,0.0026236668,0.0009577803],"about_ca_topic_score_codex":0.000029275187,"about_ca_topic_score_gemma":0.00001820996,"teacher_disagreement_score":0.78038394,"about_ca_system_score_codex":0.00029372884,"about_ca_system_score_gemma":0.00008162905,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W2738672336","doi":"10.1007/978-981-16-1819-2_3","title":"The New Butterfly Relaxation Method for Mathematical Programs with Complementarity Constraints","year":2021,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Complementarity (molecular biology); Limiting; Relaxation (psychology); Affine transformation; Stationary point; Mathematical optimization; Convergence (economics); Applied mathematics; Computer science; Mathematics; Mathematical analysis; Pure mathematics; Engineering","score_opus":0.07021097961007018,"score_gpt":0.3717672709066159,"score_spread":0.3015562912965457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738672336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048180327,0.00008437355,0.95274806,0.00050937984,0.00010121548,0.003977843,0.0002358945,0.00015010482,0.04218828],"genre_scores_gemma":[0.000007077289,0.00015160415,0.8504644,0.000037110363,0.0001633239,0.00033116445,0.00013578184,0.00030365807,0.14840588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948813,0.000025485742,0.0017962971,0.0008742855,0.0014952652,0.0009273929],"domain_scores_gemma":[0.99267375,0.0034540638,0.0014326798,0.0005983519,0.0015552719,0.00028588437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017411938,0.0008429663,0.0012233052,0.00023636033,0.0004161497,0.00056910206,0.00073791534,0.0004123744,0.00037583176],"category_scores_gemma":[0.0026088636,0.0006579505,0.0001645334,0.00016615953,0.000552052,0.00016977469,0.00034051735,0.0011850313,0.000029188806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004709825,0.00018163447,0.0000056408676,0.0023316368,0.00024703788,0.00002353563,0.0012203223,0.000013338745,0.000010792782,0.9675741,0.0038286305,0.024516242],"study_design_scores_gemma":[0.0012069182,0.00018171004,0.0000016708362,0.0015725688,0.00027439697,0.00007677321,0.0007327943,0.021691656,0.000084493804,0.94747484,0.025976827,0.00072537066],"about_ca_topic_score_codex":0.000004200174,"about_ca_topic_score_gemma":0.00014549165,"teacher_disagreement_score":0.10621759,"about_ca_system_score_codex":0.00053241436,"about_ca_system_score_gemma":0.000554892,"threshold_uncertainty_score":0.9995872},"labels":[],"label_agreement":null},{"id":"W2739127253","doi":"","title":"An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming","year":2010,"lang":"en","type":"article","venue":"Research portal (Tilburg University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Scheme (mathematics); Polynomial; Mathematical optimization; Convex optimization; Binary number; Regular polygon; Applied mathematics","score_opus":0.15637099960997686,"score_gpt":0.43714383918964866,"score_spread":0.2807728395796718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739127253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96306336,0.000009560669,0.0314356,0.0003584787,0.00020609751,0.002383006,0.000098668716,0.00014900259,0.0022962387],"genre_scores_gemma":[0.8010699,0.000015543535,0.19370468,0.000013962193,0.0006702707,0.000047564703,0.00030998493,0.000070491216,0.0040976214],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967567,0.0005039078,0.00037955565,0.0006624368,0.0008058574,0.0008915467],"domain_scores_gemma":[0.9974666,0.00053945224,0.00012604667,0.0005590979,0.00092149846,0.00038727967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002387668,0.00022262793,0.00031458953,0.0012960155,0.0005024605,0.00015763743,0.0005687538,0.00027520364,0.00027976304],"category_scores_gemma":[0.0013840381,0.00024812244,0.00010934865,0.0014464048,0.00042498007,0.0011439112,0.0002269275,0.0010857586,0.000010298282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004959569,0.008837223,0.019205239,0.00078704034,0.0004000363,0.0025743572,0.009561559,0.003065639,0.6591472,0.19782914,0.028765935,0.06486705],"study_design_scores_gemma":[0.019128136,0.0044523366,0.0019196189,0.00019062018,0.00007222218,0.000069581714,0.01721353,0.7082326,0.080638975,0.006114403,0.15881571,0.0031522482],"about_ca_topic_score_codex":0.0001120843,"about_ca_topic_score_gemma":0.00067081803,"teacher_disagreement_score":0.705167,"about_ca_system_score_codex":0.00022512878,"about_ca_system_score_gemma":0.00058841886,"threshold_uncertainty_score":0.9999971},"labels":[],"label_agreement":null},{"id":"W2741906455","doi":"10.1080/0305215x.2017.1355367","title":"An interior-point method-based solver for simulation of aircraft parts riveting","year":2017,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Solver; Preconditioner; Convergence (economics); Interior point method; Mathematical optimization; Dimension (graph theory); Polynomial; Computer science; Point (geometry); Matrix (chemical analysis); Applied mathematics; Mathematics; Iterative method; Mathematical analysis; Geometry","score_opus":0.05545680474294857,"score_gpt":0.4031946365032644,"score_spread":0.34773783176031586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741906455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006758765,0.0000071978334,0.9983621,0.00007773665,0.00013560164,0.0005286707,0.000014287134,0.0001479523,0.000050544873],"genre_scores_gemma":[0.1899163,0.0000025191155,0.8098109,0.000008840094,0.00006658068,0.000053379903,0.00003969173,0.00005806302,0.00004377094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998918,0.00003941387,0.0003662571,0.00024280409,0.00021393775,0.00021958072],"domain_scores_gemma":[0.998104,0.0005440379,0.0003046588,0.00057008216,0.00040138786,0.00007585837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194244,0.00015464763,0.00023656199,0.00016370631,0.00019527462,0.000089288835,0.0002538273,0.00009427321,0.000052832944],"category_scores_gemma":[0.0030684564,0.0001682693,0.00007238245,0.000083005376,0.000029450595,0.00053939695,0.000041717627,0.00009382861,8.4044314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027798535,0.00003487495,0.000028050094,0.00013818992,0.000015018299,4.3998003e-7,0.00014509134,0.99684364,0.00055589114,0.0005657514,0.000014038551,0.0016312151],"study_design_scores_gemma":[0.0006467217,0.00007558195,0.000029634655,0.000090018686,0.00001943442,4.2251213e-7,0.000018416018,0.9925654,0.0059342133,0.00036933157,0.000085302374,0.00016553154],"about_ca_topic_score_codex":0.000003124787,"about_ca_topic_score_gemma":8.2516186e-7,"teacher_disagreement_score":0.18924041,"about_ca_system_score_codex":0.000069409936,"about_ca_system_score_gemma":0.00003464319,"threshold_uncertainty_score":0.68618226},"labels":[],"label_agreement":null},{"id":"W2742920127","doi":"","title":"Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods","year":2012,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Point (geometry); Combinatorics; Calculus (dental); Geometry; Physics","score_opus":0.03653474717738906,"score_gpt":0.36200824084799216,"score_spread":0.3254734936706031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742920127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009530429,0.0056196447,0.9388494,0.00030375086,0.00031134347,0.0011971821,0.00035112177,0.0011195393,0.052152723],"genre_scores_gemma":[0.00027517922,0.0012641523,0.8951593,0.0002210413,0.00039519454,0.0002986885,0.00009032082,0.0010964974,0.10119964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959238,0.00062907056,0.0009949767,0.0007033453,0.00081677444,0.0009320342],"domain_scores_gemma":[0.9954128,0.001021811,0.0012446583,0.0017814799,0.00016809216,0.00037110888],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013089026,0.00075176597,0.0012554656,0.0015806016,0.00012598,0.00014506555,0.0009834724,0.0009775679,0.0027134207],"category_scores_gemma":[0.0012156315,0.00072258594,0.00035572023,0.0006820848,0.00022911327,0.00021819965,0.0005025724,0.0009815536,0.00006496498],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005836522,0.0023507618,0.002251965,0.0020976646,0.0023920846,0.00013504364,0.0026205021,0.0012505254,0.010058042,0.12221232,0.5197161,0.33433133],"study_design_scores_gemma":[0.0035676917,0.0011296608,0.00081769045,0.0068046586,0.0012111946,0.0001262637,0.001284946,0.1318187,0.110722676,0.24861892,0.48785985,0.006037744],"about_ca_topic_score_codex":0.005615609,"about_ca_topic_score_gemma":0.0007194991,"teacher_disagreement_score":0.3282936,"about_ca_system_score_codex":0.00063049875,"about_ca_system_score_gemma":0.00022143376,"threshold_uncertainty_score":0.9995225},"labels":[],"label_agreement":null},{"id":"W2744209407","doi":"","title":"The Small Octagon with Longest Perimeter","year":2005,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Perimeter; Mathematics; Regular polygon; Series (stratigraphy); Trigonometry; Unit (ring theory); Interval (graph theory); Combinatorics; Arithmetic; Algorithm; Calculus (dental); Mathematical analysis; Geometry; Mathematics education","score_opus":0.02180256313203329,"score_gpt":0.27800994121117595,"score_spread":0.2562073780791427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744209407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062053828,0.018007617,0.90272963,0.066338174,0.00026952443,0.0020501392,0.00008720203,0.00070023246,0.0036120913],"genre_scores_gemma":[0.015824554,0.0040029017,0.8440043,0.0018085972,0.00095086475,0.0008810696,0.0000259727,0.0003456341,0.13215616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948772,0.00049431744,0.0009050469,0.00078601507,0.0009376106,0.0019997852],"domain_scores_gemma":[0.99499583,0.0012154735,0.00046067845,0.00200998,0.0006167418,0.0007012723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015140027,0.0007511124,0.00060582446,0.00036487385,0.0010836675,0.0007695024,0.0012533373,0.00058032334,0.0004311036],"category_scores_gemma":[0.00094125664,0.0005828313,0.000255626,0.0010646305,0.00079048175,0.0006721096,0.00047922297,0.0015045195,0.00030525718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078185694,0.0017895867,0.0035017875,0.0003463014,0.000543023,0.00032942917,0.0018677579,0.073394254,0.0009552959,0.21972091,0.0206308,0.676139],"study_design_scores_gemma":[0.001690814,0.00068123854,0.0013620259,0.00033625023,0.00017955789,0.00077100476,0.0006245118,0.65228695,0.012029536,0.0055554365,0.32323053,0.0012521613],"about_ca_topic_score_codex":0.0018540685,"about_ca_topic_score_gemma":0.015105609,"teacher_disagreement_score":0.6748868,"about_ca_system_score_codex":0.0015483014,"about_ca_system_score_gemma":0.0006602262,"threshold_uncertainty_score":0.99966234},"labels":[],"label_agreement":null},{"id":"W2745275603","doi":"10.1016/j.orl.2017.08.004","title":"Linear fractional approximations for master problems in column generation","year":2017,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Column (typography); Mathematics; Applied mathematics; Calculus (dental); Mathematical optimization; Computer science; Medicine; Geometry","score_opus":0.3870013463244872,"score_gpt":0.4904084144009487,"score_spread":0.1034070680764615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745275603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026609432,0.000011309296,0.9463024,0.022930523,0.00014474122,0.0028825921,0.00008394522,0.00004531403,0.0009897241],"genre_scores_gemma":[0.17157994,0.000051904768,0.8081537,0.0004138531,0.0010358073,0.0057305237,0.00037646262,0.00011131515,0.0125464965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758935,0.00024398195,0.00041642901,0.0004244342,0.0007921498,0.00053363346],"domain_scores_gemma":[0.997733,0.00044271856,0.00005739527,0.00078917376,0.0008632311,0.00011450057],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018927981,0.00013701458,0.00018000214,0.0004934149,0.0022018524,0.0007259386,0.0004978377,0.000099688834,0.00030483495],"category_scores_gemma":[0.0040294845,0.00014062211,0.00005949256,0.00028263227,0.00027558696,0.0011787987,0.00014907084,0.0005052533,0.00007780283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004774648,0.0007474069,0.0012055486,0.00021272471,0.00006692157,0.000009820165,0.0012977312,0.85164815,0.046297237,0.05590946,0.038439803,0.004117471],"study_design_scores_gemma":[0.0011359914,0.000052647723,0.00031550994,0.00003473035,0.0000033765039,0.0000036903716,0.00010636621,0.9850689,0.0010448468,0.003333486,0.008716008,0.00018441705],"about_ca_topic_score_codex":0.00010877513,"about_ca_topic_score_gemma":0.0014453141,"teacher_disagreement_score":0.14497052,"about_ca_system_score_codex":0.00029670182,"about_ca_system_score_gemma":0.00020053773,"threshold_uncertainty_score":0.99909717},"labels":[],"label_agreement":null},{"id":"W2749216644","doi":"10.22436/jnsa.010.08.33","title":"Solutions of nonlinear systems by reproducing kernel method","year":2017,"lang":"en","type":"article","venue":"The Journal of Nonlinear Sciences and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; King Saud University","keywords":"Mathematics; Kernel (algebra); Applied mathematics; Nonlinear system; Pure mathematics; Physics","score_opus":0.11580349692666997,"score_gpt":0.43923924106638257,"score_spread":0.3234357441397126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749216644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005273514,0.0009500405,0.99018365,0.0024270278,0.000059688984,0.00032694088,0.00004633964,0.000008886698,0.00072393916],"genre_scores_gemma":[0.024556467,0.0011495034,0.9728516,0.000024089672,0.0004197353,0.000014881823,0.0000014188167,0.000015605248,0.000966724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987712,0.00009302788,0.0004425498,0.0001378539,0.00039331516,0.00016205582],"domain_scores_gemma":[0.9975567,0.00053582166,0.0008807014,0.00052968,0.00042308864,0.00007401708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036569638,0.00007369501,0.00019566876,0.000070604656,0.0011609085,0.00010438743,0.00076629117,0.000031125175,0.0000078203975],"category_scores_gemma":[0.00073098857,0.000045666493,0.00004395786,0.00019988978,0.0005617081,0.00025212477,0.00015367079,0.00017725112,0.0000017476962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002779589,0.004523484,0.0029883417,0.0012918382,0.00092242536,0.000010239679,0.00870984,0.17444573,0.10778461,0.3579135,0.027012093,0.31411994],"study_design_scores_gemma":[0.0008418457,0.00030629986,0.000240105,0.00020020158,0.0001729367,0.00033785787,0.003537026,0.92929333,0.0045253583,0.03146257,0.028788293,0.00029415803],"about_ca_topic_score_codex":0.00004254494,"about_ca_topic_score_gemma":0.0000039253932,"teacher_disagreement_score":0.7548476,"about_ca_system_score_codex":0.000015390002,"about_ca_system_score_gemma":0.000112687194,"threshold_uncertainty_score":0.8928887},"labels":[],"label_agreement":null},{"id":"W2761564338","doi":"10.1007/s10589-019-00078-w","title":"A sub-additive DC approach to the complementarity problem","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Agence Nationale de la Recherche","keywords":"Mixed complementarity problem; Complementarity theory; Mathematics; Linear complementarity problem; Maxima and minima; Monotone polygon; Mathematical optimization; Complementarity (molecular biology); Nonlinear complementarity problem; Optimization problem; Regular polygon; Convex function; Stationary point; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.039618985544971994,"score_gpt":0.3377216631295292,"score_spread":0.2981026775845572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761564338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023929971,0.000018166102,0.98642904,0.0016484818,0.000017931565,0.002600515,0.00009871428,0.000097786266,0.008850085],"genre_scores_gemma":[0.027711008,0.000020522064,0.96886396,0.0008061781,0.00007825946,0.0011425182,0.0006435867,0.000032139844,0.00070184737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986962,0.00007174678,0.00030131688,0.00037058588,0.00036584557,0.0001943083],"domain_scores_gemma":[0.9986746,0.00041948308,0.000113548274,0.0002553245,0.00041661123,0.000120446915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024239055,0.0001427226,0.00015238514,0.00011330774,0.0003653571,0.00010330346,0.0002200204,0.000041006584,0.00016357434],"category_scores_gemma":[0.00004451081,0.00011847023,0.00003553351,0.00064596,0.00007031555,0.00014754223,0.00013575425,0.00014167599,0.00010433167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047610497,0.000111347894,0.00005034466,0.000015968382,0.000015766478,3.3879505e-8,0.00017082373,0.76378894,0.0000037084328,0.23249976,0.0017600567,0.0015784907],"study_design_scores_gemma":[0.00047888467,0.00002582973,0.00023318538,0.000008284524,0.000012882497,0.000007643568,0.00029208083,0.9403502,0.000019784837,0.04121702,0.017176697,0.00017755368],"about_ca_topic_score_codex":0.0000035161088,"about_ca_topic_score_gemma":0.0000025331897,"teacher_disagreement_score":0.19128275,"about_ca_system_score_codex":0.00006785717,"about_ca_system_score_gemma":0.00006695916,"threshold_uncertainty_score":0.48310757},"labels":[],"label_agreement":null},{"id":"W2765287882","doi":"10.15807/jorsj.60.419","title":"SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS","year":2017,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of Japan","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Japan Society for the Promotion of Science","keywords":"Simplex; Degeneracy (biology); Simplex algorithm; Degenerate energy levels; Exponential function; Mathematics; Combinatorics; Constraint (computer-aided design); Matrix (chemical analysis); Mathematical optimization; Computer science; Algorithm; Linear programming; Physics; Mathematical analysis; Geometry","score_opus":0.43075456663718875,"score_gpt":0.5584178816665836,"score_spread":0.12766331502939482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765287882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114906445,0.00024476153,0.8138879,0.06765763,0.00036972677,0.0020715834,0.00018045545,0.000019699813,0.0006617933],"genre_scores_gemma":[0.03138841,0.00030857016,0.9627044,0.00014280659,0.00032817002,0.000047881622,0.0000032813616,0.000043327822,0.0050331084],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715716,0.0006249683,0.00068964926,0.00018349636,0.0008884084,0.00045629806],"domain_scores_gemma":[0.9930896,0.0015793671,0.00040788294,0.0009529788,0.0037837306,0.00018642544],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0072194827,0.00014156167,0.00037915574,0.000111132285,0.0025341401,0.00038065453,0.0018053446,0.00012109324,0.00008080561],"category_scores_gemma":[0.008500899,0.000095354124,0.0004969179,0.00025870392,0.00069627014,0.00037855652,0.00046849996,0.00070379727,7.6921805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004345177,0.0020440856,0.001250197,0.0011798242,0.003022176,0.0000029155149,0.02862426,0.14740916,0.34785548,0.07660477,0.2254879,0.1660847],"study_design_scores_gemma":[0.004444603,0.00091005216,0.0010995024,0.00030566627,0.00016159871,0.000062627296,0.0101427,0.5983154,0.26482475,0.079508506,0.03965524,0.00056931213],"about_ca_topic_score_codex":0.000102426915,"about_ca_topic_score_gemma":0.00036409893,"teacher_disagreement_score":0.45090628,"about_ca_system_score_codex":0.00020385828,"about_ca_system_score_gemma":0.0007786382,"threshold_uncertainty_score":0.9998509},"labels":[],"label_agreement":null},{"id":"W2767549563","doi":"","title":"A refinement of Guo's theorem concerning divisibility properties of binomial coeffi cients.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Divisibility rule; Binomial (polynomial); Binomial theorem; Pure mathematics; Applied mathematics; Statistics; Discrete mathematics","score_opus":0.09202414065968427,"score_gpt":0.3553592494910651,"score_spread":0.26333510883138084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767549563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929691,0.00008596544,0.0010584466,0.0001248667,0.0005785866,0.00055509474,0.000016968203,0.00004138333,0.0045696166],"genre_scores_gemma":[0.99280816,0.00001923384,0.006672554,0.0000048473566,0.000006605614,0.000022561304,0.00000240672,0.000023912336,0.00043970862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836266,0.00010674631,0.0004993572,0.0002540901,0.0005361835,0.0002409428],"domain_scores_gemma":[0.9975461,0.00019574008,0.0005889747,0.0010666073,0.000532582,0.00006999915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000790488,0.00014071362,0.00037726044,0.0000681926,0.0002313279,0.000037496797,0.0006357164,0.000068921116,0.0001014468],"category_scores_gemma":[0.0037417158,0.00011774924,0.0000814821,0.000091267735,0.0005264588,0.00018130428,0.00044700582,0.00014901302,0.0000048884017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017807815,0.00067748775,0.008853693,0.00039978052,0.00009801186,0.0000030923786,0.0015199012,0.00013259046,0.0055742674,0.97919625,0.00036819672,0.0029986463],"study_design_scores_gemma":[0.004690759,0.00037068233,0.0027906848,0.00049658667,0.00004615844,0.000001706518,0.00049532496,0.0074640648,0.163148,0.8198183,0.00032210207,0.00035559112],"about_ca_topic_score_codex":0.00004457124,"about_ca_topic_score_gemma":0.000004334514,"teacher_disagreement_score":0.15937792,"about_ca_system_score_codex":0.00007952213,"about_ca_system_score_gemma":0.00010532952,"threshold_uncertainty_score":0.48016745},"labels":[],"label_agreement":null},{"id":"W2768763745","doi":"10.1007/s10589-018-0016-0","title":"Mesh-based Nelder–Mead algorithm for inequality constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematical optimization; Simplex algorithm; Mathematics; Algorithm; Simplex; Rate of convergence; Point (geometry); Computer science; Linear programming; Key (lock)","score_opus":0.0606054398186082,"score_gpt":0.3863672623675488,"score_spread":0.3257618225489406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768763745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014002415,0.000027098778,0.9957167,0.0009825504,0.000059713926,0.0019275302,0.00019556592,0.000292087,0.00078474544],"genre_scores_gemma":[0.0036045602,0.000018570234,0.993031,0.0005526871,0.00027584634,0.0009951515,0.0012138401,0.000057905123,0.00025040592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980717,0.000093646355,0.00060560054,0.00054127467,0.0003842041,0.0003035858],"domain_scores_gemma":[0.99648404,0.0009987592,0.0002888111,0.0002938934,0.0017374072,0.00019706496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039606268,0.00024888557,0.0002748302,0.00025321025,0.0007006512,0.000138291,0.0001984945,0.00013910796,0.00035132564],"category_scores_gemma":[0.00032489642,0.0002678097,0.00007663126,0.00072502426,0.00043268767,0.00026354252,0.0000558115,0.000116673415,0.000011522966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014929016,0.00016957,0.000012654547,0.000035598885,0.000025824751,1.5954794e-7,0.000052085597,0.9150054,0.0000034100924,0.06068117,0.00049264653,0.023506574],"study_design_scores_gemma":[0.0014808411,0.000093300994,0.000010661578,0.000017319646,0.00003254362,0.0000053355534,0.00006089013,0.96029466,0.00006773262,0.036113802,0.0015468675,0.00027605254],"about_ca_topic_score_codex":0.0000019831152,"about_ca_topic_score_gemma":0.0000012270756,"teacher_disagreement_score":0.045289278,"about_ca_system_score_codex":0.000083213876,"about_ca_system_score_gemma":0.00023147122,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"W2772841103","doi":"10.1007/978-3-032-00906-7_9","title":"Mesh Adaptive Direct Search","year":2017,"lang":"en","type":"book-chapter","venue":"Springer series in operations research/Springer series in operations research and financial engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Polytechnique Montréal","funders":"","keywords":"Lipschitz continuity; Convergence (economics); Set (abstract data type); Global Positioning System; Mathematical optimization; Algorithm; Function (biology); Mathematics; Computer science; Pure mathematics","score_opus":0.09785867226774157,"score_gpt":0.37445671519216106,"score_spread":0.2765980429244195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772841103","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031843293,0.019639283,0.044725306,0.010531552,0.0049343244,0.03872711,0.0027149054,0.0022137759,0.8446705],"genre_scores_gemma":[0.06382179,0.026103158,0.14600433,0.000028600647,0.0017920651,0.0040374496,0.0002444345,0.00097316626,0.756995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900768,0.0005105519,0.0016368766,0.0020019882,0.0030906033,0.0026831974],"domain_scores_gemma":[0.9926796,0.0010813051,0.000062750434,0.0024717448,0.0030513864,0.00065319764],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0070610587,0.001035163,0.001450535,0.0050086826,0.0028369415,0.0018403477,0.0019490521,0.001119827,0.00059001066],"category_scores_gemma":[0.010212983,0.0011541626,0.00018525569,0.0010870692,0.0024649717,0.003029534,0.0030358282,0.007295381,0.00012857725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000417733,0.00026413336,0.00005271319,0.0005705913,0.000109331086,0.0005960672,0.0032109264,0.12146743,0.00042344528,0.8678156,0.0003991523,0.004672855],"study_design_scores_gemma":[0.0091344025,0.006589582,0.0020418623,0.013804988,0.00009827252,0.00056132436,0.0053256177,0.50557137,0.008742372,0.090918064,0.34588224,0.011329889],"about_ca_topic_score_codex":0.0009528124,"about_ca_topic_score_gemma":0.021303212,"teacher_disagreement_score":0.77689755,"about_ca_system_score_codex":0.0017817813,"about_ca_system_score_gemma":0.0022673116,"threshold_uncertainty_score":0.9991958},"labels":[],"label_agreement":null},{"id":"W2787872150","doi":"","title":"Optimisation sans dérivées sous contraintes","year":2016,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Physics; Art","score_opus":0.022053515775066774,"score_gpt":0.2879320715095542,"score_spread":0.26587855573448743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787872150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003129009,0.0056188777,0.9269846,0.058622718,0.00050409895,0.0018222996,0.00041947275,0.0010970323,0.0018018796],"genre_scores_gemma":[0.06724739,0.0070902156,0.84594357,0.001879655,0.0007696995,0.00092813733,0.000041793643,0.0003776931,0.07572182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942192,0.00060647825,0.0012382239,0.0009446514,0.0010284303,0.0019630555],"domain_scores_gemma":[0.9943043,0.0018853734,0.00059651455,0.001586393,0.0007831496,0.0008442762],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015420143,0.00079220184,0.0008407773,0.00072034256,0.0004674674,0.00032990135,0.00095028896,0.0008535602,0.0021786976],"category_scores_gemma":[0.004444035,0.00068765256,0.00039907204,0.0008783608,0.0007473749,0.0011637238,0.00041445362,0.00073747523,0.00039866322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032319728,0.0014142552,0.0030776141,0.00041902333,0.00041659825,0.0003048566,0.0014778674,0.013206254,0.019837549,0.43472755,0.03163256,0.4931627],"study_design_scores_gemma":[0.006234378,0.00097210566,0.0022837191,0.0021547498,0.0003456354,0.000909111,0.0013130883,0.63879144,0.06486831,0.19716233,0.0819687,0.0029964254],"about_ca_topic_score_codex":0.0017818067,"about_ca_topic_score_gemma":0.0015845806,"teacher_disagreement_score":0.6255852,"about_ca_system_score_codex":0.0021196085,"about_ca_system_score_gemma":0.0006909501,"threshold_uncertainty_score":0.99955744},"labels":[],"label_agreement":null},{"id":"W2788376296","doi":"10.3846/mma.2018.001","title":"An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones","year":2018,"lang":"en","type":"article","venue":"Mathematical Modelling and Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interior point method; Mathematics; Monotone polygon; Arc (geometry); Complementarity (molecular biology); Linear complementarity problem; Ellipse; Ellipsoid; Algorithm; Convergence (economics); Point (geometry); Path (computing); Search algorithm; Mathematical optimization; Combinatorics; Geometry; Computer science; Nonlinear system","score_opus":0.1097320074911878,"score_gpt":0.3968934424576526,"score_spread":0.28716143496646485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788376296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025819985,0.000032639065,0.97301954,0.00011154176,0.000015980617,0.00064812443,0.000090432426,0.00011179,0.00014998323],"genre_scores_gemma":[0.16027024,0.000033796205,0.8390499,0.000042364492,0.000117084535,0.00009195909,0.00006667045,0.000047979625,0.00028002952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975298,0.00011968393,0.0007019416,0.00058021105,0.0005414746,0.00052688754],"domain_scores_gemma":[0.99774176,0.00077062554,0.00013244039,0.00052695273,0.0005368884,0.0002913439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012377377,0.00027010875,0.00073350925,0.0006503245,0.0003458947,0.00015506535,0.00027204846,0.00010677806,0.00044771555],"category_scores_gemma":[0.00016151024,0.00022783494,0.00022309502,0.0012340661,0.00028372038,0.00022270344,0.00013321472,0.00021971464,0.000017859891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040720138,0.007192359,0.0019003759,0.004270081,0.012628829,0.000029524355,0.022714587,0.43076587,0.0013569542,0.36346456,0.00039207895,0.15487757],"study_design_scores_gemma":[0.0004757534,0.0002070876,0.000005115639,0.000039337407,0.00041014267,0.0000022894362,0.00023588225,0.822597,0.0005093638,0.17526112,0.00003514563,0.00022173054],"about_ca_topic_score_codex":0.000053071202,"about_ca_topic_score_gemma":0.00001469865,"teacher_disagreement_score":0.39183116,"about_ca_system_score_codex":0.00006806398,"about_ca_system_score_gemma":0.000026196516,"threshold_uncertainty_score":0.92908394},"labels":[],"label_agreement":null},{"id":"W2789177248","doi":"10.48550/arxiv.1802.07342","title":"A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematical optimization; Decomposition; Benders' decomposition; Integer (computer science); Integer programming; Nonlinear system; Decomposition method (queueing theory); Nonlinear programming; Global optimization; Linear programming; Optimization problem; Mathematics; Computer science","score_opus":0.14669611688337625,"score_gpt":0.3266549236918374,"score_spread":0.17995880680846116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789177248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037479,0.000014861486,0.99267936,0.000050636416,0.00035766547,0.0021441858,0.00021107639,0.00020716008,0.0005871472],"genre_scores_gemma":[0.037178516,0.00006080051,0.9613496,0.00001709751,0.00015014215,0.000017318062,0.00044076113,0.00007214356,0.0007135968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746877,0.00027468542,0.00057860697,0.0010073469,0.0002124209,0.00045814048],"domain_scores_gemma":[0.9961962,0.0002798193,0.0007710993,0.0008545431,0.0016966502,0.00020169538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062939,0.0004239323,0.0007075829,0.0002466912,0.00015005893,0.000058417078,0.0005866325,0.0005451883,0.000093721705],"category_scores_gemma":[0.0004229121,0.00047752383,0.00041545808,0.0005850432,0.00022873972,0.0002119879,0.00075892225,0.00040115326,0.000012686273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026868263,0.00057356805,0.00020570381,0.00061407586,0.00024328414,0.000018786935,0.00011572925,0.9822438,0.000013267988,0.014019398,0.00021157844,0.0014721503],"study_design_scores_gemma":[0.0014022526,0.00021598641,0.000013452649,0.00028417906,0.00021327201,0.0000062439517,0.00012247813,0.94883984,0.0005507365,0.04782403,0.00012226355,0.0004052513],"about_ca_topic_score_codex":0.00007224089,"about_ca_topic_score_gemma":0.00008175321,"teacher_disagreement_score":0.03380463,"about_ca_system_score_codex":0.0006596695,"about_ca_system_score_gemma":0.00031894498,"threshold_uncertainty_score":0.99976766},"labels":[],"label_agreement":null},{"id":"W2790000037","doi":"10.48550/arxiv.1803.02414","title":"A gradient method in a Hilbert space with an optimized inner product: achieving a Newton-like convergence","year":2018,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Ottawa","funders":"","keywords":"Mathematics; Linear subspace; Gradient descent; Hilbert space; Applied mathematics; Subspace topology; Projection (relational algebra); Convergence (economics); Inner product space; Parameterized complexity; Mathematical analysis; Combinatorics; Algorithm; Pure mathematics; Computer science","score_opus":0.08983312980673834,"score_gpt":0.38689197863998437,"score_spread":0.297058848833246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790000037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38178536,0.00019527247,0.6106525,0.0023570762,0.00066432665,0.003325781,0.000025765607,0.00037890786,0.00061502005],"genre_scores_gemma":[0.020475725,0.00017085529,0.97285676,0.00017907628,0.00032644192,0.0006711509,0.00007562604,0.00024534095,0.0049990383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487036,0.0007402848,0.00085588277,0.0017718482,0.0008325167,0.00092908344],"domain_scores_gemma":[0.99560916,0.00047753012,0.00060706143,0.0022145906,0.000732896,0.00035876082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017231216,0.00072622614,0.0010862199,0.0005399685,0.00017088884,0.000107517364,0.0010350475,0.0003412526,0.0003658993],"category_scores_gemma":[0.0017029857,0.00062663783,0.00013654817,0.00093004835,0.00029515306,0.0003973018,0.0013304865,0.0015817649,0.00007382228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00792159,0.009260868,0.32257324,0.008165522,0.0026688534,0.0015104895,0.05167389,0.56200176,0.002910239,0.009176681,0.01337666,0.008760161],"study_design_scores_gemma":[0.015298346,0.0021258832,0.026610907,0.0056893076,0.0007139547,0.00038974252,0.0024518536,0.8871816,0.010108638,0.028859384,0.0125948135,0.007975615],"about_ca_topic_score_codex":0.00029720087,"about_ca_topic_score_gemma":0.00031230893,"teacher_disagreement_score":0.36220425,"about_ca_system_score_codex":0.0004401174,"about_ca_system_score_gemma":0.0005611519,"threshold_uncertainty_score":0.9996185},"labels":[],"label_agreement":null},{"id":"W2790082774","doi":"10.5539/jmr.v10n2p36","title":"Algorithms for Asymptotically Exact Minimizations in Karush-Kuhn-Tucker Methods","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Karush–Kuhn–Tucker conditions; Convergence (economics); Minification; Applied mathematics; Asymptotically optimal algorithm; Mathematical optimization","score_opus":0.36572592166246093,"score_gpt":0.5969951996691925,"score_spread":0.23126927800673153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790082774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002377705,0.000103433515,0.9914869,0.0014322001,0.00022654817,0.0010005911,0.000014449966,0.00002744134,0.0033306975],"genre_scores_gemma":[0.0020394123,0.00013490322,0.9941876,0.00003341795,0.00056695886,0.00006682962,0.0000025723193,0.00011070524,0.0028576115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941279,0.0008836704,0.001748353,0.00032272493,0.0019545662,0.0009627579],"domain_scores_gemma":[0.9817741,0.011277794,0.00053039903,0.000629995,0.0054214736,0.0003662376],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.016733527,0.00025343348,0.0007643336,0.001612395,0.00030784274,0.00017851219,0.0010166118,0.00025031142,0.00058416673],"category_scores_gemma":[0.029607154,0.00020900641,0.00023175,0.0016414663,0.0005524711,0.000421826,0.00027082092,0.0010750998,0.000050363542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015417612,0.019049361,0.0005806256,0.005360311,0.001796634,0.00045801562,0.03882389,0.005240286,0.017131224,0.61824065,0.1117857,0.17999153],"study_design_scores_gemma":[0.002952315,0.0011175828,0.00006219834,0.00053076004,0.000049735612,0.00021494995,0.0029004477,0.30170596,0.0075790384,0.67327,0.009224976,0.00039207187],"about_ca_topic_score_codex":0.0000026146897,"about_ca_topic_score_gemma":0.000018662018,"teacher_disagreement_score":0.29646567,"about_ca_system_score_codex":0.00039274967,"about_ca_system_score_gemma":0.0006562337,"threshold_uncertainty_score":0.9785669},"labels":[],"label_agreement":null},{"id":"W2790720375","doi":"10.1007/s10898-017-0601-2","title":"Corrections to: Differentiable McCormick relaxations","year":2018,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Differentiable function; Mathematics; Regular polygon; Watson; Applied mathematics; Mathematical economics; Pure mathematics; Combinatorics; Geometry; Computer science","score_opus":0.03579917435867024,"score_gpt":0.38492927748450695,"score_spread":0.3491301031258367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790720375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054461784,0.000018899327,0.9876654,0.0006569939,0.00070695597,0.00021243829,0.000014126993,0.00004757312,0.0052314224],"genre_scores_gemma":[0.06279916,0.00004682302,0.9348181,0.00015215822,0.00047874372,0.0000059959975,0.0000053269923,0.000026238367,0.0016674779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984508,0.00007933558,0.00059687864,0.00014063812,0.0004959549,0.00023637174],"domain_scores_gemma":[0.99703807,0.00011828545,0.00046800813,0.0002137243,0.0019486044,0.0002133366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002906558,0.0001278375,0.00022729745,0.0001633177,0.00023053812,0.00007936961,0.00023924636,0.00008253074,0.00064707483],"category_scores_gemma":[0.0019907968,0.00011540846,0.00009006615,0.001163321,0.00006666846,0.00046014463,0.00006482911,0.00015436347,0.000059534388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016420429,0.00041397908,0.0025063467,0.000015907119,0.00010539459,0.0000077710665,0.00025837356,0.93110913,0.0000842121,0.016625471,0.046053812,0.0026553718],"study_design_scores_gemma":[0.003308185,0.0021679646,0.0029517387,0.00033271033,0.00026397366,0.00050282816,0.00079641276,0.9166441,0.0009917457,0.056243636,0.01501164,0.00078505237],"about_ca_topic_score_codex":0.000004660271,"about_ca_topic_score_gemma":0.000017395645,"teacher_disagreement_score":0.057352986,"about_ca_system_score_codex":0.0004187118,"about_ca_system_score_gemma":0.00016003833,"threshold_uncertainty_score":0.7085016},"labels":[],"label_agreement":null},{"id":"W2791867344","doi":"10.1007/s10898-018-0612-7","title":"Global optimization of MIQCPs with dynamic piecewise relaxations","year":2018,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundação para a Ciência e a Tecnologia; Ontario Research Foundation","keywords":"Mathematics; Mathematical optimization; Global optimization; Piecewise; Bilinear interpolation; Benchmark (surveying); Relaxation (psychology); Integer programming; Integer (computer science); Optimization problem; Branch and price; Nonlinear programming; Branch and bound; Nonlinear system; Computer science","score_opus":0.018627814204502404,"score_gpt":0.3480092862410984,"score_spread":0.329381472036596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791867344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002967236,0.000098927776,0.99260765,0.000798248,0.00021782746,0.00033645643,0.000062659565,0.000050349074,0.0028606462],"genre_scores_gemma":[0.119136006,0.00021404625,0.88026845,0.000055197484,0.00016279084,0.0000045035213,0.000022533399,0.000032783635,0.000103670594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714375,0.0001642229,0.0010919007,0.00024321415,0.001027738,0.00032919264],"domain_scores_gemma":[0.9937586,0.00012332846,0.0016862857,0.0003635288,0.0038621866,0.0002060488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050168036,0.00024162327,0.0004661293,0.00021841675,0.00016920258,0.00006760434,0.00039056744,0.00017025696,0.00021668898],"category_scores_gemma":[0.001517745,0.0002114071,0.00012743507,0.0024489707,0.00030454487,0.0008826137,0.00007697145,0.00015605486,0.0000049499554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034327895,0.00026732657,0.0015483476,0.00003421049,0.000110816945,0.000009529264,0.00006597035,0.99049747,0.000007293272,0.0054069506,0.0005417099,0.0011671033],"study_design_scores_gemma":[0.0022162728,0.00089134614,0.0007325193,0.0002076129,0.00014326151,0.00028633015,0.00018649775,0.9876943,0.000042560387,0.0072457767,0.00010167285,0.0002518072],"about_ca_topic_score_codex":0.000009431851,"about_ca_topic_score_gemma":0.000028570692,"teacher_disagreement_score":0.11616877,"about_ca_system_score_codex":0.0009742414,"about_ca_system_score_gemma":0.00070233183,"threshold_uncertainty_score":0.86209315},"labels":[],"label_agreement":null},{"id":"W2792096534","doi":"10.1016/j.dam.2018.02.001","title":"Preface: Linear optimization","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.046832346095364685,"score_gpt":0.36373938567326275,"score_spread":0.31690703957789806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792096534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010132514,0.000009522468,0.928781,0.00011434619,0.00008260155,0.0007827883,0.000015810558,0.00040257897,0.068798125],"genre_scores_gemma":[0.010258445,0.000024412151,0.9869781,0.00008565366,0.00030919397,0.00012130611,0.000035928846,0.0001277189,0.0020592334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978715,0.000023952363,0.0005680092,0.0003963606,0.00064864475,0.00049150316],"domain_scores_gemma":[0.998141,0.00031491346,0.0002517364,0.000798289,0.0003237585,0.00017033455],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041090068,0.0002927679,0.0003661168,0.00015297993,0.0002663353,0.00006823826,0.00041504332,0.00015666947,0.0011900928],"category_scores_gemma":[0.00053802325,0.00025973743,0.000075382275,0.00054440723,0.00027682507,0.00016941575,0.00020959665,0.0002237321,0.00043748788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009492024,0.0006729903,0.00000967933,0.000694736,0.00018857233,0.000007859842,0.0055312067,0.03769835,0.0025170788,0.9418918,0.006337228,0.0043556048],"study_design_scores_gemma":[0.0009458733,0.000102291226,0.0000023352752,0.000064470114,0.000058893824,0.000012337156,0.0008986226,0.7904082,0.010707992,0.19415791,0.0020929775,0.0005481099],"about_ca_topic_score_codex":7.609165e-7,"about_ca_topic_score_gemma":0.0000018235572,"teacher_disagreement_score":0.75270987,"about_ca_system_score_codex":0.00007865971,"about_ca_system_score_gemma":0.00005871398,"threshold_uncertainty_score":0.99998546},"labels":[],"label_agreement":null},{"id":"W2795213612","doi":"10.2298/yjor180120014g","title":"Less is more: Simplified Nelder-Mead method for large unconstrained optimization","year":2018,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Regular polygon; Mathematical optimization; Simplex; Simplex algorithm; Simple (philosophy); Algorithm; Computer science; Continuous optimization; Mathematics; Optimization problem; Convex optimization; Linear programming; Combinatorics; Multi-swarm optimization; Geometry","score_opus":0.2462101905584332,"score_gpt":0.5465173684657684,"score_spread":0.3003071779073352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795213612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017084503,0.00007123441,0.9904083,0.005307255,0.00018766336,0.0010493431,0.000087269415,0.000031794716,0.0011486672],"genre_scores_gemma":[0.016723922,0.000098632634,0.9774769,0.00021615205,0.00076252664,0.00008933294,0.00002613436,0.00008087761,0.004525507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569416,0.00064374326,0.0010343891,0.00035370773,0.0014930238,0.0007809925],"domain_scores_gemma":[0.9874712,0.001679897,0.00017817252,0.00052994204,0.0098256115,0.00031513022],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0060609626,0.00021891174,0.00045716544,0.0009750441,0.0011360617,0.00035695115,0.00069546857,0.00019720796,0.001175827],"category_scores_gemma":[0.006703333,0.00018873392,0.00018596869,0.0014001258,0.00029514308,0.0007252988,0.0001664451,0.00073597714,0.000022012926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016507506,0.0031841483,0.00017496213,0.00053836626,0.0011878881,0.00009465263,0.019357333,0.5369676,0.010856878,0.2070916,0.14726765,0.07162819],"study_design_scores_gemma":[0.0029751332,0.0007457307,0.000008031408,0.00009302779,0.000036298745,0.00011434463,0.004427887,0.96608603,0.0102470005,0.010281603,0.004739368,0.00024553319],"about_ca_topic_score_codex":0.000013201971,"about_ca_topic_score_gemma":0.00005376106,"teacher_disagreement_score":0.42911848,"about_ca_system_score_codex":0.00026209457,"about_ca_system_score_gemma":0.0010211798,"threshold_uncertainty_score":0.99973726},"labels":[],"label_agreement":null},{"id":"W2805409131","doi":"10.1007/978-3-319-90026-1_8","title":"Stabilized Optimization Via an NCL Algorithm","year":2018,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Solver; Jacobian matrix and determinant; Augmented Lagrangian method; Mathematical optimization; Sequence (biology); Nonlinear programming; Computer science; Nonlinear system; Mathematics; Trust region; Algorithm; Applied mathematics","score_opus":0.045316859540277935,"score_gpt":0.33773485270753556,"score_spread":0.29241799316725764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805409131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011003168,0.00006922935,0.9187117,0.000031482305,0.00026808266,0.0018835329,0.00040974544,0.00039878685,0.0782164],"genre_scores_gemma":[0.000004397898,0.00042652743,0.87512904,0.000031254407,0.00039735585,0.00011701659,0.00017700033,0.00061966147,0.12309775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384934,0.000026625094,0.0020761946,0.0012395262,0.0018199999,0.0009883277],"domain_scores_gemma":[0.99436677,0.00067819253,0.00142701,0.000849103,0.0022733968,0.00040552756],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014893101,0.0011304328,0.0014854174,0.0009365375,0.00024616133,0.00033010863,0.0010152285,0.00086658093,0.0033923653],"category_scores_gemma":[0.0017059296,0.0012113506,0.00014705028,0.00024889875,0.00053598674,0.00056417874,0.00051229255,0.0013005036,0.00023682228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090083464,0.0011730923,0.000007864111,0.005206184,0.00035056964,0.00015092111,0.008672756,0.0013453527,0.00007770827,0.95047957,0.006283776,0.02616211],"study_design_scores_gemma":[0.00065468927,0.00015078302,5.3886214e-7,0.00049419503,0.00011212594,0.000025034145,0.00019086705,0.38578308,0.000052698386,0.60808426,0.0035875873,0.0008641537],"about_ca_topic_score_codex":0.00000430954,"about_ca_topic_score_gemma":0.000024912024,"teacher_disagreement_score":0.3844377,"about_ca_system_score_codex":0.0007384238,"about_ca_system_score_gemma":0.00024424464,"threshold_uncertainty_score":0.99903363},"labels":[],"label_agreement":null},{"id":"W2811061659","doi":"10.3934/jimo.2018107","title":"An interior point continuous path-following trajectory for linear programming","year":2018,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ode; Trajectory; Path (computing); Ordinary differential equation; Interior point method; Mathematics; Descent (aeronautics); Convergence (economics); Computer science; Mathematical optimization; Applied mathematics; Mathematical analysis; Differential equation","score_opus":0.07256755066339415,"score_gpt":0.36273675370633346,"score_spread":0.2901692030429393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811061659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008520347,0.00002606106,0.98965377,0.000197068,0.00056773314,0.00084175786,0.0000030181227,0.000033826072,0.00015644309],"genre_scores_gemma":[0.01915994,0.000099134595,0.9792639,0.000050614282,0.0010771377,0.000026316347,0.000009573195,0.00003819553,0.00027517986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870336,0.000077059434,0.0005584499,0.00015919427,0.0002929605,0.0002089698],"domain_scores_gemma":[0.99886155,0.000090376,0.0004169911,0.00012432312,0.00039187333,0.00011488812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009781519,0.00013034373,0.00026211544,0.00024906802,0.00015195576,0.00010820614,0.00015281385,0.000097016484,0.00003525102],"category_scores_gemma":[0.00040187247,0.000111287416,0.00009207626,0.00021144398,0.000053866333,0.0005299081,0.00004490984,0.00014658237,4.758013e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030865718,0.0012820488,0.00070392096,0.00042445108,0.0013342925,0.00012616189,0.0031420349,0.12300972,0.00047889428,0.007800855,0.0063758,0.85223526],"study_design_scores_gemma":[0.021122707,0.008548304,0.00002866011,0.001315425,0.00081994437,0.0000820311,0.007341781,0.93291235,0.0018881467,0.00411818,0.020892248,0.00093024457],"about_ca_topic_score_codex":9.93118e-7,"about_ca_topic_score_gemma":8.631024e-7,"teacher_disagreement_score":0.851305,"about_ca_system_score_codex":0.00006594794,"about_ca_system_score_gemma":0.000033820692,"threshold_uncertainty_score":0.45381692},"labels":[],"label_agreement":null},{"id":"W2851221906","doi":"","title":"How to Compute a Local Minimum of the MPCC","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Stationary point; Convergence (economics); Point (geometry); Mathematics; Sequence (biology); Relaxation (psychology); Mathematical optimization; Applied mathematics; Stationary state; Mathematical analysis; Geometry; Physics","score_opus":0.07827596401453407,"score_gpt":0.38277139581106123,"score_spread":0.30449543179652716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2851221906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025346733,0.0000037571067,0.9817224,0.0063450127,0.00008573627,0.0002639778,0.0000031010106,0.000023121573,0.00901821],"genre_scores_gemma":[0.27422547,0.0000031271923,0.6679169,0.00022231415,0.00006283063,0.000012929887,4.663448e-7,0.000023415365,0.05753253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993487,0.000023669372,0.00010226823,0.00010995546,0.0002758819,0.00013949738],"domain_scores_gemma":[0.99874485,0.00012634518,0.00008517252,0.0008009346,0.00016108806,0.00008161203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010699367,0.000060539947,0.00011555595,0.000026374337,0.00016223294,0.000071896546,0.000596337,0.000030759253,0.00005464179],"category_scores_gemma":[0.0010534218,0.000037306047,0.00004366979,0.000060566003,0.00013569072,0.000090531124,0.0004024559,0.00007254371,0.00001555659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016346446,0.0008099552,0.0019781922,0.0004841637,0.00022930991,0.00002323424,0.0036640584,0.008990709,0.0021867077,0.58734816,0.18248293,0.2116391],"study_design_scores_gemma":[0.0031264178,0.0003740633,0.0016668421,0.00024758233,0.00003432911,0.000023382705,0.002686663,0.689507,0.061328504,0.17718993,0.063059814,0.00075546734],"about_ca_topic_score_codex":0.000005373492,"about_ca_topic_score_gemma":0.00001906391,"teacher_disagreement_score":0.6805163,"about_ca_system_score_codex":0.000019853062,"about_ca_system_score_gemma":0.00003906178,"threshold_uncertainty_score":0.15212964},"labels":[],"label_agreement":null},{"id":"W2883106675","doi":"10.1080/02331934.2018.1482297","title":"Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term","year":2018,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shiraz University of Technology; Shahrekord University; K.N.Toosi University of Technology; York University","keywords":"Mathematics; Kernel (algebra); Trigonometric functions; Mathematical optimization; Variable kernel density estimation; Simple (philosophy); Algorithm; Bounded function; Interior point method; Applied mathematics; Kernel method; Computer science; Discrete mathematics; Artificial intelligence; Support vector machine; Mathematical analysis","score_opus":0.0408754261256368,"score_gpt":0.3554681554258558,"score_spread":0.314592729300219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883106675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007410488,0.0000072230246,0.994491,0.0003225907,0.00021179853,0.0018575253,0.000040771265,0.00032283246,0.002672171],"genre_scores_gemma":[0.007908345,0.000016578397,0.98964024,0.0003024919,0.000379968,0.00038611933,0.00039257717,0.00017105948,0.000802644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973704,0.00020879674,0.0006069062,0.00073807716,0.0005914119,0.00048439734],"domain_scores_gemma":[0.9964983,0.00073329255,0.00044454582,0.0005340012,0.0016154269,0.00017442441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008591743,0.00038588681,0.0004139783,0.0010532797,0.00053556496,0.00011829645,0.00022108952,0.00021512549,0.0007873032],"category_scores_gemma":[0.0018075658,0.00033948154,0.00011342657,0.0019309976,0.00012276403,0.0005781921,0.00008218728,0.00021627921,0.000017452865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015321113,0.0002465385,0.00004280535,0.000104079125,0.00005109231,0.0000013767752,0.00016713775,0.99340636,0.000033364802,0.0015687397,0.00028180753,0.002564572],"study_design_scores_gemma":[0.0033113235,0.002153239,0.000017621509,0.00009750726,0.0000974064,0.0000077441355,0.000060262468,0.99162185,0.0014032109,0.0006718447,0.0001611081,0.00039685567],"about_ca_topic_score_codex":0.0000045126835,"about_ca_topic_score_gemma":0.000003307813,"teacher_disagreement_score":0.007834241,"about_ca_system_score_codex":0.00035228228,"about_ca_system_score_gemma":0.000184187,"threshold_uncertainty_score":0.9999057},"labels":[],"label_agreement":null},{"id":"W2883514251","doi":"10.1007/s10957-018-1344-z","title":"Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shiraz University of Technology; York University","keywords":"Mathematics; Interior point method; Theory of computation; Mathematical optimization; Applied mathematics; Mixed complementarity problem; Complementarity (molecular biology); Term (time); Algorithm; Nonlinear system","score_opus":0.12883433508910186,"score_gpt":0.43512796934725667,"score_spread":0.3062936342581548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883514251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028407052,0.00005018615,0.99602455,0.00006403152,0.000022094844,0.000863101,0.00003627031,0.000009691395,0.00008937502],"genre_scores_gemma":[0.061623808,0.00003686268,0.9381603,0.000018455985,0.00006208117,0.000041641226,0.000012899983,0.000020548761,0.000023374609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998576,0.00022894308,0.00077275606,0.0001396714,0.00016283193,0.00011981159],"domain_scores_gemma":[0.9960463,0.0007253992,0.0012109033,0.00017129586,0.001772899,0.00007318334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018092972,0.0001139564,0.00035552713,0.0004008168,0.00017084762,0.00001743561,0.000151939,0.000048672453,0.00009603195],"category_scores_gemma":[0.00040333424,0.00009161133,0.00007363134,0.00072451914,0.0004396994,0.00024579026,0.000049147282,0.00011306053,1.1905033e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004763604,0.0015249599,0.00092255947,0.0016614696,0.00093774626,3.2459545e-7,0.0023019265,0.14397624,0.01064553,0.8134035,0.0000611893,0.019800927],"study_design_scores_gemma":[0.0033199373,0.0015779642,0.00013984369,0.00019173155,0.0003709466,0.000053763128,0.0009933821,0.6562454,0.010343829,0.3262983,0.00024364807,0.0002212257],"about_ca_topic_score_codex":0.000002315078,"about_ca_topic_score_gemma":0.0000013836753,"teacher_disagreement_score":0.5122692,"about_ca_system_score_codex":0.000058360358,"about_ca_system_score_gemma":0.00008410298,"threshold_uncertainty_score":0.37358016},"labels":[],"label_agreement":null},{"id":"W2896436568","doi":"","title":"Mesh-based Nelder-Mead algorithm for inequality constrained optimization","year":2017,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Convergence (economics); Mathematical optimization; Algorithm; Simplex algorithm; Computer science; Mathematics; Point (geometry); Linear programming","score_opus":0.04647607653764747,"score_gpt":0.3423832298216191,"score_spread":0.29590715328397166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896436568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040609555,0.00007164943,0.9910399,0.004185513,0.00015023662,0.0024131495,0.00027657874,0.000830869,0.00062605424],"genre_scores_gemma":[0.019175585,0.00005352693,0.9768207,0.00069361547,0.00018869463,0.001465893,0.00014352181,0.00014953602,0.0013089275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967225,0.00020377288,0.00079088483,0.00067535305,0.0006416564,0.0009658321],"domain_scores_gemma":[0.9952776,0.00080989837,0.0007553362,0.001986247,0.00075654685,0.00041438325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016494875,0.0004620821,0.0006142486,0.00038842083,0.0012384519,0.00054942333,0.0010836436,0.00042433923,0.00015612885],"category_scores_gemma":[0.004720491,0.00048011343,0.0002730296,0.000262694,0.00036164056,0.00068664475,0.00024904223,0.0004385506,0.0000074844884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005056087,0.0020820242,0.0034513422,0.0005938938,0.0003618622,0.000113739705,0.00041348813,0.3196551,0.0014602239,0.1626655,0.009738731,0.4989585],"study_design_scores_gemma":[0.0020797933,0.00016112998,0.00026302738,0.00006562086,0.000043768992,0.00001673396,0.0000580734,0.9702542,0.005340221,0.02059079,0.0006216971,0.00050497],"about_ca_topic_score_codex":0.0006244676,"about_ca_topic_score_gemma":0.00027005438,"teacher_disagreement_score":0.65059906,"about_ca_system_score_codex":0.00048391832,"about_ca_system_score_gemma":0.0005212055,"threshold_uncertainty_score":0.99976504},"labels":[],"label_agreement":null},{"id":"W2897413842","doi":"10.1007/s10107-022-01775-x","title":"Nonlinear acceleration of momentum and primal-dual algorithms","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"Agence Nationale de la Recherche; Defense Advanced Research Projects Agency; U.S. Department of Defense","keywords":"Iterated function; Mathematics; Acceleration; Numerical analysis; Operator (biology); Momentum (technical analysis); Convergence (economics); Nonlinear system; Applied mathematics; Algorithm; Interior point method; Rate of convergence; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.06656881159893424,"score_gpt":0.36403268006520184,"score_spread":0.2974638684662676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897413842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07321976,0.0001456774,0.92112714,0.0007197604,0.000103881124,0.0022051781,0.000038321916,0.00032679914,0.0021134722],"genre_scores_gemma":[0.039817855,0.000006713232,0.9589907,0.000019504841,0.000050145787,0.00027775025,0.000020398187,0.00005009134,0.0007668334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979607,0.000105585095,0.00051998085,0.00026796802,0.0008199801,0.00032577655],"domain_scores_gemma":[0.99890757,0.0004258312,0.00017609893,0.0002598239,0.00012164091,0.0001090198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087653205,0.00015086187,0.00030981362,0.00013173574,0.00026101602,0.00005896587,0.000175153,0.000043304735,0.00067628344],"category_scores_gemma":[0.0005870504,0.0001436633,0.000058138034,0.00036786302,0.0001322507,0.00014978876,0.00045406795,0.0002908379,0.0000061062065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018855839,0.0062546106,0.00023204635,0.003142488,0.00033004247,0.00009571332,0.009990496,0.0016137697,0.0038123727,0.4427434,0.0007777506,0.53081876],"study_design_scores_gemma":[0.0020832145,0.00091537373,0.000012838037,0.00007807614,0.00008840954,0.00017706715,0.005085,0.62258506,0.0064653545,0.3544323,0.0074481354,0.0006291666],"about_ca_topic_score_codex":0.0000014858279,"about_ca_topic_score_gemma":2.9164934e-7,"teacher_disagreement_score":0.62097126,"about_ca_system_score_codex":0.00007911004,"about_ca_system_score_gemma":0.00004205451,"threshold_uncertainty_score":0.740483},"labels":[],"label_agreement":null},{"id":"W2898960061","doi":"","title":"A Unified Framework of Regularization Methods for Degenerate Non-Linear Optimization Models","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Regularization (linguistics); Degenerate energy levels; Computer science; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Physics; Artificial intelligence; Quantum mechanics","score_opus":0.06302388024644533,"score_gpt":0.3736050584626802,"score_spread":0.3105811782162349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898960061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029821653,0.00020398112,0.9914725,0.0012846007,0.00022455893,0.0016970623,0.000119164426,0.00020540775,0.0044945097],"genre_scores_gemma":[0.002205573,0.0003945564,0.98994964,0.000031751155,0.00006103141,0.0003071433,0.001102043,0.00015104671,0.0057972106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99103534,0.0060472996,0.0010656087,0.0009046075,0.0005246377,0.00042252443],"domain_scores_gemma":[0.97913826,0.005528066,0.0012563823,0.002514695,0.011380562,0.00018202556],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010959422,0.00042021213,0.0006854351,0.00039582778,0.00033988414,0.00017620383,0.0012032383,0.0007060255,0.00012283167],"category_scores_gemma":[0.015123717,0.00046341488,0.00023858846,0.0008440822,0.00032189244,0.000241195,0.0011145397,0.0005941386,0.000003588492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008275537,0.0005882975,0.000010601112,0.0008420899,0.00018037406,4.8889757e-7,0.0048659868,0.5169683,0.0008591325,0.46105224,0.00043738587,0.01411232],"study_design_scores_gemma":[0.0003589401,7.981051e-7,0.0000020187138,0.00092330034,0.000053514366,0.0000010245407,0.000033416567,0.6528753,0.05069639,0.29462335,0.0001792743,0.0002526485],"about_ca_topic_score_codex":0.000050991646,"about_ca_topic_score_gemma":0.000030480789,"teacher_disagreement_score":0.16642891,"about_ca_system_score_codex":0.0001694948,"about_ca_system_score_gemma":0.00054166606,"threshold_uncertainty_score":0.9997817},"labels":[],"label_agreement":null},{"id":"W2905998793","doi":"","title":"Exact separation of \\(k\\)-projection polytope constraints","year":2015,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Mathematics; Cutting-plane method; Projection (relational algebra); Relaxation (psychology); Combinatorics; Cone (formal languages); Integer (computer science); Constraint (computer-aided design); Mathematical optimization; Plane (geometry); Optimization problem; Algorithm; Integer programming; Geometry; Computer science","score_opus":0.042013246999530865,"score_gpt":0.33612874725682707,"score_spread":0.2941155002572962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905998793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009508838,0.004452272,0.9700828,0.005205344,0.0007178898,0.001919324,0.00023350518,0.00048909476,0.007390899],"genre_scores_gemma":[0.18082215,0.00124088,0.786401,0.0004896453,0.00052401784,0.00042455876,0.000097196724,0.00023625,0.029764315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947229,0.00066938833,0.0013079894,0.00065947615,0.0015097682,0.0011304972],"domain_scores_gemma":[0.9949947,0.00043514982,0.0008232827,0.0011702669,0.0017898018,0.0007868267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002746672,0.0005731696,0.00081272423,0.00086672866,0.0002047332,0.00016314254,0.0005751638,0.00077998516,0.00052585447],"category_scores_gemma":[0.0037278996,0.0006565296,0.00026784642,0.0015199861,0.00095892383,0.0010558998,0.00030246624,0.0008735664,0.00012979654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011723065,0.0044414653,0.0089319935,0.0014889982,0.0007268504,0.00031844832,0.007978465,0.103499204,0.012437118,0.41688165,0.074551344,0.36757216],"study_design_scores_gemma":[0.00286442,0.0009695513,0.00088495313,0.00050897186,0.00019196459,0.00062182586,0.002727706,0.89914393,0.040933,0.03564374,0.014429482,0.0010804422],"about_ca_topic_score_codex":0.005341685,"about_ca_topic_score_gemma":0.0013952141,"teacher_disagreement_score":0.79564476,"about_ca_system_score_codex":0.0023356674,"about_ca_system_score_gemma":0.0019897276,"threshold_uncertainty_score":0.9995886},"labels":[],"label_agreement":null},{"id":"W2913411363","doi":"10.1201/9781584888239-c32","title":"Convex Optimization","year":2009,"lang":"en","type":"book","venue":"Chapman & Hall/CRC applied algorithms and data structures series","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conic optimization; Regular polygon; Mathematics; Mathematical optimization; Convex optimization; Computer science; Convex analysis; Geometry","score_opus":0.06386492561833429,"score_gpt":0.3371041092670929,"score_spread":0.2732391836487586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913411363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000537889,0.0035562506,0.64467263,0.0006868523,0.00065173977,0.0039512594,0.0047518504,0.0012401434,0.34048393],"genre_scores_gemma":[0.000020798234,0.003972753,0.79216975,0.0003157208,0.0014545849,0.000049251263,0.0149284685,0.00035785398,0.18673085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498004,0.000060974984,0.0010080462,0.001950871,0.0011396975,0.00086035917],"domain_scores_gemma":[0.99548084,0.00026622709,0.0007003805,0.0028116482,0.0003271546,0.000413734],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042053912,0.0011507655,0.0014045781,0.00040622798,0.0005960545,0.00048514514,0.0017299876,0.0009517605,0.00097135315],"category_scores_gemma":[0.00022183562,0.0010806896,0.000100959,0.00024446083,0.0007728996,0.0008094524,0.0015753476,0.0011691629,0.000023946472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024877465,0.00009792626,9.106073e-7,0.0010323278,0.0004947557,0.0000915261,0.000713999,0.0057561505,0.000015339458,0.7799491,0.11412262,0.09747653],"study_design_scores_gemma":[0.0015101826,0.00017939346,0.000011111536,0.0001625677,0.00026453738,0.00019412258,0.00030134295,0.029152809,0.000079919184,0.73673207,0.22958541,0.0018265451],"about_ca_topic_score_codex":0.000007752312,"about_ca_topic_score_gemma":0.00002115641,"teacher_disagreement_score":0.15375309,"about_ca_system_score_codex":0.00019754667,"about_ca_system_score_gemma":0.0004310498,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W2915050298","doi":"10.1007/s10107-021-01663-w","title":"Status determination by interior-point methods for convex optimization problems in domain-driven form","year":2021,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Conic section; Conic optimization; Duality (order theory); Mathematical optimization; Domain (mathematical analysis); Context (archaeology); Dual (grammatical number); Duality gap; Regular polygon; Interior point method; Computer science; Point (geometry); Convex optimization; Mathematics; Effective domain; Optimization problem; Convex analysis; Discrete mathematics; Geometry","score_opus":0.07236776562694941,"score_gpt":0.4375472251117842,"score_spread":0.36517945948483477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915050298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059508986,0.0002130014,0.9918211,0.00024966436,0.00018151657,0.006238757,0.00003373328,0.00028215072,0.00038500485],"genre_scores_gemma":[0.0011062409,0.00008287248,0.9931339,0.000032733842,0.00004888059,0.0045389603,0.00057459844,0.00021683465,0.0002649644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950096,0.00046476407,0.0017523589,0.0010452344,0.00062020525,0.0011078274],"domain_scores_gemma":[0.99539936,0.0020396053,0.0007414007,0.0008227923,0.0007093249,0.0002875094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023220466,0.0006323424,0.0012839166,0.0004037445,0.00015131017,0.00058710494,0.0005333888,0.0006685312,0.0002762281],"category_scores_gemma":[0.0049182046,0.00063096656,0.00032966209,0.00048055223,0.00019140636,0.00038001544,0.0010269742,0.0010195005,0.0000049347445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016967942,0.0034528023,0.00011116197,0.037562214,0.00052390713,0.000045212688,0.03124981,0.0946225,0.001044817,0.021465635,0.00037580245,0.8093765],"study_design_scores_gemma":[0.0010100969,0.00010991408,5.9506334e-7,0.0011753994,0.000058863512,0.000011448343,0.0011942909,0.7678319,0.0005202911,0.22686444,0.0006668644,0.00055584667],"about_ca_topic_score_codex":0.00000768951,"about_ca_topic_score_gemma":0.00001516532,"teacher_disagreement_score":0.8088206,"about_ca_system_score_codex":0.00087813305,"about_ca_system_score_gemma":0.00023787397,"threshold_uncertainty_score":0.9996142},"labels":[],"label_agreement":null},{"id":"W2917843279","doi":"","title":"The SCIP Optimization Suite 3.2","year":2016,"lang":"en","type":"article","venue":"TUbilio (Technical University of Darmstadt)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Integer programming; Heuristics; Suite; Linear programming; Mathematical optimization; Branch and bound; Nonlinear programming; Quadratic programming; Optimization problem; Constraint programming; Parallel computing; Algorithm; Programming language; Nonlinear system; Mathematics; Stochastic programming","score_opus":0.03001465655743017,"score_gpt":0.29303033413030655,"score_spread":0.26301567757287636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917843279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024709555,0.000033192726,0.9892319,0.0022896556,0.000041978834,0.00038604208,0.000023478222,0.00020995892,0.005312839],"genre_scores_gemma":[0.2537363,0.0014337243,0.72147995,0.00004310641,0.000067613466,0.0000028140266,0.000009605877,0.00007315893,0.023153739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986633,0.000118806565,0.0002180994,0.00025504865,0.00045211666,0.00029261064],"domain_scores_gemma":[0.99744827,0.0013637474,0.00014788858,0.0005885518,0.0003371269,0.00011440762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005832537,0.000116072464,0.000191171,0.00010566068,0.0003327312,0.000015204624,0.00061566825,0.00010657679,0.00044849416],"category_scores_gemma":[0.0011889982,0.00007577103,0.00010013611,0.00045062494,0.0006536814,0.0002394829,0.00030728313,0.00014295119,0.000034820812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021455782,0.0017621774,0.0013433835,0.00032406545,0.00040739562,0.00015422881,0.00096638507,0.03695714,0.028828517,0.64519626,0.059444148,0.2224707],"study_design_scores_gemma":[0.024843398,0.002536622,0.0030997861,0.0013001738,0.0005878715,0.00015598221,0.00498151,0.12482413,0.027123086,0.4736944,0.33279246,0.004060581],"about_ca_topic_score_codex":0.0000063306684,"about_ca_topic_score_gemma":0.00003140698,"teacher_disagreement_score":0.2733483,"about_ca_system_score_codex":0.00016800952,"about_ca_system_score_gemma":0.00009295862,"threshold_uncertainty_score":0.49106967},"labels":[],"label_agreement":null},{"id":"W29367237","doi":"10.1098/rsif.2017.0633","title":"The Structure of the Zeros of the Generalized Bernoulli Polynomials.","year":2005,"lang":"en","type":"article","venue":"Neural Parallel & Scientific Comp","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bernoulli's principle; Bernoulli polynomials; Pure mathematics; Applied mathematics; Algebra over a field; Difference polynomials; Orthogonal polynomials; Physics; Thermodynamics","score_opus":0.03778666740354927,"score_gpt":0.32715914657087847,"score_spread":0.2893724791673292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29367237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894263,0.00034149888,0.0018370934,0.005336147,0.0014706241,0.0011205319,0.00010170155,0.00003872206,0.0003273658],"genre_scores_gemma":[0.9733851,0.000014727533,0.013511621,0.00008896246,0.00010040609,0.000006879893,0.0000038101061,0.000025026384,0.012863499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975696,0.00028577156,0.00054005184,0.00029380192,0.0009601085,0.00035066658],"domain_scores_gemma":[0.99752474,0.00039431613,0.00039990337,0.001314618,0.0003059519,0.00006047372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040074307,0.00016426656,0.00024363701,0.00004669021,0.0008113708,0.000114783725,0.0015703576,0.00005883761,0.00020375584],"category_scores_gemma":[0.0004276919,0.00007485033,0.00021563719,0.0007005076,0.0010906294,0.00011113985,0.0004917359,0.00029971616,0.000006643035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025649913,0.00046911152,0.002875818,0.0001957977,0.00017333959,0.0000013552856,0.0035719115,0.47974837,0.3386353,0.06362187,0.088359505,0.022091143],"study_design_scores_gemma":[0.0048199506,0.00009339248,0.013638928,0.00016179134,0.00013560994,0.000049841798,0.0005498968,0.54474777,0.26762438,0.08165263,0.08569118,0.0008346242],"about_ca_topic_score_codex":0.000014680526,"about_ca_topic_score_gemma":0.00017337767,"teacher_disagreement_score":0.071010925,"about_ca_system_score_codex":0.000048862177,"about_ca_system_score_gemma":0.00010459561,"threshold_uncertainty_score":0.624049},"labels":[],"label_agreement":null},{"id":"W2939844400","doi":"10.3390/pr7040221","title":"Convergence of Subtangent-Based Relaxations of Nonlinear Programs","year":2019,"lang":"en","type":"article","venue":"Processes","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pointwise convergence; Pointwise; Bounding overwatch; Convergence (economics); Relaxation (psychology); Nonlinear system; Mathematics; Mathematical optimization; Affine transformation; Regular polygon; Applied mathematics; Nonlinear programming; Convex optimization; Domain (mathematical analysis); Compact convergence; Rate of convergence; Computer science; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.0570686189777466,"score_gpt":0.354752707319467,"score_spread":0.2976840883417204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939844400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.432068,0.0013546403,0.55828184,0.0003872577,0.00020016682,0.0026090837,0.00010009033,0.00026719683,0.004731727],"genre_scores_gemma":[0.5462085,0.00009822105,0.45259356,0.000010727428,0.000014499527,0.000049263916,0.000025894453,0.00002769463,0.00097162294],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991252,0.000018311128,0.00027506196,0.00013333317,0.00032039228,0.00012773447],"domain_scores_gemma":[0.99829656,0.0002652721,0.00023576316,0.00022639651,0.00094043877,0.000035592082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012816984,0.00007195514,0.00016934323,0.000077559176,0.000018790643,0.000005297089,0.00017324992,0.00003963645,0.00034023955],"category_scores_gemma":[0.0011770548,0.00006445062,0.000029710542,0.000622875,0.000077854485,0.00010594729,0.000028821985,0.000062514286,0.000024423318],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010054532,0.014745967,0.60340726,0.17990308,0.0007088862,0.000016382599,0.00974969,0.052735876,0.022150379,0.047416903,0.0012203783,0.06693975],"study_design_scores_gemma":[0.0034751012,0.0010817865,0.000545648,0.0010674018,0.00010737546,0.0000054898314,0.001768239,0.24109216,0.71375436,0.029465463,0.006844229,0.0007927564],"about_ca_topic_score_codex":0.000005297287,"about_ca_topic_score_gemma":0.000008089712,"teacher_disagreement_score":0.69160396,"about_ca_system_score_codex":0.000013337489,"about_ca_system_score_gemma":0.00021671555,"threshold_uncertainty_score":0.37253845},"labels":[],"label_agreement":null},{"id":"W2944641123","doi":"10.1287/ijoc.2018.0862","title":"Permutations in the Factorization of Simplex Bases","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Factorization; Simplex; Simplex algorithm; Basis (linear algebra); Mathematics; Linear programming; Column (typography); Reduction (mathematics); Revised simplex method; Computation; Row; Row and column spaces; Computer science; Algorithm; Combinatorics; Mathematical optimization; Programming language","score_opus":0.06589557754533049,"score_gpt":0.395125038779866,"score_spread":0.3292294612345355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944641123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41612157,0.0000061816895,0.57904863,0.00018488917,0.00014022377,0.00027275112,0.0000028777006,0.000016990394,0.0042058816],"genre_scores_gemma":[0.9799442,0.0000057083403,0.01977664,0.00012603412,0.000059505026,7.332803e-7,0.0000034707173,0.00000956818,0.00007408496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.00005435171,0.00044309898,0.000059444385,0.00044949807,0.00016184579],"domain_scores_gemma":[0.99822456,0.0011248504,0.00028406412,0.00013482565,0.00020174128,0.000029958215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064375205,0.00007328437,0.00012968629,0.00020871256,0.000096551135,0.000058606332,0.0002124633,0.00003109384,0.000118107324],"category_scores_gemma":[0.0008392952,0.000045910052,0.000047575722,0.00037865207,0.000018601928,0.00025635483,0.000030384865,0.0003170339,0.000018077912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051830448,0.00025970157,0.016584761,0.00013069442,0.00004129915,0.00001712059,0.011835742,0.80821496,0.00017315293,0.09839755,0.00044736647,0.06384584],"study_design_scores_gemma":[0.0027845004,0.000578886,0.018763147,0.00052076054,0.000013689368,0.00022702057,0.0094362,0.8762354,0.00084702676,0.08640886,0.0037804323,0.00040406582],"about_ca_topic_score_codex":0.0000018300526,"about_ca_topic_score_gemma":0.0000012369304,"teacher_disagreement_score":0.5638227,"about_ca_system_score_codex":0.000061316474,"about_ca_system_score_gemma":0.000064507876,"threshold_uncertainty_score":0.18721576},"labels":[],"label_agreement":null},{"id":"W2949093810","doi":"10.48550/arxiv.1102.1478","title":"Fixed Points of Averages of Resolvents: Geometry and Algorithms","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fixed point; Iterated function; Hyperplane; Convergence (economics); Algorithm; Generalization; Gauss; Applied mathematics; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.16000046667316004,"score_gpt":0.26242529408419996,"score_spread":0.10242482741103992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949093810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3686007,0.00019688382,0.62612957,0.000022765485,0.00019946806,0.0007292549,0.0001996264,0.000096115094,0.0038256266],"genre_scores_gemma":[0.9002988,0.0013896223,0.09443381,0.000009227599,0.000032038453,0.0000013419018,0.000028872137,0.000061034716,0.0037452732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983958,0.00016250466,0.00039561812,0.00060615933,0.00017353165,0.00026638963],"domain_scores_gemma":[0.9975405,0.0003926352,0.000595032,0.0008521951,0.00048027653,0.00013935995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040695217,0.00026430126,0.0006253744,0.0005528705,0.000052283332,0.000009598336,0.0005666711,0.00031939903,0.00030568452],"category_scores_gemma":[0.0005282071,0.00029951383,0.00016068091,0.0004947961,0.00032975432,0.00014807486,0.0013344433,0.00048492182,0.000007173604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020261148,0.0052234875,0.037050214,0.017059414,0.0046193604,0.0011779425,0.006456928,0.16385959,0.0009885833,0.7456321,0.0030253152,0.012880935],"study_design_scores_gemma":[0.003091815,0.00029687933,0.0024155423,0.0010306916,0.00038890363,0.000010459132,0.0008568865,0.16084263,0.008857217,0.8210369,0.00015053648,0.0010215692],"about_ca_topic_score_codex":0.000070297334,"about_ca_topic_score_gemma":0.000007352979,"teacher_disagreement_score":0.5316981,"about_ca_system_score_codex":0.000085617066,"about_ca_system_score_gemma":0.00010292035,"threshold_uncertainty_score":0.9999457},"labels":[],"label_agreement":null},{"id":"W2949973360","doi":"10.48550/arxiv.1107.5290","title":"A numerical method for variational problems with convexity constraints","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convexity; Variational inequality; Mathematics; Constraint (computer-aided design); Convex analysis; Regular polygon; Mathematical optimization; Convex optimization; Conic optimization; Variational analysis; Applied mathematics; Proper convex function; Optimization problem; Cone (formal languages); Convex cone; Algorithm; Geometry","score_opus":0.2214860799207179,"score_gpt":0.28972119086616777,"score_spread":0.06823511094544987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949973360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003451542,0.0000056844315,0.9931405,0.000055488385,0.0001010099,0.0014837584,0.00013852853,0.00017314043,0.0045566894],"genre_scores_gemma":[0.12966242,0.000019410842,0.8671411,0.000043820175,0.00006871968,0.000025556445,0.00009238778,0.00006994477,0.0028766312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805045,0.00020890043,0.00026523139,0.00090841274,0.00016200764,0.00040500064],"domain_scores_gemma":[0.99716914,0.0008782975,0.00038269354,0.00061554986,0.0007416013,0.00021273446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005102963,0.00033158108,0.00048976345,0.00019927282,0.00015594701,0.000038538117,0.0005450467,0.0003343187,0.00064177794],"category_scores_gemma":[0.00039171882,0.00033397693,0.00016572836,0.0003363723,0.00029041868,0.00014949577,0.00034439337,0.0006218257,0.000024658468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024629792,0.00031433688,0.0002684641,0.00042764048,0.0003742748,0.000046651814,0.00030427627,0.3421625,0.000003990302,0.65521055,0.00023684703,0.00040417796],"study_design_scores_gemma":[0.0009872053,0.00007626023,0.000034001176,0.00006523333,0.000100417725,0.000008094908,0.000053700096,0.52823037,0.000042955257,0.46996737,0.00013336628,0.0003010053],"about_ca_topic_score_codex":0.000040199502,"about_ca_topic_score_gemma":0.000012299999,"teacher_disagreement_score":0.18606791,"about_ca_system_score_codex":0.00024015551,"about_ca_system_score_gemma":0.00052747456,"threshold_uncertainty_score":0.99991125},"labels":[],"label_agreement":null},{"id":"W2950148570","doi":"10.48550/arxiv.1611.00724","title":"Computing proximal points of convex functions with inexact subgradients","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subgradient method; Mathematics; Mathematical optimization; Bounded function; Function (biology); Subderivative; Regular polygon; Saddle point; Oracle; Point (geometry); Convex function; Minification; Applied mathematics; Lipschitz continuity; Convex optimization; Computer science; Mathematical analysis; Geometry","score_opus":0.1115400300633398,"score_gpt":0.24854911655917775,"score_spread":0.13700908649583793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950148570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19985467,0.000007839053,0.79530346,0.000042619748,0.00012701549,0.000582681,0.000074982156,0.00013324016,0.0038734584],"genre_scores_gemma":[0.9790315,0.000023068387,0.016452521,0.000009349867,0.000055111712,0.000001196957,0.000028039864,0.000055957098,0.004343279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830985,0.00014292609,0.00029256693,0.0006875264,0.00018965869,0.00037746187],"domain_scores_gemma":[0.9975568,0.00037151237,0.0004918018,0.00077345135,0.0006408897,0.00016553025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024076385,0.00029896706,0.00047747928,0.00035857386,0.0001299895,0.000021237538,0.0005142838,0.00021250336,0.00018779216],"category_scores_gemma":[0.0002228658,0.00026381877,0.00013131941,0.00048329134,0.0003010907,0.00017186461,0.00075647025,0.0005103074,0.00004017773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020509714,0.0026048054,0.09534697,0.003391179,0.0026263997,0.0008738652,0.0016467203,0.46243298,0.0002319354,0.42419368,0.0025685711,0.002031922],"study_design_scores_gemma":[0.0067934813,0.0005959678,0.0024499185,0.0020055347,0.0005042289,0.0000324986,0.0008872634,0.7270073,0.0010710489,0.25654256,0.00039845484,0.0017117343],"about_ca_topic_score_codex":0.000016682898,"about_ca_topic_score_gemma":0.000018616283,"teacher_disagreement_score":0.7791768,"about_ca_system_score_codex":0.00024924925,"about_ca_system_score_gemma":0.00023941525,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W2950326222","doi":"10.48550/arxiv.1401.4774","title":"Extreme point inequalities and geometry of the rank sparsity ball","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Extreme point; Matrix norm; Unit sphere; Ball (mathematics); Mathematics; Norm (philosophy); Rank (graph theory); Penalty method; Regular polygon; Convex geometry; Simple (philosophy); Algebra over a field; Combinatorics; Mathematical optimization; Pure mathematics; Convex set; Convex optimization; Geometry; Eigenvalues and eigenvectors","score_opus":0.19269746795597797,"score_gpt":0.24993448719852415,"score_spread":0.05723701924254618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950326222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5331897,0.0000600308,0.46349993,0.000119617966,0.0001902417,0.0005118155,0.00006723258,0.00008227707,0.0022791806],"genre_scores_gemma":[0.98721653,0.00024616902,0.007431489,0.000035823232,0.000045488952,7.605229e-7,0.000008007078,0.000031777887,0.0049839267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983944,0.00032073192,0.00028310018,0.00053944637,0.00018756761,0.00027474808],"domain_scores_gemma":[0.9975467,0.0005831297,0.00040083172,0.0010366802,0.0003195821,0.00011309441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056762504,0.00025792842,0.00046416672,0.0002456369,0.00013473775,0.000027893737,0.000732,0.00026178887,0.000168402],"category_scores_gemma":[0.0007084672,0.00023232038,0.00017530975,0.00039312482,0.00037932815,0.000117043615,0.0021759071,0.0006119979,0.00000771186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000246373,0.00041300012,0.022696886,0.002829308,0.00052211207,0.00006523991,0.0014932948,0.2782767,0.00008891306,0.691267,0.0013963275,0.0007048203],"study_design_scores_gemma":[0.0014825154,0.000055526016,0.0029641187,0.00038521824,0.00021820009,0.000006794146,0.0008163901,0.28701243,0.0005496649,0.7054547,0.00040200184,0.0006524454],"about_ca_topic_score_codex":0.000073383235,"about_ca_topic_score_gemma":0.000038109483,"teacher_disagreement_score":0.45606843,"about_ca_system_score_codex":0.00013528379,"about_ca_system_score_gemma":0.00010773996,"threshold_uncertainty_score":0.947375},"labels":[],"label_agreement":null},{"id":"W2950633536","doi":"10.48550/arxiv.math/0104020","title":"Self-scaled barriers for irreducible symmetric cones","year":2001,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Engineering and Physical Sciences Research Council; Korea Science and Engineering Foundation","keywords":"Homothetic transformation; Interior point method; Euclidean geometry; Mathematics; Semidefinite programming; Pure mathematics; Algebraic number; Algebra over a field; Mathematical optimization; Mathematical analysis","score_opus":0.14512448976080164,"score_gpt":0.2738971703172926,"score_spread":0.12877268055649096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950633536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017412113,0.00011119642,0.9672757,0.0001085299,0.00058412063,0.0021038349,0.00018482233,0.00066870335,0.011551014],"genre_scores_gemma":[0.63798106,0.002321575,0.3065054,0.000109515255,0.0005044323,0.000047050187,0.00023043007,0.00031788953,0.051982645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756676,0.00014290855,0.00033948975,0.001139457,0.00017838,0.0006329858],"domain_scores_gemma":[0.9965065,0.0009654318,0.00034107693,0.0010987939,0.0006558868,0.00043227093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043956912,0.00042506508,0.0005983766,0.00082253537,0.00027940617,0.00007975461,0.0009092579,0.0004885043,0.00035262114],"category_scores_gemma":[0.0012410146,0.00050566363,0.0003388545,0.0014149992,0.00014181585,0.00021445578,0.0007565617,0.00063757575,0.000059882033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000380366,0.0006020051,0.0010938506,0.002080094,0.001034134,0.000351972,0.0005315743,0.40558997,0.000012081728,0.579545,0.007857039,0.0009218601],"study_design_scores_gemma":[0.001685816,0.00007110141,0.000012773945,0.000078661855,0.0002532021,0.000006790145,0.00042382244,0.6639953,0.00013434449,0.32717326,0.0055129384,0.0006519289],"about_ca_topic_score_codex":0.000021414797,"about_ca_topic_score_gemma":0.000014471683,"teacher_disagreement_score":0.66077024,"about_ca_system_score_codex":0.0005887533,"about_ca_system_score_gemma":0.0004540546,"threshold_uncertainty_score":0.99973947},"labels":[],"label_agreement":null},{"id":"W2951921640","doi":"10.48550/arxiv.1409.8272","title":"Semidefinite approximations of conical hulls of measured sets","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Cone (formal languages); Bounding overwatch; Regular polygon; Conical surface; Compact space; Semidefinite programming; Sequence (biology); Positive-definite matrix; Convergence (economics); Homogeneous space; Geometry; Mathematical analysis; Algorithm; Physics; Mathematical optimization; Computer science","score_opus":0.22034354193723485,"score_gpt":0.2806106856968545,"score_spread":0.06026714375961964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951921640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06597048,0.000033234573,0.9259096,0.000040455216,0.000119445256,0.0006777419,0.00018071636,0.00010913558,0.0069592167],"genre_scores_gemma":[0.93516374,0.00011027939,0.06336684,0.000008983482,0.000019404839,0.0000020140365,0.000054952707,0.000041869298,0.0012319495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981651,0.00028981903,0.00051174883,0.00053108163,0.0002405963,0.00026168762],"domain_scores_gemma":[0.9962968,0.00086465623,0.00072345603,0.001085348,0.0008929915,0.00013674589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050867995,0.00025031768,0.00068311836,0.00033531588,0.00005941522,0.000011525929,0.00068326294,0.00036953142,0.0001681109],"category_scores_gemma":[0.0012161689,0.00028903087,0.0002569422,0.0004821084,0.00034015058,0.00009648155,0.00074695237,0.00056625373,0.000020601528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092055845,0.00038939944,0.0005471493,0.0012369688,0.00031008173,0.000018487144,0.00028569397,0.6430048,0.00014670151,0.353309,0.0004274219,0.00023228706],"study_design_scores_gemma":[0.0010670163,0.00006166009,0.00011885375,0.00033277625,0.00020069987,0.0000025016514,0.0001458951,0.6413527,0.0013119292,0.35490337,0.00013070025,0.00037190196],"about_ca_topic_score_codex":0.000016157403,"about_ca_topic_score_gemma":0.000009976254,"teacher_disagreement_score":0.86919326,"about_ca_system_score_codex":0.0001263531,"about_ca_system_score_gemma":0.00026006176,"threshold_uncertainty_score":0.9999562},"labels":[],"label_agreement":null},{"id":"W2953246837","doi":"10.48550/arxiv.1001.4582","title":"More Colourful Simplices","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"","keywords":"Convex hull; Vertex (graph theory); Combinatorics; General position; Regular polygon; Position (finance); Point (geometry); Set (abstract data type); Mathematics; Hull; Geometry; Computer science; Graph; Geology; Economics","score_opus":0.1522924130693781,"score_gpt":0.2824494614336489,"score_spread":0.1301570483642708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953246837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4043911,0.000044291206,0.5821715,0.0003046691,0.00058918324,0.0010995582,0.00012976959,0.00062879623,0.010641131],"genre_scores_gemma":[0.94529045,0.0001980561,0.036181543,0.000084621315,0.00014233135,0.0000040957584,0.00006165544,0.00010338408,0.017933873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998146,0.00010033631,0.00023977218,0.000892308,0.00016898998,0.00045257033],"domain_scores_gemma":[0.9974012,0.0004288786,0.00031140842,0.0012363399,0.00042287842,0.00019931093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024554104,0.00035621307,0.0004287289,0.00028654997,0.00018452904,0.00007292753,0.0010807633,0.0006417785,0.00071360206],"category_scores_gemma":[0.00042285534,0.00040693456,0.0001991666,0.0004471799,0.00026921593,0.00018125703,0.0015254858,0.0016533412,0.00015345147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017595521,0.0006091356,0.0013746419,0.00075463305,0.00040927524,0.000898535,0.00080518227,0.64539015,0.00017706979,0.34381232,0.0039235535,0.0016695638],"study_design_scores_gemma":[0.000783251,0.00003972645,0.00015598423,0.00008485802,0.00013075498,0.000007865305,0.00046224648,0.559044,0.00031425228,0.43342802,0.004793753,0.00075530296],"about_ca_topic_score_codex":0.000040861654,"about_ca_topic_score_gemma":0.000060790066,"teacher_disagreement_score":0.54598993,"about_ca_system_score_codex":0.0002036187,"about_ca_system_score_gemma":0.00022919469,"threshold_uncertainty_score":0.99983823},"labels":[],"label_agreement":null},{"id":"W2954701560","doi":"10.1007/s11590-019-01448-3","title":"Uniform simplex of an arbitrary orientation","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Mitacs; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Simplex; Simplex algorithm; Convex hull; Combinatorics; Series (stratigraphy); Mathematics; Set (abstract data type); Derivative (finance); Linear programming; Mathematical optimization; Computational intelligence; Regular polygon; Computer science; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.02430181695925274,"score_gpt":0.33051475612565046,"score_spread":0.3062129391663977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954701560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09727324,0.0000033362962,0.8986956,0.00051282626,0.00012257711,0.0005215498,0.000014647311,0.00011016721,0.0027460516],"genre_scores_gemma":[0.025331074,0.000011651918,0.9732443,0.0005742634,0.00004651879,0.000017187696,0.00021855376,0.000054158085,0.0005022916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986857,0.0000755863,0.00036451628,0.00025048637,0.0004130732,0.00021059463],"domain_scores_gemma":[0.9989699,0.00014756652,0.00021348847,0.00039836584,0.00019127806,0.00007936819],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021233459,0.0001291632,0.00018774472,0.00021081342,0.000052419113,0.000028683935,0.00018608707,0.000062469786,0.0013776879],"category_scores_gemma":[0.00013289633,0.00013199712,0.000046331766,0.00048048203,0.00005354862,0.0007451501,0.000037172693,0.000112961556,0.000031355165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000353198,0.00008873054,0.00020162722,0.000060445713,0.00001786168,0.0000018416569,0.00029812788,0.98707014,0.0011458925,0.009582899,0.000288402,0.001208721],"study_design_scores_gemma":[0.0010144481,0.00008481418,0.00007905092,0.000021863429,0.000013089572,0.0000045973693,0.00025824996,0.9914411,0.0037517936,0.0027242578,0.00039179085,0.00021495699],"about_ca_topic_score_codex":0.000005193302,"about_ca_topic_score_gemma":0.0000011107152,"teacher_disagreement_score":0.0745487,"about_ca_system_score_codex":0.00006593366,"about_ca_system_score_gemma":0.00004075045,"threshold_uncertainty_score":0.9995352},"labels":[],"label_agreement":null},{"id":"W2955620234","doi":"10.3934/jimo.2016074","title":"Double well potential function and its optimization in the &lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;\\begin{document}$N$\\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; -dimensional real space-part Ⅱ","year":2016,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Invertible matrix; Function (biology); Norm (philosophy); Global optimization; Convex function; Infinity; Regular polygon; Uniform norm; Combinatorics; Applied mathematics; Pure mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.0356104538255751,"score_gpt":0.29101752573029965,"score_spread":0.25540707190472456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955620234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075237505,0.0009851094,0.8986858,0.010517564,0.0034778623,0.0065880697,0.00011516398,0.00028787128,0.0041050427],"genre_scores_gemma":[0.29750392,0.06637308,0.58613586,0.0013711125,0.009574494,0.0006976504,0.0015480499,0.00093810586,0.035857726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934049,0.00044068007,0.0021578367,0.0008067579,0.0022676783,0.00092210487],"domain_scores_gemma":[0.99596786,0.00039020943,0.0017617104,0.00056521286,0.0009258942,0.0003890976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003101553,0.0007667296,0.00090361334,0.0011197918,0.00060039875,0.0005376699,0.0005770033,0.0005468994,0.0005067937],"category_scores_gemma":[0.00038833555,0.0005332805,0.00023349916,0.0011505111,0.00018001845,0.0028427027,0.00047306003,0.00065947603,0.000024555047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023702658,0.0007064345,0.00005835227,0.00016844849,0.00047434325,0.00010421704,0.00025252262,0.9154465,0.00035506903,0.06294751,0.008149287,0.008967044],"study_design_scores_gemma":[0.030509444,0.0015261155,0.00010614302,0.00112309,0.0009605785,0.00026058103,0.00043402953,0.93063,0.00036425408,0.0058977962,0.026903594,0.0012843476],"about_ca_topic_score_codex":0.000008957845,"about_ca_topic_score_gemma":0.000018745344,"teacher_disagreement_score":0.31254998,"about_ca_system_score_codex":0.00050491374,"about_ca_system_score_gemma":0.00022393782,"threshold_uncertainty_score":0.9997119},"labels":[],"label_agreement":null},{"id":"W2963550906","doi":"10.1007/s00453-017-0275-7","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear programming relaxation; Combinatorics; Relaxation (psychology); Theory of computation; Tree (set theory); Approximation algorithm; Integer programming; Integer (computer science); Discrete mathematics; Algorithm; Computer science","score_opus":0.08491445882408623,"score_gpt":0.39161509114688065,"score_spread":0.30670063232279443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963550906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015842168,0.00013759061,0.9587885,0.0020889489,0.00054525177,0.0015952024,0.00004942852,0.00047634976,0.02047657],"genre_scores_gemma":[0.015288727,0.00009143356,0.97696984,0.00009653403,0.0004876823,0.00019732336,0.000046949335,0.00009563359,0.006725874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980243,0.00008093198,0.00046374017,0.00047257106,0.00050288293,0.00045561363],"domain_scores_gemma":[0.9981675,0.00023988084,0.00042007913,0.00084173767,0.00019348363,0.00013731464],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004967726,0.00024535396,0.00032427793,0.00015139679,0.0015541348,0.00023013038,0.0004616872,0.00012445477,0.00014458956],"category_scores_gemma":[0.0009248133,0.00023298665,0.00006928364,0.00014161044,0.00021671463,0.0006459405,0.0004644614,0.00028624127,0.000040907526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053095035,0.0003602957,0.00018480851,0.00019378014,0.00018084435,0.000041143878,0.0021821237,0.000031371736,0.000728535,0.024931157,0.006211155,0.9649017],"study_design_scores_gemma":[0.003941186,0.0003624261,0.0004050306,0.00019412105,0.00012314194,0.00009934319,0.00078442495,0.7659456,0.009667406,0.20306318,0.014311028,0.0011031216],"about_ca_topic_score_codex":0.00004543575,"about_ca_topic_score_gemma":0.000017755257,"teacher_disagreement_score":0.9637986,"about_ca_system_score_codex":0.00008200858,"about_ca_system_score_gemma":0.000060879785,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W2963881376","doi":"10.48550/arxiv.1809.00452","title":"Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Peking University; Government of Jiangsu Province; National Natural Science Foundation of China; Centre de Recherches Mathématiques; State Key Laboratory of Scientific and Engineering Computing; U.S. Department of Energy; Chinese Academy of Sciences; National Science Foundation","keywords":"Hessian matrix; Orthogonality; Euclidean geometry; Euclidean distance matrix; Hessian equation; Eigenvalues and eigenvectors; Quasi-Newton method; Mathematical optimization; Euclidean space; Convergence (economics); Mathematics; Applied mathematics; Newton's method; Function (biology); Matrix (chemical analysis); Euclidean distance; Computer science; Mathematical analysis; Geometry","score_opus":0.1770814827503858,"score_gpt":0.3386846273736207,"score_spread":0.1616031446232349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963881376","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039822366,0.000013819095,0.9926349,0.00006338474,0.00023498376,0.0016547639,0.0001990222,0.00024958476,0.0009673055],"genre_scores_gemma":[0.04894793,0.000057941514,0.94822717,0.0000322259,0.00012779943,0.000011332036,0.00024110233,0.0000969992,0.0022575047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732983,0.00047663067,0.00036624787,0.0011753002,0.00016158084,0.00049041916],"domain_scores_gemma":[0.99597746,0.00086116383,0.00056323566,0.0010559037,0.0013038313,0.00023840886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083062367,0.00046200733,0.0006187237,0.00029022185,0.0002601169,0.00008003057,0.00067521265,0.0005025891,0.0006046828],"category_scores_gemma":[0.0008685391,0.00046758173,0.00020184029,0.0005397608,0.0006835839,0.00021972552,0.0005250798,0.0005681057,0.0000064802034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003937931,0.00016021724,0.00019621088,0.00040319248,0.00031121552,0.000022871736,0.00013999383,0.9179936,0.0000100560555,0.078318045,0.0002610582,0.0017897333],"study_design_scores_gemma":[0.0012771484,0.00015157847,0.00002604855,0.00010323622,0.00019944529,0.0000069017756,0.00014457089,0.790524,0.00027480256,0.20652641,0.00025976138,0.00050606695],"about_ca_topic_score_codex":0.000012296792,"about_ca_topic_score_gemma":0.000029559638,"teacher_disagreement_score":0.12820837,"about_ca_system_score_codex":0.00035713948,"about_ca_system_score_gemma":0.0004800974,"threshold_uncertainty_score":0.9997776},"labels":[],"label_agreement":null},{"id":"W2965171029","doi":"","title":"Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form.","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Computer science; Second-order cone programming; Linear programming; Mathematical optimization; Convex optimization; Software; Convex function; Semidefinite programming; Quadratic programming; Algorithm; Regular polygon; Applied mathematics; Mathematics; Programming language","score_opus":0.09245854248179167,"score_gpt":0.25353950468719755,"score_spread":0.16108096220540588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965171029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015704306,0.000022429484,0.97745454,0.00011882847,0.0003065983,0.0050893934,0.00033795548,0.00035770595,0.0006082612],"genre_scores_gemma":[0.15620959,0.00014702504,0.8386448,0.0001333078,0.000109451015,0.00010711598,0.0010074006,0.00030100308,0.0033403174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960964,0.00027401527,0.0007079761,0.001583662,0.00035640094,0.0009815929],"domain_scores_gemma":[0.9955627,0.00095769495,0.00077351864,0.0015794113,0.00084477925,0.00028190966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052943174,0.0007342836,0.0010376162,0.00090137083,0.00022946285,0.0001371848,0.0012323394,0.00089326117,0.00033232907],"category_scores_gemma":[0.00032400707,0.0008511307,0.00044029258,0.0008941185,0.00025115718,0.00047028507,0.0009636049,0.0010383483,0.000076492965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021537134,0.0003319493,0.0036566886,0.0013691348,0.0001343204,0.00007633397,0.0004566547,0.9777374,0.000017014781,0.015402579,0.00056378316,0.000038752798],"study_design_scores_gemma":[0.005589165,0.00014768545,0.00005996337,0.00056701584,0.00010039661,0.0000026806388,0.00026427943,0.861773,0.000062072824,0.12981744,0.00067893,0.00093733025],"about_ca_topic_score_codex":0.000026515763,"about_ca_topic_score_gemma":0.00010533461,"teacher_disagreement_score":0.14050528,"about_ca_system_score_codex":0.0012219452,"about_ca_system_score_gemma":0.0007064215,"threshold_uncertainty_score":0.99939394},"labels":[],"label_agreement":null},{"id":"W2965180164","doi":"10.1002/net.22068","title":"Constraint programming approaches for the discretizable molecular distance geometry problem","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Discretization; Integer programming; Vertex (graph theory); Constraint satisfaction problem; Computational geometry; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type)","score_opus":0.06243605348160239,"score_gpt":0.3252412656153425,"score_spread":0.2628052121337401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965180164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005300719,0.0016881691,0.9947049,0.0009164838,0.00006966889,0.0010205668,0.0000092037235,0.000086985056,0.0014509857],"genre_scores_gemma":[0.045859635,0.000080640624,0.9501426,0.00008826855,0.00017134003,0.0007314827,0.00005147034,0.000068727095,0.0028058176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863636,0.00006390535,0.0002493852,0.00031211105,0.0002717137,0.000466543],"domain_scores_gemma":[0.99840003,0.00081095326,0.00009289098,0.00042261073,0.00019521937,0.00007826688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043143067,0.00014587233,0.00018861066,0.000024599072,0.00024356865,0.00013743497,0.00022452851,0.000092452145,0.0000597896],"category_scores_gemma":[0.00042208366,0.000107853666,0.00010132446,0.00050233834,0.00017008347,0.00007723369,0.000113763606,0.0002763643,0.0000017182027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025443018,0.00016466525,0.00008428095,0.00018854582,0.00013903408,0.000024373203,0.00017033973,0.39672384,0.000012000887,0.37393013,0.0014832505,0.22705412],"study_design_scores_gemma":[0.00048713505,0.000028008199,0.000005833623,0.00006685148,0.00004097856,0.000018474644,0.00076071796,0.92511034,0.00028373246,0.046501834,0.02648101,0.00021507872],"about_ca_topic_score_codex":8.155458e-7,"about_ca_topic_score_gemma":0.000008293135,"teacher_disagreement_score":0.52838653,"about_ca_system_score_codex":0.00005318796,"about_ca_system_score_gemma":0.00007221935,"threshold_uncertainty_score":0.4398145},"labels":[],"label_agreement":null},{"id":"W2965596841","doi":"10.1080/03155986.2019.1624490","title":"A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Identity matrix; Algorithm; Trust region; Positive-definite matrix; Regularization (linguistics); Matrix (chemical analysis); Computer science; Arc (geometry); Linear system; Mathematical optimization; Mathematics; Applied mathematics; Eigenvalues and eigenvectors; Artificial intelligence; Mathematical analysis","score_opus":0.1088302267502211,"score_gpt":0.4324654026274953,"score_spread":0.3236351758772742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965596841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068286404,0.00006151326,0.9195551,0.0003427739,0.0004132154,0.006517316,0.00019911464,0.000071147995,0.004553387],"genre_scores_gemma":[0.8968309,0.00006956271,0.09968401,0.00006079592,0.000131413,0.00056913204,0.0009166113,0.00003654939,0.0017010027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739116,0.00011157276,0.0009080774,0.00017053394,0.0010933549,0.00032530038],"domain_scores_gemma":[0.9948548,0.0006939457,0.00025375007,0.00023331576,0.0038572794,0.00010688137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019870854,0.00014213088,0.00025341107,0.000616993,0.00025513544,0.00023808816,0.0001613749,0.00012322092,0.00013387407],"category_scores_gemma":[0.0007008264,0.00012666888,0.000044606426,0.00069473765,0.00010139314,0.0010731659,0.000075354284,0.00016195963,0.000026165033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002259217,0.000049459344,0.00061986543,0.00076497503,0.00006321188,3.0978157e-7,0.0025266206,0.6319985,0.00010490428,0.35475162,0.0009782591,0.007916379],"study_design_scores_gemma":[0.0022880863,0.0003379637,0.00013734387,0.00007073565,0.00000656489,0.000014184644,0.0074384357,0.98265547,0.00045893755,0.0005042265,0.005919356,0.00016869287],"about_ca_topic_score_codex":0.00009944475,"about_ca_topic_score_gemma":0.000004150897,"teacher_disagreement_score":0.8285445,"about_ca_system_score_codex":0.00015702812,"about_ca_system_score_gemma":0.00050763757,"threshold_uncertainty_score":0.51654065},"labels":[],"label_agreement":null},{"id":"W2971106990","doi":"10.48550/arxiv.1908.11576","title":"Circumcentered methods induced by isometries","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Isometry (Riemannian geometry); Intersection (aeronautics); Reflection (computer programming); Convergence (economics); Rate of convergence; Mathematics; Applied mathematics; Computer science; Algorithm; Pure mathematics; Telecommunications","score_opus":0.2612396434705233,"score_gpt":0.33236575983361466,"score_spread":0.07112611636309135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971106990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04305243,0.00009756605,0.95074064,0.000071110175,0.00052908715,0.00080786174,0.000114203176,0.0002833503,0.0043037515],"genre_scores_gemma":[0.81875676,0.000579825,0.15132733,0.00009083862,0.00009800969,0.0000046152327,0.00016045288,0.00017061406,0.028811537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733233,0.0005174248,0.0003419087,0.0010942053,0.00019116733,0.0005229342],"domain_scores_gemma":[0.9966086,0.000927348,0.00040904473,0.0014208953,0.0004129788,0.00022108911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006067793,0.00042925173,0.00066060846,0.00061279093,0.00013159856,0.00009145781,0.001115875,0.0005670946,0.0004940181],"category_scores_gemma":[0.0009992548,0.00050504674,0.00025268956,0.001067177,0.00012754781,0.00025780508,0.0016544044,0.001158018,0.00017083371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009889598,0.003488937,0.005290318,0.005278467,0.0043505826,0.0005715394,0.0029463887,0.46762627,0.0075766556,0.43046513,0.049230218,0.022186534],"study_design_scores_gemma":[0.003134675,0.00019857191,0.00012684632,0.00033160383,0.00033074434,0.0000064618416,0.0010071924,0.49734533,0.006258762,0.4828385,0.006343537,0.002077765],"about_ca_topic_score_codex":0.00003457933,"about_ca_topic_score_gemma":0.000004844337,"teacher_disagreement_score":0.7994133,"about_ca_system_score_codex":0.00049397675,"about_ca_system_score_gemma":0.00023053498,"threshold_uncertainty_score":0.9997401},"labels":[],"label_agreement":null},{"id":"W2971476396","doi":"10.1109/focs.2019.00055","title":"Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geodesic; Polytope; Moment (physics); Commutative property; Order (exchange); Mathematics; Algebra over a field; Computer science; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Classical mechanics; Business","score_opus":0.07921382801214945,"score_gpt":0.4478247454359489,"score_spread":0.3686109174237995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971476396","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101926824,0.0005814935,0.99151194,0.00040939116,0.000106971966,0.002703263,0.00015733416,0.00004974499,0.0043779607],"genre_scores_gemma":[0.00037908784,0.0007846463,0.99235225,0.0000651739,0.000032605294,0.00035276782,0.00008900645,0.00008600481,0.005858438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978509,0.00039972272,0.00058521185,0.00057457143,0.00028621798,0.00030336896],"domain_scores_gemma":[0.9959589,0.0021041683,0.0003831307,0.00060095114,0.00083516195,0.00011768899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017359834,0.0003754966,0.0008355147,0.00028013263,0.00009417838,0.00008595767,0.00028486678,0.00028896242,0.00032008791],"category_scores_gemma":[0.0010029508,0.00031681388,0.000085570224,0.00019590462,0.00027076807,0.0001280911,0.001156703,0.00036348126,8.7279267e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005913762,0.00049782934,0.000046156398,0.0071862177,0.0013853097,0.000002767675,0.009887649,0.6394511,0.00012973176,0.14860433,0.001023771,0.19119377],"study_design_scores_gemma":[0.0013040551,0.00015317212,0.000017764654,0.00019332631,0.00012179841,0.0000055984087,0.0014054681,0.72298825,0.0016948832,0.27137375,0.00033391168,0.0004080114],"about_ca_topic_score_codex":0.000018221604,"about_ca_topic_score_gemma":0.000002493913,"teacher_disagreement_score":0.19078577,"about_ca_system_score_codex":0.00008420546,"about_ca_system_score_gemma":0.00026029474,"threshold_uncertainty_score":0.9999284},"labels":[],"label_agreement":null},{"id":"W2978181039","doi":"10.1002/cjce.23658","title":"A novel analytical second‐order sensitivity calculation approach using the finite element method for chemical engineering problems","year":2019,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Sensitivity (control systems); Broyden–Fletcher–Goldfarb–Shanno algorithm; Collocation (remote sensing); Mathematical optimization; Computer science; Benchmark (surveying); Finite element method; Nonlinear system; Orthogonal collocation; Nonlinear programming; Collocation method; Mathematics; Engineering","score_opus":0.04526908879312142,"score_gpt":0.30668449135820364,"score_spread":0.2614154025650822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978181039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025645679,0.000033644483,0.9733838,0.00031390137,0.00009102152,0.00047237505,0.000016941513,0.000015568246,0.00002709695],"genre_scores_gemma":[0.3514901,2.8323407e-7,0.64810896,0.000047278234,0.00023052529,0.000011989699,0.000005980711,0.00005883602,0.000046015113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984573,0.000036830468,0.00048864883,0.0001689885,0.000358385,0.0004898247],"domain_scores_gemma":[0.997466,0.0014233029,0.00015811331,0.0002568964,0.0003846712,0.00031101235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017257212,0.00019957425,0.0003368402,0.00015171977,0.000071116105,0.00008153507,0.0002638333,0.0001227422,0.00003508616],"category_scores_gemma":[0.0020183753,0.0001394648,0.00015764635,0.00039111162,0.00003980773,0.00013270378,0.000040302577,0.0006599919,8.6681104e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008659318,0.000014383643,0.0000063764905,0.000120053744,0.00009592776,0.0000021276187,0.00025273135,0.8944389,0.10250774,0.002371325,0.000030152245,0.00015157343],"study_design_scores_gemma":[0.00050455163,0.000011709539,0.0000027079307,0.00006519671,0.000052477793,0.00018237314,0.0000211177,0.980544,0.017908188,0.00021611284,0.00032680592,0.00016476211],"about_ca_topic_score_codex":0.0000750169,"about_ca_topic_score_gemma":0.00001570712,"teacher_disagreement_score":0.32584444,"about_ca_system_score_codex":0.00047550476,"about_ca_system_score_gemma":0.00032834988,"threshold_uncertainty_score":0.568721},"labels":[],"label_agreement":null},{"id":"W2981781020","doi":"10.1137/18m1193657","title":"Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Mathematics; Combinatorics; Semidefinite programming; Vertex (graph theory); Conic optimization; Regular polygon; Convex optimization; Discrete mathematics; Graph; Convex set; Mathematical optimization","score_opus":0.07053607418130879,"score_gpt":0.35574779963651165,"score_spread":0.28521172545520285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981781020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042244284,0.000051363695,0.98852783,0.0015111255,0.0002000919,0.0009932983,0.000011517419,0.00007156643,0.0044087777],"genre_scores_gemma":[0.051954355,0.0007709603,0.94536436,0.0004763826,0.00018846904,0.000037810503,0.000088191366,0.00012155887,0.0009979366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701667,0.00048242544,0.0007144207,0.00034087448,0.0009675487,0.00047807992],"domain_scores_gemma":[0.9976565,0.000853895,0.0005282712,0.00040510733,0.000431999,0.0001241891],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015246634,0.00028837522,0.00034439412,0.00048940664,0.0004087828,0.00027493585,0.000415887,0.00010618393,0.0014731335],"category_scores_gemma":[0.00047625913,0.00019987211,0.00007054893,0.0011574739,0.000066715,0.00070430734,0.000114174916,0.00080636144,0.00003346884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021280193,0.00014876862,0.0016968301,0.000025158759,0.000036620302,0.000015161131,0.0002958519,0.99371076,0.000006679132,0.0029004419,0.0002582469,0.0006927013],"study_design_scores_gemma":[0.002108012,0.0003242978,0.000116436204,0.00020001462,0.000021598626,0.00008895338,0.0005740313,0.993611,0.00010678834,0.0017517754,0.0008149921,0.00028211164],"about_ca_topic_score_codex":0.000013183456,"about_ca_topic_score_gemma":0.000020626368,"teacher_disagreement_score":0.047729928,"about_ca_system_score_codex":0.0004862335,"about_ca_system_score_gemma":0.00014871184,"threshold_uncertainty_score":0.99943966},"labels":[],"label_agreement":null},{"id":"W2988554220","doi":"10.1007/s10107-025-02219-y","title":"Polyhedral Newton-min algorithms for complementarity problems","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Polyhedron; Epigraph; Quadratic growth; Descent direction; Convex function; Newton's method; Function (biology); Newton's method in optimization; Nonlinear complementarity problem; Regular polygon; Zero (linguistics); Monotonic function; Sequence (biology); Interior point method; Local convergence; Nonlinear system; Applied mathematics; Complementarity theory; Mathematical optimization; Algorithm; Gradient descent; Iterative method; Mathematical analysis; Computer science; Combinatorics; Geometry","score_opus":0.13136913583828114,"score_gpt":0.44437871135796164,"score_spread":0.3130095755196805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988554220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048629305,0.00006463925,0.9912712,0.0020219672,0.00011465069,0.0030858559,0.000020094969,0.0003882407,0.0025470345],"genre_scores_gemma":[0.003511075,0.0000034505993,0.98861927,0.00013821285,0.000085807864,0.0011384579,0.000035041183,0.00006139587,0.0064072674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733543,0.0000745268,0.0007955032,0.000485362,0.00048118114,0.00082799804],"domain_scores_gemma":[0.9974867,0.0014123368,0.00014659499,0.0005081289,0.00027450235,0.00017173121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009842471,0.0002986485,0.00051922695,0.00020704685,0.00036432635,0.00019278064,0.00044247598,0.0001318862,0.00028309223],"category_scores_gemma":[0.0016258575,0.0002688559,0.0001968126,0.0005671093,0.00019464166,0.00018893738,0.00025937468,0.00029529037,0.000033969372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040189596,0.0011099123,0.000085067055,0.002250091,0.00017366285,0.000004852772,0.000592157,0.00009849335,0.00012082659,0.83899736,0.0040211277,0.15250623],"study_design_scores_gemma":[0.001416338,0.00012568047,0.000008434148,0.00023921554,0.00006973285,0.000007049889,0.00046092467,0.13113712,0.0006001068,0.83307344,0.032538835,0.00032311483],"about_ca_topic_score_codex":0.000009868727,"about_ca_topic_score_gemma":0.000013798732,"teacher_disagreement_score":0.15218312,"about_ca_system_score_codex":0.00018617001,"about_ca_system_score_gemma":0.00009487758,"threshold_uncertainty_score":0.99997634},"labels":[],"label_agreement":null},{"id":"W2989393577","doi":"10.1007/978-3-030-19462-8","title":"Nonlinear Optimization","year":2019,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Nonlinear programming; Nonlinear system; Computer science; Variety (cybernetics); Field (mathematics); Mathematical optimization; Range (aeronautics); Mathematics; Engineering; Physics; Aerospace engineering; Artificial intelligence","score_opus":0.08797174338832488,"score_gpt":0.46432307891724744,"score_spread":0.3763513355289226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989393577","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075271085,0.00010135682,0.022207666,0.012266912,0.004335292,0.009012412,0.00033634665,0.00027010922,0.9507172],"genre_scores_gemma":[0.0031209737,0.0059302393,0.23086566,0.00014099837,0.0005007282,0.0022091938,0.00077906233,0.00017997774,0.75627315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97038716,0.0008209605,0.0025658875,0.003969445,0.0191565,0.0031000732],"domain_scores_gemma":[0.9875954,0.0006575841,0.00019590356,0.002897807,0.008075875,0.000577476],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","open_science","insufficient_payload"],"category_scores_codex":[0.025754651,0.00097564113,0.00084800227,0.022358613,0.0036963571,0.0062445835,0.013037834,0.0004005435,0.004652786],"category_scores_gemma":[0.0052929665,0.0010382156,0.00021453208,0.013086881,0.010817262,0.012422677,0.009898071,0.0033409158,0.0009920025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017276782,0.0005835611,0.00006627789,0.00015258302,0.00010742095,0.00021510065,0.00058057683,0.50337857,0.00008384479,0.4883805,0.0049045985,0.001374241],"study_design_scores_gemma":[0.0024403904,0.00033157412,0.00037212315,0.001521154,0.000025771971,0.000060473074,0.0058881748,0.7636261,0.0003240794,0.044089813,0.17970604,0.0016143194],"about_ca_topic_score_codex":0.00031264863,"about_ca_topic_score_gemma":0.0029047604,"teacher_disagreement_score":0.44429067,"about_ca_system_score_codex":0.013974936,"about_ca_system_score_gemma":0.0030337493,"threshold_uncertainty_score":0.99978584},"labels":[],"label_agreement":null},{"id":"W2990034365","doi":"10.1007/s10107-021-01691-6","title":"On generalized surrogate duality in mixed-integer nonlinear programming","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Institut de Valorisation des Données; Bundesministerium für Bildung und Forschung","keywords":"Relaxation (psychology); Integer programming; Generalization; Linear programming relaxation; Mathematical optimization; Integer (computer science); Duality (order theory); Linear programming; Set (abstract data type); Computer science; Nonlinear system; Nonlinear programming; Mathematics; Algorithm; Applied mathematics; Discrete mathematics","score_opus":0.07208214385825237,"score_gpt":0.38894071916496864,"score_spread":0.31685857530671624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990034365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093211204,0.00015042604,0.897089,0.0014685458,0.00025177232,0.002258996,0.000015450154,0.00085987826,0.0046947524],"genre_scores_gemma":[0.027018214,0.000011633276,0.9703106,0.00011472377,0.00010361461,0.00034398626,0.000043620777,0.00012642014,0.0019271648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583805,0.00042538173,0.0010330875,0.00071752415,0.0009809018,0.0010050342],"domain_scores_gemma":[0.9967213,0.0016691674,0.00018424993,0.0007771383,0.0003631376,0.00028496896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016013782,0.0003897456,0.0007282372,0.00020910309,0.0001620411,0.00023639872,0.00031946634,0.0002142753,0.0005987254],"category_scores_gemma":[0.007074185,0.00035155023,0.00022261085,0.0010845514,0.00017059203,0.00019922637,0.00026818013,0.0007088272,0.00021480802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016541962,0.0065550148,0.0002537475,0.0021761833,0.00018223768,0.0013142194,0.0020963799,0.0015578144,0.00031303428,0.76213115,0.00037726338,0.22287753],"study_design_scores_gemma":[0.0045048376,0.0002707714,0.000031901083,0.001139312,0.00007652095,0.0001712041,0.0018014001,0.19531159,0.00712576,0.7738548,0.014337681,0.0013742484],"about_ca_topic_score_codex":0.0000060969746,"about_ca_topic_score_gemma":0.00004177327,"teacher_disagreement_score":0.22150329,"about_ca_system_score_codex":0.00021473003,"about_ca_system_score_gemma":0.00012923437,"threshold_uncertainty_score":0.99989367},"labels":[],"label_agreement":null},{"id":"W2997805287","doi":"","title":"Low rank quadratic assignment problem: Formulations and experimental analysis","year":2019,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Rank (graph theory); Mathematics; Quadratic equation; Applied mathematics; Statistics; Mathematical optimization; Combinatorics; Geometry","score_opus":0.021048007341040995,"score_gpt":0.2950891194687331,"score_spread":0.2740411121276921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997805287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5107128,0.0007112287,0.39347395,0.0002128113,0.00072789687,0.0072875535,0.00048285845,0.0007264413,0.08566447],"genre_scores_gemma":[0.70557773,0.00024730823,0.05715516,0.000034229743,0.00006819728,0.0000280648,0.0037295474,0.00017853706,0.23298123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99800944,0.00012281297,0.00033301016,0.00059413543,0.00058876,0.00035185443],"domain_scores_gemma":[0.99852693,0.00025231435,0.00031594577,0.0004853548,0.00023831478,0.00018114276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012819997,0.0003666603,0.00058193476,0.001346515,0.00027990562,0.00008420918,0.0003195899,0.00031894867,0.0007674514],"category_scores_gemma":[0.000056851313,0.0004125368,0.00023663754,0.0015196461,0.000054524393,0.00043496443,0.000088334586,0.00035842834,0.000047887082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007250569,0.015012798,0.25632298,0.014672227,0.047881275,0.0016863807,0.013396438,0.27916676,0.0012786274,0.26834986,0.06581459,0.0291675],"study_design_scores_gemma":[0.02294857,0.0015983039,0.0014871187,0.0016656157,0.015970407,8.0039065e-8,0.5106726,0.32408348,0.05131328,0.02140859,0.04023952,0.008612446],"about_ca_topic_score_codex":0.000038982154,"about_ca_topic_score_gemma":0.0076356335,"teacher_disagreement_score":0.49727616,"about_ca_system_score_codex":0.00041921236,"about_ca_system_score_gemma":0.00015672203,"threshold_uncertainty_score":0.99983263},"labels":[],"label_agreement":null},{"id":"W2998252087","doi":"","title":"Equivalences and Differences in Conic Relaxations of Combinatorial Quadratic Optimization Problems","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Quadratic assignment problem; Mathematics; Combinatorial optimization; Conic section; Conic optimization; Quadratic unconstrained binary optimization; Quadratic programming; Mathematical optimization; Optimization problem; Quadratic equation; Binary number; Generalization; Integer programming; Combinatorics; Convex optimization; Geometry","score_opus":0.10730650126440616,"score_gpt":0.3775436971562838,"score_spread":0.2702371958918776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998252087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20098333,0.00016974472,0.77844226,0.0011259948,0.00042791644,0.001634713,0.000013320368,0.00010192469,0.017100766],"genre_scores_gemma":[0.87245923,0.00017904709,0.12675874,0.0000026812058,0.000015025346,0.00003360177,0.0000022798579,0.000009638821,0.0005397605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990514,0.000063440755,0.0003265943,0.00016528457,0.00024743352,0.000145878],"domain_scores_gemma":[0.99883443,0.0003784405,0.00029269373,0.00030284634,0.0001479479,0.000043645323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030539004,0.000086562395,0.00021566244,0.0001057603,0.00018873115,0.00008228502,0.0002286493,0.000062372244,0.00016364735],"category_scores_gemma":[0.001844681,0.00007189908,0.000017401171,0.00009233539,0.00024995464,0.00038614625,0.00010560503,0.00009712952,0.0000014248928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000485333,0.0006399677,0.0900784,0.0007921074,0.000058609152,0.00000386011,0.002408152,0.023588216,0.00017107063,0.8796421,0.00007835852,0.0024906127],"study_design_scores_gemma":[0.0017302134,0.00015645707,0.0063863182,0.00017291747,0.000013742721,0.0000020581824,0.00046576018,0.6762615,0.00028539464,0.31432873,0.0000055975456,0.00019132232],"about_ca_topic_score_codex":0.00005931221,"about_ca_topic_score_gemma":0.00007024758,"teacher_disagreement_score":0.6714759,"about_ca_system_score_codex":0.000022799377,"about_ca_system_score_gemma":0.000049265465,"threshold_uncertainty_score":0.29319593},"labels":[],"label_agreement":null},{"id":"W3010739339","doi":"10.1287/opre.2019.1892","title":"The Benders Dual Decomposition Method","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Decomposition; Dual (grammatical number); Decomposition method (queueing theory); Exploit; Integer programming; Integer (computer science); Computer science; Node (physics); Mathematics; Algorithm; Engineering","score_opus":0.3165010738985468,"score_gpt":0.5717275746829251,"score_spread":0.2552265007843783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010739339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001086716,0.000087047905,0.94751436,0.041893806,0.0000489226,0.00086112524,0.000015276635,0.0001066504,0.008386078],"genre_scores_gemma":[0.045767847,0.00024367117,0.94616854,0.0003410425,0.00038771564,0.00038056064,0.00004473569,0.00006935805,0.0065965205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970662,0.0009136587,0.00026824052,0.00029312688,0.0010099199,0.0004488637],"domain_scores_gemma":[0.9967252,0.0018225597,0.000013871955,0.0003562278,0.0008647038,0.00021741245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019173191,0.00009480476,0.0001123003,0.00010262304,0.0018736853,0.00039465746,0.0003492363,0.00006138848,0.0004227235],"category_scores_gemma":[0.0037544558,0.000069407695,0.000046218305,0.0010049009,0.00017988619,0.0002526306,0.00022057729,0.00062701176,0.00030495002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013910442,0.00023169984,0.000021364862,0.00005856635,0.0001266828,0.000035584468,0.0046623405,0.12155856,0.010354609,0.74453235,0.06459861,0.05368051],"study_design_scores_gemma":[0.00045978941,0.00014909296,0.00001751729,0.0000082908,0.0000054435277,0.000011407909,0.0023317607,0.9522358,0.0050596143,0.01610908,0.023466378,0.00014578145],"about_ca_topic_score_codex":0.000020846725,"about_ca_topic_score_gemma":0.0000918602,"teacher_disagreement_score":0.8306773,"about_ca_system_score_codex":0.000108941655,"about_ca_system_score_gemma":0.00021715382,"threshold_uncertainty_score":0.99942577},"labels":[],"label_agreement":null},{"id":"W30154001","doi":"10.1007/978-0-387-75714-8_7","title":"Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes","year":2009,"lang":"en","type":"book-chapter","venue":"Advances in mechanics and mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Path (computing); Curvature; Conjecture; Simplex algorithm; Cube (algebra); Polyhedron; Combinatorics; Linear programming; Mathematical optimization; Computer science; Geometry","score_opus":0.046749178762762356,"score_gpt":0.3404566767044096,"score_spread":0.29370749794164724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30154001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027062055,0.0073561054,0.97395086,0.00028131905,0.00027844604,0.0024045424,0.00040131988,0.00011775415,0.015182574],"genre_scores_gemma":[0.00015075503,0.02211574,0.9472941,0.00011151185,0.00017971238,0.00007911552,0.0001243947,0.00014625656,0.029798392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976841,0.000021586786,0.0007822927,0.00058449723,0.00043860552,0.000488922],"domain_scores_gemma":[0.9980686,0.00061860937,0.00045100346,0.00045088795,0.00024404304,0.00016687525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004496212,0.00052541314,0.0008426882,0.00019662615,0.00018898833,0.00011345675,0.00023144516,0.00039037128,0.00005336332],"category_scores_gemma":[0.0004892199,0.00048357635,0.000103393184,0.000066077955,0.00009317102,0.00034295727,0.00014354319,0.0005404935,0.000001444421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002071912,0.000074200834,3.0181752e-7,0.0010974583,0.00002815873,0.000009059355,0.0005117889,0.00008514702,0.00000845655,0.97643244,0.00016935582,0.021562919],"study_design_scores_gemma":[0.000536285,0.00013746103,3.182008e-7,0.0006884249,0.000057594087,0.000029219576,0.00009433586,0.10071192,0.000029522149,0.86063594,0.036646936,0.00043204482],"about_ca_topic_score_codex":4.6312405e-7,"about_ca_topic_score_gemma":0.00003241393,"teacher_disagreement_score":0.1157965,"about_ca_system_score_codex":0.00011009453,"about_ca_system_score_gemma":0.00006601432,"threshold_uncertainty_score":0.9997616},"labels":[],"label_agreement":null},{"id":"W3017255278","doi":"","title":"Complementarity Formulations of ℓ0-norm Optimization","year":2018,"lang":"en","type":"article","venue":"Pacific Journal of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Complementarity (molecular biology); Mathematics; Norm (philosophy); Mathematical economics; Mathematical optimization; Computer science; Epistemology; Philosophy","score_opus":0.07554202120277777,"score_gpt":0.38593215655290397,"score_spread":0.3103901353501262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017255278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007964291,0.0000332282,0.99229145,0.0002221831,0.00025734934,0.0003056101,0.000018929139,0.000028712906,0.006046105],"genre_scores_gemma":[0.13508904,0.00012100836,0.86431485,0.000013891032,0.00019629922,0.0000036195802,0.0000375578,0.000035662368,0.00018806959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975608,0.0001338682,0.0011699176,0.00016158627,0.0007181566,0.0002556801],"domain_scores_gemma":[0.9952617,0.00028807827,0.001203762,0.00029367695,0.0028248038,0.00012797429],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008629741,0.00016899078,0.00037138545,0.00048568836,0.00020388226,0.00004646745,0.00027158906,0.000094161864,0.0015416371],"category_scores_gemma":[0.0009327855,0.00015809548,0.00012289184,0.00078629225,0.00018679518,0.00077806384,0.00006295539,0.0001978603,0.0000048608063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103256745,0.00024355686,0.0005829063,0.000041332518,0.00007570645,0.0000017873422,0.0007435141,0.9887788,0.00008634554,0.007276131,0.0010386275,0.0010279946],"study_design_scores_gemma":[0.001402278,0.0004143035,0.00006552312,0.0000841003,0.00007350988,0.000049606293,0.00072712475,0.985469,0.0015130554,0.009620891,0.00039661472,0.00018399839],"about_ca_topic_score_codex":0.000003920537,"about_ca_topic_score_gemma":0.0000041332614,"teacher_disagreement_score":0.1342926,"about_ca_system_score_codex":0.00016193376,"about_ca_system_score_gemma":0.00015095377,"threshold_uncertainty_score":0.9993711},"labels":[],"label_agreement":null},{"id":"W3021111117","doi":"10.1007/978-3-030-45771-6_25","title":"On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Integer programming; Computer science; Duality (order theory); Integer (computer science); Nonlinear programming; Nonlinear system; Mathematical optimization; Applied mathematics; Algebra over a field; Algorithm; Mathematics; Discrete mathematics; Programming language; Pure mathematics; Physics","score_opus":0.055774730431660056,"score_gpt":0.3478965546864528,"score_spread":0.2921218242547928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021111117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014700492,0.000052098003,0.9963408,0.0009526719,0.0004591961,0.0007818761,0.0000143121815,0.0001364898,0.0011155144],"genre_scores_gemma":[0.0039569717,0.00002514978,0.99439114,0.0006280122,0.00030189,0.000022706428,0.000020743111,0.00008345987,0.0005699172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621123,0.00009237408,0.0006529955,0.00119671,0.0012249663,0.00062173465],"domain_scores_gemma":[0.99749094,0.0010373454,0.0002449145,0.00073707924,0.00029887428,0.00019085669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001034586,0.00047176343,0.0006624381,0.00063510146,0.00011836411,0.00020896601,0.0010280414,0.00029751397,0.00008578065],"category_scores_gemma":[0.0011630434,0.0004249559,0.00011838218,0.0007179706,0.00051567744,0.00018554213,0.00061076274,0.0013416426,0.00004791929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011811015,0.00025663985,0.000034390923,0.00037561968,0.000034033277,0.0005878354,0.0016973062,0.36439383,0.00006549411,0.082068846,0.00006953206,0.5502984],"study_design_scores_gemma":[0.0005385813,0.00011758118,0.0000036686652,0.000375121,0.0000046315386,0.000010626833,4.6456537e-7,0.69646204,0.00049921393,0.3005104,0.0010366314,0.00044101098],"about_ca_topic_score_codex":0.000012063811,"about_ca_topic_score_gemma":0.0001728693,"teacher_disagreement_score":0.5498574,"about_ca_system_score_codex":0.00042348017,"about_ca_system_score_gemma":0.00035291273,"threshold_uncertainty_score":0.99982023},"labels":[],"label_agreement":null},{"id":"W3022854658","doi":"","title":"A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hessian matrix; Augmented Lagrangian method; Jacobian matrix and determinant; Python (programming language); Mathematical optimization; Implementation; Computer science; Algorithm; Matrix (chemical analysis); Mathematics; Applied mathematics; Programming language","score_opus":0.01087528217850223,"score_gpt":0.2779163486946088,"score_spread":0.26704106651610654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022854658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007663924,0.000053266544,0.9933871,0.0017613443,0.000046667017,0.0026268829,0.00008996496,0.0010736347,0.0001947641],"genre_scores_gemma":[0.009314422,0.000025525207,0.9870971,0.00043028212,0.00014406016,0.0013142542,0.00010306152,0.00017371544,0.0013976238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966086,0.00032414767,0.0005976861,0.00069449225,0.0008202643,0.0009548079],"domain_scores_gemma":[0.99688846,0.00026805617,0.0003104054,0.0015203253,0.0004992147,0.00051351514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010985035,0.0004483871,0.00045752918,0.00059401605,0.00041110607,0.00016795273,0.00084632897,0.0002656562,0.00011118678],"category_scores_gemma":[0.0006484594,0.00041339078,0.00010015012,0.0013739615,0.00006327507,0.00044291693,0.00029941148,0.00039290678,0.000024368654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002717844,0.0002465339,0.0008300239,0.00007127836,0.00007190376,0.000009368519,0.00051468913,0.9527248,0.00079546054,0.014411934,0.0028922951,0.02715992],"study_design_scores_gemma":[0.0013706017,0.00027554776,0.00044840277,0.00003845312,0.000042050597,0.000048248847,0.00013634514,0.98312134,0.002238052,0.011105029,0.0006837848,0.0004921507],"about_ca_topic_score_codex":0.00032738934,"about_ca_topic_score_gemma":0.0006670474,"teacher_disagreement_score":0.030396525,"about_ca_system_score_codex":0.00055138697,"about_ca_system_score_gemma":0.000121088044,"threshold_uncertainty_score":0.9998318},"labels":[],"label_agreement":null},{"id":"W3028519024","doi":"","title":"A new hybrid conjugate gradient method with global convergence properties","year":2020,"lang":"en","type":"article","venue":"International Journal of Advanced Science and Technology","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjugate gradient method; Convergence (economics); Conjugate; Computer science; Derivation of the conjugate gradient method; Applied mathematics; Nonlinear conjugate gradient method; Conjugate residual method; Mathematics; Gradient descent; Algorithm; Artificial intelligence; Mathematical analysis; Artificial neural network","score_opus":0.036237972893313534,"score_gpt":0.35988706077853583,"score_spread":0.3236490878852223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028519024","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05480901,0.00023153203,0.9227708,0.021558492,0.00021530452,0.00015130591,0.000005529912,0.000054877575,0.00020314705],"genre_scores_gemma":[0.32250506,0.00012986157,0.6770005,0.00026216762,0.000050556773,0.000002655985,1.559355e-7,0.0000066330394,0.000042397576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983461,0.000016350936,0.00031093814,0.00022277154,0.0008945972,0.00020924],"domain_scores_gemma":[0.9973235,0.000048037706,0.00028667823,0.00009945094,0.002050795,0.00019153865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031317797,0.000104474755,0.00019588199,0.00023329906,0.000080633276,0.000055074812,0.0007908756,0.00002800687,0.000026047226],"category_scores_gemma":[0.0017745707,0.0000741263,0.00002106093,0.0008230546,0.00055156555,0.0006252349,0.00019058392,0.00021100738,0.000003105504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001141382,0.00015973618,0.0018470691,0.00004331354,0.00025097546,0.00079942774,0.00097224006,0.0070409686,0.07200582,0.20367332,0.00091910164,0.71114665],"study_design_scores_gemma":[0.0069452403,0.003419456,0.00019420075,0.0004081272,0.000062639956,0.0075194594,0.0038399803,0.07911382,0.43694443,0.44262093,0.018169275,0.0007624406],"about_ca_topic_score_codex":0.0000021029816,"about_ca_topic_score_gemma":0.0000020876423,"teacher_disagreement_score":0.7103842,"about_ca_system_score_codex":0.00013535291,"about_ca_system_score_gemma":0.00056161894,"threshold_uncertainty_score":0.30227828},"labels":[],"label_agreement":null},{"id":"W3035691313","doi":"","title":"A simpler approach to accelerated optimization: iterative averaging meets optimism","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical optimization; Computer science; Control theory (sociology); Mathematics; Artificial intelligence","score_opus":0.19871367044126856,"score_gpt":0.4037736806013445,"score_spread":0.20506001016007594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035691313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005732864,0.000009387594,0.90927386,0.012861214,0.00009858417,0.00044429515,0.000026509362,0.00030464627,0.07640823],"genre_scores_gemma":[0.53829527,0.000026992439,0.45739514,0.0018253939,0.00020663517,0.00008071268,0.0002282752,0.00007054942,0.001871061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758947,0.00021521596,0.00043247128,0.0006214135,0.0008052846,0.00033615448],"domain_scores_gemma":[0.99833685,0.00023135818,0.00018525243,0.00018319472,0.00075950264,0.0003038158],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023985641,0.00030009993,0.00030316057,0.00024783704,0.00022871776,0.00035636275,0.00059206993,0.000084116415,0.0030431768],"category_scores_gemma":[0.0018207155,0.00029199777,0.000073202034,0.0005015691,0.000038967493,0.00036005315,0.00026318134,0.00077393226,0.0001416983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012580579,0.000089511675,0.00009209723,0.000015314461,0.000071929906,0.000014185032,0.0023142458,0.9353582,0.00021043366,0.05936586,0.0003932523,0.001949129],"study_design_scores_gemma":[0.0007537237,0.0001335581,0.000013454746,0.000043511605,0.000007224221,0.000009303593,0.00030214412,0.9937548,0.00025650038,0.0009934254,0.0034318736,0.00030048165],"about_ca_topic_score_codex":0.000009345677,"about_ca_topic_score_gemma":9.67352e-7,"teacher_disagreement_score":0.537722,"about_ca_system_score_codex":0.00012657879,"about_ca_system_score_gemma":0.000091793656,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W3045794209","doi":"","title":"Convergence analysis of a new coefficient conjugate gradient method under exact line search","year":2020,"lang":"en","type":"article","venue":"International Journal of Advanced Science and Technology","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjugate gradient method; Convergence (economics); Line search; Nonlinear conjugate gradient method; Conjugate; Computer science; Line (geometry); Applied mathematics; Conjugate residual method; Mathematical optimization; Mathematics; Algorithm; Gradient descent; Mathematical analysis; Artificial intelligence; Artificial neural network; Geometry","score_opus":0.06495578451469657,"score_gpt":0.4270622620179934,"score_spread":0.36210647750329683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045794209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14323497,0.0001392389,0.8466855,0.009608838,0.00014062475,0.00010166039,0.000009545552,0.00002135664,0.000058247842],"genre_scores_gemma":[0.7028073,0.00027064455,0.29663655,0.000191229,0.000031100113,0.0000012449257,8.738101e-7,0.0000074221102,0.000053631997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997693,0.00003299683,0.0005669162,0.0002557308,0.0012273394,0.00022398493],"domain_scores_gemma":[0.9959837,0.00025492755,0.00042517213,0.00015147205,0.002980192,0.00020452506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085576315,0.00010431989,0.0003632632,0.0015566723,0.00006403759,0.000029627181,0.000904505,0.00005488803,0.00008644811],"category_scores_gemma":[0.002423921,0.00008718892,0.00007257173,0.0037353234,0.00063080905,0.00032156304,0.0002646834,0.0002862515,0.0000016104216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041726162,0.00034715942,0.0013290151,0.00003038435,0.0013391788,0.00012939943,0.0022417388,0.5199306,0.1671654,0.17281167,0.00015867529,0.13409951],"study_design_scores_gemma":[0.0026012943,0.0012442176,0.0005370962,0.000089131645,0.00027647676,0.00019637754,0.004142458,0.68695533,0.23881964,0.06323812,0.0015768918,0.00032297507],"about_ca_topic_score_codex":0.0000041894546,"about_ca_topic_score_gemma":0.0000033545145,"teacher_disagreement_score":0.55957234,"about_ca_system_score_codex":0.00011894621,"about_ca_system_score_gemma":0.00044656688,"threshold_uncertainty_score":0.3555461},"labels":[],"label_agreement":null},{"id":"W3048704129","doi":"10.3233/jifs-200374","title":"An approximation algorithm for solving standard quadratic optimization problems","year":2020,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Conestoga College","funders":"","keywords":"Semidefinite programming; Algorithm; Computational complexity theory; Mathematics; Linear programming; Approximation algorithm; Heuristic; Mathematical optimization; Quadratic programming; Matrix (chemical analysis); Quadratic equation; Computer science","score_opus":0.08199086183557162,"score_gpt":0.3593272716802328,"score_spread":0.2773364098446612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048704129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025239124,0.0004395238,0.9967688,0.0003584713,0.00046108675,0.0014815994,0.000032320197,0.00006971121,0.00013611323],"genre_scores_gemma":[0.01893086,0.00020313871,0.97952384,0.000063572574,0.0009663179,0.00007143703,0.000028760736,0.00009916327,0.0001129112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966779,0.00018722554,0.0015631283,0.00025592465,0.0009796837,0.0003361887],"domain_scores_gemma":[0.99562556,0.00040106976,0.0012763498,0.00023715294,0.002107436,0.0003524353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348966,0.0002372109,0.00061003957,0.0002490459,0.00016202593,0.00029047363,0.00041031087,0.00012805981,0.000044831475],"category_scores_gemma":[0.0011829188,0.0002013115,0.00017915393,0.00042435966,0.000041149095,0.0008666981,0.000033373108,0.0003024417,0.000006430268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010892396,0.00015709679,0.000016080292,0.0007012388,0.00012415533,0.000007777637,0.002466253,0.975719,0.00035181857,0.0022960892,0.0010792153,0.016972395],"study_design_scores_gemma":[0.00067743665,0.001181725,3.8676427e-7,0.00028374407,0.000053755222,0.000054048345,0.0026292517,0.9895884,0.001542934,0.0029025637,0.0008780056,0.00020775067],"about_ca_topic_score_codex":0.0000028692396,"about_ca_topic_score_gemma":8.8943875e-7,"teacher_disagreement_score":0.01867847,"about_ca_system_score_codex":0.0002954199,"about_ca_system_score_gemma":0.00021015984,"threshold_uncertainty_score":0.82092446},"labels":[],"label_agreement":null},{"id":"W307017053","doi":"10.21236/ada444692","title":"Nonlinear Programming by Mesh Adaptive Direct Searches","year":2005,"lang":"en","type":"report","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Nonlinear system; Computer science; Adaptive mesh refinement; Nonlinear programming; Mathematical optimization; Algorithm; Computational science; Mathematics; Physics","score_opus":0.14615238851482007,"score_gpt":0.4242637269838348,"score_spread":0.2781113384690147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W307017053","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008431918,0.0017465021,0.20727673,0.00035412598,0.000278686,0.0025982878,0.0003890206,0.001069778,0.7862784],"genre_scores_gemma":[0.000025416984,0.0023486717,0.6548859,0.000020053003,0.0006576684,0.00019954178,0.00027868763,0.00020982274,0.34137425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945559,0.00016786518,0.00076698186,0.0008194328,0.002814384,0.0008754348],"domain_scores_gemma":[0.9959094,0.00091916445,0.0003704575,0.0007638863,0.0017241114,0.00031301714],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015423,0.0005540333,0.00090401905,0.00031348763,0.00017504347,0.00013364381,0.00052295375,0.00055507483,0.0023119475],"category_scores_gemma":[0.0031444903,0.00047826263,0.00026086427,0.00053035654,0.00019455265,0.00020907857,0.00034911121,0.0011653635,0.00017346024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049186765,0.0009811164,0.00001834069,0.00070282817,0.00070061034,0.00008321853,0.0002724367,0.0001349337,0.000015367525,0.00052273006,0.45496187,0.5415574],"study_design_scores_gemma":[0.00037429645,0.00015975416,0.000001060651,0.00022167445,0.00007896767,0.00004032769,0.00023835346,0.015645733,0.00081431854,0.00053179724,0.98112136,0.0007723357],"about_ca_topic_score_codex":0.00012657614,"about_ca_topic_score_gemma":0.00008428288,"teacher_disagreement_score":0.540785,"about_ca_system_score_codex":0.0009670208,"about_ca_system_score_gemma":0.001568691,"threshold_uncertainty_score":0.9997669},"labels":[],"label_agreement":null},{"id":"W3081045602","doi":"10.5539/jmr.v12n5p27","title":"On a New Optimization Method With Constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Combinatorics; Convergence (economics); Function (biology); Optimization problem; Set (abstract data type); Mathematical optimization; Discrete mathematics; Computer science; Geometry","score_opus":0.2675800424540174,"score_gpt":0.4967431685305785,"score_spread":0.22916312607656109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081045602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056395744,0.000027772772,0.9898899,0.0042545768,0.000027797687,0.0004204734,0.000003780339,0.000029897552,0.0047818087],"genre_scores_gemma":[0.003332865,0.000053728494,0.99551976,0.00012618116,0.0002064784,0.000004997548,9.904819e-7,0.00007006679,0.0006849517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553955,0.00040211345,0.0007676876,0.00021542511,0.0026280947,0.0004471287],"domain_scores_gemma":[0.9929605,0.0039452626,0.0004603188,0.00030552587,0.0017057892,0.0006226033],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031276613,0.00018413542,0.0004988992,0.00045888234,0.0001371269,0.00013258253,0.0005948158,0.00010412994,0.0013095146],"category_scores_gemma":[0.009957508,0.00012978098,0.00010154719,0.00104174,0.00019965008,0.0002543189,0.000109648594,0.0011692237,0.000054194297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00100812,0.0016052559,0.000018871617,0.0010044225,0.0005402718,0.00061595254,0.010550911,0.67096746,0.0008412224,0.236671,0.054502044,0.021674447],"study_design_scores_gemma":[0.004600949,0.0035558848,0.0000024844815,0.00072507234,0.00006220041,0.0005713989,0.0043777344,0.74070245,0.0040852935,0.23993653,0.000984299,0.00039572487],"about_ca_topic_score_codex":0.0000010503215,"about_ca_topic_score_gemma":6.383688e-7,"teacher_disagreement_score":0.069734946,"about_ca_system_score_codex":0.0001436488,"about_ca_system_score_gemma":0.00070333946,"threshold_uncertainty_score":0.99960345},"labels":[],"label_agreement":null},{"id":"W3081538319","doi":"10.1016/j.disopt.2020.100610","title":"BDD-based optimization for the quadratic stable set problem","year":2020,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary decision diagram; Quadratic programming; Solver; Mathematical optimization; Quadratic equation; Mathematics; Integer programming; Representation (politics); Set (abstract data type); Quadratic unconstrained binary optimization; Computer science; Optimization problem; Algorithm; Programming language","score_opus":0.08705139819538114,"score_gpt":0.36025948128975266,"score_spread":0.2732080830943715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081538319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012142276,0.000075827505,0.9885487,0.0074749975,0.00007564727,0.0026438087,0.00011612764,0.00030061984,0.0007521485],"genre_scores_gemma":[0.0047084894,0.000065776534,0.9923094,0.00082698994,0.000163133,0.00062068086,0.00066740665,0.00013594261,0.00050220155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977933,0.00014843418,0.00056356634,0.00048837106,0.0005515482,0.00045474328],"domain_scores_gemma":[0.99759805,0.0008974341,0.0003084518,0.00043773162,0.00057443284,0.0001838832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043540247,0.00028971717,0.00030428873,0.00009392267,0.00051278237,0.00022979364,0.00041207354,0.00012931088,0.00079866085],"category_scores_gemma":[0.0015922687,0.00022470694,0.00012818238,0.000862108,0.00010053745,0.00050144165,0.000076655924,0.00019989151,0.0000133145995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011320948,0.00003737241,0.000014014293,0.00017385182,0.00003831022,7.3772145e-7,0.00042538857,0.99173933,0.000014694969,0.0042090896,0.0027434311,0.00049054873],"study_design_scores_gemma":[0.0012801525,0.00014090029,9.74901e-7,0.000032388718,0.000076698154,8.3800404e-7,0.00035625184,0.9947708,0.00034730096,0.0014850404,0.0012274941,0.00028111532],"about_ca_topic_score_codex":0.0000059552976,"about_ca_topic_score_gemma":0.000004047506,"teacher_disagreement_score":0.0066480073,"about_ca_system_score_codex":0.000100579804,"about_ca_system_score_gemma":0.00020081304,"threshold_uncertainty_score":0.91632825},"labels":[],"label_agreement":null},{"id":"W3082716383","doi":"10.4230/lipics.approx/random.2020.18","title":"On Testing and Robust Characterizations of Convexity","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Computer science","score_opus":0.14247473325074667,"score_gpt":0.33722900295259484,"score_spread":0.19475426970184817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082716383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1676882,0.000011648409,0.822312,0.0010411222,0.00017857211,0.0021794073,0.0013483646,0.00028565153,0.004955057],"genre_scores_gemma":[0.37508842,0.000039275263,0.6222095,0.0016063971,0.00015909832,0.0001375085,0.00038548408,0.00012413123,0.000250233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980186,0.000033829165,0.0009285489,0.00019795012,0.00042624088,0.00039482283],"domain_scores_gemma":[0.99751663,0.00092038634,0.00048102083,0.00032283316,0.00051554077,0.00024361546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028336167,0.000255171,0.00043222687,0.00014783419,0.00021452174,0.000091364236,0.00030025793,0.00013347312,0.000078083736],"category_scores_gemma":[0.003513219,0.0002385045,0.00008261265,0.000421271,0.00016680255,0.0005896303,0.00021206618,0.00033460144,0.000025362866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003260192,0.005902851,0.058665078,0.037021946,0.0023334962,0.000051430645,0.12110305,0.070407085,0.0059603346,0.5763873,0.023648899,0.09525836],"study_design_scores_gemma":[0.004697555,0.0008447569,0.0009428853,0.0003490525,0.00006618931,0.000024400086,0.0015245047,0.9744926,0.0028984665,0.0109257735,0.0025618353,0.0006719577],"about_ca_topic_score_codex":0.000001993913,"about_ca_topic_score_gemma":0.0000010352753,"teacher_disagreement_score":0.9040855,"about_ca_system_score_codex":0.000044509994,"about_ca_system_score_gemma":0.000061561586,"threshold_uncertainty_score":0.9725931},"labels":[],"label_agreement":null},{"id":"W3089370116","doi":"","title":"Modeling and solving bundle adjustment problems","year":2020,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Applied mathematics; Algorithm; Mathematics; Mathematical optimization","score_opus":0.047645848645806045,"score_gpt":0.30644162999992597,"score_spread":0.2587957813541199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089370116","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004389839,0.0038286992,0.98264325,0.004316556,0.00016418225,0.002695507,0.00010246129,0.0014210385,0.0004384646],"genre_scores_gemma":[0.07844809,0.0028072204,0.91448957,0.0007033464,0.0003663279,0.0018807895,0.00009837418,0.00031036825,0.0008958924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957179,0.00021714918,0.0009819948,0.0011953908,0.00086940615,0.0010181884],"domain_scores_gemma":[0.99706984,0.00025401684,0.0003867562,0.0012898594,0.00035380496,0.0006457269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008124476,0.0007463149,0.0009262253,0.00051943,0.00030366998,0.00038028855,0.0008212294,0.00074830494,0.00006106588],"category_scores_gemma":[0.0011539358,0.00079467107,0.00023208717,0.0004013545,0.00011315035,0.00028412734,0.0028734363,0.0020461062,0.000012273472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008130183,0.0005433824,0.0003432182,0.0018775943,0.00027570318,0.00005747574,0.0015778649,0.92984974,0.0010617628,0.04784892,0.0018429322,0.014640078],"study_design_scores_gemma":[0.0003869499,0.00008884254,0.000038065882,0.0003392814,0.000067126384,0.000036605954,0.0001332295,0.8365114,0.00040847462,0.16120996,0.00017334135,0.00060674903],"about_ca_topic_score_codex":0.0020149327,"about_ca_topic_score_gemma":0.00074224477,"teacher_disagreement_score":0.11336104,"about_ca_system_score_codex":0.0009044844,"about_ca_system_score_gemma":0.0005102508,"threshold_uncertainty_score":0.99945045},"labels":[],"label_agreement":null},{"id":"W3090909285","doi":"10.1016/j.cam.2020.113218","title":"Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e514\" altimg=\"si2.svg\"><mml:mi mathvariant=\"double-struck\">R</mml:mi></mml:math>","year":2020,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Mathematics; Lipschitz continuity; Bounded function; Simplex; Function (biology); Fixed point; Mathematical analysis; Approximation error; Infinity; Interval (graph theory); Applied mathematics; Combinatorics","score_opus":0.04148645709190102,"score_gpt":0.3184948015708173,"score_spread":0.27700834447891626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090909285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87059754,0.000005856676,0.127683,0.00043327664,0.000030747586,0.00016576586,0.00003257477,0.000024032492,0.0010271963],"genre_scores_gemma":[0.5996968,0.000010913899,0.39992422,0.00017324009,0.00007371036,0.00005933457,0.000017640918,0.000038165985,0.0000059480635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763167,0.000045052224,0.0010997439,0.00018744169,0.0008268924,0.00020918314],"domain_scores_gemma":[0.99715245,0.0010919318,0.001213635,0.0001781677,0.00024003172,0.00012381501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007364665,0.00019871847,0.0003313054,0.0001286142,0.00012014135,0.00007244933,0.00030291307,0.00014712814,0.000023684672],"category_scores_gemma":[0.0006244597,0.00017662643,0.00013664928,0.00033447394,0.00014050273,0.00019324866,0.0002412882,0.00043041338,0.000018085535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025114967,0.00033680486,0.000008482122,0.0005073339,0.000086860506,0.000017013075,0.0036539221,0.0059337853,0.00068133057,0.9870953,0.000028742692,0.0013992642],"study_design_scores_gemma":[0.001005848,0.00037533895,0.000080387304,0.00060364703,0.000101497375,0.00019994119,0.0021609177,0.92354906,0.014028686,0.057676066,0.00003260475,0.00018603934],"about_ca_topic_score_codex":0.000004083215,"about_ca_topic_score_gemma":0.0000016350203,"teacher_disagreement_score":0.9294192,"about_ca_system_score_codex":0.000019973,"about_ca_system_score_gemma":0.00015840658,"threshold_uncertainty_score":0.7202617},"labels":[],"label_agreement":null},{"id":"W3091576739","doi":"10.1007/s10589-022-00448-x","title":"Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition","year":2023,"lang":"en","type":"preprint","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia Graduate School; Natural Sciences and Engineering Research Council of Canada","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Quasi-Newton method; Inverse; Noise (video); Applied mathematics; Mathematics; Inverse problem; Mathematical optimization; Computer science; Newton's method; Mathematical analysis; Artificial intelligence; Nonlinear system; Geometry; Physics","score_opus":0.10201284216496538,"score_gpt":0.41545003704038547,"score_spread":0.3134371948754201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091576739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000317535,0.00018767254,0.99017966,0.0049471953,0.0001606456,0.0032070577,0.00038020159,0.0005360803,0.00036970593],"genre_scores_gemma":[0.0019675894,0.00045564727,0.98608744,0.00045230056,0.0004110326,0.0034465773,0.0047493964,0.0001986978,0.0022313276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996018,0.00048980926,0.0010765959,0.0010336152,0.00095062045,0.00043137957],"domain_scores_gemma":[0.9945665,0.0023252815,0.0008482235,0.0007445497,0.0012704114,0.00024505518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001099398,0.0005258659,0.00059486675,0.00045819365,0.0010110616,0.00041963288,0.00060729665,0.00033133777,0.0003254454],"category_scores_gemma":[0.00039444116,0.0004645433,0.00019753912,0.0009667274,0.0002576577,0.00021952062,0.00076832826,0.0008432316,0.00006273002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001764223,0.0001710645,0.000008452375,0.00022689246,0.00012308151,0.000002301665,0.00038988004,0.9447253,0.000010286553,0.0504351,0.002258951,0.0016310768],"study_design_scores_gemma":[0.0006099765,0.000019950034,0.00004314448,0.000104135506,0.00011751294,0.000027740409,0.00025359067,0.8030531,0.00001718137,0.19380903,0.0015493209,0.0003953614],"about_ca_topic_score_codex":0.000050445644,"about_ca_topic_score_gemma":0.000020149266,"teacher_disagreement_score":0.14337394,"about_ca_system_score_codex":0.00026801144,"about_ca_system_score_gemma":0.00044112388,"threshold_uncertainty_score":0.99978065},"labels":[],"label_agreement":null},{"id":"W3092221604","doi":"10.1002/nla.2337","title":"Minimizing convex quadratics with variable precision conjugate gradients","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Conjugate gradient method; Context (archaeology); Computation; Conjugate; Quadratic equation; Matrix (chemical analysis); Mathematical optimization; Regular polygon; Variable (mathematics); Convex optimization; Applied mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.04017474802119845,"score_gpt":0.3171565609560845,"score_spread":0.27698181293488605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092221604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072335487,0.000027220118,0.993748,0.0015476509,0.000012049419,0.0014032451,0.0000431618,0.0003148106,0.0021805193],"genre_scores_gemma":[0.030250322,0.000016960035,0.96763134,0.00072574924,0.00015461263,0.00064963236,0.00008699677,0.00010455451,0.0003798315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783045,0.0000741492,0.000446742,0.00057741307,0.0006406161,0.00043060022],"domain_scores_gemma":[0.9977249,0.0005869236,0.00021942412,0.0005374837,0.000443676,0.00048757315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335431,0.00027335837,0.00040174875,0.00006590605,0.00028097036,0.00007033332,0.0003841364,0.00009717705,0.00029215345],"category_scores_gemma":[0.00032271008,0.00020637427,0.00004179769,0.0013940324,0.00017923742,0.00020634719,0.000101708094,0.00040188365,0.00022146573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028712838,0.00428339,0.00416737,0.0012413526,0.0011962082,0.00008678935,0.0056145764,0.10910493,0.002021238,0.817503,0.01094401,0.040965866],"study_design_scores_gemma":[0.0041213194,0.0013672456,0.00009601033,0.00012171592,0.00022403948,0.00005444948,0.00065632415,0.8558584,0.002668119,0.026770804,0.106864266,0.001197341],"about_ca_topic_score_codex":0.000005036683,"about_ca_topic_score_gemma":0.00000117902,"teacher_disagreement_score":0.7907322,"about_ca_system_score_codex":0.000055618304,"about_ca_system_score_gemma":0.00016415666,"threshold_uncertainty_score":0.8415699},"labels":[],"label_agreement":null},{"id":"W3097322038","doi":"10.1016/j.orl.2020.10.009","title":"A note on the Lasserre hierarchy for different formulations of the maximum independent set problem","year":2020,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Hierarchy; Mathematics; Set (abstract data type); Independent set; Combinatorics; Optimization problem; Mathematical optimization; Applied mathematics; Computer science","score_opus":0.1664717190378425,"score_gpt":0.41683763501147447,"score_spread":0.250365915973632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097322038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09743655,0.000010556088,0.51268417,0.381645,0.000074270436,0.006737288,0.0003044162,0.0000650571,0.0010427327],"genre_scores_gemma":[0.9148577,0.000022738102,0.078120746,0.0032427162,0.00022898607,0.002215942,0.00006982061,0.00009620073,0.0011451704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970871,0.0005078935,0.0003831636,0.00031179405,0.0012524427,0.00045760884],"domain_scores_gemma":[0.99683326,0.0018168814,0.000049724244,0.0006181338,0.0005549249,0.00012705366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081594643,0.00015316262,0.00018181793,0.00014470112,0.0010126779,0.0001546705,0.000772512,0.00006362329,0.00016234057],"category_scores_gemma":[0.002768191,0.00008547871,0.00013141028,0.00079784275,0.0002496054,0.00016765749,0.00030368264,0.00072396913,0.000021025555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028105616,0.00059661263,0.00025570727,0.0003860896,0.00021947964,0.0000046347986,0.011376489,0.29300034,0.052702073,0.57148015,0.066178545,0.0035188312],"study_design_scores_gemma":[0.002311345,0.0005384068,0.00053578,0.00017896689,0.000035393317,0.0000042270917,0.0015012531,0.89473885,0.030924188,0.05528281,0.013508272,0.00044049762],"about_ca_topic_score_codex":0.000015166776,"about_ca_topic_score_gemma":0.00012743432,"teacher_disagreement_score":0.81742114,"about_ca_system_score_codex":0.0001635105,"about_ca_system_score_gemma":0.00016600611,"threshold_uncertainty_score":0.77888024},"labels":[],"label_agreement":null},{"id":"W310879469","doi":"10.1007/978-1-4613-0279-7_24","title":"An Analytic Center Self-Concordant Cut Method for the Convex Feasibility Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Center (category theory); Regular polygon; Set (abstract data type); Convex analysis; Combinatorics; Convex set; Convex optimization; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.07041449983146163,"score_gpt":0.3974612581906012,"score_spread":0.32704675835913954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W310879469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.6698963e-7,0.00029518138,0.9369568,0.0009479135,0.00005539333,0.0073082973,0.00038209272,0.00031356022,0.053740293],"genre_scores_gemma":[0.00006690541,0.0034430656,0.88569796,0.0004976367,0.00037175787,0.0022269518,0.00075961667,0.00025560317,0.106680505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970157,0.00009439892,0.00092666724,0.0010324642,0.0004994108,0.00043133218],"domain_scores_gemma":[0.99507624,0.0013823444,0.0006549542,0.001173178,0.0013989285,0.00031438065],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000855309,0.00055347424,0.0006706346,0.00024270448,0.0006945633,0.00019887323,0.00058501604,0.00044681013,0.0010400554],"category_scores_gemma":[0.00013468691,0.00045064656,0.00020014527,0.00023480943,0.00015335431,0.00030955402,0.00012690506,0.0005112094,0.00003377331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097421624,0.0006905766,0.000020832655,0.0007055875,0.00058345875,0.0000022559266,0.0006436109,0.08438703,0.00001678089,0.89309525,0.003304717,0.016452497],"study_design_scores_gemma":[0.0010907043,0.00010210516,0.0000010624515,0.000043229607,0.000302959,0.000025108151,0.00008877175,0.7962425,0.000025527223,0.045992352,0.15560316,0.00048255103],"about_ca_topic_score_codex":0.000003704554,"about_ca_topic_score_gemma":0.000022249373,"teacher_disagreement_score":0.8471029,"about_ca_system_score_codex":0.00025309267,"about_ca_system_score_gemma":0.00027044961,"threshold_uncertainty_score":0.9998731},"labels":[],"label_agreement":null},{"id":"W3109513473","doi":"","title":"Solving unconstrained minimization problems with a new hybrid conjugate gradient method","year":2020,"lang":"en","type":"article","venue":"International Conference on Industrial Engineering and Operations Management","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjugate gradient method; Minification; Nonlinear conjugate gradient method; Computer science; Derivation of the conjugate gradient method; Mathematical optimization; Gradient method; Conjugate residual method; Applied mathematics; Mathematics; Algorithm; Gradient descent; Artificial intelligence; Artificial neural network","score_opus":0.1175550187998964,"score_gpt":0.32755968579418837,"score_spread":0.210004666994292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109513473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011137385,0.0000049032756,0.98697525,0.006310528,0.00016559087,0.00066092727,0.000022300243,0.00014385831,0.004602924],"genre_scores_gemma":[0.355239,0.00011200375,0.63929504,0.00042588965,0.00056076987,0.00022630033,0.00013290938,0.000073888354,0.003934175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998811,0.000027948836,0.00029314228,0.00032614262,0.00036513899,0.00017664336],"domain_scores_gemma":[0.9994079,0.000076073884,0.000055047574,0.00012002792,0.00016520353,0.00017578021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014009251,0.0001802695,0.00016621736,0.0001639248,0.00009333745,0.00024155862,0.00017953466,0.000042677162,0.00030133524],"category_scores_gemma":[0.00024145674,0.00016337995,0.0000246223,0.0001983659,0.000024806122,0.0002040868,0.00007616302,0.00022598193,0.000010081526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005307504,0.000039932907,0.000009214682,0.0000243595,0.00015114971,0.000011900802,0.00029773902,0.70839316,0.00012388486,0.28105584,0.0007724221,0.009067316],"study_design_scores_gemma":[0.0017770777,0.00017777989,0.000005532326,0.00014595379,0.000028787079,0.000008159792,0.00023225186,0.9929666,0.000478461,0.0007351781,0.0032296963,0.00021455098],"about_ca_topic_score_codex":0.000014759238,"about_ca_topic_score_gemma":0.000005978016,"teacher_disagreement_score":0.35412526,"about_ca_system_score_codex":0.000072987226,"about_ca_system_score_gemma":0.000073308074,"threshold_uncertainty_score":0.66624415},"labels":[],"label_agreement":null},{"id":"W3112731927","doi":"","title":"Comparison of conjugate gradient method on solving unconstrained optimization problems","year":2020,"lang":"en","type":"article","venue":"International Conference on Industrial Engineering and Operations Management","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjugate gradient method; Computer science; Nonlinear conjugate gradient method; Conjugate; Mathematical optimization; Derivation of the conjugate gradient method; Gradient method; Conjugate residual method; Applied mathematics; Mathematics; Algorithm; Gradient descent; Artificial intelligence; Artificial neural network; Mathematical analysis","score_opus":0.2004435237611576,"score_gpt":0.3959218037650013,"score_spread":0.1954782800038437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112731927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012620157,0.0000044120575,0.9882878,0.0027821173,0.00024081893,0.00059079926,0.00003015273,0.00008655014,0.0067153503],"genre_scores_gemma":[0.69307923,0.0000469603,0.30604297,0.000103630286,0.0001469301,0.00010065725,0.00007071567,0.000028324683,0.0003805605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876523,0.00004340203,0.0004214136,0.00026019616,0.0003738178,0.00013595664],"domain_scores_gemma":[0.9993855,0.00012404594,0.00008493073,0.00011814665,0.00019331671,0.00009409109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020513621,0.00015164494,0.00021452799,0.00019085823,0.00007321425,0.000100241436,0.00018006409,0.00006321699,0.00019119262],"category_scores_gemma":[0.00038032414,0.0001489466,0.000033152217,0.00019234706,0.000028883416,0.0001143606,0.000073736985,0.00023246625,0.000004164984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025519366,0.00006400976,0.000009250115,0.000022135133,0.00006702546,0.0000012316845,0.00025221516,0.7258435,0.000128882,0.27009636,0.00010274946,0.0033871285],"study_design_scores_gemma":[0.0009335359,0.00020247452,0.0000035498283,0.00013910799,0.000017368282,6.5367e-7,0.00033619793,0.99641496,0.0010291915,0.00031349575,0.00047670034,0.00013277085],"about_ca_topic_score_codex":0.000005178916,"about_ca_topic_score_gemma":0.0000013789738,"teacher_disagreement_score":0.6918172,"about_ca_system_score_codex":0.00006248173,"about_ca_system_score_gemma":0.000027513499,"threshold_uncertainty_score":0.6073866},"labels":[],"label_agreement":null},{"id":"W3120315277","doi":"10.1007/s10957-020-01796-6","title":"A Nonmonotone Trust Region Method for Unconstrained Optimization Problems on Riemannian Manifolds","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Trust region; Mathematics; Theory of computation; Convergence (economics); Mathematical optimization; Order (exchange); Applied mathematics; Rate of convergence; Stationary point; Quadratic equation; Riemannian geometry; Mathematical analysis; Computer science; Algorithm; Geometry","score_opus":0.04020131094185135,"score_gpt":0.3669768293300348,"score_spread":0.3267755183881834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120315277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031600302,0.00012682802,0.99629873,0.0010862662,0.000052335716,0.00096372317,0.000021021162,0.000042627897,0.0013768482],"genre_scores_gemma":[0.001468135,0.0004285682,0.99535275,0.0002177001,0.0002149532,0.000255075,0.00005734816,0.000056125064,0.0019493464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812424,0.0003277122,0.0007538056,0.00029305188,0.00028625285,0.0002149085],"domain_scores_gemma":[0.9961065,0.0013932985,0.0007102062,0.0003146404,0.0013097753,0.00016556386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629077,0.00019569203,0.00035233577,0.00025619767,0.00034600892,0.00010557782,0.00017705471,0.0001407732,0.0001442585],"category_scores_gemma":[0.0010371808,0.00018213018,0.0001301545,0.0005877787,0.00009245547,0.00031842722,0.00003847768,0.00021910238,0.0000013237734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013327754,0.00023111263,0.000004841588,0.000070845046,0.000060932944,0.0000037537695,0.00016936824,0.74556816,0.000058519814,0.24818878,0.00017365241,0.005336769],"study_design_scores_gemma":[0.002513614,0.00026750375,0.0000036327215,0.00014232726,0.00017547814,0.0004018189,0.0008841641,0.7770188,0.0015626985,0.2124659,0.004249789,0.00031426392],"about_ca_topic_score_codex":2.0745337e-7,"about_ca_topic_score_gemma":4.6741226e-7,"teacher_disagreement_score":0.03572288,"about_ca_system_score_codex":0.00008138085,"about_ca_system_score_gemma":0.00017294845,"threshold_uncertainty_score":0.74270535},"labels":[],"label_agreement":null},{"id":"W3120609971","doi":"10.22215/etd/2014-10380","title":"Subadditive Approaches to Mixed Integer Programming","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subadditivity; Mathematics; Integer programming; Knapsack problem; Linear programming; Integer (computer science); Linear programming relaxation; Duality (order theory); Discrete mathematics; Mathematical optimization; Combinatorics; Computer science","score_opus":0.2000307554030832,"score_gpt":0.3763119452720022,"score_spread":0.17628118986891897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120609971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068335916,0.00002576047,0.880108,0.00018754577,0.00043742225,0.0021646617,0.000020099942,0.0004240164,0.11594915],"genre_scores_gemma":[0.0031534785,0.0000065686672,0.75587845,0.00004861756,0.00023586926,0.0009325544,0.0015488687,0.00019639023,0.23799922],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786735,0.00010249741,0.00042907684,0.00054786034,0.00060754415,0.00044568794],"domain_scores_gemma":[0.99833316,0.0004844111,0.00018484585,0.0004410909,0.0003487565,0.00020776354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036835513,0.00035409236,0.00047255377,0.00036063706,0.00010894978,0.00010945407,0.00035316846,0.00031651033,0.00083977],"category_scores_gemma":[0.0017966265,0.0003119351,0.0001253859,0.00043121004,0.00002774882,0.0001018541,0.000060657087,0.00046922022,0.0003529716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030075852,0.0006443017,0.000013802947,0.001886707,0.00040168865,0.000018499304,0.0072293896,0.0008632514,0.000033199933,0.312359,0.0443171,0.6319323],"study_design_scores_gemma":[0.0046455944,0.0017446071,0.00033048037,0.0033226004,0.0007342352,0.000035449088,0.08939509,0.1000168,0.049528163,0.29922614,0.44105095,0.009969883],"about_ca_topic_score_codex":0.000009487962,"about_ca_topic_score_gemma":0.0003544594,"teacher_disagreement_score":0.6219624,"about_ca_system_score_codex":0.00013104554,"about_ca_system_score_gemma":0.00010484757,"threshold_uncertainty_score":0.9999333},"labels":[],"label_agreement":null},{"id":"W3122987013","doi":"10.1287/ijoc.2021.1138","title":"Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cutting-plane method; Mathematical optimization; Set (abstract data type); Optimization problem; Integer (computer science); Inverse; Discrete optimization; Integer programming; Computer science; Inverse problem; Mathematics","score_opus":0.07202007146734461,"score_gpt":0.38885166001823096,"score_spread":0.31683158855088633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122987013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014998748,0.000060315357,0.98175263,0.00039141817,0.0005519417,0.00019063878,9.491235e-7,0.0000823397,0.001971033],"genre_scores_gemma":[0.030588798,0.00005386839,0.96769094,0.00062119536,0.00025179284,0.000005849373,0.00000539477,0.000045971472,0.0007362096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804515,0.00028144222,0.00060898,0.00018591623,0.0005563953,0.00032214168],"domain_scores_gemma":[0.99828357,0.00061288,0.00045556837,0.00020518628,0.00024227826,0.00020054427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634114,0.00018391221,0.00026881555,0.00046330495,0.0010896636,0.00019341784,0.00027913263,0.000056545516,0.00018690576],"category_scores_gemma":[0.00091489655,0.0001541027,0.000080012425,0.00055307214,0.000071506816,0.00048731043,0.0004280957,0.0010462643,0.0000037180064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089110246,0.00006742921,0.00009761368,0.000021452594,0.00004843933,0.0000913283,0.0022660028,0.92674166,0.000008555702,0.011897506,0.0013607634,0.057310123],"study_design_scores_gemma":[0.0010313363,0.00023394334,0.000023475774,0.000043122094,0.000010265586,0.0011527139,0.0017929625,0.9764733,0.00006590797,0.011824675,0.007133729,0.00021459842],"about_ca_topic_score_codex":0.0000014740721,"about_ca_topic_score_gemma":3.764018e-7,"teacher_disagreement_score":0.057095528,"about_ca_system_score_codex":0.00029189754,"about_ca_system_score_gemma":0.000106739026,"threshold_uncertainty_score":0.83809215},"labels":[],"label_agreement":null},{"id":"W3123799354","doi":"10.1007/s10898-022-01245-w","title":"TREGO: a trust-region framework for efficient global optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Global optimization; Python (programming language); Computer science; Benchmark (surveying); Mathematical optimization; Id, ego and super-ego; Trust region; Convergence (economics); Optimization problem; Dimension (graph theory); Algorithm; Mathematics; Geography; Psychology; Economics; Social psychology","score_opus":0.0386669940503243,"score_gpt":0.36914418414564043,"score_spread":0.3304771900953161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123799354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079739746,0.00022807292,0.9951761,0.0013314605,0.0008889049,0.00085918483,0.00012238548,0.00007870054,0.00051779],"genre_scores_gemma":[0.021439614,0.000075430136,0.97772396,0.00019673622,0.00029037448,0.00006750564,0.000040352148,0.000048593647,0.00011743609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658436,0.0002844959,0.0010908425,0.00032699073,0.0012487494,0.00046453765],"domain_scores_gemma":[0.99651945,0.0003372044,0.001348298,0.00033354806,0.0012295186,0.00023200027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082117674,0.00028008688,0.0004922328,0.00015665416,0.00053584966,0.00011764992,0.00053631025,0.00015422038,0.00035297265],"category_scores_gemma":[0.0023415096,0.00028002792,0.00031227194,0.0016613833,0.00007209245,0.00033709223,0.00018373106,0.0003483708,0.0000016801858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005807691,0.00045600627,0.0002548673,0.00003475728,0.00007553209,0.000021167738,0.000082097366,0.9497946,6.8015527e-7,0.04490935,0.0021369501,0.0016532376],"study_design_scores_gemma":[0.0020966805,0.00057956233,0.000026441125,0.000050206778,0.0001079817,0.00037977373,0.00044299653,0.9622341,0.000007683726,0.03311134,0.00070537784,0.00025788092],"about_ca_topic_score_codex":0.000002784204,"about_ca_topic_score_gemma":8.794087e-7,"teacher_disagreement_score":0.020642217,"about_ca_system_score_codex":0.002164479,"about_ca_system_score_gemma":0.0003996512,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W3125989689","doi":"","title":"Conic formulation for lp-norm optimization","year":2004,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conic section; Duality gap; Duality (order theory); Conic optimization; Norm (philosophy); Mathematics; Strong duality; Optimization problem; Mathematical optimization; Weak duality; Discrete mathematics; Convex optimization; Convex analysis; Geometry","score_opus":0.07647012242959955,"score_gpt":0.4014800584826622,"score_spread":0.32500993605306266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125989689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017490804,0.00036020004,0.8587355,0.0019311778,0.0017454525,0.021444084,0.0007545958,0.0007237222,0.09681447],"genre_scores_gemma":[0.12231653,0.009778951,0.85329425,0.00009188155,0.0007524866,0.0038383517,0.0013841741,0.0005515379,0.007991829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958737,0.00019869127,0.0011321453,0.0011234466,0.0005462019,0.0011258061],"domain_scores_gemma":[0.995573,0.0017776428,0.0004152602,0.0012367712,0.00075389654,0.00024346959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023162952,0.00043328918,0.00072029606,0.0009830392,0.00029698797,0.0002317926,0.0007974278,0.00078053394,0.00020366602],"category_scores_gemma":[0.0035451357,0.0005000329,0.00025454548,0.00028328694,0.00016890034,0.00029046234,0.0009280488,0.001603757,0.0000086757245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013126369,0.00018520791,0.00007169767,0.00052530423,0.00006826779,0.000004814855,0.0002473125,0.95179105,0.000008572266,0.013428861,0.000038036764,0.03349962],"study_design_scores_gemma":[0.0018880017,0.00011450278,0.000048985417,0.0002844331,0.00001376183,0.0000043876394,0.00022523287,0.85498494,0.00017572872,0.14001706,0.0017419077,0.0005010667],"about_ca_topic_score_codex":0.000018774545,"about_ca_topic_score_gemma":0.00011570155,"teacher_disagreement_score":0.12658821,"about_ca_system_score_codex":0.0037462192,"about_ca_system_score_gemma":0.0015514718,"threshold_uncertainty_score":0.99974513},"labels":[],"label_agreement":null},{"id":"W3128841739","doi":"10.1007/s12532-020-00200-8","title":"Design and implementation of a modular interior-point solver for linear optimization","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Interior point method; Solver; Computer science; Linear algebra; Linear programming; Benchmark (surveying); Speedup; Modular design; Context (archaeology); Mathematical optimization; Parallel computing; Point (geometry); Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.068070465368407,"score_gpt":0.40687205881756205,"score_spread":0.33880159344915506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128841739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030503187,0.00003093372,0.99520236,0.00019937656,0.000031213858,0.001376966,0.0000038227768,0.00008748785,0.00001751794],"genre_scores_gemma":[0.032314725,0.000007929542,0.96732926,0.000016291582,0.000024782874,0.00017053494,0.000057411922,0.00003983568,0.0000392109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852014,0.00012031782,0.0005719034,0.00027341995,0.00029138435,0.00022284941],"domain_scores_gemma":[0.9980971,0.0008352595,0.00021910142,0.00014778916,0.00062879734,0.00007195908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373938,0.00014290767,0.00028684785,0.00010275433,0.00009520367,0.00006381176,0.0000660572,0.00006997138,0.00006927577],"category_scores_gemma":[0.00071656343,0.00014261426,0.000062406034,0.00025843838,0.00006809116,0.00019902296,0.00007491824,0.00007846877,0.0000018831547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011687849,0.0005810289,0.000024429759,0.0032499565,0.00021246352,0.00001016224,0.005234756,0.6769036,0.002496557,0.05001707,0.00013953328,0.26101354],"study_design_scores_gemma":[0.00082188885,0.00014288744,0.0000027866379,0.00007918165,0.00004183874,0.000013802699,0.00071413827,0.8761483,0.006599347,0.11529353,0.000021017458,0.000121277895],"about_ca_topic_score_codex":9.721839e-7,"about_ca_topic_score_gemma":6.462969e-7,"teacher_disagreement_score":0.26089227,"about_ca_system_score_codex":0.000053192252,"about_ca_system_score_gemma":0.00006669262,"threshold_uncertainty_score":0.58156407},"labels":[],"label_agreement":null},{"id":"W3141481607","doi":"10.5539/jmr.v13n2p90","title":"Superlinear Convergence of a Modified Newton&amp;#39;s Method for Convex Optimization Problems With Constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Regular polygon; Convex function; Domain (mathematical analysis); Projection (relational algebra); Lagrange multiplier; Combinatorics; Convergence (economics); Function (biology); Convex optimization; Optimization problem; Mathematical optimization; Mathematical analysis; Algorithm; Geometry","score_opus":0.26403397437393245,"score_gpt":0.48591097609513145,"score_spread":0.221877001721199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141481607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029851145,0.00015270575,0.9944064,0.0007352327,0.000070516086,0.00093703787,0.000037220798,0.000017335335,0.00065842515],"genre_scores_gemma":[0.0035660216,0.0002914254,0.9936768,0.000014479524,0.00008660631,0.000047852365,0.000011424647,0.000080973135,0.0022244267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495095,0.0005335718,0.0014450302,0.0002893992,0.0021999292,0.0005811108],"domain_scores_gemma":[0.98338115,0.0050681434,0.000773005,0.0005583095,0.009939907,0.0002794972],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006233028,0.00022612693,0.0008681965,0.00053530186,0.00017132821,0.00009665125,0.0005559827,0.00017543537,0.0006807997],"category_scores_gemma":[0.008983747,0.00017797097,0.00019317806,0.0010647451,0.00048766207,0.00031152923,0.00015421356,0.00072349294,0.0000053464055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071302004,0.004371369,0.000101272104,0.008951093,0.0012865511,0.00015438175,0.009863002,0.78278476,0.02818208,0.15505339,0.004772558,0.0037665213],"study_design_scores_gemma":[0.0039978162,0.00073274947,0.00000264243,0.000996513,0.000099761135,0.000708613,0.0044218823,0.8736582,0.028233465,0.085982636,0.00084839115,0.00031735277],"about_ca_topic_score_codex":0.0000033735807,"about_ca_topic_score_gemma":0.0000074499494,"teacher_disagreement_score":0.09087341,"about_ca_system_score_codex":0.00015740677,"about_ca_system_score_gemma":0.0013518106,"threshold_uncertainty_score":0.999364},"labels":[],"label_agreement":null},{"id":"W3146482834","doi":"10.82308/10278","title":"A smoothing-regularization method for mathematical programs with cardinality constraints","year":2020,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Smoothing; Regularization (linguistics); Cardinality (data modeling); Mathematics; Computer science; Calculus (dental); Mathematical optimization; Applied mathematics; Algorithm; Artificial intelligence; Statistics; Data mining","score_opus":0.07776575226022478,"score_gpt":0.34236746598252926,"score_spread":0.26460171372230445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146482834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016789334,0.000026407455,0.95163536,0.00086437684,0.00012668346,0.006278352,0.00093686127,0.0014282527,0.02191437],"genre_scores_gemma":[0.120946966,0.0000040342024,0.87729067,0.0003968196,0.000047185702,0.00049267104,0.00009202165,0.0001933872,0.00053622073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582005,0.0005047318,0.0008200575,0.0009771361,0.0010715,0.0008065237],"domain_scores_gemma":[0.9964486,0.0010473449,0.0003657965,0.0006259541,0.00088814966,0.0006241882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017171365,0.0005019596,0.0007798265,0.00012524442,0.00072966405,0.00013757263,0.00052798295,0.00030275964,0.00023920558],"category_scores_gemma":[0.005082363,0.00044752992,0.0002510944,0.0008765063,0.0002772424,0.0006721901,0.00021719497,0.0007328923,0.000060294336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025818447,0.0003400531,0.000017669365,0.0007617577,0.000254136,0.000033016164,0.000039226794,0.0006003884,0.002099285,0.7917597,0.0000053054846,0.20383124],"study_design_scores_gemma":[0.0046077822,0.0011125214,0.00001444177,0.000319654,0.00034699577,0.00014813428,0.0005066525,0.05126562,0.03133152,0.8962186,0.012827561,0.0013005087],"about_ca_topic_score_codex":0.0000055966048,"about_ca_topic_score_gemma":0.00000854664,"teacher_disagreement_score":0.20253073,"about_ca_system_score_codex":0.00032350922,"about_ca_system_score_gemma":0.00007466356,"threshold_uncertainty_score":0.99979764},"labels":[],"label_agreement":null},{"id":"W3155416702","doi":"10.3934/math.2021383","title":"A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection","year":2021,"lang":"en","type":"article","venue":"AIMS Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Line search; Conjugate gradient method; Selection (genetic algorithm); Mathematical optimization; Convergence (economics); Gradient descent; Algorithm; Nonlinear conjugate gradient method; Computer science; Descent (aeronautics); Portfolio; Mathematics; Artificial intelligence","score_opus":0.023377743158726337,"score_gpt":0.31285585941219796,"score_spread":0.28947811625347164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155416702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025296975,0.00002896033,0.994432,0.00017102188,0.000050734496,0.0015931576,0.000045365814,0.00017632905,0.0009727708],"genre_scores_gemma":[0.0065565263,0.000045294364,0.9912687,0.00006239548,0.00006732607,0.0006726936,0.00021383722,0.000100561934,0.0010126855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785477,0.000063073894,0.00068551814,0.00048067875,0.00046211536,0.00045383908],"domain_scores_gemma":[0.99781424,0.0004944133,0.0003451873,0.0004236947,0.00079736835,0.00012507614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049449696,0.00027809467,0.00044257197,0.00023440026,0.00014607381,0.00008172665,0.00016450282,0.0001018941,0.000104979605],"category_scores_gemma":[0.0004895567,0.00026473813,0.00007843276,0.0007704969,0.00008624862,0.00025349797,0.000052268366,0.00021240664,0.0000103567145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017136867,0.0070896866,0.00028521437,0.002210428,0.00057614996,0.00017492018,0.003559092,0.61203593,0.0011966679,0.24589854,0.0021752024,0.1246268],"study_design_scores_gemma":[0.0016274671,0.00013879963,0.0000031460502,0.000106436695,0.000051216302,0.00016736887,0.00045031446,0.91950226,0.004767655,0.07256789,0.0003162276,0.00030123309],"about_ca_topic_score_codex":0.0000074572927,"about_ca_topic_score_gemma":0.000043734282,"teacher_disagreement_score":0.30746633,"about_ca_system_score_codex":0.00023846571,"about_ca_system_score_gemma":0.0002482429,"threshold_uncertainty_score":0.9999805},"labels":[],"label_agreement":null},{"id":"W3158889296","doi":"10.1007/s10107-021-01654-x","title":"Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Ordinary differential equation; Bounding overwatch; Mathematics; Relaxation (psychology); Global optimization; Applied mathematics; Parametric statistics; Regular polygon; Convex optimization; Mathematical optimization; Optimization problem; Mathematical analysis; Differential equation; Computer science; Geometry","score_opus":0.08930853927278422,"score_gpt":0.37644312487995507,"score_spread":0.28713458560717087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158889296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035018622,0.00010068577,0.99681693,0.00018828304,0.00016608006,0.0016253091,0.00004327563,0.00017982311,0.00052944286],"genre_scores_gemma":[0.1171672,0.000004798988,0.88063526,0.000013086302,0.0000883669,0.00082010095,0.00016109634,0.000077324694,0.0010327818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973527,0.0001675952,0.0009998799,0.00038995384,0.00064465275,0.00044521384],"domain_scores_gemma":[0.9913355,0.00627869,0.00041028392,0.00055623666,0.0012468665,0.00017238442],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0004448774,0.00023269554,0.0005980969,0.00029174573,0.00023969279,0.0001317025,0.00023671013,0.00017430831,0.00042539823],"category_scores_gemma":[0.012244187,0.00022255452,0.00022318723,0.0012607349,0.00016960758,0.00015758851,0.000086619366,0.00020150782,0.000014884307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005512544,0.0027662944,0.00007465203,0.004078374,0.00026129934,0.00001577924,0.00035832997,0.545535,0.0001514006,0.4414428,0.00046080677,0.004800122],"study_design_scores_gemma":[0.0010786754,0.00010554486,0.0000014940038,0.00019089134,0.000118728865,0.0000076250267,0.00037673817,0.9752062,0.00064908736,0.02171641,0.0003176583,0.0002309412],"about_ca_topic_score_codex":0.0000024019673,"about_ca_topic_score_gemma":9.97251e-7,"teacher_disagreement_score":0.4296712,"about_ca_system_score_codex":0.00010848514,"about_ca_system_score_gemma":0.000268634,"threshold_uncertainty_score":0.9960761},"labels":[],"label_agreement":null},{"id":"W3164623467","doi":"10.37193/cmi.2013.01.03","title":"Applications of the PL homotopy algorithm for the computation of fixed points to unconstrained optimization problems","year":2013,"lang":"en","type":"article","venue":"Creative Mathematics and Informatics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Eaves; Mathematics; Homotopy; Computation; Maxima and minima; Mathematical optimization; Fixed point; Piecewise; Piecewise linear function; Optimization problem; Algorithm; Applied mathematics; Pure mathematics; Mathematical analysis","score_opus":0.02831897765656806,"score_gpt":0.31557086206936924,"score_spread":0.2872518844128012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164623467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000562228,0.000025097384,0.9926936,0.0002866008,0.000023808421,0.004989119,0.00009210921,0.000023485985,0.0013039535],"genre_scores_gemma":[0.0033588412,0.000033196702,0.99535906,0.000045464967,0.000016377644,0.00087710674,0.000014579393,0.00002486141,0.00027052124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998382,0.000030364843,0.0009369192,0.00009533883,0.0003647566,0.00019066446],"domain_scores_gemma":[0.99654144,0.0011533775,0.0007139858,0.00036358586,0.0011572107,0.00007037865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000478081,0.00017289481,0.0003309627,0.0001173084,0.00022822841,0.000059775834,0.00030757993,0.00006857774,0.000049204435],"category_scores_gemma":[0.0006927949,0.000102368154,0.000083730796,0.0005301486,0.0002868899,0.00023180182,0.00014950188,0.0001042425,0.0000034712994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021571996,0.0010930407,0.0000782152,0.005987229,0.0006419848,6.651545e-8,0.068609916,0.311279,0.0002696962,0.1997042,0.0028560588,0.40945902],"study_design_scores_gemma":[0.000490849,0.00008457451,0.000020563799,0.00015646352,0.00005193129,0.0000029561304,0.0058651185,0.9370108,0.0010015308,0.05504873,0.00015446848,0.000111998255],"about_ca_topic_score_codex":0.0000074401264,"about_ca_topic_score_gemma":0.0000013456529,"teacher_disagreement_score":0.6257318,"about_ca_system_score_codex":0.00003554494,"about_ca_system_score_gemma":0.00006617589,"threshold_uncertainty_score":0.4174452},"labels":[],"label_agreement":null},{"id":"W3176077280","doi":"10.1016/j.compchemeng.2021.107413","title":"Bounding convex relaxations of process models from below by tractable black-box sampling","year":2021,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Mathematical optimization; Black box; Sampling (signal processing); Convex optimization; Process (computing); Regular polygon; Affine transformation; Minimum bounding box; Computation; Global optimization; Computer science; Mathematics; Algorithm","score_opus":0.039916374938676315,"score_gpt":0.31136884998250475,"score_spread":0.2714524750438284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176077280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05526176,0.00020943524,0.94393504,0.00007326081,0.000094454204,0.00011386226,0.00003043615,0.00015019542,0.00013155806],"genre_scores_gemma":[0.30922684,0.000023526689,0.6904436,0.000017728566,0.00007221223,0.000014019946,0.00009497957,0.00005385855,0.000053284803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868727,0.000011736858,0.00038111737,0.000303004,0.00031826014,0.00029863045],"domain_scores_gemma":[0.9985607,0.00072818255,0.00009220522,0.00026450964,0.00022398257,0.00013038948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008257608,0.00016460044,0.0003219853,0.00006210536,0.000044077256,0.000047342986,0.0002195162,0.00010692156,0.000046415702],"category_scores_gemma":[0.00051345135,0.0001939608,0.000068992515,0.00037743914,0.00004243771,0.00026435746,0.00010886204,0.0003044387,0.0000025041468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004885656,0.000105270454,0.000008699215,0.00029368146,0.00007210905,0.000005521959,0.0008005617,0.88845134,0.1073927,0.0019332628,0.00032742633,0.00060455],"study_design_scores_gemma":[0.00031043153,0.0000037820716,6.885589e-7,0.00014344629,0.0000132206915,0.000003346499,0.000061691666,0.8271306,0.16457577,0.00748055,0.000116025105,0.00016043673],"about_ca_topic_score_codex":0.0000029456728,"about_ca_topic_score_gemma":1.0235907e-7,"teacher_disagreement_score":0.25396508,"about_ca_system_score_codex":0.00010882885,"about_ca_system_score_gemma":0.00005694109,"threshold_uncertainty_score":0.7909492},"labels":[],"label_agreement":null},{"id":"W3182862038","doi":"10.1145/3470005","title":"SGN: Sparse Gauss-Newton for Accelerated Sensitivity Analysis","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Hessian matrix; Solver; Newton's method; Nonlinear programming; Sensitivity (control systems); Applied mathematics; Lagrange multiplier; Mathematical optimization; Mathematics; Computer science; Gauss; Inverse; Convergence (economics); Algorithm; Nonlinear system","score_opus":0.13917301097015108,"score_gpt":0.39749980048691497,"score_spread":0.2583267895167639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182862038","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006903072,0.000022192216,0.9899961,0.0021182734,0.000108507,0.00037151412,0.00017237435,0.000185271,0.00012269529],"genre_scores_gemma":[0.41285583,0.000606716,0.58039635,0.0006388001,0.000095487216,0.00024353032,0.0002135281,0.00012982667,0.004819902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816346,0.0001944898,0.00034770646,0.00048445188,0.00043535614,0.0003745098],"domain_scores_gemma":[0.9960202,0.0017405817,0.000094572526,0.0010387072,0.0009526936,0.00015326618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041719517,0.00021674574,0.00038555043,0.0005731436,0.00040817363,0.0000875917,0.0001764229,0.00018170231,0.0003476703],"category_scores_gemma":[0.00082875945,0.00022904875,0.00042595147,0.0036356458,0.000089403926,0.00021833263,0.000010321589,0.00039860423,0.000012812025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011336845,0.009274398,0.0011519571,0.00086080946,0.015959362,0.00056216633,0.0020158389,0.8200315,0.009847427,0.052264042,0.007876394,0.07902241],"study_design_scores_gemma":[0.004284824,0.00034617595,0.0012768619,0.000088320194,0.00377658,0.00007766971,0.0009816014,0.7174951,0.10244137,0.15663616,0.011020103,0.0015752221],"about_ca_topic_score_codex":0.000013006851,"about_ca_topic_score_gemma":0.00060507975,"teacher_disagreement_score":0.40959972,"about_ca_system_score_codex":0.00006876679,"about_ca_system_score_gemma":0.00012282045,"threshold_uncertainty_score":0.93403363},"labels":[],"label_agreement":null},{"id":"W3194428037","doi":"10.5206/mt.v1i2.14358","title":"Jonathan Michael Borwein 1951 − 2016: Life and Legacy","year":2021,"lang":"en","type":"preprint","venue":"Maple Transactions","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics; Algebra over a field; Mathematics education; Pure mathematics","score_opus":0.056679744792131316,"score_gpt":0.34484177285329287,"score_spread":0.28816202806116153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194428037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003294366,0.0011732056,0.9901664,0.002281477,0.000505543,0.0006871309,0.00021860994,0.0002691062,0.0014041553],"genre_scores_gemma":[0.105681114,0.0047551547,0.8519733,0.00035093422,0.00043770895,0.0007394839,0.0003574453,0.0003393081,0.035365537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773514,0.00015143697,0.0005016817,0.00068832794,0.0004979431,0.00042547015],"domain_scores_gemma":[0.9980452,0.00035423826,0.00014556,0.0008086216,0.0003167132,0.00032968557],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002581603,0.00036803735,0.00052408676,0.0002793411,0.0002864442,0.0003163665,0.00030451463,0.0003856954,0.0020087091],"category_scores_gemma":[0.00024596974,0.00040593088,0.00020533524,0.0002807296,0.00014700071,0.0002955899,0.00012339067,0.001301613,0.000031845375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007952369,0.012247497,0.0003278239,0.024287082,0.010106532,0.0013055829,0.061046936,0.36780775,0.006297718,0.03305278,0.0625709,0.42015418],"study_design_scores_gemma":[0.012346165,0.0004778984,0.0011754754,0.0033456746,0.0021872423,0.0005171167,0.0257243,0.548975,0.012241703,0.22317554,0.16015637,0.00967749],"about_ca_topic_score_codex":0.00014451524,"about_ca_topic_score_gemma":0.00026002713,"teacher_disagreement_score":0.41047668,"about_ca_system_score_codex":0.00011834517,"about_ca_system_score_gemma":0.000527575,"threshold_uncertainty_score":0.99983925},"labels":[],"label_agreement":null},{"id":"W3198929120","doi":"","title":"A continuous Newton-type method for unconstrained optimization","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Type (biology); Computer science; Newton's method; Mathematical optimization; Mathematics; Applied mathematics; Nonlinear system; Physics","score_opus":0.10408899384115365,"score_gpt":0.417389719919634,"score_spread":0.3133007260784803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198929120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077035154,0.000015091516,0.9896081,0.0005310411,0.00009581216,0.0007893411,0.000008577673,0.00024423967,0.008630759],"genre_scores_gemma":[0.00032722912,0.00002641473,0.96782106,0.00014222217,0.00007004077,0.000055219723,0.000029417632,0.000043592292,0.03148477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886274,0.00006546428,0.00029709056,0.00024885812,0.00023749254,0.00028833016],"domain_scores_gemma":[0.99806696,0.0008771556,0.00009012081,0.00025321427,0.00060823717,0.00010428869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031120123,0.00013572912,0.00024577478,0.00011323223,0.0001781458,0.00001915168,0.00014364059,0.00008900164,0.00080734753],"category_scores_gemma":[0.0018676462,0.00012157053,0.00006790923,0.00036596408,0.00006936151,0.00015025317,0.000037577272,0.00009056999,0.000015577385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038983388,0.0005748034,0.00014409256,0.00017093601,0.00021058845,0.000040390976,0.001255068,0.6901293,0.0009106236,0.20130762,0.084812716,0.020054031],"study_design_scores_gemma":[0.0014603132,0.00013772833,0.0000023152659,0.000008089774,0.000015011366,0.000071696624,0.00015779259,0.97468114,0.001948757,0.01642968,0.004876943,0.00021054586],"about_ca_topic_score_codex":0.000006425001,"about_ca_topic_score_gemma":0.0000034711177,"teacher_disagreement_score":0.28455183,"about_ca_system_score_codex":0.000051821906,"about_ca_system_score_gemma":0.00013703256,"threshold_uncertainty_score":0.8839889},"labels":[],"label_agreement":null},{"id":"W3200713868","doi":"10.48550/arxiv.2109.05685","title":"Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Monotone polygon; Mathematics; Line search; Conjugate gradient method; Matrix (chemical analysis); Non-negative matrix factorization; Gradient method; Convergence (economics); Nonlinear conjugate gradient method; Applied mathematics; Mathematical optimization; Algorithm; Gradient descent; Matrix decomposition; Computer science","score_opus":0.07802442260630979,"score_gpt":0.3038032719078441,"score_spread":0.22577884930153433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200713868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11551393,0.000022658092,0.8811575,0.00007541175,0.000027835193,0.0027393498,0.00006961306,0.000110686844,0.00028299904],"genre_scores_gemma":[0.8500084,0.0006344893,0.14806855,0.00001921704,0.00003950863,0.00005735917,0.00012318774,0.00007938571,0.0009699028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747366,0.00030397403,0.00030725694,0.0012718376,0.00024973415,0.00039354924],"domain_scores_gemma":[0.9973708,0.0005881471,0.00031980872,0.0006620795,0.00078918535,0.00027002848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005501857,0.0004482938,0.00058266724,0.0004721864,0.00022860394,0.0001022723,0.00030402644,0.00039257933,0.000026363143],"category_scores_gemma":[0.00021416436,0.0004632328,0.00006561431,0.0008373802,0.00014851107,0.00026468883,0.0008019851,0.0009183835,0.0000059973167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018595335,0.0012213322,0.0011613726,0.003411935,0.00093011255,0.0005946686,0.0044521457,0.85761726,0.019463265,0.10693863,0.000035716304,0.0023140358],"study_design_scores_gemma":[0.0016129545,0.00036044745,0.00019996394,0.0004142617,0.00014207744,0.000013283672,0.0006249912,0.9359756,0.039489772,0.020537257,0.000016275355,0.0006130905],"about_ca_topic_score_codex":0.000073413205,"about_ca_topic_score_gemma":0.000038648664,"teacher_disagreement_score":0.73449445,"about_ca_system_score_codex":0.00035078265,"about_ca_system_score_gemma":0.00023653585,"threshold_uncertainty_score":0.99978197},"labels":[],"label_agreement":null},{"id":"W3203691100","doi":"10.1137/21m1455127","title":"Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Imperial College London; Pacific Institute for the Mathematical Sciences","keywords":"Pointwise; Mathematics; Infimum and supremum; Nabla symbol; Combinatorics; Upper and lower bounds; Convex function; Relaxation (psychology); Omega; Regular polygon; Applied mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.04715189319642251,"score_gpt":0.3360420978468465,"score_spread":0.28889020465042403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203691100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041304445,0.00005383595,0.9931789,0.0008615846,0.00021753825,0.00061719347,0.000051014074,0.00012726718,0.000762189],"genre_scores_gemma":[0.106018245,0.001378937,0.890836,0.00004866634,0.00020186872,0.000057982765,0.0004347692,0.00012318585,0.00090033555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969477,0.00032824697,0.0011748482,0.0003001366,0.00094893714,0.00030014277],"domain_scores_gemma":[0.9958292,0.0009148798,0.0013420101,0.00026465274,0.0014968009,0.00015242741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012632777,0.00024080081,0.0004039756,0.0010720483,0.00027873286,0.00007909064,0.0001698164,0.00020002092,0.00040281643],"category_scores_gemma":[0.0039285477,0.00022682654,0.00010647968,0.0015055869,0.0001651415,0.0007735386,0.000075131364,0.00041191556,0.000008222443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100322504,0.00015952524,0.0003335192,0.000109272056,0.00006569241,0.0000037540608,0.00085513067,0.96939033,0.0000912892,0.027591297,0.00041786866,0.00088200194],"study_design_scores_gemma":[0.0014227107,0.00035942186,0.00050013897,0.00028682014,0.000044764656,0.00004880203,0.00042973642,0.9793111,0.0002969903,0.017041655,0.00005016857,0.00020766148],"about_ca_topic_score_codex":0.0000049963755,"about_ca_topic_score_gemma":0.0000027994813,"teacher_disagreement_score":0.102342926,"about_ca_system_score_codex":0.0001513391,"about_ca_system_score_gemma":0.00020145436,"threshold_uncertainty_score":0.92497176},"labels":[],"label_agreement":null},{"id":"W3205040079","doi":"10.1007/978-1-0716-0843-2_9","title":"Applications of Unconstrained Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Engineering optimization; Computer science; Optimization algorithm; Mathematical optimization; Optimization problem; Algorithm; Mathematics","score_opus":0.04214007796729567,"score_gpt":0.34390600604544125,"score_spread":0.30176592807814556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205040079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011477273,0.000076236814,0.9234687,0.00005546311,0.00009528449,0.00046503235,0.000013505077,0.000046243542,0.075778365],"genre_scores_gemma":[0.00016323804,0.00006814809,0.9567724,0.000030326095,0.00008210529,0.000024050747,0.000015862457,0.000030140167,0.04281373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979437,0.000016911936,0.00050913566,0.00053958263,0.0007540323,0.00023662993],"domain_scores_gemma":[0.99794185,0.0002987206,0.00028074268,0.00071102363,0.0006815563,0.000086130254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235124,0.00018624862,0.00033724977,0.00057408947,0.0000866505,0.0000534474,0.00071861147,0.00012738538,0.00044061954],"category_scores_gemma":[0.00011069573,0.00019746802,0.000056599667,0.00054945407,0.00079019,0.00017850335,0.0004212005,0.00027134104,0.0000108684335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023471591,0.00007331871,0.0000027959325,0.00012625239,0.000010588235,0.0000120251525,0.00016796541,0.22844553,0.000010137199,0.58783627,0.00012458731,0.18318819],"study_design_scores_gemma":[0.000355708,0.000041944935,0.0000021264996,0.00038485802,0.00001073734,0.000022025324,0.00000658649,0.784698,0.00018893204,0.21081875,0.003097862,0.0003724486],"about_ca_topic_score_codex":0.0000011444821,"about_ca_topic_score_gemma":0.0000045995366,"teacher_disagreement_score":0.5562525,"about_ca_system_score_codex":0.0001681919,"about_ca_system_score_gemma":0.00063387863,"threshold_uncertainty_score":0.80525124},"labels":[],"label_agreement":null},{"id":"W3205360536","doi":"10.1007/978-1-0716-0843-2_12","title":"Linear Programming Part II: Interior-Point Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Interior point method; Polyhedron; Iterated function; Linear programming; Simplex algorithm; Simplex; Vertex (graph theory); Mathematics; Mathematical optimization; Boundary (topology); Algorithm; Computer science; Combinatorics; Mathematical analysis","score_opus":0.10719977043631085,"score_gpt":0.4330292003760061,"score_spread":0.32582942993969527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205360536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001214847,0.00020202504,0.9746424,0.00017022996,0.00085282564,0.0005371056,0.000004187345,0.00015887481,0.023420187],"genre_scores_gemma":[0.000008452094,0.00007067195,0.8979383,0.00011083841,0.00024632434,0.000024280233,0.0000055504397,0.000060980907,0.10153456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965426,0.00008330483,0.000717982,0.0010699516,0.00096125854,0.0006249389],"domain_scores_gemma":[0.99741197,0.0004821539,0.00028038514,0.0010779853,0.0005421164,0.0002053666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024594949,0.00037754048,0.00059130124,0.0005850671,0.00027538554,0.00021131546,0.0012640513,0.00019934007,0.00065888197],"category_scores_gemma":[0.000527355,0.00036707942,0.00012389684,0.00048467412,0.0008245824,0.00034771758,0.0026008752,0.00084104843,0.00004263555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004309441,0.000055748693,0.0000011063366,0.000112137306,0.000016092876,0.0001222348,0.000637414,0.0010751056,0.000017481614,0.09138044,0.0004637608,0.90611416],"study_design_scores_gemma":[0.00054357847,0.0003002827,0.0000023584387,0.0020890203,0.00002063506,0.00014068637,0.000019487912,0.545386,0.0008787107,0.19511628,0.25432247,0.001180466],"about_ca_topic_score_codex":0.0000016989867,"about_ca_topic_score_gemma":0.000006984723,"teacher_disagreement_score":0.9049337,"about_ca_system_score_codex":0.00035998088,"about_ca_system_score_gemma":0.00052074675,"threshold_uncertainty_score":0.9998781},"labels":[],"label_agreement":null},{"id":"W3205964799","doi":"10.1007/978-1-0716-0843-2_11","title":"Linear Programming Part I: The Simplex Method","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Maxima and minima; Simplex algorithm; Linear programming; Mathematical optimization; Simplex; Range (aeronautics); Linear-fractional programming; Computation; Computer science; Revised simplex method; Function (biology); Mathematics; Algorithm; Combinatorics; Engineering","score_opus":0.11797812307378809,"score_gpt":0.4203340627107622,"score_spread":0.3023559396369741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205964799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022479026,0.00015048658,0.978889,0.0004190215,0.00039305538,0.0005899368,0.0000051175225,0.00010134917,0.019449772],"genre_scores_gemma":[0.000009519778,0.000052480722,0.91405725,0.00019697042,0.00038714553,0.000023008044,0.000004865779,0.00004715543,0.08522158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968525,0.00007771779,0.0004971871,0.00080564234,0.0012186228,0.0005483351],"domain_scores_gemma":[0.9970404,0.0010606208,0.00021973863,0.0011071593,0.00044740288,0.0001247111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244748,0.00028692678,0.00038385316,0.00028233675,0.0002981736,0.00023945479,0.0014415459,0.00014015786,0.00032116188],"category_scores_gemma":[0.0003836767,0.0002149419,0.000095175135,0.0004967945,0.0006863655,0.0002068053,0.0012641781,0.0007580728,0.00005047193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019934748,0.00003345289,9.753168e-7,0.000051907737,0.000011457973,0.00007058356,0.0003706091,0.005752022,0.0000017036108,0.19878274,0.0007130735,0.7942095],"study_design_scores_gemma":[0.00021553412,0.00005058052,0.0000024636686,0.0003402594,0.000011129537,0.000057386664,0.000010864555,0.49802753,0.00008139955,0.16758546,0.33318377,0.00043361375],"about_ca_topic_score_codex":0.0000024458438,"about_ca_topic_score_gemma":0.00001484536,"teacher_disagreement_score":0.79377586,"about_ca_system_score_codex":0.00018901535,"about_ca_system_score_gemma":0.00050779275,"threshold_uncertainty_score":0.87650764},"labels":[],"label_agreement":null},{"id":"W3206089052","doi":"10.1007/978-1-0716-0843-2_5","title":"Basic Multidimensional Gradient Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Applied mathematics; Mathematics; Algorithm; Mathematical optimization; Calculus (dental); Medicine","score_opus":0.09415315138970701,"score_gpt":0.4167420760176179,"score_spread":0.3225889246279109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206089052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024619687,0.0002539496,0.9690791,0.00012827713,0.00082845613,0.00035026463,0.0000067793458,0.00008392201,0.029244684],"genre_scores_gemma":[0.000018716486,0.000060041937,0.9100183,0.00013806079,0.00013954628,0.0000096520325,0.000005559151,0.000045054196,0.08956504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669945,0.000082205515,0.00051345245,0.0010064605,0.0011956146,0.00050280424],"domain_scores_gemma":[0.99723315,0.0009600405,0.00019231136,0.0009141053,0.0005000623,0.00020032449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018303755,0.00032020087,0.0004718914,0.00064554263,0.00018088841,0.0000901994,0.0008258149,0.00015817404,0.0005794693],"category_scores_gemma":[0.00034264033,0.00030756873,0.000102189195,0.000395773,0.00071394094,0.00021866619,0.0012595657,0.0006389391,0.000071151524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004234814,0.00008598255,0.0000023389005,0.000064007625,0.000014586938,0.00018185022,0.00030187776,0.0057002115,0.000056352448,0.6134167,0.00069819053,0.3794737],"study_design_scores_gemma":[0.00051238615,0.00007637148,0.00002949737,0.00060142047,0.000011204519,0.00010103059,0.0000041273765,0.59284693,0.00057840283,0.37734753,0.02716847,0.0007226238],"about_ca_topic_score_codex":0.0000018700573,"about_ca_topic_score_gemma":0.0000064657493,"teacher_disagreement_score":0.5871467,"about_ca_system_score_codex":0.00040230717,"about_ca_system_score_gemma":0.00056600303,"threshold_uncertainty_score":0.99993765},"labels":[],"label_agreement":null},{"id":"W3206312835","doi":"10.1007/978-1-0716-0843-2_7","title":"Quasi-Newton Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Class (philosophy); Mathematics; Metric (unit); Set (abstract data type); Variable (mathematics); Feature (linguistics); Applied mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis; Engineering; Philosophy","score_opus":0.10906084739514141,"score_gpt":0.44574119804433787,"score_spread":0.33668035064919644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206312835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030563506,0.00023826463,0.91277397,0.00019662011,0.00059554906,0.00028585456,0.0000039252764,0.00009746321,0.085805304],"genre_scores_gemma":[0.000006446893,0.000087575856,0.78886104,0.00011069567,0.00016303243,0.000007207046,0.000003126632,0.000044164673,0.21071671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968715,0.000083181534,0.00051826827,0.0009539148,0.0010734422,0.0004997429],"domain_scores_gemma":[0.9972213,0.0008626691,0.0002074344,0.0010906036,0.00044536774,0.000172617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020193395,0.0003132242,0.0005096851,0.0006509166,0.00015326033,0.00018405296,0.0012606527,0.00019837558,0.0006492957],"category_scores_gemma":[0.00041317954,0.00031086718,0.00009272359,0.0004708876,0.0006756865,0.00028445205,0.0011877876,0.000684117,0.00008064344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025911274,0.00008668819,0.0000012255973,0.00007712369,0.00000973728,0.00010946646,0.00027686212,0.001479778,0.000018648605,0.5209604,0.00094769587,0.47602978],"study_design_scores_gemma":[0.00030226706,0.00011255341,0.000005541995,0.00048515166,0.000008599666,0.00005751166,0.0000043353884,0.31540433,0.0003811945,0.64132047,0.041304052,0.00061401253],"about_ca_topic_score_codex":0.0000024102385,"about_ca_topic_score_gemma":0.000008498805,"teacher_disagreement_score":0.47541577,"about_ca_system_score_codex":0.0003606504,"about_ca_system_score_gemma":0.000609724,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W3206492465","doi":"10.1007/978-1-0716-0843-2_13","title":"Quadratic, Semidefinite, and Second-Order Cone Programming","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Second-order cone programming; Quadratically constrained quadratic program; Quadratic programming; Semidefinite programming; Nonlinear programming; Mathematics; Mathematical optimization; Quadratic function; Sequential quadratic programming; Conic optimization; Linear programming; Convex optimization; Convex cone; Regular polygon; Quadratic equation; Nonlinear system; Convex analysis; Geometry","score_opus":0.05563290061245824,"score_gpt":0.34093269676441973,"score_spread":0.2852997961519615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206492465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001999511,0.00091387786,0.9205153,0.00020525583,0.00044850848,0.00091992086,0.000014341113,0.00017292351,0.07660991],"genre_scores_gemma":[0.0001860013,0.00010462696,0.89042413,0.00015655611,0.00010926853,0.000017461225,0.000007150681,0.000051640724,0.10894319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731874,0.000029696757,0.0004982005,0.0008569034,0.0008204084,0.00047606826],"domain_scores_gemma":[0.9978675,0.0006031615,0.00020039547,0.0006441269,0.0005113903,0.00017339597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084263016,0.00031026034,0.0004716945,0.00047029703,0.00018319568,0.00032349513,0.00055395975,0.0001717016,0.00054667785],"category_scores_gemma":[0.0002857608,0.0003113642,0.000039911218,0.0004161175,0.00089558074,0.0003326769,0.0008852475,0.0005849441,0.000028824543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062440204,0.00009908819,0.000029902378,0.00045101726,0.000029446273,0.0002995667,0.0011911376,0.0008911849,0.000024404775,0.4739941,0.00064385193,0.52234006],"study_design_scores_gemma":[0.0019250022,0.00033421296,0.000084212355,0.002505525,0.00003654487,0.00043830095,0.000059078142,0.36224967,0.00026422087,0.54584634,0.083864495,0.0023923966],"about_ca_topic_score_codex":0.0000019037008,"about_ca_topic_score_gemma":0.000045196986,"teacher_disagreement_score":0.51994765,"about_ca_system_score_codex":0.0001436835,"about_ca_system_score_gemma":0.00047767936,"threshold_uncertainty_score":0.99993384},"labels":[],"label_agreement":null},{"id":"W3207047257","doi":"10.1007/978-1-0716-0843-2_4","title":"One-Dimensional Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Nonlinear system; Computer science; Mathematics; Physics","score_opus":0.06969306767776083,"score_gpt":0.3443678112768024,"score_spread":0.27467474359904154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207047257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008512514,0.000120536686,0.9471438,0.00016888579,0.00042558313,0.0003204629,0.000006950139,0.00009619769,0.0517091],"genre_scores_gemma":[0.000051379546,0.000054929515,0.9118656,0.00015938934,0.00018043957,0.0000069789116,0.000016953103,0.000048901944,0.08761545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686587,0.000028395789,0.00046510276,0.0008264393,0.0014197563,0.0003944355],"domain_scores_gemma":[0.9979607,0.0003528205,0.00019394608,0.00072448916,0.0006245041,0.0001435389],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071038265,0.00025068643,0.00037873158,0.0005924852,0.00016745126,0.00014924815,0.00074849284,0.00017580568,0.0010323956],"category_scores_gemma":[0.00019741087,0.00028139516,0.00006436549,0.00038317608,0.0005172819,0.00033530095,0.0008747205,0.00048311744,0.0000686579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046406863,0.000081946586,0.0000012605649,0.00005277242,0.000011075352,0.00006755316,0.0001254299,0.710258,0.000007001652,0.22592479,0.00051132875,0.06295421],"study_design_scores_gemma":[0.00025788217,0.000035084264,0.0000044804897,0.00040651555,0.0000056552717,0.000020475383,9.279471e-7,0.90064085,0.000055406123,0.097123735,0.0010986723,0.00035031987],"about_ca_topic_score_codex":0.0000014236202,"about_ca_topic_score_gemma":0.0000060252414,"teacher_disagreement_score":0.19038285,"about_ca_system_score_codex":0.00034855277,"about_ca_system_score_gemma":0.00064967317,"threshold_uncertainty_score":0.9999638},"labels":[],"label_agreement":null},{"id":"W3207486910","doi":"10.1007/978-1-0716-0843-2_3","title":"General Properties of Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algorithm; Computer science; Series (stratigraphy); Sequence (biology); Order (exchange); Mathematics","score_opus":0.09294831713288876,"score_gpt":0.3414244355665527,"score_spread":0.24847611843366396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207486910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040825983,0.00096726604,0.9418717,0.00014408909,0.00079972134,0.00068587036,0.000014686907,0.00010705243,0.055001337],"genre_scores_gemma":[0.0003871617,0.0001233017,0.8384178,0.000051798852,0.0002046467,0.000008724756,0.0000025628594,0.000044412718,0.16075958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973646,0.00002348168,0.0005198973,0.00061809184,0.0011191213,0.00035484077],"domain_scores_gemma":[0.99828213,0.00009101485,0.00021325848,0.0007260197,0.00059154286,0.00009600376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061150856,0.00024179391,0.0004560584,0.00048536604,0.00008315185,0.00007492777,0.0009432508,0.00013037476,0.00017893066],"category_scores_gemma":[0.00012411315,0.00021600959,0.00007398114,0.00030138044,0.00092852046,0.00023070863,0.0008810501,0.00037105233,0.000018027456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013134568,0.00020377476,0.000008722278,0.0005902707,0.000042742613,0.00019164043,0.0013360591,0.015006244,0.00071317086,0.52792656,0.0007696359,0.45319802],"study_design_scores_gemma":[0.00063805806,0.00014587607,0.000016382748,0.0018463671,0.000014282943,0.00007523292,0.000009015145,0.7975421,0.0079070935,0.18595648,0.004953312,0.00089578325],"about_ca_topic_score_codex":0.000004277267,"about_ca_topic_score_gemma":0.0000060376874,"teacher_disagreement_score":0.78253585,"about_ca_system_score_codex":0.00017973964,"about_ca_system_score_gemma":0.00059417303,"threshold_uncertainty_score":0.8808615},"labels":[],"label_agreement":null},{"id":"W3207662870","doi":"10.1007/978-1-0716-0843-2_6","title":"Conjugate-Direction Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relation (database); Mathematics; Function (biology); Conjugate gradient method; Conjugate; Computer science; Algorithm; Mathematical optimization; Applied mathematics; Mathematical analysis; Data mining; Biology","score_opus":0.09342894155116546,"score_gpt":0.43001737706944143,"score_spread":0.336588435518276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207662870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004301109,0.00019220637,0.8768781,0.000090657966,0.0008400066,0.00027483256,0.0000030635813,0.00012593085,0.121590935],"genre_scores_gemma":[0.000016754386,0.00010611813,0.8360669,0.000090604284,0.00016917389,0.000008622747,0.0000032563917,0.00004036176,0.16349822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741036,0.00008028233,0.0004530884,0.0008332654,0.00082666194,0.00039631565],"domain_scores_gemma":[0.9977681,0.00065500493,0.00019338497,0.0007710564,0.00047830047,0.00013417022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001824507,0.00026539288,0.00042546913,0.00059511425,0.00016401404,0.00017142869,0.0007502256,0.00018039365,0.0005492778],"category_scores_gemma":[0.00035207343,0.00026921576,0.000075380914,0.00043095968,0.00058413774,0.00028603242,0.00072992506,0.0005850454,0.000066229404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038107653,0.000041456373,0.0000016260864,0.000071612805,0.00001242711,0.000079500474,0.00022702197,0.0029755046,0.00006409666,0.31130075,0.00070022466,0.684522],"study_design_scores_gemma":[0.00038010103,0.00007642479,0.0000139390795,0.00051304733,0.000011637798,0.00008608271,0.000004265723,0.40349087,0.0011318435,0.5507703,0.042841952,0.0006795472],"about_ca_topic_score_codex":0.0000028064035,"about_ca_topic_score_gemma":0.000010176229,"teacher_disagreement_score":0.6838424,"about_ca_system_score_codex":0.00037859718,"about_ca_system_score_gemma":0.00044729773,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W3209317464","doi":"10.1007/978-3-031-06901-7_7","title":"Improving the Cook et al. Proximity Bound Given Integral Valued Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Physics; Combinatorics; Upper and lower bounds; Mathematics; Mathematical analysis","score_opus":0.04196334111085764,"score_gpt":0.3287179370376539,"score_spread":0.28675459592679625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209317464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018369818,0.00009138821,0.99127173,0.002735255,0.0006103455,0.0010569787,0.000029464241,0.00010805819,0.0040783905],"genre_scores_gemma":[0.004580603,0.0000448783,0.9869062,0.006349279,0.00017853182,0.00006716649,0.000021066853,0.00010786569,0.0017444394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963602,0.00013575122,0.0004752536,0.00097337103,0.0014684127,0.0005870574],"domain_scores_gemma":[0.9966435,0.0016135634,0.00033834894,0.0009611254,0.00032772066,0.000115761126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021408957,0.00041076698,0.00042903653,0.00037700118,0.0005556454,0.00034646172,0.0017710163,0.00014545632,0.00062508805],"category_scores_gemma":[0.001245822,0.00030584304,0.000120204844,0.00041511963,0.0022933371,0.00037487614,0.0015058995,0.0020914592,0.000012650673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041400057,0.00012336271,0.000016664353,0.00014083493,0.000060609837,0.0001703402,0.002894431,0.06755721,0.00015299972,0.1651875,0.0008349443,0.7628197],"study_design_scores_gemma":[0.00040837826,0.00014460349,0.000004715493,0.00015632261,0.00001326074,0.00010676844,0.0000033565232,0.5938992,0.00026886657,0.3980121,0.0064523295,0.0005300974],"about_ca_topic_score_codex":0.000020782642,"about_ca_topic_score_gemma":0.00004954853,"teacher_disagreement_score":0.7622896,"about_ca_system_score_codex":0.00059162674,"about_ca_system_score_gemma":0.0010010457,"threshold_uncertainty_score":0.9999394},"labels":[],"label_agreement":null},{"id":"W3213237799","doi":"10.1287/moor.2021.1207","title":"Penalty and Augmented Lagrangian Methods for Constrained DC Programming","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Penalty method; Sequence (biology); Stationary point; Mathematical optimization; Infimum and supremum; Pointwise; Regular polygon; Function (biology); Convergence (economics); Constraint (computer-aided design); Limit point; Point (geometry); Applied mathematics; Combinatorics; Mathematical analysis","score_opus":0.22256743211485086,"score_gpt":0.5456395272196878,"score_spread":0.3230720951048369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213237799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008896418,0.00016125993,0.9844409,0.001014822,0.000042031952,0.0036417188,0.00012240894,0.00007668068,0.001603757],"genre_scores_gemma":[0.01658659,0.000020448759,0.9783471,0.0000100967445,0.000022044735,0.0017280255,0.00004471822,0.00005201775,0.0031889114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718195,0.0006033624,0.0005965765,0.00031246734,0.0008275356,0.00047808318],"domain_scores_gemma":[0.9954126,0.002870178,0.000069884365,0.0004599179,0.0010527008,0.00013471728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065320986,0.0001428808,0.00034221305,0.000526974,0.0011774012,0.000115157505,0.00038978254,0.0000504471,0.00043096862],"category_scores_gemma":[0.004583223,0.00013789964,0.00007701387,0.00090589887,0.00036077914,0.00014891617,0.00037180577,0.0004328163,0.0000023471555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009183672,0.0022823012,0.000018025881,0.0019112208,0.0002781403,0.000006780515,0.011765817,0.009609821,0.028288646,0.8809033,0.0017752135,0.06306888],"study_design_scores_gemma":[0.0018572677,0.00078342773,0.0000030675403,0.00006275171,0.000038891547,0.00005454551,0.016279679,0.8546277,0.010833934,0.108819835,0.0063304887,0.00030837103],"about_ca_topic_score_codex":0.000015218537,"about_ca_topic_score_gemma":0.000018003871,"teacher_disagreement_score":0.8450179,"about_ca_system_score_codex":0.0001253149,"about_ca_system_score_gemma":0.00024413022,"threshold_uncertainty_score":0.9055737},"labels":[],"label_agreement":null},{"id":"W3215819884","doi":"10.1007/s12532-024-00254-y","title":"Nonlinear conjugate gradient for smooth convex functions","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Nonlinear conjugate gradient method; Mathematics; Conjugate; Regular polygon; Mathematical analysis; Computer science; Physics; Geometry; Gradient descent; Artificial intelligence","score_opus":0.07001615077258662,"score_gpt":0.3931760246580674,"score_spread":0.3231598738854808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215819884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014352469,0.000091506714,0.99426836,0.0006990337,0.0002962852,0.0016190101,0.000023256976,0.00089837296,0.00066890934],"genre_scores_gemma":[0.027099734,0.0000038267262,0.9702567,0.000037265978,0.0002095581,0.0004967949,0.00012674656,0.000097825665,0.0016715509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998161,0.00005755125,0.0005400235,0.00040708936,0.00041490863,0.0004194345],"domain_scores_gemma":[0.9975067,0.0017783256,0.000078493424,0.00019740229,0.00028944502,0.0001496778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064179854,0.00021191307,0.0002974388,0.00020089974,0.00021339183,0.0003183533,0.00013018039,0.00009682833,0.00010077874],"category_scores_gemma":[0.0009061849,0.0001864851,0.00015933473,0.00046852496,0.00012934196,0.00020315219,0.000055117423,0.00022029156,0.00022488854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000616136,0.000989363,0.000005732868,0.004311553,0.00024917527,0.000029592988,0.0019237036,0.0048064166,0.00011292618,0.492443,0.005742484,0.48932442],"study_design_scores_gemma":[0.0002898162,0.00013594583,7.538422e-7,0.00013164383,0.00004708031,0.000013843993,0.00014637184,0.66591674,0.00008046546,0.31882602,0.014254313,0.00015698775],"about_ca_topic_score_codex":9.702965e-7,"about_ca_topic_score_gemma":0.000001091581,"teacher_disagreement_score":0.66111034,"about_ca_system_score_codex":0.00012282292,"about_ca_system_score_gemma":0.000070658505,"threshold_uncertainty_score":0.7604642},"labels":[],"label_agreement":null},{"id":"W353671651","doi":"10.1023/a:1017595513275","title":"On the Convergence of Cone Splitting Algorithms with ω-Subdivisions","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Hyperplane; Polytope; Mathematics; Cone (formal languages); Subdivision; Theory of computation; Convergence (economics); Algorithm; Minification; Function (biology); Dual cone and polar cone; Path (computing); Combinatorics; Discrete mathematics; Mathematical optimization; Geometry; Computer science; Regular polygon","score_opus":0.031888483803697354,"score_gpt":0.33531596593877283,"score_spread":0.3034274821350755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W353671651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039176866,0.000078024634,0.99383456,0.00058162725,0.000017448625,0.00033576268,0.000006452753,0.0000126482355,0.0012157793],"genre_scores_gemma":[0.40517917,0.0014773061,0.5915041,0.00025619546,0.00017159038,0.00009815915,0.0000077653185,0.000056609108,0.0012491195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882996,0.00017464673,0.00045465742,0.00011311043,0.0003086252,0.00011897375],"domain_scores_gemma":[0.9960954,0.0023798998,0.00058316503,0.0002356549,0.000626076,0.00007977926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011874919,0.0001015279,0.00018864189,0.00012250664,0.00023592982,0.000026061423,0.00020602456,0.000041113813,0.0003432678],"category_scores_gemma":[0.00067722244,0.00006238621,0.000042741576,0.000507397,0.000222238,0.00016070262,0.000031569183,0.00019940044,0.000002112985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014655503,0.00019283783,0.00007403798,0.00001695359,0.000057713423,0.0000023292232,0.00023401779,0.25287485,0.000096160424,0.7422997,0.00009806437,0.0039068055],"study_design_scores_gemma":[0.0025188685,0.0007347757,0.00014115704,0.0003602017,0.0002133044,0.0004571816,0.004062572,0.19289178,0.0044799023,0.7911894,0.002509227,0.0004416815],"about_ca_topic_score_codex":2.940018e-7,"about_ca_topic_score_gemma":1.5892478e-7,"teacher_disagreement_score":0.4023305,"about_ca_system_score_codex":0.000019347943,"about_ca_system_score_gemma":0.00005626812,"threshold_uncertainty_score":0.3758542},"labels":[],"label_agreement":null},{"id":"W36849672","doi":"10.1007/978-1-4614-7621-4_12","title":"Preprocessing and Regularization for Degenerate Semidefinite Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Regularization (linguistics); Mathematical optimization; Semidefinite embedding; Preprocessor; Interior point method; Positive-definite matrix; Algorithm; Quadratically constrained quadratic program; Quadratic programming; Computer science; Artificial intelligence; Eigenvalues and eigenvectors","score_opus":0.0656506104055056,"score_gpt":0.3251260629061176,"score_spread":0.259475452500612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36849672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010161807,0.0003532316,0.91925216,0.00007561838,0.000120681805,0.0042918283,0.00017740483,0.0002737148,0.075353764],"genre_scores_gemma":[0.000030028841,0.0004360069,0.770418,0.00001749085,0.00012322661,0.00041625794,0.00009779253,0.00032354405,0.22813764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964744,0.0000073539604,0.0012974048,0.00085419964,0.00073174806,0.00063488405],"domain_scores_gemma":[0.99638623,0.0006045493,0.0010595054,0.00033717474,0.0014232523,0.00018929131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085385755,0.0006927213,0.000920775,0.00045407837,0.00020500868,0.00047398364,0.00034548825,0.000533179,0.00009777476],"category_scores_gemma":[0.0018816591,0.000715269,0.00007491105,0.00012436093,0.0002570249,0.00031714293,0.00028255704,0.0006233804,0.000027239133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013533557,0.00009671109,0.000013340059,0.007188922,0.000070678034,0.00000550928,0.0012876817,0.000028263456,0.0000609362,0.9737484,0.0009809573,0.016505063],"study_design_scores_gemma":[0.0005463661,0.000074218326,0.0000016182078,0.0015717547,0.00012125425,0.000016937815,0.00011450506,0.06969954,0.00016375535,0.9214747,0.0055301175,0.0006852408],"about_ca_topic_score_codex":0.000001335391,"about_ca_topic_score_gemma":0.000008138657,"teacher_disagreement_score":0.15278389,"about_ca_system_score_codex":0.00023351994,"about_ca_system_score_gemma":0.00013342666,"threshold_uncertainty_score":0.99952984},"labels":[],"label_agreement":null},{"id":"W4207029996","doi":"10.1017/cbo9781107282094.006","title":"Applications of duality*","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Selection (genetic algorithm); Focus (optics); Point (geometry); Computer science; Section (typography); Reading (process); Duality (order theory); Mathematics education; Range (aeronautics); Mathematics; Engineering; Artificial intelligence; Pure mathematics; Linguistics; Geometry","score_opus":0.05446661159978211,"score_gpt":0.2964421514285793,"score_spread":0.24197553982879721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207029996","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000320574,0.00003062623,0.15776691,0.0000061773667,0.00003432626,0.00066650176,0.00040199643,0.00010315964,0.8409871],"genre_scores_gemma":[0.000015301075,0.000067120876,0.021688329,0.000009816396,0.000109617016,0.000002971938,0.00004779228,0.000061482206,0.97799754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868256,0.000036759266,0.0002765723,0.0003849405,0.00041006706,0.0002091225],"domain_scores_gemma":[0.9977085,0.00023017397,0.00037809697,0.0008514935,0.0006959743,0.00013578917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014076763,0.0002493582,0.0004083418,0.00023743737,0.00012345373,0.000013176207,0.0005480838,0.00030669058,0.00007190638],"category_scores_gemma":[0.0000452713,0.00030252867,0.0001644513,0.000017561313,0.0005108749,0.00005987784,0.00042510114,0.0003202393,0.000030537423],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002676722,0.00001755678,1.5401022e-7,0.00020580723,0.00010254242,0.000013310507,0.000044024066,0.0000020579803,0.000009130568,0.9675635,0.030838244,0.0011769121],"study_design_scores_gemma":[0.00036045356,0.000035369507,2.9255492e-7,0.00009527157,0.00012072266,0.000005198997,0.0000405936,0.0001536379,0.00050249253,0.0021318279,0.9962745,0.00027966546],"about_ca_topic_score_codex":0.000012428574,"about_ca_topic_score_gemma":0.0000010095969,"teacher_disagreement_score":0.9654362,"about_ca_system_score_codex":0.00015419467,"about_ca_system_score_gemma":0.0001266937,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W4207041581","doi":"10.1090/mbk/139/14","title":"Sieve methods","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Materials science; Mathematics","score_opus":0.07280451276034706,"score_gpt":0.4117538845618519,"score_spread":0.33894937180150486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207041581","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011735061,0.00007070184,0.46790764,0.00017299592,0.000043228487,0.0004212883,0.000023703715,0.0002286179,0.5311307],"genre_scores_gemma":[0.00000255065,0.0000641499,0.52444756,0.0003534685,0.00013929902,0.000050680672,0.000016077453,0.00021094698,0.47471523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960255,0.00015600323,0.0010236364,0.0009005677,0.0011460681,0.0007482177],"domain_scores_gemma":[0.99365574,0.0033835357,0.00070653565,0.0013320924,0.00049181236,0.00043028427],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090387196,0.0007730056,0.0017098192,0.0000743609,0.00018368277,0.00011558064,0.0006002933,0.00045752455,0.0040180176],"category_scores_gemma":[0.00096143776,0.0007223403,0.0012581438,0.00009387885,0.0015543298,0.000051528925,0.0006095056,0.0013948393,0.0003147658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005525743,0.00005741462,8.87982e-8,0.0003904369,0.0005274063,0.000029999319,0.00070363557,0.0000031107243,0.0000630114,0.91126746,0.00745746,0.07949447],"study_design_scores_gemma":[0.00023155804,0.00008104467,8.328908e-8,0.0002835783,0.00020025736,0.000043673666,0.0004975521,0.0019621893,0.00030199083,0.86647093,0.129166,0.0007611364],"about_ca_topic_score_codex":0.0000024897752,"about_ca_topic_score_gemma":0.0000011811837,"teacher_disagreement_score":0.12170855,"about_ca_system_score_codex":0.00035421073,"about_ca_system_score_gemma":0.00031734505,"threshold_uncertainty_score":0.99952275},"labels":[],"label_agreement":null},{"id":"W4210249170","doi":"10.1017/cbo9781107282094.010","title":"References","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Focus (optics); Reading (process); Point (geometry); Computer science; Selection (genetic algorithm); Section (typography); Mathematics education; Mathematics; Artificial intelligence; Linguistics","score_opus":0.09004496885769285,"score_gpt":0.29280769138514884,"score_spread":0.20276272252745597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210249170","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010935016,0.000036412253,0.01385423,0.000011336294,0.00014342708,0.00040819368,0.00019755839,0.0002402857,0.98509765],"genre_scores_gemma":[0.000012611037,0.00012935058,0.014811403,0.00002000492,0.0001974789,7.82095e-7,0.00003668812,0.00007597283,0.9847157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984245,0.000043643326,0.00021238154,0.0005179136,0.00048493742,0.00031668105],"domain_scores_gemma":[0.9981328,0.00021175409,0.00025320495,0.00071572466,0.00049551064,0.00019099329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012996203,0.00034620464,0.00040899141,0.00023379634,0.00020769406,0.000043604454,0.00066416536,0.0004027497,0.00016053815],"category_scores_gemma":[0.000076373515,0.00038768508,0.00015183141,0.000011063344,0.00043895553,0.00009751282,0.0005022315,0.00050235435,0.00010574444],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039640247,0.00000728122,1.1079552e-7,0.00007324291,0.00008805381,0.00009824899,0.000039801118,0.0000012477507,0.0000028269164,0.876698,0.12213178,0.0008197405],"study_design_scores_gemma":[0.0003749613,0.00006262765,3.5718412e-7,0.00015212287,0.000094946074,0.000009940738,0.000040941297,0.00024538193,0.00016089034,0.0017106377,0.9967232,0.0004240264],"about_ca_topic_score_codex":0.000012425029,"about_ca_topic_score_gemma":0.0000021721864,"teacher_disagreement_score":0.87498736,"about_ca_system_score_codex":0.00022319355,"about_ca_system_score_gemma":0.00014089658,"threshold_uncertainty_score":0.9998575},"labels":[],"label_agreement":null},{"id":"W4210564655","doi":"10.1017/cbo9781107282094.009","title":"Computational complexity","year":2018,"lang":"en","type":"other","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Focus (optics); Computer science; Point (geometry); Reading (process); Selection (genetic algorithm); Section (typography); Mathematics education; Range (aeronautics); Mathematics; Engineering; Artificial intelligence; Linguistics","score_opus":0.14057282615049188,"score_gpt":0.42489538571523794,"score_spread":0.28432255956474606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210564655","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.2605468e-8,0.0000071708523,0.44676304,0.000044951576,0.000055556968,0.00014186944,0.000019816032,0.00028756092,0.55267996],"genre_scores_gemma":[2.8760348e-7,0.0000033393146,0.48035878,0.00003160487,0.00015676115,0.000005327023,0.000043933112,0.00020867429,0.5191913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990769,0.000035799123,0.00014368263,0.000209927,0.00037174355,0.00016197095],"domain_scores_gemma":[0.99936193,0.00012119503,0.00009693168,0.0002495705,0.00010488615,0.000065460095],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007855158,0.00014284752,0.00020076218,0.00016844022,0.000035585796,0.000018900593,0.00018500694,0.00013543178,0.1566474],"category_scores_gemma":[0.00013533645,0.00012664529,0.0000401878,0.00012638926,0.00021096999,0.000017552598,0.00008864975,0.00009384908,0.0038032748],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010809788,0.000030360065,0.0000018364211,0.000035195484,0.000025049694,0.000001357227,0.0000054723555,0.000027992006,2.7928296e-8,0.11448735,0.88507754,0.0003067669],"study_design_scores_gemma":[0.00018204856,0.000012339219,0.0000014471805,0.000031831267,0.0000046095815,0.0000029536777,0.0000064789047,0.0172932,0.0000013879189,0.29518563,0.68713003,0.00014808425],"about_ca_topic_score_codex":0.000012065429,"about_ca_topic_score_gemma":0.00004192002,"teacher_disagreement_score":0.1979475,"about_ca_system_score_codex":0.000035614557,"about_ca_system_score_gemma":0.000050017672,"threshold_uncertainty_score":0.9969724},"labels":[],"label_agreement":null},{"id":"W4220771592","doi":"10.1002/wics.1580","title":"Function minimization and nonlinear least squares in R","year":2022,"lang":"en","type":"review","venue":"Wiley Interdisciplinary Reviews Computational Statistics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Minification; Non-linear least squares; Nonlinear programming; Mathematical optimization; Context (archaeology); Computer science; Nonlinear system; Perspective (graphical); Least-squares function approximation; Function (biology); Implementation; Algorithm; Mathematics; Estimation theory; Artificial intelligence; Statistics","score_opus":0.14486415181118906,"score_gpt":0.4485202495835514,"score_spread":0.30365609777236235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220771592","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6694061e-7,0.6339368,0.36326805,0.000035383902,0.00021923405,0.001514984,0.0008470656,0.00004430816,0.00013401081],"genre_scores_gemma":[9.0114746e-8,0.7188862,0.27604946,0.000022147156,0.00011986112,0.0005009029,0.003904589,0.00010091253,0.00041585116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953165,0.0009988963,0.0018217466,0.0007988027,0.00067525834,0.00038882022],"domain_scores_gemma":[0.9955247,0.0027796945,0.0010139489,0.00037557323,0.00015246558,0.00015358701],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00080751645,0.00063271297,0.0020408959,0.0006712206,0.00035856097,0.00010258446,0.00037207856,0.00018790264,0.0011669032],"category_scores_gemma":[0.00089812436,0.00058766926,0.00023035641,0.00096845644,0.0001569861,0.00021786631,0.0011089551,0.0008952989,0.00008400596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021095426,0.00019359698,0.0000026743996,0.014093115,0.000061900086,0.0000371685,0.0001811164,0.0030901,3.2629803e-9,0.0066223266,0.0117364675,0.9639604],"study_design_scores_gemma":[0.0003018583,0.00015494607,0.0000025940908,0.0062396443,0.00025163975,0.00009720548,0.00009157307,0.06310919,2.6150546e-9,0.045353945,0.8838857,0.0005117281],"about_ca_topic_score_codex":0.000001426163,"about_ca_topic_score_gemma":0.000021024216,"teacher_disagreement_score":0.9634487,"about_ca_system_score_codex":0.0005141045,"about_ca_system_score_gemma":0.0002785016,"threshold_uncertainty_score":0.99974614},"labels":[],"label_agreement":null},{"id":"W4221140793","doi":"","title":"Approximation à précision numérique prédéfinie d'une classe de problèmes d'optimisation non-linéaires non-convexes séparables","year":2022,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Physics","score_opus":0.02433347388500327,"score_gpt":0.28888945082943746,"score_spread":0.26455597694443417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02446115,0.00082108454,0.91772676,0.020399744,0.00044549085,0.003543511,0.00020456055,0.00046213996,0.03193556],"genre_scores_gemma":[0.091364205,0.003956192,0.8273521,0.00011491547,0.00011177355,0.0017777343,0.0025579687,0.00031772,0.07244736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98257387,0.010401606,0.0020258708,0.001908559,0.0018362674,0.0012538251],"domain_scores_gemma":[0.9827346,0.006188404,0.0021368412,0.0036194543,0.0047736005,0.0005470726],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01344152,0.0010258076,0.001150465,0.00071235315,0.0016192553,0.00096118235,0.0024742885,0.00092562055,0.0018544274],"category_scores_gemma":[0.007811752,0.0012030873,0.00051641866,0.0017319898,0.0006998545,0.0008557624,0.0027661505,0.0023772505,0.00015090014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039051645,0.009453292,0.0034075212,0.006424419,0.00085609977,0.00007727594,0.15732323,0.3691838,0.011764776,0.29154137,0.011473043,0.13810465],"study_design_scores_gemma":[0.0015898255,0.000004972359,0.0012068689,0.0033169866,0.000096280324,0.000040180075,0.0024224038,0.8807728,0.04111972,0.05788421,0.010386369,0.0011593543],"about_ca_topic_score_codex":0.0016612735,"about_ca_topic_score_gemma":0.0013447528,"teacher_disagreement_score":0.51158905,"about_ca_system_score_codex":0.0015292611,"about_ca_system_score_gemma":0.0017672805,"threshold_uncertainty_score":0.9999243},"labels":[],"label_agreement":null},{"id":"W4224005576","doi":"10.1007/s40305-022-00398-5","title":"Cubic Regularization Methods with Second-Order Complexity Guarantee Based on a New Subproblem Reformulation","year":2022,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"National Natural Science Foundation of China","keywords":"Hessian matrix; Regularization (linguistics); Mathematics; Lipschitz continuity; Minification; Trust region; Eigenvalues and eigenvectors; Applied mathematics; Regular polygon; Computational complexity theory; Mathematical optimization; Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.136753856636964,"score_gpt":0.4532613657135169,"score_spread":0.3165075090765529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224005576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019776711,0.000057904897,0.9642692,0.014036638,0.00009040504,0.0009999595,0.000029515013,0.000017541277,0.0007220815],"genre_scores_gemma":[0.06104677,0.000028524295,0.9322354,0.00013437682,0.000095344025,0.000028050235,0.000016684578,0.000044679906,0.006370124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947155,0.0018193696,0.00067300425,0.0001945221,0.0022909835,0.0003065936],"domain_scores_gemma":[0.99650127,0.0005759475,0.00032300875,0.0005814978,0.001922214,0.0000960861],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006019854,0.00014591469,0.00032041618,0.0002540047,0.0014132519,0.00009075679,0.0007275079,0.00006341438,0.0009672505],"category_scores_gemma":[0.0011901841,0.00009534792,0.00022240514,0.002203677,0.00027956825,0.00038396704,0.00023374219,0.0013993977,9.882953e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023878868,0.0003992041,0.000037554546,0.00007506357,0.00010088982,0.0000010048857,0.0024298814,0.9714343,0.0034816267,0.0130997095,0.0071727103,0.001529269],"study_design_scores_gemma":[0.0018467888,0.0007709494,0.00045865696,0.00009185237,0.000022698134,0.00003468066,0.0008693464,0.9380937,0.0050180736,0.05097611,0.0016895188,0.00012761341],"about_ca_topic_score_codex":0.00003601705,"about_ca_topic_score_gemma":0.00003428189,"teacher_disagreement_score":0.041270062,"about_ca_system_score_codex":0.0005837352,"about_ca_system_score_gemma":0.0015341574,"threshold_uncertainty_score":0.999946},"labels":[],"label_agreement":null},{"id":"W4226195069","doi":"10.23952/jano.4.2022.1.01","title":"A Special Issue on Recent Progress on Vector Optimization and Related Topics Dedicated to Professor Dinh The Luc on the occasion of his 70th birthday","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Engineering ethics; Computer science; Data science; Computational biology; Engineering; Biology","score_opus":0.024967813549732702,"score_gpt":0.31040457697538554,"score_spread":0.28543676342565283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226195069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03996344,0.00046243172,0.70742774,0.2149289,0.004009642,0.013494159,0.00013179403,0.00027487666,0.019307025],"genre_scores_gemma":[0.28328857,0.005736035,0.69062185,0.0056727836,0.008005419,0.0008900409,0.00016983744,0.0005563399,0.005059117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784124,0.00024867195,0.000633313,0.00022757804,0.0008478002,0.00020139453],"domain_scores_gemma":[0.9981438,0.00060381705,0.00065016793,0.00021949604,0.0002593982,0.00012333342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249236,0.00018268918,0.0003192034,0.00018251203,0.00041547144,0.00004652344,0.00022880026,0.00007821535,0.00062642136],"category_scores_gemma":[0.000573459,0.000108944645,0.000049002658,0.000782238,0.00010135468,0.00006772722,0.00012720324,0.0005547596,0.000002449403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014233739,0.00048049312,0.000008301988,0.000024442254,0.0000526382,0.0000051462926,0.001240597,0.9642072,0.00002944135,0.0086492365,0.005782521,0.018096626],"study_design_scores_gemma":[0.0040133726,0.0055969823,0.00018570658,0.00024650252,0.00015149373,0.000062072926,0.0019113594,0.93493783,0.0019124969,0.0045018313,0.045935016,0.0005453556],"about_ca_topic_score_codex":3.7853835e-7,"about_ca_topic_score_gemma":1.0455477e-7,"teacher_disagreement_score":0.24332513,"about_ca_system_score_codex":0.0001542907,"about_ca_system_score_gemma":0.000072807496,"threshold_uncertainty_score":0.68588746},"labels":[],"label_agreement":null},{"id":"W4226236569","doi":"10.1287/opre.2022.2267","title":"A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Polytechnique Montréal","funders":"","keywords":"Solver; Linearization; Computer science; Quadratic equation; Preprocessor; Mathematical optimization; Quadratic programming; Integer programming; Pascal (unit); Tardiness; Classifier (UML); Artificial intelligence; Machine learning; Algorithm; Mathematics; Job shop scheduling; Nonlinear system; Schedule","score_opus":0.3173609931698647,"score_gpt":0.4785776817810923,"score_spread":0.16121668861122757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226236569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27301964,0.00006907269,0.6737891,0.028304702,0.00023995263,0.009088207,0.00014637895,0.00011134695,0.015231593],"genre_scores_gemma":[0.9482036,0.000020020258,0.033081945,0.00017099013,0.00005553883,0.0030639428,0.00004851764,0.000064545486,0.015290864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588865,0.0013417044,0.0004910107,0.00032508143,0.0015432207,0.00041033418],"domain_scores_gemma":[0.9968954,0.0016304394,0.000030612475,0.00064661016,0.00070581393,0.000091177695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003482349,0.000111675625,0.000182287,0.0007871986,0.00070770946,0.00010211703,0.0005503006,0.00004523412,0.0019829285],"category_scores_gemma":[0.004532279,0.00008631199,0.000041472333,0.0030375123,0.0001160248,0.00012999345,0.0004106241,0.0008666046,0.00009619008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037402977,0.0004912832,0.00011715083,0.000026785556,0.00001310829,0.00000370088,0.0023280114,0.85452676,0.0020879828,0.13403429,0.005426917,0.0009066335],"study_design_scores_gemma":[0.0006410793,0.00058453385,0.0002750165,0.000077331766,0.0000037264733,0.000005416819,0.0063501005,0.9693799,0.0032803023,0.013736672,0.0054529076,0.0002130055],"about_ca_topic_score_codex":0.00012567294,"about_ca_topic_score_gemma":0.0009287185,"teacher_disagreement_score":0.675184,"about_ca_system_score_codex":0.00037001687,"about_ca_system_score_gemma":0.00038310626,"threshold_uncertainty_score":0.9989294},"labels":[],"label_agreement":null},{"id":"W4229703319","doi":"10.23952/jnva.4.2020.2.04","title":"Primal-dual partitions in linear semi-infinite programming with bounded coefficients","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Sistema Nacional de Investigadores; European Regional Development Fund; Consejo Nacional de Ciencia y Tecnología","keywords":"Bounded function; Dual (grammatical number); Mathematics; Linear programming; Semi-infinite programming; Applied mathematics; Mathematical optimization; Mathematical analysis; Regular polygon; Geometry","score_opus":0.04778303372939251,"score_gpt":0.34762727388186904,"score_spread":0.2998442401524765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229703319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062421147,0.000043237025,0.9348185,0.0024011305,0.000020073358,0.00014972477,0.000044687764,0.000015794938,0.0000857161],"genre_scores_gemma":[0.18708998,0.000044152912,0.81223637,0.00018675266,0.00025552287,0.0000049074783,0.000055127875,0.000018090137,0.00010909878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847126,0.0000785445,0.00055183255,0.00014928494,0.00058744464,0.00016164045],"domain_scores_gemma":[0.9985081,0.00031881296,0.0003403446,0.00007366718,0.000591403,0.0001676924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041478276,0.00010712583,0.0003407836,0.00035688694,0.00009088973,0.000060498394,0.00008712596,0.000048052865,0.00016634652],"category_scores_gemma":[0.0006513044,0.00008270821,0.00010876661,0.0017176479,0.000047417514,0.00021323707,0.000034942495,0.00026484448,0.0000026699524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008462399,0.0018028413,0.056742847,0.0001457182,0.0036902756,0.00020441298,0.0035979361,0.9218834,0.00014764875,0.006193526,0.00014468351,0.004600437],"study_design_scores_gemma":[0.001687139,0.00028068564,0.0040466925,0.000031754524,0.00062327145,0.00002942872,0.000273265,0.989687,0.000039516217,0.0012301367,0.0019088218,0.00016225256],"about_ca_topic_score_codex":0.000004563207,"about_ca_topic_score_gemma":0.000020133033,"teacher_disagreement_score":0.12466884,"about_ca_system_score_codex":0.000044843568,"about_ca_system_score_gemma":0.00015970036,"threshold_uncertainty_score":0.33727428},"labels":[],"label_agreement":null},{"id":"W4231414503","doi":"10.22215/etd/2018-12694","title":"Reaching Feasibility Quickly for Sets of Linear Constraints","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear programming; Acceleration; Mathematical optimization; Set (abstract data type); Computer science; Linear system; Interior point method; Linear-fractional programming; Point (geometry); Feasible region; Projection (relational algebra); Computation; Algorithm; Mathematics","score_opus":0.13259910038512152,"score_gpt":0.4696475423946224,"score_spread":0.3370484420095009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231414503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045005444,0.00005676733,0.8752277,0.000059570782,0.00079965894,0.004673414,0.0005727846,0.0002799194,0.07332473],"genre_scores_gemma":[0.0066049234,0.00001695257,0.97097003,0.000014477338,0.00012266415,0.000079314166,0.0011788423,0.00009397385,0.020918792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.000065486995,0.00064571813,0.00039761837,0.00042822456,0.00027345837],"domain_scores_gemma":[0.9970564,0.00072664296,0.00042464805,0.0004953641,0.0012077597,0.00008915933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074478466,0.00022989778,0.00049109414,0.00015983763,0.00011314991,0.000014676979,0.00026226026,0.00032175667,0.0008416475],"category_scores_gemma":[0.004084161,0.00021174355,0.00016321239,0.00014983106,0.0001363479,0.000093578354,0.000028278218,0.000250471,0.000015850805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061740773,0.005890875,0.0008659847,0.051256437,0.002491448,0.000024296485,0.040831577,0.00053141033,0.0078098853,0.41317374,0.056907088,0.4140432],"study_design_scores_gemma":[0.0063710804,0.0012069896,0.00041461966,0.0017546219,0.0004020141,0.000015321813,0.013851697,0.09998191,0.0666958,0.8043874,0.0027421375,0.0021764366],"about_ca_topic_score_codex":0.000011182653,"about_ca_topic_score_gemma":0.00013417356,"teacher_disagreement_score":0.41186675,"about_ca_system_score_codex":0.000104737286,"about_ca_system_score_gemma":0.00029490064,"threshold_uncertainty_score":0.921545},"labels":[],"label_agreement":null},{"id":"W4232444021","doi":"10.22215/etd/2009-08730","title":"Branching variable direction selection in mixed integer programming","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Selection (genetic algorithm); Variable (mathematics); Computer science; Mathematics; Combinatorics; Integer programming; Branching (polymer chemistry); Arithmetic; Algorithm; Artificial intelligence; Mathematical analysis","score_opus":0.024429889008983765,"score_gpt":0.36267279243505035,"score_spread":0.3382429034260666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232444021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057218964,0.00014894406,0.8960207,0.00005246776,0.0008654375,0.0021202436,0.000002793909,0.00092389854,0.0941436],"genre_scores_gemma":[0.007001283,0.00010203241,0.8582423,0.000028581095,0.00026769858,0.0003237449,0.00057914155,0.00017787963,0.13327737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979234,0.0001344335,0.00056803477,0.00047609012,0.0004720155,0.00042602624],"domain_scores_gemma":[0.9989905,0.0002213435,0.00023795081,0.00016005662,0.00032051717,0.000069633934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055852445,0.00030062062,0.00040399213,0.00067868107,0.00013627525,0.00012243768,0.00015365478,0.00042461423,0.00032449723],"category_scores_gemma":[0.0010357219,0.0003057245,0.00007475026,0.0012503769,0.000009697996,0.00035011937,0.000014085629,0.0008560029,0.000022109336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041791587,0.0013451453,0.00016819534,0.001492531,0.00015695815,0.000016250498,0.002393001,0.016539967,0.0031516976,0.038140055,0.0027430197,0.93343526],"study_design_scores_gemma":[0.0056778984,0.0008181408,0.004336427,0.00451892,0.00029762834,0.000082481034,0.007959022,0.51246953,0.023046399,0.39756468,0.03843149,0.004797425],"about_ca_topic_score_codex":0.00018241529,"about_ca_topic_score_gemma":0.0032454997,"teacher_disagreement_score":0.92863786,"about_ca_system_score_codex":0.00043017702,"about_ca_system_score_gemma":0.00015719896,"threshold_uncertainty_score":0.9999395},"labels":[],"label_agreement":null},{"id":"W4233310447","doi":"10.23952/jnva.2.2018.2.01","title":"A special issue on Nonlinear Analysis and Optimization dedicated to Professor Simeon Reich, Part II","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.03004105620919256,"score_gpt":0.3622711553827004,"score_spread":0.3322300991735078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233310447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027081432,0.000033590415,0.9630986,0.0076506063,0.00026327407,0.000396118,0.00020251163,0.00003613087,0.0012377362],"genre_scores_gemma":[0.0032983026,0.00013069251,0.97992975,0.00045215737,0.013029716,0.000006293174,0.00010562489,0.000031075622,0.0030163995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762654,0.00016381156,0.0008325788,0.00030386407,0.0008487575,0.00022447275],"domain_scores_gemma":[0.9969894,0.0003909806,0.00057966576,0.00018347586,0.0015677041,0.00028874818],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009603611,0.00019279256,0.00062841247,0.0014214137,0.00034824628,0.000081605736,0.00016821512,0.000119833494,0.0016641862],"category_scores_gemma":[0.0013923948,0.0001578979,0.00022789689,0.0036857163,0.00010059356,0.00023713852,0.00010421442,0.00024680563,0.00001042282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031639433,0.003683399,0.008899166,0.00013575585,0.040425763,0.00007517759,0.004927097,0.89239687,0.00019613132,0.005390734,0.017523464,0.023182504],"study_design_scores_gemma":[0.0008649269,0.00062299165,0.002129049,0.000028626708,0.0039862064,0.000009419324,0.000107298685,0.9760695,0.000150348,0.0011835012,0.014618045,0.00023005095],"about_ca_topic_score_codex":0.0000061181686,"about_ca_topic_score_gemma":0.000060832866,"teacher_disagreement_score":0.08367267,"about_ca_system_score_codex":0.00007733423,"about_ca_system_score_gemma":0.00012962722,"threshold_uncertainty_score":0.99924845},"labels":[],"label_agreement":null},{"id":"W4234479786","doi":"10.1007/978-1-4419-9467-7_8","title":"Convex Functions","year":2011,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics","score_opus":0.12903414240885086,"score_gpt":0.34000671488803763,"score_spread":0.21097257247918677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234479786","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028969037,0.00018021042,0.1340306,0.00003650923,0.00023816586,0.00088651455,0.000052338946,0.00023266776,0.8643401],"genre_scores_gemma":[0.000024058076,0.00016411059,0.16272636,0.000039493865,0.00013447089,0.000079044774,0.000029983972,0.00028543867,0.83651704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714935,0.000027160077,0.0011035491,0.0005256391,0.0006945349,0.0004997449],"domain_scores_gemma":[0.99709034,0.0006236766,0.0005325057,0.0012608621,0.00031167455,0.00018095446],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005027613,0.0005956508,0.00095401646,0.000556779,0.00011349503,0.000050989158,0.0005632895,0.0006400561,0.0051249918],"category_scores_gemma":[0.00057450286,0.0005921129,0.00022974546,0.0000757709,0.00032048012,0.00012287083,0.00028790694,0.0011251139,0.0013773969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007771778,0.000120581535,0.0000017714922,0.00056316634,0.00008534197,0.00005566964,0.0007823539,0.00002014832,0.0000034317238,0.9882171,0.008319179,0.001823473],"study_design_scores_gemma":[0.0003716674,0.000047587713,4.768569e-7,0.0005853809,0.00007206776,0.00003297831,0.000080967984,0.0014547559,0.000025998512,0.9201356,0.07665111,0.00054140063],"about_ca_topic_score_codex":0.0000016532231,"about_ca_topic_score_gemma":0.000016679538,"teacher_disagreement_score":0.06833193,"about_ca_system_score_codex":0.00027818215,"about_ca_system_score_gemma":0.0001828633,"threshold_uncertainty_score":0.99965304},"labels":[],"label_agreement":null},{"id":"W4234763145","doi":"10.1007/978-3-030-19462-8_8","title":"Geometric Programming","year":2019,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Geometric programming; Misnomer; Nonlinear programming; Computer science; Duality (order theory); Mathematics; Mathematical economics; Mathematical optimization; Discrete mathematics; Nonlinear system; Philosophy","score_opus":0.1134913708158824,"score_gpt":0.46383918193915963,"score_spread":0.35034781112327723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234763145","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010987788,0.0001447999,0.008849467,0.011539405,0.0033476965,0.008840998,0.0001909334,0.0002468393,0.9657411],"genre_scores_gemma":[0.023786817,0.007015043,0.13383394,0.000112819245,0.00039580907,0.0021435511,0.00035344876,0.00019397063,0.8321646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97097,0.00044822172,0.002367044,0.0037709563,0.019393958,0.0030498174],"domain_scores_gemma":[0.98889583,0.0006483067,0.00018112986,0.002658743,0.0070440858,0.0005719279],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","open_science","insufficient_payload"],"category_scores_codex":[0.025857126,0.00092695444,0.00079113216,0.030800259,0.0036092105,0.0063393856,0.0122264605,0.00033841608,0.00490397],"category_scores_gemma":[0.004983508,0.00097396225,0.00021919917,0.0126979565,0.0108288815,0.0105018895,0.010294511,0.0032222576,0.001251489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016747779,0.00049126404,0.00013854417,0.00017011225,0.00014683623,0.00034096878,0.00049799617,0.095216446,0.00010863324,0.8908193,0.0017002629,0.010202179],"study_design_scores_gemma":[0.0038992767,0.00073441706,0.0019709775,0.0026964052,0.00004707544,0.00013469857,0.011369745,0.17124876,0.0005984848,0.16676198,0.63746566,0.0030725228],"about_ca_topic_score_codex":0.0003701287,"about_ca_topic_score_gemma":0.0035754647,"teacher_disagreement_score":0.7240573,"about_ca_system_score_codex":0.010045011,"about_ca_system_score_gemma":0.0017472935,"threshold_uncertainty_score":0.99952614},"labels":[],"label_agreement":null},{"id":"W4235843859","doi":"10.1002/9781118884003.ch7","title":"Nonlinear equations","year":2014,"lang":"en","type":"other","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Nonlinear system; Maxima and minima; Non-linear least squares; Constraint (computer-aided design); Least-squares function approximation; Applied mathematics; Function (biology); Mathematics; Mathematical optimization; Minification; Explained sum of squares; Mathematical analysis; Physics; Statistics; Geometry","score_opus":0.06722186607830986,"score_gpt":0.39632030433634596,"score_spread":0.3290984382580361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235843859","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5739897e-9,0.000015427177,0.49684465,0.000065263455,0.000048023277,0.000145496,0.000011838477,0.0002887503,0.5025805],"genre_scores_gemma":[1.4995308e-7,0.000019497942,0.45026237,0.000038228285,0.00021446646,0.000014465939,0.000028771985,0.0003356647,0.5490864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915457,0.00003630552,0.0001553285,0.00019200941,0.00028984045,0.00017197184],"domain_scores_gemma":[0.99904484,0.0002880892,0.00009950512,0.00044099987,0.00005805003,0.00006850593],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010558558,0.0001412309,0.00020446874,0.00022155554,0.00002679356,0.000018294279,0.0001840495,0.00018173795,0.047389746],"category_scores_gemma":[0.0007904638,0.00012137417,0.000047076774,0.00014212764,0.000039594554,0.000015999974,0.000060502847,0.00015718276,0.0029821938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9698858e-7,0.00003618016,2.920538e-7,0.000047073267,0.000021525191,8.6677517e-7,0.0000061104597,0.000018852046,6.3191584e-7,0.059239786,0.93890375,0.0017245424],"study_design_scores_gemma":[0.00015498212,0.000010526528,2.9856096e-8,0.000038436236,0.00000935995,6.498664e-7,0.0000066702196,0.0313912,0.0000105904455,0.011304239,0.95691746,0.00015585704],"about_ca_topic_score_codex":0.00001062188,"about_ca_topic_score_gemma":0.00006894802,"teacher_disagreement_score":0.04793555,"about_ca_system_score_codex":0.000024282523,"about_ca_system_score_gemma":0.000041664294,"threshold_uncertainty_score":0.9977941},"labels":[],"label_agreement":null},{"id":"W4238372997","doi":"10.1007/978-3-662-04197-0_1","title":"Linear Programming","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Sketch; Computer science; Linear programming; Programming language; Algorithm","score_opus":0.08275078792266363,"score_gpt":0.37017001428519003,"score_spread":0.28741922636252637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238372997","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.1218274e-7,0.00007197581,0.0794591,0.00008272958,0.00003794032,0.00048160928,0.000009116897,0.00032096094,0.9195365],"genre_scores_gemma":[4.7345773e-7,0.00017030275,0.40285107,0.000029860095,0.00013393929,0.000011073148,0.00002215288,0.00009135931,0.59668976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861497,0.000007817912,0.00032535387,0.00031482504,0.00047338696,0.0002636757],"domain_scores_gemma":[0.99903,0.00016439296,0.00009658025,0.00045124063,0.00014496222,0.00011282436],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011035649,0.00025862845,0.00030990894,0.00015641666,0.000067211215,0.000030750747,0.00021545652,0.00029213855,0.0227926],"category_scores_gemma":[0.000081085636,0.0002318732,0.000118612086,0.0000324827,0.00007657616,0.000062196086,0.00007610642,0.00045418163,0.0014397695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009355178,0.000025430854,1.2131068e-7,0.00006785762,0.00005473275,0.000036300276,0.00003378365,0.00008516767,3.0145168e-7,0.77413654,0.0047848527,0.22076553],"study_design_scores_gemma":[0.00011721961,0.000024799607,1.6728636e-8,0.000055457018,0.000013897146,0.00000815392,0.0000029581358,0.0013851306,0.000010058523,0.32939893,0.66877294,0.00021046738],"about_ca_topic_score_codex":0.0000012242996,"about_ca_topic_score_gemma":0.000004637582,"teacher_disagreement_score":0.66398805,"about_ca_system_score_codex":0.0000695957,"about_ca_system_score_gemma":0.00006897777,"threshold_uncertainty_score":0.99933773},"labels":[],"label_agreement":null},{"id":"W4239112803","doi":"10.1137/1.9781611974331.ch84","title":"Improved Deterministic Algorithms for Linear Programming in Low Dimensions","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming; Upper and lower bounds; Algorithm; Mathematics; Combinatorics; Time complexity; Sampling (signal processing); Running time; Deterministic algorithm; Discrete mathematics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.12992074355861483,"score_gpt":0.4200409554620417,"score_spread":0.29012021190342685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239112803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017991946,0.000019297713,0.99593955,0.00014753499,0.000116928575,0.0013915414,0.00000895079,0.00016489954,0.00041210494],"genre_scores_gemma":[0.010296427,0.0000036864078,0.98591363,0.00004712296,0.000077895886,0.00034814817,0.000014834791,0.000050309514,0.0032479116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868065,0.000038007238,0.00035287885,0.00027226628,0.00023343205,0.00042278363],"domain_scores_gemma":[0.99857473,0.0005157463,0.00006908543,0.00028666217,0.0003415425,0.00021225504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004917107,0.00014099457,0.00022368379,0.00014642041,0.00005888675,0.000032343807,0.00016084166,0.00008425145,0.000022664597],"category_scores_gemma":[0.0028716319,0.00012240229,0.0000500488,0.00030332638,0.000053128493,0.00013254807,0.000093839735,0.00014203342,0.000015838788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010629975,0.007194636,0.00085252227,0.0021109,0.00027953926,0.00029879637,0.009085207,0.034412988,0.0021300132,0.07175405,0.0067081563,0.8641102],"study_design_scores_gemma":[0.0016292698,0.00019246861,0.0000028095087,0.00003327985,0.000007438007,0.0000067802885,0.00044062137,0.9811079,0.0007173793,0.013992042,0.0016856631,0.00018435062],"about_ca_topic_score_codex":0.000010900258,"about_ca_topic_score_gemma":0.000045949746,"teacher_disagreement_score":0.9466949,"about_ca_system_score_codex":0.00010907937,"about_ca_system_score_gemma":0.00014890534,"threshold_uncertainty_score":0.49914202},"labels":[],"label_agreement":null},{"id":"W4239845472","doi":"10.22215/etd/2008-06301","title":"Faster MIP solutions via new node selection rules","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"Carleton University","keywords":"Selection (genetic algorithm); Computer science; Node (physics); Humanities; Art; Artificial intelligence; Engineering","score_opus":0.06928175383367484,"score_gpt":0.36895309958792555,"score_spread":0.2996713457542507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239845472","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006743296,0.00015276005,0.9393882,0.00015509006,0.00042013105,0.0006554989,0.000016443611,0.0004319501,0.058105588],"genre_scores_gemma":[0.00018024285,0.0002829716,0.47587097,0.000049907183,0.000308704,0.000062597646,0.0009901534,0.00012807026,0.5221264],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979269,0.0000619859,0.00046593323,0.00042589352,0.0006153052,0.0005040075],"domain_scores_gemma":[0.99863774,0.00018178171,0.00021090965,0.0003202848,0.00046443782,0.000184878],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010351293,0.00032857514,0.00035372836,0.00038335845,0.00034411193,0.000056265755,0.00022837454,0.00042023152,0.002921318],"category_scores_gemma":[0.00034005492,0.00032248994,0.00015016475,0.00039631187,0.00002923019,0.00023502503,0.000033667537,0.0005196055,0.0007328231],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047069258,0.00150047,0.00011972669,0.0015270248,0.0009870253,0.000047144185,0.0073778266,0.009573934,0.004039525,0.05403332,0.78592175,0.13440156],"study_design_scores_gemma":[0.0065308153,0.00051526097,0.0014180325,0.0010087836,0.0006914419,0.00043640513,0.0042519034,0.4210717,0.021052323,0.443601,0.09321271,0.0062096007],"about_ca_topic_score_codex":0.00011398499,"about_ca_topic_score_gemma":0.0007628694,"teacher_disagreement_score":0.692709,"about_ca_system_score_codex":0.00020887022,"about_ca_system_score_gemma":0.00037770753,"threshold_uncertainty_score":0.9999227},"labels":[],"label_agreement":null},{"id":"W4240016086","doi":"10.23952/jnva.4.2020.3.08","title":"Shrinking projection method for solving zero point and fixed point problems in Banach spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Fixed point; Projection (relational algebra); Mathematics; Zero (linguistics); Point (geometry); Fixed-point theorem; Zero-point energy; Mathematical analysis; Geometry; Physics; Algorithm","score_opus":0.05988113881793294,"score_gpt":0.37093042846153,"score_spread":0.31104928964359707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240016086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004175985,0.00009618883,0.9915022,0.0039744168,0.000016832033,0.00018886999,0.000013267352,0.000007311859,0.000024875224],"genre_scores_gemma":[0.03478222,0.0000983107,0.964769,0.00010730828,0.00017147843,0.000006959174,0.00001195047,0.000013068995,0.000039710812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987419,0.000086394284,0.0005481183,0.00016937622,0.00032367412,0.0001304946],"domain_scores_gemma":[0.99832183,0.0006986765,0.00039720107,0.00005119098,0.0004344332,0.00009664794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012623614,0.000100989106,0.00037184602,0.00044181556,0.000089085726,0.00008036368,0.000067993285,0.000054834753,0.000036099536],"category_scores_gemma":[0.0013692428,0.00008314223,0.00012673513,0.0007536546,0.00001468275,0.00030714332,0.000043549328,0.00019469137,1.939734e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009680905,0.0010261522,0.038783506,0.0013099458,0.006923414,0.00003431633,0.018237332,0.8726041,0.005684751,0.027130492,0.00058350957,0.026714392],"study_design_scores_gemma":[0.00082571217,0.00012191386,0.0012973231,0.000027879347,0.00032273587,0.000014833482,0.0002858968,0.9778354,0.000080345555,0.018967126,0.00013053058,0.00009030103],"about_ca_topic_score_codex":0.000016538297,"about_ca_topic_score_gemma":0.000032372885,"teacher_disagreement_score":0.1052313,"about_ca_system_score_codex":0.000049627317,"about_ca_system_score_gemma":0.00007236365,"threshold_uncertainty_score":0.33904415},"labels":[],"label_agreement":null},{"id":"W4240383261","doi":"10.1007/978-3-319-09462-5","title":"Nonlinear Approaches in Engineering Applications","year":2014,"lang":"en","type":"book","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Nonlinear system; Computer science; Physics","score_opus":0.08959028096858956,"score_gpt":0.3288303113220622,"score_spread":0.23924003035347263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240383261","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.8295594e-8,0.000037172747,0.6042729,0.000035133547,0.000012673278,0.00052571367,0.000007736009,0.000114981915,0.39499357],"genre_scores_gemma":[7.8429565e-7,0.000016774182,0.45781124,0.000010208138,0.00015763674,0.00021273147,0.000075380674,0.000068459136,0.5416468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880385,0.000014566379,0.00034439345,0.00031171774,0.00028673172,0.00023872106],"domain_scores_gemma":[0.9988537,0.000430142,0.00008466909,0.00049206935,0.000064519074,0.00007489804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002269312,0.00021516108,0.00033048348,0.0003130577,0.000023970531,0.0000227934,0.0002833205,0.00026320553,0.00023107343],"category_scores_gemma":[0.00015450933,0.00021378446,0.00006105308,0.00014696566,0.00003114018,0.000047833564,0.000107129534,0.00050126377,0.00018618266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005411493,0.0002337318,0.0000043444365,0.0019027379,0.0000740899,0.000006797746,0.00011968835,0.032169785,0.000003480201,0.9238247,0.023394788,0.01826041],"study_design_scores_gemma":[0.00025790968,0.000012260105,3.90673e-7,0.000093379036,0.000011075512,0.0000038316048,0.000009428153,0.4068371,0.000025769034,0.060886674,0.53149396,0.00036822387],"about_ca_topic_score_codex":6.086844e-7,"about_ca_topic_score_gemma":0.000010357417,"teacher_disagreement_score":0.86293805,"about_ca_system_score_codex":0.0002180761,"about_ca_system_score_gemma":0.00013657096,"threshold_uncertainty_score":0.8717877},"labels":[],"label_agreement":null},{"id":"W4241359251","doi":"10.23952/jano.1.2019.2.02","title":"Differentiating through a cone program","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Cone (formal languages); Computer science; Geometry; Mathematics; Programming language","score_opus":0.025256701609860904,"score_gpt":0.33354569883712204,"score_spread":0.3082889972272611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241359251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007558906,0.00004099505,0.9873456,0.00014631581,0.00007679885,0.0003760274,9.306584e-7,0.000038001584,0.0044164397],"genre_scores_gemma":[0.17958847,0.00010164017,0.82004136,0.00006111332,0.00007437124,0.000007996616,0.0000035684343,0.000024467321,0.000096994736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988799,0.000028290822,0.00044459183,0.00012824115,0.00034898854,0.0001700017],"domain_scores_gemma":[0.9989828,0.00021166279,0.00041587485,0.00010052767,0.00020569786,0.000083468956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017811438,0.00011259262,0.00030656686,0.00007150347,0.00005737983,0.00005595369,0.0000949077,0.00006705235,0.00023221251],"category_scores_gemma":[0.00012569454,0.000088012894,0.000050316055,0.00022705429,0.000034310648,0.00022215431,0.000045791847,0.00022229178,0.000005324549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007685538,0.0013442633,0.0005553987,0.00031847841,0.0002593776,0.000012417891,0.0019220304,0.8328789,0.0017014234,0.06605322,0.0005709132,0.09361501],"study_design_scores_gemma":[0.00282877,0.0005899045,0.000113756956,0.000074283686,0.000058375255,0.00004790154,0.0004489199,0.9607886,0.0008404452,0.032756727,0.001173018,0.00027927497],"about_ca_topic_score_codex":3.5874592e-7,"about_ca_topic_score_gemma":1.8976197e-8,"teacher_disagreement_score":0.17202955,"about_ca_system_score_codex":0.00003450119,"about_ca_system_score_gemma":0.000029115101,"threshold_uncertainty_score":0.35890618},"labels":[],"label_agreement":null},{"id":"W4241764126","doi":"10.1007/978-1-84628-622-3_9","title":"Optimisation","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Management science; Systems engineering; Engineering","score_opus":0.1781969182873355,"score_gpt":0.40847976959444693,"score_spread":0.23028285130711143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241764126","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.919067e-8,0.00002983269,0.35479927,0.00004686984,0.000054725635,0.0002215536,0.000004848196,0.00014382781,0.644699],"genre_scores_gemma":[7.239352e-7,0.000081984545,0.39308423,0.000054220574,0.00010938999,0.0000029100124,0.000024204532,0.00006778508,0.60657454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865353,0.0000056089416,0.0003310528,0.00026249024,0.0005431582,0.0002041487],"domain_scores_gemma":[0.998793,0.00029888662,0.00014317106,0.00039793825,0.00026857085,0.000098412456],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025828887,0.00021758137,0.00024095422,0.00024993374,0.0000529847,0.000023653509,0.00016230888,0.0003385877,0.015093014],"category_scores_gemma":[0.00016787772,0.00020470693,0.00008962737,0.000028658482,0.00006211253,0.000071489725,0.0000770748,0.00035603155,0.00077927805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056332497,0.0000085743895,8.286188e-8,0.000032387674,0.000026227686,0.000012099782,0.000019280373,0.00008989712,0.0000011425411,0.9679242,0.0092062615,0.022674236],"study_design_scores_gemma":[0.00017543991,0.0000228455,1.381862e-7,0.00004454977,0.000017413222,0.000008606926,0.0000068505283,0.0017371355,0.00007146248,0.65147156,0.34617004,0.00027397156],"about_ca_topic_score_codex":8.4101373e-7,"about_ca_topic_score_gemma":0.00000652481,"teacher_disagreement_score":0.33696377,"about_ca_system_score_codex":0.00014953526,"about_ca_system_score_gemma":0.00005596379,"threshold_uncertainty_score":0.99999875},"labels":[],"label_agreement":null},{"id":"W4243792189","doi":"10.23952/jano.3.2021.1.04","title":"Non-Euclidean proximal methods for convex-concave saddle-point problems","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation; Deutsche Forschungsgemeinschaft","keywords":"Saddle point; Regular polygon; Saddle; Euclidean geometry; Mathematics; Euclidean distance; Point (geometry); Combinatorics; Geometry; Computer science; Mathematical optimization","score_opus":0.04057491881040825,"score_gpt":0.3809193250032356,"score_spread":0.34034440619282735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243792189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016847695,0.0001134025,0.9968184,0.000551962,0.0001061566,0.0005215782,0.000003972717,0.000021505008,0.0016945414],"genre_scores_gemma":[0.0059974194,0.00018713059,0.99319786,0.0001654549,0.00015688052,0.000037616875,0.000013245683,0.00004734369,0.00019705005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838907,0.00006990439,0.00075259694,0.00023619665,0.00028901335,0.00026325256],"domain_scores_gemma":[0.9975605,0.0006723908,0.0005524903,0.00015280499,0.0008601584,0.0002016739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567446,0.00017478915,0.0005230379,0.00012459082,0.0001304325,0.000087339,0.00012193724,0.00012078747,0.000103295504],"category_scores_gemma":[0.00068807666,0.00014819474,0.000116124174,0.00033213606,0.00006697022,0.00022051131,0.000070525144,0.00027780162,0.0000011513982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008190446,0.0007869124,0.000036353096,0.0005793475,0.00034255645,0.000024448414,0.0017403624,0.8473705,0.0070790495,0.029566191,0.0010710573,0.11058419],"study_design_scores_gemma":[0.0026378552,0.00032209916,0.0000109755065,0.000063388994,0.00009627751,0.000104136285,0.00044408717,0.9270068,0.011819449,0.055141725,0.0020950472,0.00025820188],"about_ca_topic_score_codex":2.5618192e-7,"about_ca_topic_score_gemma":6.506672e-8,"teacher_disagreement_score":0.110325985,"about_ca_system_score_codex":0.00007730417,"about_ca_system_score_gemma":0.00015835074,"threshold_uncertainty_score":0.60432065},"labels":[],"label_agreement":null},{"id":"W4244542037","doi":"10.1007/978-1-0716-0843-2_2","title":"Basic Principles","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Maxima and minima; Hessian matrix; Nonlinear programming; Convergence (economics); Mathematics; Point (geometry); Mathematical optimization; Saddle point; Applied mathematics; Nonlinear system; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.10191870608943228,"score_gpt":0.3598995598462783,"score_spread":0.25798085375684604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244542037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041395677,0.00020805081,0.75880706,0.0001657993,0.0005562731,0.0003949685,0.000007776658,0.00012765903,0.23969102],"genre_scores_gemma":[0.00010019705,0.00009247428,0.6966906,0.00010918576,0.0001993536,0.000007961608,0.000004133186,0.00004614351,0.30274993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972198,0.000020889967,0.00042485527,0.00080033584,0.0011082449,0.0004258513],"domain_scores_gemma":[0.99804866,0.00035689038,0.0001666506,0.0009270606,0.000362685,0.00013804254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007809853,0.00025641246,0.00036201434,0.0005103714,0.00013685427,0.00016346641,0.0011069458,0.00013703367,0.0005961652],"category_scores_gemma":[0.00022568765,0.0002532713,0.00006610141,0.00032896083,0.0006213418,0.00024593485,0.001193299,0.0005107321,0.000115395844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002158816,0.000045931596,0.000006650289,0.00008769684,0.000007859397,0.00018612835,0.00022420107,0.005167273,0.000006522668,0.86027616,0.0004678782,0.13352156],"study_design_scores_gemma":[0.00051226444,0.00008282907,0.000058943268,0.0010915791,0.000009701171,0.00009083731,0.000004796197,0.3793399,0.00024332154,0.5471479,0.07046731,0.00095058186],"about_ca_topic_score_codex":9.86866e-7,"about_ca_topic_score_gemma":0.000014007656,"teacher_disagreement_score":0.37417263,"about_ca_system_score_codex":0.00030825412,"about_ca_system_score_gemma":0.00063321175,"threshold_uncertainty_score":0.99999195},"labels":[],"label_agreement":null},{"id":"W4245609702","doi":"10.23952/asvao.3.2021.3.02","title":"A Dai-Liao-like projection method for solving convex constrained nonlinear monotone equations and minimizing the $\\ell_1$-regularized problem","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Petroleum Technology Development Fund; Deutscher Akademischer Austauschdienst","keywords":"Monotone polygon; Regular polygon; Mathematics; Projection (relational algebra); Nonlinear system; Applied mathematics; Projection method; Convex optimization; Convex analysis; Mathematical optimization; Mathematical analysis; Algorithm; Dykstra's projection algorithm; Physics; Geometry","score_opus":0.04316706657146967,"score_gpt":0.3540700728513287,"score_spread":0.310903006279859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245609702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030949796,0.00009364896,0.99697125,0.00057468534,0.00002900222,0.0015572768,0.00004911784,0.00010345161,0.00031207578],"genre_scores_gemma":[0.0058962395,0.00020559152,0.9919037,0.00015579489,0.000066313834,0.00047395282,0.00069340767,0.000055010245,0.00054995314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763453,0.00020507211,0.00069542543,0.0006928855,0.00040613775,0.0003659322],"domain_scores_gemma":[0.99708456,0.0013139873,0.00039202074,0.00040657393,0.000682095,0.00012077092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012998978,0.00029047334,0.0006189573,0.00036076602,0.0008840951,0.00030331133,0.00012462721,0.00017967483,0.00008034355],"category_scores_gemma":[0.00065359473,0.00024381618,0.00016030952,0.0018728453,0.00015072095,0.00020700331,0.00012282314,0.00021338073,8.1633465e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001277684,0.00021628199,0.0000346217,0.00022647427,0.0020280892,0.000002532124,0.0026609234,0.9150108,0.0058754697,0.06102416,0.00007652624,0.012716353],"study_design_scores_gemma":[0.0015887117,0.000029265608,0.000006052442,0.000018596596,0.0015041113,0.0000058242713,0.0022199326,0.9847824,0.001759878,0.0077155805,0.0000971234,0.00027249943],"about_ca_topic_score_codex":0.00001953955,"about_ca_topic_score_gemma":0.00005444783,"teacher_disagreement_score":0.069771625,"about_ca_system_score_codex":0.00006503183,"about_ca_system_score_gemma":0.00015313095,"threshold_uncertainty_score":0.99425346},"labels":[],"label_agreement":null},{"id":"W4245927254","doi":"10.1090/gsm/134/12","title":"Sieve methods","year":2012,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Sieve (category theory); Computer science; Mathematics; Combinatorics","score_opus":0.5356754391031253,"score_gpt":0.5333505902883701,"score_spread":0.0023248488147552537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245927254","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009898702,0.010262314,0.15689154,0.00032001128,0.0011376631,0.002150266,0.000066837005,0.00041607008,0.8287454],"genre_scores_gemma":[0.00000914965,0.007173784,0.6367667,0.000025123645,0.00021816717,0.00008140997,0.000009858687,0.00022150544,0.35549435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961453,0.00013914534,0.0013891475,0.0005396939,0.0009990247,0.00078769133],"domain_scores_gemma":[0.99328136,0.0041137505,0.00072601467,0.0011227007,0.00060044765,0.0001557376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025603208,0.00080001034,0.001718129,0.0005094333,0.00012616265,0.00003018499,0.0005543574,0.00040220958,0.00040174817],"category_scores_gemma":[0.003863596,0.000708004,0.0002778595,0.00017503553,0.0006092348,0.00015034959,0.00081936904,0.0011876397,0.0003533067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080356895,0.00015773007,0.0000010564819,0.0025288698,0.0006589849,0.000054991608,0.0074657304,0.000042266773,0.0000032520832,0.95578235,0.009941178,0.023355538],"study_design_scores_gemma":[0.00033141123,0.000035831847,3.9605692e-7,0.00088075333,0.00017280193,0.000034457644,0.0009970776,0.00096155633,0.0000534679,0.97211236,0.023747047,0.0006728551],"about_ca_topic_score_codex":5.3818496e-7,"about_ca_topic_score_gemma":0.000006291011,"teacher_disagreement_score":0.47987512,"about_ca_system_score_codex":0.00050102914,"about_ca_system_score_gemma":0.00006518894,"threshold_uncertainty_score":0.9995371},"labels":[],"label_agreement":null},{"id":"W4245983062","doi":"10.1090/conm/618/12341","title":"Leah-Cosine and -Sine Functions: Definitions and Elementary Properties","year":2014,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Sine; Trigonometric functions; Pure mathematics; Algebra over a field; Geometry","score_opus":0.10322892663789157,"score_gpt":0.320274741187521,"score_spread":0.2170458145496294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245983062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037211247,0.0035233258,0.6637957,0.0018562321,0.00011064714,0.0037715123,0.00046448383,0.0016720208,0.32443392],"genre_scores_gemma":[0.0012373285,0.0018096736,0.7928312,0.0005931134,0.000357997,0.0005889732,0.00018257058,0.0013975573,0.20100163],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628556,0.00018037617,0.0011802358,0.0008612184,0.00084316416,0.00064943254],"domain_scores_gemma":[0.9962343,0.0011873832,0.0009814615,0.0009927086,0.00016767802,0.00043646793],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007561216,0.0008922046,0.0017581651,0.00023695128,0.0003191601,0.00018796361,0.00036600686,0.0003326673,0.0013638024],"category_scores_gemma":[0.0009868038,0.000741897,0.00028997063,0.0004924084,0.002192536,0.00018176336,0.00050118857,0.00070813723,0.00018516714],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023411989,0.0012160821,0.000038730235,0.009416059,0.0010974058,0.000013208416,0.0021639916,0.0000026065388,0.00008403419,0.081807986,0.90159553,0.0025409488],"study_design_scores_gemma":[0.0047947024,0.0010954281,0.000014628158,0.009332814,0.0011243235,0.00036557417,0.019793704,0.062287647,0.00010829957,0.66016614,0.23616953,0.0047471817],"about_ca_topic_score_codex":0.000031954038,"about_ca_topic_score_gemma":0.000009994335,"teacher_disagreement_score":0.665426,"about_ca_system_score_codex":0.000102660684,"about_ca_system_score_gemma":0.00015034969,"threshold_uncertainty_score":0.9995491},"labels":[],"label_agreement":null},{"id":"W4246818668","doi":"10.23952/jnva.5.2021.1.06","title":"An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Technology (BHU) Varanasi","keywords":"Link (geometry); Computer science; Regression; Inclusion (mineral); Algorithm; Mathematical optimization; Mathematics; Statistics; Psychology","score_opus":0.042115668701450296,"score_gpt":0.35932298012534836,"score_spread":0.3172073114238981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246818668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054245824,0.00014319913,0.992758,0.0011196994,0.000017588804,0.00040856897,0.00009652966,0.000018709976,0.0000131676325],"genre_scores_gemma":[0.00962563,0.00017194512,0.98930806,0.000060658116,0.0004108613,0.000051352483,0.00020842842,0.000024852754,0.00013824046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983063,0.00007014227,0.00062678446,0.0002818529,0.00054208224,0.00017287722],"domain_scores_gemma":[0.9965556,0.00035500893,0.0004649706,0.00015516534,0.0022547825,0.00021443013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092293415,0.00014458987,0.00037221357,0.00042374455,0.0005436697,0.0001556292,0.00010725225,0.00008983286,0.000027931279],"category_scores_gemma":[0.00027713738,0.00010831325,0.00009293005,0.001188238,0.000024525198,0.00042992295,0.00013405678,0.00019728791,2.8878648e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003668878,0.0017519009,0.008633826,0.0006770752,0.004701098,0.000021581114,0.005459196,0.56782794,0.014173385,0.003945258,0.00015831829,0.39228356],"study_design_scores_gemma":[0.0009218801,0.0002657196,0.00094293465,0.00010915689,0.0006220583,0.000044927045,0.00017907996,0.9877737,0.00034857687,0.0076958244,0.0009622606,0.00013386879],"about_ca_topic_score_codex":0.0000041871854,"about_ca_topic_score_gemma":0.000016166434,"teacher_disagreement_score":0.4199458,"about_ca_system_score_codex":0.00007168568,"about_ca_system_score_gemma":0.00018109033,"threshold_uncertainty_score":0.44168863},"labels":[],"label_agreement":null},{"id":"W4249171336","doi":"10.22215/etd/2020-13931","title":"Combining Node and Variable Selection Heuristics for Faster MIP Solutions","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Selection (genetic algorithm); Heuristic; Node (physics); Variable (mathematics); Computer science; Mathematical optimization; Integer (computer science); Algorithm; Mathematics; Artificial intelligence; Engineering","score_opus":0.07614927904686562,"score_gpt":0.3711716278950095,"score_spread":0.2950223488481439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249171336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005208903,0.00005143257,0.9825487,0.00014415113,0.00023529396,0.00079793885,0.000051481406,0.00016958671,0.015949296],"genre_scores_gemma":[0.00042307095,0.000047649257,0.939854,0.00007948146,0.00012390586,0.00020273277,0.001059339,0.00010592148,0.058103874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986977,0.0000373092,0.00034807032,0.00035453663,0.00024941235,0.00031298635],"domain_scores_gemma":[0.9985187,0.0005787298,0.00016333051,0.00013375869,0.0004944507,0.00011103514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016823193,0.00021611211,0.0003170129,0.00013328278,0.00031552344,0.00009581431,0.00010363021,0.00024501616,0.00019956284],"category_scores_gemma":[0.0013390236,0.00022578795,0.00005022138,0.00026386825,0.000020827683,0.00011058796,0.000035719393,0.00032027607,0.000011909174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035998056,0.0003471172,0.00004143632,0.004357367,0.000415292,0.0000030952083,0.0025703306,0.0031250939,0.0016768712,0.9329367,0.04929966,0.0048670257],"study_design_scores_gemma":[0.0013317979,0.00017565841,0.000014418461,0.0001760238,0.00020992264,0.000007741855,0.0015034038,0.80078715,0.0009101097,0.17958696,0.01472229,0.00057454064],"about_ca_topic_score_codex":0.0000070669917,"about_ca_topic_score_gemma":0.000039551865,"teacher_disagreement_score":0.797662,"about_ca_system_score_codex":0.00007114528,"about_ca_system_score_gemma":0.00015127767,"threshold_uncertainty_score":0.92073655},"labels":[],"label_agreement":null},{"id":"W4249641980","doi":"10.1007/978-1-4757-3441-6_19","title":"Sieve Methods","year":2001,"lang":"en","type":"book-chapter","venue":"Graduate texts in mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.22149927941624456,"score_gpt":0.44580434598167945,"score_spread":0.2243050665654349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249641980","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054168527,0.00021380773,0.33698973,0.00016579502,0.00018431182,0.0009987287,0.000032053427,0.00025181985,0.6611583],"genre_scores_gemma":[0.0000051572792,0.00069719116,0.540347,0.000033254153,0.000108150285,0.00004253799,0.000023400129,0.00025871882,0.45848462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956663,0.0001237359,0.0015290902,0.0007262695,0.0012042791,0.00075030996],"domain_scores_gemma":[0.9948512,0.0023076637,0.0007546621,0.0014898778,0.0003800428,0.000216593],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018975569,0.000828789,0.0013894069,0.0007739417,0.00008965361,0.00008651925,0.0008248412,0.0006726444,0.0021648335],"category_scores_gemma":[0.001746011,0.00079845474,0.00030009297,0.00025524973,0.00026640817,0.00015146934,0.000411744,0.0015495527,0.0007069693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010509525,0.00021126801,6.031955e-7,0.0008749615,0.00012651937,0.00021313228,0.0012256647,0.00018517471,0.0000075277826,0.953766,0.0068125706,0.036566086],"study_design_scores_gemma":[0.00045186406,0.000044215078,5.609779e-7,0.0006954805,0.00007484046,0.00008449422,0.00008531686,0.012108086,0.00006110768,0.9474032,0.03824905,0.00074180047],"about_ca_topic_score_codex":0.0000021507758,"about_ca_topic_score_gemma":0.000011265193,"teacher_disagreement_score":0.20335722,"about_ca_system_score_codex":0.00041588277,"about_ca_system_score_gemma":0.00014016786,"threshold_uncertainty_score":0.99944663},"labels":[],"label_agreement":null},{"id":"W4250020400","doi":"10.1007/978-1-4615-0011-7_15","title":"Orientation","year":2001,"lang":"en","type":"book-chapter","venue":"Applied optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lexicographical order; Parametric statistics; Stability (learning theory); Parametric programming; Orientation (vector space); Inverse; Linear programming; Mathematical optimization; Computer science; Section (typography); Inverse problem; Nonlinear programming; Mathematics; Applied mathematics; Nonlinear system; Geometry; Mathematical analysis; Combinatorics; Physics; Statistics; Machine learning","score_opus":0.04712770410238021,"score_gpt":0.3236016807271862,"score_spread":0.276473976624806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250020400","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3318991e-7,0.000023710281,0.50069,0.00003988515,0.00008587366,0.00055668916,0.000012818921,0.00020131326,0.49838957],"genre_scores_gemma":[0.00002722744,0.00050223625,0.4535478,0.00009083834,0.00027903361,0.00008256306,0.00079466944,0.00024348115,0.5444321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977006,0.000014597339,0.0005971096,0.0006134444,0.000752011,0.00032227612],"domain_scores_gemma":[0.9981907,0.00021807232,0.00047030178,0.0006129286,0.00037513732,0.00013285017],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020546993,0.00043558874,0.00043273834,0.00036214315,0.00017830123,0.00007535169,0.00025675664,0.0005152291,0.005932213],"category_scores_gemma":[0.00011373562,0.0004789665,0.00009937255,0.00015748266,0.00009927288,0.00015642478,0.0001056816,0.000434319,0.00035863064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029537543,0.000026061878,3.1342861e-7,0.000045497734,0.000047212478,0.0000069105213,0.00006578854,0.25033242,0.0000036967424,0.73719877,0.0043739867,0.007869818],"study_design_scores_gemma":[0.0014187306,0.00006542127,4.5384232e-7,0.00012057102,0.00018067,0.000021206644,0.000049151568,0.12826072,0.00010506659,0.7211777,0.1473902,0.0012101287],"about_ca_topic_score_codex":9.364673e-7,"about_ca_topic_score_gemma":0.0000018487651,"teacher_disagreement_score":0.14301622,"about_ca_system_score_codex":0.00028897656,"about_ca_system_score_gemma":0.00009798824,"threshold_uncertainty_score":0.99976623},"labels":[],"label_agreement":null},{"id":"W4250986753","doi":"10.23952/jnva.2.2018.3.07","title":"Lagrange theory of discrete-continuous nonlinear optimization","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nonlinear system; Mathematics; Nonlinear programming; Applied mathematics; Mathematical optimization; Computer science; Physics","score_opus":0.027805619708348432,"score_gpt":0.3389488576353638,"score_spread":0.31114323792701537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250986753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010340498,0.00009062575,0.9886833,0.00027652338,0.00005584447,0.000075288495,0.00006474975,0.000008485611,0.00040472142],"genre_scores_gemma":[0.047280967,0.00013665897,0.9513759,0.000048394744,0.0006098469,0.0000012393947,0.000037383645,0.000018576242,0.00049100665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825186,0.00016498895,0.000736539,0.00013662226,0.0005730168,0.00013697607],"domain_scores_gemma":[0.9966536,0.0006316782,0.0007420561,0.00015556812,0.0017160431,0.00010104452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011764818,0.00011888744,0.00045650318,0.0005787712,0.00009840011,0.00003213686,0.00016526824,0.00007743897,0.0006852819],"category_scores_gemma":[0.0011869557,0.00009176869,0.00023479063,0.0010282663,0.00012862906,0.00026251984,0.000049168437,0.00015292034,0.000002309346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031947012,0.0037691465,0.035093747,0.00038899848,0.023756314,0.00006399026,0.0066160224,0.76709944,0.0013310594,0.13075037,0.0009835326,0.026952686],"study_design_scores_gemma":[0.00092644256,0.00024423443,0.0023106423,0.000027108505,0.0013732116,0.000021759999,0.00023246011,0.9768329,0.00025304712,0.017338712,0.00029118225,0.00014825366],"about_ca_topic_score_codex":0.0000050765607,"about_ca_topic_score_gemma":0.0000079228075,"teacher_disagreement_score":0.20973352,"about_ca_system_score_codex":0.000029311608,"about_ca_system_score_gemma":0.00009267108,"threshold_uncertainty_score":0.75033563},"labels":[],"label_agreement":null},{"id":"W4251102484","doi":"10.23952/jano.3.2021.1.03","title":"Data-compatibility of algorithms for constrained convex optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Compatibility (geochemistry); Algorithm; Regular polygon; Mathematical optimization; Computer science; Convex optimization; Mathematics; Materials science; Geometry; Composite material","score_opus":0.09222090177705922,"score_gpt":0.3793088991012824,"score_spread":0.2870879973242232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251102484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024827576,0.000092990296,0.9983275,0.00026785434,0.00009557277,0.0003370004,0.000107731306,0.00001718043,0.0005059143],"genre_scores_gemma":[0.021202026,0.00020390683,0.9781974,0.000057410205,0.00010131366,0.0000067589745,0.00017108311,0.000028847979,0.000031274853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980893,0.00006862567,0.00096497085,0.00027403937,0.00041698996,0.00018605501],"domain_scores_gemma":[0.99665874,0.0007939214,0.0007991584,0.00033872895,0.001266365,0.00014308059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125672,0.0001532385,0.0005708952,0.00011805224,0.000087058455,0.000041153686,0.00022099451,0.00010983508,0.00017474766],"category_scores_gemma":[0.0012659268,0.00013769756,0.00007191883,0.0003734596,0.00013603288,0.00030571356,0.00010517708,0.00017523256,2.5948557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024801344,0.00029952335,0.000017353354,0.0001319712,0.00008833467,0.00000328922,0.00012416154,0.9866617,0.00024852637,0.0046193507,0.00024641227,0.0073113777],"study_design_scores_gemma":[0.0018580322,0.00013252026,0.000009506036,0.000031353662,0.00008339093,0.00003281199,0.00027766643,0.9886332,0.0017375511,0.006825592,0.00024341152,0.0001349641],"about_ca_topic_score_codex":5.5554324e-7,"about_ca_topic_score_gemma":1.6317281e-7,"teacher_disagreement_score":0.02095375,"about_ca_system_score_codex":0.000043355354,"about_ca_system_score_gemma":0.00022986345,"threshold_uncertainty_score":0.5615144},"labels":[],"label_agreement":null},{"id":"W4251314684","doi":"10.23952/jano.1.2019.1.05","title":"Three convergence results for continuous descent methods with a convex objective function","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Convergence (economics); Mathematics; Function (biology); Convex function; Regular polygon; Mathematical optimization; Applied mathematics; Computer science; Economics; Physics; Geometry; Biology","score_opus":0.026549802017938412,"score_gpt":0.336297206979644,"score_spread":0.3097474049617056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251314684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011957847,0.000039734394,0.9969874,0.00013317275,0.00013348846,0.0007402937,0.000005777714,0.000022246502,0.00074207096],"genre_scores_gemma":[0.06492126,0.000056855322,0.93473655,0.00007190499,0.00007623083,0.00002120156,0.000007224001,0.000030044523,0.00007874523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.000034754077,0.0005197823,0.00021665935,0.00031293172,0.00019611848],"domain_scores_gemma":[0.99772674,0.0007094819,0.0006276766,0.00013347094,0.0006803951,0.0001222542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006802207,0.00014935757,0.00041797766,0.0001207367,0.00007831993,0.000040965388,0.00009360734,0.000086621636,0.000048927996],"category_scores_gemma":[0.00028718956,0.0001097529,0.000055302346,0.00026396208,0.00005747781,0.00019652136,0.000027008356,0.0002020034,0.0000019967345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01904687,0.00041807117,0.00019982886,0.00019264664,0.00036237802,0.0000046354075,0.0009304154,0.9160373,0.0016913828,0.023630757,0.0007366894,0.036748987],"study_design_scores_gemma":[0.007042913,0.002033793,0.0001685396,0.000073551164,0.00013876297,0.000041359905,0.00061464997,0.96176237,0.0024448738,0.024499103,0.0008872929,0.00029277703],"about_ca_topic_score_codex":0.0000010079865,"about_ca_topic_score_gemma":2.5812503e-7,"teacher_disagreement_score":0.06372548,"about_ca_system_score_codex":0.000072352654,"about_ca_system_score_gemma":0.00008056332,"threshold_uncertainty_score":0.44755933},"labels":[],"label_agreement":null},{"id":"W4255476075","doi":"10.1090/fic/055/02","title":"Finite algorithms for global minimization of separable concave programs","year":2009,"lang":"en","type":"other","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Separable space; Minification; Computer science; Algorithm; Mathematical optimization; Mathematics; Programming language","score_opus":0.07428065966584009,"score_gpt":0.3978113424582844,"score_spread":0.32353068279244435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255476075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.859785e-8,0.00013370268,0.6307711,0.000034796507,0.00007857847,0.001569326,0.00014658076,0.0002464605,0.36701936],"genre_scores_gemma":[0.0000016260336,0.000086404296,0.52470917,0.000024458797,0.00009793256,0.000092425595,0.00025189278,0.00019004226,0.47454605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982085,0.0000483604,0.00048182852,0.00039939742,0.0004703881,0.0003914958],"domain_scores_gemma":[0.99841577,0.00023278389,0.00045478877,0.00044187068,0.00034694452,0.00010782067],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016004582,0.0003145872,0.0005964228,0.00015892759,0.000035823963,0.00003194006,0.0002803831,0.0004232223,0.0015669159],"category_scores_gemma":[0.00046632264,0.00028882886,0.00015469472,0.0004326177,0.000100365614,0.0000562607,0.00004848722,0.00010752508,0.00002352428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000577386,0.00064424955,0.000018600784,0.00091705495,0.00026825696,0.0000046587543,0.00006364346,0.0016235105,0.0000011662653,0.047567517,0.7873875,0.1614461],"study_design_scores_gemma":[0.0028059906,0.00046920465,0.0000021527248,0.0004819064,0.00013779227,0.000006023441,0.00010853888,0.20194367,0.00014515565,0.079543225,0.713585,0.000771316],"about_ca_topic_score_codex":0.000018534593,"about_ca_topic_score_gemma":0.000042567273,"teacher_disagreement_score":0.20032015,"about_ca_system_score_codex":0.00010548844,"about_ca_system_score_gemma":0.00014688467,"threshold_uncertainty_score":0.99995637},"labels":[],"label_agreement":null},{"id":"W4255644217","doi":"10.22215/etd/2012-07383","title":"Achieving integer feasibility quickly by alternating axis-parallel and general disjunctions","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Integer (computer science); Computer science; Combinatorics; Reel; Mathematics; Humanities; Physics; Arithmetic; Art; Operating system; Visual arts","score_opus":0.05953614749201604,"score_gpt":0.40005206835870577,"score_spread":0.34051592086668975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255644217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32548162,0.0013817771,0.61510336,0.00025140503,0.0013024292,0.002033113,0.00012084348,0.0005387461,0.053786706],"genre_scores_gemma":[0.036900245,0.00044042853,0.5114043,0.0000825614,0.00064224,0.00027673453,0.0022247727,0.00028778153,0.44774094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997666,0.00012794518,0.0005946185,0.00055260083,0.0005514196,0.0005073855],"domain_scores_gemma":[0.9983189,0.00036266513,0.00030888527,0.00046289893,0.00030309288,0.00024353046],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004537608,0.00039159675,0.00045317126,0.00017562405,0.00030277713,0.00012494193,0.00024735808,0.00029900105,0.0010790852],"category_scores_gemma":[0.0009533575,0.00035167276,0.00011130223,0.00020439138,0.0000610365,0.0004174346,0.000102518745,0.00071099825,0.000035525987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002141638,0.009184184,0.08203711,0.014861325,0.0039436375,0.00005637149,0.03000308,0.0069921683,0.034644898,0.3930113,0.19391295,0.22921132],"study_design_scores_gemma":[0.023597687,0.0017250892,0.085177384,0.004254609,0.0030111794,0.00034492387,0.04859483,0.49225873,0.009231579,0.25411284,0.054720268,0.022970878],"about_ca_topic_score_codex":0.00011810188,"about_ca_topic_score_gemma":0.000344346,"teacher_disagreement_score":0.48526657,"about_ca_system_score_codex":0.00020863806,"about_ca_system_score_gemma":0.00007727983,"threshold_uncertainty_score":0.99989355},"labels":[],"label_agreement":null},{"id":"W4255744498","doi":"10.1007/978-1-4757-9859-3_8","title":"Fixed Points","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Fixed point; Identity (music); Mathematics; Point (geometry); Fixed-point theorem; Nonlinear system; Function (biology); Identity function; Combinatorics; Pure mathematics; Mathematical analysis; Discrete mathematics; Geometry; Physics; Quantum mechanics","score_opus":0.07400636918026855,"score_gpt":0.3506037649884375,"score_spread":0.27659739580816894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255744498","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8123447e-7,0.00004808226,0.033502746,0.00020026273,0.000051978288,0.00032798274,0.000025542233,0.00022221525,0.965621],"genre_scores_gemma":[0.0000010464212,0.0002817041,0.2121065,0.000118163356,0.000096847434,0.0000069586067,0.000030179464,0.00010573854,0.78725284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863863,0.0000107989135,0.00031945048,0.0003130013,0.00048637984,0.00023175766],"domain_scores_gemma":[0.99888515,0.00024033297,0.00009364082,0.0005372117,0.00012881841,0.00011482131],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010367097,0.00025955314,0.00033010417,0.00016999613,0.000055712015,0.00002807217,0.00024120751,0.0002951581,0.10417772],"category_scores_gemma":[0.000103249055,0.000234862,0.00011711736,0.000025739895,0.00006903728,0.00006430498,0.00008235074,0.00039250025,0.003885556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010518874,0.000015646941,9.4156434e-8,0.000032677104,0.00004598307,0.000027704926,0.00002179469,0.000022034197,5.5971105e-7,0.94411683,0.036459163,0.019246964],"study_design_scores_gemma":[0.00015919746,0.00001519956,9.791183e-8,0.000043152737,0.0000109976545,0.0000074797044,0.0000018077271,0.00047746985,0.000017946431,0.64116687,0.35790133,0.00019847845],"about_ca_topic_score_codex":0.0000010574599,"about_ca_topic_score_gemma":0.00000486406,"teacher_disagreement_score":0.32144216,"about_ca_system_score_codex":0.000083499704,"about_ca_system_score_gemma":0.00006483036,"threshold_uncertainty_score":0.99689},"labels":[],"label_agreement":null},{"id":"W4256604359","doi":"10.23952/asvao.2.2020.1.06","title":"An improvement LQP method for nonlinear complementarity problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Complementarity (molecular biology); Nonlinear system; Computer science; Mathematical optimization; Mathematics; Biology; Physics","score_opus":0.06741134093738951,"score_gpt":0.3885541585613846,"score_spread":0.3211428176239951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256604359","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039574972,0.000013216839,0.9972825,0.0005002199,0.0000125576635,0.0013601392,0.00018117912,0.0001285375,0.00012587254],"genre_scores_gemma":[0.007384807,0.000044996897,0.98967546,0.0006120307,0.000099618985,0.00023179034,0.0018657427,0.000049394486,0.00003613313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791515,0.000087594664,0.0005919243,0.00065850385,0.00041502767,0.00033177168],"domain_scores_gemma":[0.9986551,0.0001752059,0.00027472078,0.00033446352,0.00029555752,0.00026494844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006879036,0.00024785902,0.000529968,0.00020628334,0.00031026456,0.0001444526,0.00020989748,0.0000960781,0.0002733376],"category_scores_gemma":[0.00011275571,0.00023560897,0.00012856512,0.0011715188,0.00004399821,0.00019090543,0.00008868226,0.00014124914,0.0000019167117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067748806,0.00014550907,0.000054043405,0.00010700296,0.00056464376,2.7160166e-7,0.0007493501,0.9820881,0.000867575,0.0075266287,0.00013222717,0.0076968893],"study_design_scores_gemma":[0.0012411391,0.0001854408,0.000008680902,0.0000029829403,0.00077701465,1.9891297e-7,0.0005267407,0.9922286,0.0012400199,0.0031587018,0.0003664867,0.00026396164],"about_ca_topic_score_codex":0.000032286993,"about_ca_topic_score_gemma":0.00004241398,"teacher_disagreement_score":0.010140522,"about_ca_system_score_codex":0.00005980802,"about_ca_system_score_gemma":0.00003758583,"threshold_uncertainty_score":0.9607855},"labels":[],"label_agreement":null},{"id":"W4281980926","doi":"10.1007/s10898-022-01179-3","title":"Discretization and global optimization for mixed integer bilinear programming","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discretization; Mathematics; Bilinear interpolation; Discretization of continuous features; Integer programming; Mathematical optimization; Global optimization; Integer (computer science); Linear programming; Applied mathematics; Computer science; Mathematical analysis; Discretization error","score_opus":0.02840875571746555,"score_gpt":0.3570433572984689,"score_spread":0.3286346015810034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281980926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012044472,0.00021329924,0.9960971,0.0008943318,0.00043423587,0.0008388964,0.00011283895,0.000059009475,0.00014587889],"genre_scores_gemma":[0.025640298,0.00010973191,0.97372407,0.00007617248,0.00016901852,0.00006216697,0.000108411135,0.00003927421,0.00007086474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748856,0.00023231484,0.00089361676,0.00027513245,0.00078807044,0.000322286],"domain_scores_gemma":[0.9973906,0.0001842914,0.00092063344,0.00018551188,0.0011470624,0.00017186714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096478406,0.0002183301,0.00037087203,0.00012644702,0.00041894498,0.00014526137,0.0002685563,0.000091995804,0.00016548595],"category_scores_gemma":[0.0017363417,0.00021104932,0.00013529403,0.0011119182,0.00008127122,0.00064094213,0.00018421486,0.00020624542,4.0511077e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003012539,0.00020380595,0.00063761155,0.000051841787,0.0000583839,0.000005144028,0.00007083854,0.9831442,0.000002493504,0.0082869055,0.0007993093,0.0064382176],"study_design_scores_gemma":[0.0018824636,0.0005250164,0.000032400716,0.00003310426,0.000092240174,0.00019434719,0.0006088501,0.9890271,0.000011292756,0.0060802787,0.0013011482,0.00021176814],"about_ca_topic_score_codex":0.0000036042074,"about_ca_topic_score_gemma":0.0000040236055,"teacher_disagreement_score":0.02443585,"about_ca_system_score_codex":0.0008979564,"about_ca_system_score_gemma":0.00023888778,"threshold_uncertainty_score":0.8606342},"labels":[],"label_agreement":null},{"id":"W4285036071","doi":"10.1007/978-3-031-04520-2_11","title":"QUBO Software","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Clique; Bilinear interpolation; Computer science; Set (abstract data type); Compiler; Software; Mathematical optimization; Theoretical computer science; Mathematics; Algorithm; Programming language; Combinatorics","score_opus":0.08501871242588192,"score_gpt":0.3535896069970601,"score_spread":0.26857089457117816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285036071","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.781905e-8,0.0000974904,0.16037373,0.00012378262,0.000115564835,0.00032434144,0.000061864885,0.0003370727,0.8385661],"genre_scores_gemma":[1.7839999e-7,0.00014897644,0.3040196,0.00008727364,0.00007052372,0.000024448958,0.000063158266,0.000119181925,0.69546664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984111,0.000014402047,0.00029187568,0.00033864658,0.0007231363,0.00022084158],"domain_scores_gemma":[0.9986244,0.00042310226,0.00013236825,0.00057999184,0.00014442373,0.000095708165],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014385808,0.00024371973,0.00031260547,0.00018536524,0.00013724163,0.000023348912,0.00032584567,0.00016905008,0.1875954],"category_scores_gemma":[0.00032070585,0.00023786438,0.00013179267,0.000036112033,0.000055862416,0.000074255186,0.00040019723,0.00063648884,0.00057193753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004612356,0.000013297248,3.2826716e-7,0.00005620141,0.00004372587,0.000035942416,0.00002786879,0.00010803322,1.5529109e-7,0.9463498,0.04474406,0.00861597],"study_design_scores_gemma":[0.000097737255,0.000020924706,5.08773e-8,0.000012130069,0.000011078686,0.0000080713635,0.0000070683277,0.00015956156,0.00000248375,0.41470787,0.58478755,0.00018546505],"about_ca_topic_score_codex":0.0000022590443,"about_ca_topic_score_gemma":0.0000062438985,"teacher_disagreement_score":0.5400435,"about_ca_system_score_codex":0.00020562424,"about_ca_system_score_gemma":0.00011404872,"threshold_uncertainty_score":0.9699828},"labels":[],"label_agreement":null},{"id":"W4285554418","doi":"10.1007/978-1-0716-0843-2","title":"Practical Optimization","year":2021,"lang":"en","type":"book","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Computer science","score_opus":0.08890308582327774,"score_gpt":0.4166537509413963,"score_spread":0.32775066511811857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285554418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011709141,0.000040909614,0.9465995,0.00030244474,0.00045110774,0.00031869658,0.0000033647975,0.00009156957,0.05219123],"genre_scores_gemma":[0.0000049779787,0.000057391087,0.8658715,0.000119592776,0.00023301464,0.000011810569,0.000013875159,0.000036585865,0.13365127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969271,0.0000771154,0.00043670184,0.0008027147,0.0012959057,0.00046049722],"domain_scores_gemma":[0.9975694,0.0007341898,0.00019833501,0.00077281165,0.0005750596,0.0001502374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423332,0.0002330703,0.00035201042,0.0005218312,0.00016130669,0.00025138032,0.0007089594,0.00019009618,0.0004377863],"category_scores_gemma":[0.000992285,0.00023847196,0.000051578983,0.0009204245,0.0005565165,0.0005311223,0.00084767165,0.00065984356,0.000052388088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010398689,0.00037159707,0.000004908608,0.00024764054,0.000019934005,0.0006136851,0.00057260337,0.7173644,0.0000032302974,0.12875412,0.0675458,0.08449167],"study_design_scores_gemma":[0.00021101483,0.00003324033,0.0000024131998,0.00023147637,0.0000049580976,0.00006174681,0.000002566064,0.9575393,0.000023747716,0.037461445,0.004147181,0.0002808773],"about_ca_topic_score_codex":6.3697973e-7,"about_ca_topic_score_gemma":0.000003397897,"teacher_disagreement_score":0.24017493,"about_ca_system_score_codex":0.00068686425,"about_ca_system_score_gemma":0.0028546932,"threshold_uncertainty_score":0.9724604},"labels":[],"label_agreement":null},{"id":"W4286984759","doi":"10.1007/s12532-024-00274-8","title":"LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Integer (computer science); Piecewise linear function; Mathematical optimization; Integer programming; Piecewise; Mathematics; Approximations of π; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.05488586377177668,"score_gpt":0.3800281116634619,"score_spread":0.3251422478916852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286984759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034733352,0.000022556198,0.990921,0.0004830986,0.0000722557,0.0037452444,0.0000061518454,0.00035332507,0.0009230258],"genre_scores_gemma":[0.07382511,0.0000015011121,0.92491335,0.00013712302,0.000053855707,0.00061022304,0.000049261656,0.00006113832,0.00034845158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752486,0.0001356501,0.0007550225,0.00063693756,0.00050337805,0.00044414363],"domain_scores_gemma":[0.9981109,0.00047877748,0.00016877652,0.00032067238,0.0006517854,0.00026912006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006735156,0.00030746358,0.0004254258,0.00059559225,0.00031905872,0.00019809614,0.000227336,0.0001555438,0.000009401065],"category_scores_gemma":[0.0015625701,0.00030453716,0.00006679402,0.0016399099,0.000056077988,0.00027770424,0.00025707833,0.0002374136,0.000046414432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029271905,0.00048625984,0.000007649037,0.0006065337,0.00003568157,6.0342614e-7,0.0009887944,0.9281734,0.000082954146,0.04310899,0.00009231608,0.02638751],"study_design_scores_gemma":[0.00040670618,0.000057967223,0.000005173865,0.00018089914,0.000059020032,0.000009903776,0.00041501783,0.97396946,0.00017636253,0.024273876,0.00017700439,0.00026859358],"about_ca_topic_score_codex":0.0000024881185,"about_ca_topic_score_gemma":9.658866e-7,"teacher_disagreement_score":0.07035178,"about_ca_system_score_codex":0.0002095459,"about_ca_system_score_gemma":0.000067417255,"threshold_uncertainty_score":0.9999407},"labels":[],"label_agreement":null},{"id":"W4289761545","doi":"","title":"On relaxation Methods for Mathematical Programs with Complementarity Constraints","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Complementarity (molecular biology); Computer science; Relaxation (psychology); Mathematical optimization; Mixed complementarity problem; Mathematics; Physics; Psychology","score_opus":0.07722952205280084,"score_gpt":0.3908287178231054,"score_spread":0.3135991957703046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289761545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025372824,0.00003096642,0.97160006,0.0027406677,0.000087554115,0.0026920012,0.000095675394,0.00032262778,0.019893188],"genre_scores_gemma":[0.010170497,0.000028749679,0.9846886,0.000054106717,0.000027415168,0.0007151132,0.00087285176,0.000105876694,0.0033367896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923481,0.004820455,0.00075394276,0.0009226901,0.0006463529,0.00050848565],"domain_scores_gemma":[0.9851485,0.0075136563,0.00081396714,0.0020317389,0.0042639836,0.00022818253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00841163,0.00043149502,0.00058150286,0.0002105563,0.00043931833,0.0003576592,0.00097523903,0.00031355876,0.00060179393],"category_scores_gemma":[0.008068305,0.0003937175,0.00019105317,0.0003256409,0.00082753884,0.0001135558,0.000781614,0.0007304945,0.00003169228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081789636,0.0016408947,0.000079136174,0.00076683424,0.00021595384,0.0000018380925,0.0040754816,0.000088964705,0.00009559416,0.83981216,0.0011296594,0.15201168],"study_design_scores_gemma":[0.0016771624,0.0000072372145,0.000059429447,0.003032362,0.00011341669,0.00001461755,0.00021263289,0.16697334,0.011482438,0.81253266,0.003237602,0.0006571257],"about_ca_topic_score_codex":0.000038525526,"about_ca_topic_score_gemma":0.00019871717,"teacher_disagreement_score":0.16688436,"about_ca_system_score_codex":0.0002806365,"about_ca_system_score_gemma":0.00033714608,"threshold_uncertainty_score":0.99985147},"labels":[],"label_agreement":null},{"id":"W4292532313","doi":"","title":"A Tridiagonalization Method for Symmetric and Quasi-Definite Saddle-Point Systems (CM 2018, Colorado, USA)","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Saddle point; Saddle; Mathematics; Point (geometry); Computer science; Applied mathematics; Mathematical optimization; Geometry","score_opus":0.06057901175459567,"score_gpt":0.3388780854557997,"score_spread":0.27829907370120405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292532313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014137082,0.0013853712,0.98471713,0.0023625228,0.00038487805,0.0024650872,0.0003337285,0.00024730104,0.006690299],"genre_scores_gemma":[0.0109882895,0.0015488354,0.97217786,0.00006666265,0.000099109544,0.0008577753,0.00080566725,0.00017215937,0.013283614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989725,0.0066436483,0.0010759922,0.0011699422,0.0008087003,0.0005767283],"domain_scores_gemma":[0.979496,0.011172201,0.0011535037,0.0021405562,0.005714833,0.00032293168],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.012544437,0.00050972187,0.00082818023,0.00078227854,0.00053919,0.00069271005,0.0010518405,0.00053729006,0.000119665405],"category_scores_gemma":[0.015063015,0.0005394118,0.00022799044,0.0010426686,0.0003037402,0.00023452181,0.001403487,0.0006149044,0.000036442503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016077787,0.0021554034,0.00057999726,0.0042315256,0.00055029476,0.000007440699,0.008514151,0.0016972603,0.00038523768,0.90925413,0.01667193,0.055791862],"study_design_scores_gemma":[0.0016296641,0.000005101734,0.000119144126,0.0019332694,0.0001606018,0.000028048415,0.00021292837,0.8937641,0.0036078517,0.08208149,0.0156634,0.00079444493],"about_ca_topic_score_codex":0.00041482618,"about_ca_topic_score_gemma":0.0003470489,"teacher_disagreement_score":0.8920668,"about_ca_system_score_codex":0.0003477173,"about_ca_system_score_gemma":0.00043985219,"threshold_uncertainty_score":0.99970573},"labels":[],"label_agreement":null},{"id":"W4293258886","doi":"10.1090/surv/146","title":"Positive Polynomials and Sums of Squares","year":2008,"lang":"en","type":"book","venue":"Mathematical surveys and monographs","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":255,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics","score_opus":0.05006270308788904,"score_gpt":0.32352530863626594,"score_spread":0.27346260554837687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293258886","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009174401,0.008157345,0.5572439,0.00028408898,0.00019611958,0.004916099,0.0023322941,0.00038956778,0.41730618],"genre_scores_gemma":[0.008048155,0.017591583,0.35742992,0.00010845618,0.00031997747,0.00023069372,0.00051857124,0.0006665556,0.6150861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975273,0.00043519094,0.000747193,0.0004344757,0.0005004568,0.00035537969],"domain_scores_gemma":[0.9958875,0.0028990498,0.00033594412,0.00039072905,0.00024289307,0.00024383937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014782696,0.00040743558,0.0010930172,0.000345671,0.0001275028,0.00004394979,0.0001749241,0.00038450904,0.00014985015],"category_scores_gemma":[0.0007234339,0.00034187932,0.00016832944,0.0001623928,0.0007770808,0.00009370299,0.00022289963,0.00035362825,0.0000074654963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015142199,0.001091566,0.0006888534,0.008716056,0.0018958341,0.00018228506,0.0052120057,0.000011126943,0.0001579057,0.8540013,0.042920038,0.084971644],"study_design_scores_gemma":[0.0010331704,0.00034467434,0.0006099973,0.00091382937,0.00016416269,0.00010249587,0.00011798516,0.0010759459,0.00042483717,0.99242085,0.0019430338,0.0008490089],"about_ca_topic_score_codex":0.000008871287,"about_ca_topic_score_gemma":0.000007319466,"teacher_disagreement_score":0.19981396,"about_ca_system_score_codex":0.000032157215,"about_ca_system_score_gemma":0.000095045034,"threshold_uncertainty_score":0.9999033},"labels":[],"label_agreement":null},{"id":"W4293508721","doi":"10.48550/arxiv.1803.02414","title":"A gradient method in a Hilbert space with an optimized inner product:\\n achieving a Newton-like convergence","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Ottawa","funders":"","keywords":"Mathematics; Linear subspace; Gradient descent; Hilbert space; Applied mathematics; Subspace topology; Projection (relational algebra); Convergence (economics); Inner product space; Parameterized complexity; Mathematical analysis; Combinatorics; Algorithm; Pure mathematics; Computer science","score_opus":0.09506485481533279,"score_gpt":0.27444727881625036,"score_spread":0.17938242400091758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293508721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09793629,0.00008015399,0.89562696,0.0004459546,0.0005684644,0.0037643216,0.00004380678,0.00024959538,0.0012844364],"genre_scores_gemma":[0.20822756,0.0011973879,0.7663192,0.00012533393,0.0002694953,0.000040046038,0.000093672665,0.0003578075,0.023369506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98994285,0.002086956,0.0011167147,0.0043801945,0.00063621765,0.0018370678],"domain_scores_gemma":[0.9912513,0.00086906465,0.0013175121,0.0038079123,0.0017351102,0.0010190891],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0024136528,0.0014789702,0.0019023677,0.0016005887,0.00054695253,0.00024032393,0.0024526955,0.00069848,0.0012003034],"category_scores_gemma":[0.0009630416,0.0015826636,0.0003539005,0.004221892,0.0010732184,0.001439424,0.0026117316,0.002520521,0.00017319118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003289357,0.0016341397,0.001880051,0.00073841494,0.00048763902,0.0009901635,0.0037138583,0.9691189,0.000072045514,0.01744659,0.00021455067,0.0004142762],"study_design_scores_gemma":[0.0053933626,0.00075302843,0.0002370366,0.0010342167,0.00039321455,0.00007459488,0.0017202182,0.977171,0.0003262596,0.009897548,0.0010805242,0.0019189757],"about_ca_topic_score_codex":0.00075551635,"about_ca_topic_score_gemma":0.0007805731,"teacher_disagreement_score":0.12930779,"about_ca_system_score_codex":0.0017062824,"about_ca_system_score_gemma":0.0014016115,"threshold_uncertainty_score":0.999796},"labels":[],"label_agreement":null},{"id":"W4296640280","doi":"10.1016/j.cam.2022.114833","title":"An accelerated Sobolev gradient method for unconstrained optimization problems based on variable inner products","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sobolev space; Applied mathematics; Gradient descent; Gradient method; Proximal Gradient Methods; Convergence (economics); Projection (relational algebra); Rate of convergence; Conjugate gradient method; Mathematical analysis; Mathematical optimization; Algorithm; Geometry","score_opus":0.05600105146265033,"score_gpt":0.3462066880104404,"score_spread":0.2902056365477901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296640280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071259704,0.000008272167,0.9973532,0.0005041015,0.00006986172,0.0008367156,0.000042857533,0.00003268345,0.0004396915],"genre_scores_gemma":[0.0130611025,0.0000016529192,0.9863544,0.00017893856,0.000084588886,0.00011288556,0.000070200644,0.000043386783,0.00009280623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980649,0.00008248088,0.00071748835,0.00020697944,0.000726846,0.00020134641],"domain_scores_gemma":[0.9972016,0.0010802222,0.0006847047,0.00014291816,0.00077775196,0.00011276392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015292814,0.00017632218,0.00036219502,0.00028768732,0.00034390783,0.00008103631,0.00020184815,0.00004170221,0.00010154099],"category_scores_gemma":[0.0002860118,0.00015214077,0.000047381534,0.00048429274,0.00004253667,0.00013023757,0.0000422432,0.0002634608,3.660306e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009953911,0.0007992258,4.998752e-7,0.00021545404,0.000038898113,0.0000012224509,0.00039515973,0.8766892,0.00020474175,0.11997868,0.00045151057,0.0011258947],"study_design_scores_gemma":[0.0013771385,0.00035088713,8.1081413e-7,0.000025090128,0.00003321478,0.000041120977,0.0002996964,0.7412043,0.00021604735,0.25609857,0.00022991613,0.00012317626],"about_ca_topic_score_codex":1.9200614e-7,"about_ca_topic_score_gemma":8.348051e-8,"teacher_disagreement_score":0.13611989,"about_ca_system_score_codex":0.00010474609,"about_ca_system_score_gemma":0.00029480073,"threshold_uncertainty_score":0.62041205},"labels":[],"label_agreement":null},{"id":"W4297337997","doi":"10.1007/s10107-022-01890-9","title":"Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Semidefinite programming; Reduction (mathematics); Mathematics; Computer science; Geometry; Mathematical optimization","score_opus":0.0835175284157905,"score_gpt":0.3650636598238889,"score_spread":0.28154613140809837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297337997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08723012,0.0001587372,0.89748424,0.0016536041,0.000386539,0.009100955,0.000058398677,0.0010721607,0.0028552287],"genre_scores_gemma":[0.13922617,0.000004069673,0.855811,0.000022398603,0.00017465957,0.0033229252,0.000052772102,0.000099065524,0.0012869511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756813,0.0001377094,0.0005520026,0.00050488446,0.0006469539,0.0005903329],"domain_scores_gemma":[0.998457,0.00065355405,0.00021274638,0.00030509828,0.000189153,0.0001824609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011205034,0.0002469276,0.0003980042,0.00018546055,0.0007650821,0.00015053943,0.00022469947,0.000081490805,0.00013624286],"category_scores_gemma":[0.0013747782,0.0002401865,0.00012252979,0.000574825,0.00020636566,0.00019784592,0.00032567582,0.0004388747,0.000008495366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028442606,0.0014404298,0.0000245074,0.0011744908,0.00017049165,0.000013808912,0.005806267,0.00016114728,0.0008592083,0.37851578,0.00043434335,0.6111151],"study_design_scores_gemma":[0.001981213,0.00082344475,0.0000031097998,0.0000894514,0.00009706325,0.00021143172,0.0068461094,0.025475211,0.001351973,0.9541787,0.0083458945,0.00059642934],"about_ca_topic_score_codex":0.0000021126448,"about_ca_topic_score_gemma":5.3530886e-7,"teacher_disagreement_score":0.6105187,"about_ca_system_score_codex":0.00018213897,"about_ca_system_score_gemma":0.00005671852,"threshold_uncertainty_score":0.9794522},"labels":[],"label_agreement":null},{"id":"W4297781182","doi":"","title":"Recherche du coefficient de relaxation utilisé dans la méthode de Newton-Raphson pour la résolution de systèmes non-linéaires","year":2008,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"","keywords":"Physics; Newton's method; Nonlinear system","score_opus":0.07747846169349126,"score_gpt":0.326553716996085,"score_spread":0.24907525530259372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297781182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038555305,0.0007938729,0.9027009,0.011400782,0.00019228598,0.0012260567,0.00011621784,0.00046657337,0.044548027],"genre_scores_gemma":[0.12985127,0.012682338,0.82068497,0.00009626769,0.00010099003,0.00035477348,0.00048326922,0.0002427441,0.035503395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95129526,0.04325318,0.0014524115,0.0014232608,0.0011703761,0.0014055384],"domain_scores_gemma":[0.9728327,0.017981913,0.0014496462,0.0027680255,0.004274554,0.00069317163],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaresearch","research_integrity"],"category_scores_codex":[0.030155765,0.00083456875,0.0008601295,0.00054306193,0.0010937869,0.000623179,0.002035245,0.0017919829,0.0001967364],"category_scores_gemma":[0.030471414,0.000989691,0.0004972896,0.0013264609,0.001044466,0.00037084662,0.0014680818,0.0028513717,0.000117008145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019851163,0.006032242,0.007615917,0.0019550035,0.0004948334,0.00018228228,0.13747716,0.26682395,0.013030358,0.47789538,0.008693628,0.079600714],"study_design_scores_gemma":[0.0012958221,0.0000022390975,0.005420838,0.0037970506,0.00015281196,0.00034918997,0.0015207054,0.91228306,0.031505246,0.03427614,0.00855455,0.00084236707],"about_ca_topic_score_codex":0.0026248763,"about_ca_topic_score_gemma":0.0009580676,"teacher_disagreement_score":0.64545906,"about_ca_system_score_codex":0.0043189134,"about_ca_system_score_gemma":0.0039207735,"threshold_uncertainty_score":0.9995039},"labels":[],"label_agreement":null},{"id":"W4298555389","doi":"10.48550/arxiv.1002.0013","title":"Explicit Sensor Network Localization using Semidefinite Representations\\n and Facial Reductions","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Embedding; Euclidean geometry; Mathematical optimization; Computer science; Algorithm; Artificial intelligence","score_opus":0.1963070968517302,"score_gpt":0.2934629300591014,"score_spread":0.0971558332073712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298555389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12152926,0.000028681892,0.8762042,0.000048677284,0.00043268065,0.0005894994,0.00005236968,0.00020440816,0.0009102194],"genre_scores_gemma":[0.7327562,0.00090487086,0.25845516,0.00006495531,0.00089512666,0.0000084583535,0.0002224094,0.00016829482,0.0065245493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980563,0.00020189406,0.00032882058,0.0008808417,0.00015056849,0.00038156132],"domain_scores_gemma":[0.9978878,0.00032012793,0.00034932423,0.00079843064,0.00044963098,0.00019471304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002630849,0.00030436242,0.0003546367,0.000306802,0.0005301147,0.00010405832,0.00028186032,0.0004743716,0.0001828716],"category_scores_gemma":[0.0004907845,0.00038615486,0.00011239858,0.0007549379,0.00021936418,0.00027933458,0.00076333556,0.00097127823,0.000013841502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030493873,0.000051252544,0.0012161937,0.0000797749,0.00007103068,0.000038512535,0.0002231222,0.9510651,0.000068664915,0.04670901,0.00030220003,0.00014462488],"study_design_scores_gemma":[0.00035303674,0.000010811827,0.00005844178,0.000077129574,0.00013016183,0.000016159025,0.000401359,0.81379837,0.00006994672,0.18430363,0.0004350248,0.0003459138],"about_ca_topic_score_codex":0.00012223309,"about_ca_topic_score_gemma":0.00007259285,"teacher_disagreement_score":0.61774904,"about_ca_system_score_codex":0.00017865935,"about_ca_system_score_gemma":0.00016339007,"threshold_uncertainty_score":0.99985904},"labels":[],"label_agreement":null},{"id":"W4298622783","doi":"10.1002/cjce.24694","title":"A novel predictive homotopic path tracking algorithm to solve non‐linear algebraic equations","year":2022,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tecnológico Nacional de México","keywords":"Mathematics; Continuation; Algebraic number; Algebraic equation; Homotopy; Path (computing); Applied mathematics; System of linear equations; Tracking (education); Linear system; Algorithm; Nonlinear system; Computer science; Mathematical analysis; Pure mathematics","score_opus":0.029785321807845416,"score_gpt":0.2781870119704448,"score_spread":0.24840169016259941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298622783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156516,0.000045867848,0.9882497,0.000962944,0.00019547605,0.0002484908,0.00006380378,0.00001950099,0.000057687743],"genre_scores_gemma":[0.58237404,8.865326e-7,0.41684362,0.00014453233,0.00041142717,0.000053193482,0.0000065510585,0.00006955271,0.00009620903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986471,0.000015478998,0.0003728984,0.000118191994,0.00046507927,0.00038125218],"domain_scores_gemma":[0.99854666,0.00039486738,0.00011545658,0.0001952865,0.00024777927,0.00049993873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005091155,0.00013044916,0.00021088439,0.00026870405,0.00023372505,0.00004446958,0.0004851097,0.000040915587,0.00014780869],"category_scores_gemma":[0.0013567903,0.00011688928,0.000097784956,0.00054069224,0.00003599141,0.00011652807,0.000071702605,0.0007859132,0.0000027726992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013660492,0.00006255311,0.000007411003,0.0000323651,0.00014930293,0.0000772317,0.0040700366,0.9637144,0.021858834,0.004099375,0.00054914324,0.005365682],"study_design_scores_gemma":[0.0006166332,0.00011277686,0.000018955116,0.00006290676,0.000039115457,0.00026951573,0.0002210758,0.9873645,0.0076594357,0.0025653942,0.000850979,0.00021876553],"about_ca_topic_score_codex":0.00013834334,"about_ca_topic_score_gemma":0.000043360556,"teacher_disagreement_score":0.5722175,"about_ca_system_score_codex":0.00067984965,"about_ca_system_score_gemma":0.00058084895,"threshold_uncertainty_score":0.47666064},"labels":[],"label_agreement":null},{"id":"W4299790063","doi":"10.1007/978-0-387-74759-0_103","title":"Criss-Cross Pivoting Rules","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04436691264716803,"score_gpt":0.3397273638812548,"score_spread":0.2953604512340868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299790063","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012960122,0.0004095139,0.34351495,0.00003273661,0.00024463743,0.0005289552,0.00006974379,0.00016282294,0.6550237],"genre_scores_gemma":[0.000013583737,0.01170475,0.5206655,0.000014417024,0.00029538994,0.000018945751,0.00028281013,0.00020565519,0.4667989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969704,0.000040897838,0.0011003163,0.0005674423,0.0009428199,0.00037810366],"domain_scores_gemma":[0.9967835,0.0004981101,0.00096132775,0.00066242035,0.0009483781,0.00014629272],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002645675,0.00049604534,0.00071299035,0.00042973645,0.00020472867,0.000038062917,0.00042625333,0.00055318343,0.0021778073],"category_scores_gemma":[0.0011308423,0.0005318269,0.00021647166,0.00011707748,0.00028360254,0.00035522148,0.0002024434,0.0005368381,0.00009156194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000773815,0.00016802631,0.000067928224,0.00068288884,0.00021241674,0.0000724087,0.0012162647,0.8904495,0.000002120737,0.07433482,0.02019828,0.012517914],"study_design_scores_gemma":[0.004008386,0.0004742115,0.00004362629,0.0018333433,0.00041874798,0.00018592864,0.00012714474,0.44659224,0.0002171837,0.13039683,0.41151726,0.0041851127],"about_ca_topic_score_codex":0.0000036023632,"about_ca_topic_score_gemma":0.0000012942811,"teacher_disagreement_score":0.4438573,"about_ca_system_score_codex":0.00015835582,"about_ca_system_score_gemma":0.00022190894,"threshold_uncertainty_score":0.9997133},"labels":[],"label_agreement":null},{"id":"W4300107446","doi":"10.1007/0-306-48332-7_252","title":"Least-Index Anticycling Rules","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Index (typography); Computer science; World Wide Web","score_opus":0.03774584614018987,"score_gpt":0.31949604586841895,"score_spread":0.28175019972822907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300107446","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034664333,0.00017524381,0.4693651,0.000049209026,0.00017369857,0.0004104548,0.000030119254,0.00010741358,0.5296853],"genre_scores_gemma":[0.000030112302,0.011222889,0.43077895,0.000018365581,0.00039048592,0.000017779139,0.00027114036,0.0002377356,0.5570325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970621,0.000042111387,0.0010283762,0.00055834855,0.0009252877,0.00038377225],"domain_scores_gemma":[0.997177,0.0004355055,0.00086515653,0.0006841901,0.0006853634,0.00015278262],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029547128,0.0004996665,0.00075041223,0.0005642249,0.00012430213,0.000036657613,0.000402803,0.00055771956,0.0039360304],"category_scores_gemma":[0.0007387524,0.0005346141,0.00020744385,0.00014616347,0.00017507382,0.00029963398,0.00016949222,0.0005286695,0.00009156511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007900106,0.00015052134,0.00008334756,0.00044657738,0.00019607753,0.000051964187,0.00024242961,0.8142511,0.0000017988137,0.15811357,0.0044927355,0.021890834],"study_design_scores_gemma":[0.0018836093,0.0001900221,0.000013997524,0.0011499216,0.0003270733,0.000049839706,0.000076594006,0.5453315,0.00002873081,0.26490498,0.18422751,0.0018162598],"about_ca_topic_score_codex":0.0000043835244,"about_ca_topic_score_gemma":0.000003865539,"teacher_disagreement_score":0.26891968,"about_ca_system_score_codex":0.00014393567,"about_ca_system_score_gemma":0.0001900831,"threshold_uncertainty_score":0.99971056},"labels":[],"label_agreement":null},{"id":"W4300677122","doi":"10.48550/arxiv.1805.03756","title":"A Residual Smoothing Strategy for Accelerating Newton Method\\n Continuation","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Centre for Applied Research in Cancer Control; Sandia National Laboratories; University of Wyoming; National Aeronautics and Space Administration","keywords":"Jacobian matrix and determinant; Smoothing; Residual; Newton's method; Nonlinear system; Convergence (economics); Local convergence; Continuation; Quasi-Newton method; Limit (mathematics); Quadratic equation; Mathematics; Applied mathematics; Mathematical optimization; Computer science; Iterative method; Algorithm; Mathematical analysis; Physics","score_opus":0.38778104448010825,"score_gpt":0.3529854665986066,"score_spread":0.03479557788150167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300677122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024736743,0.000016702828,0.9706094,0.00010005692,0.00019603485,0.0013066481,0.00006575653,0.0002560545,0.0027125853],"genre_scores_gemma":[0.1856511,0.000069490256,0.79563767,0.000059771355,0.00071435235,0.000020336427,0.00020038764,0.00016146101,0.017485421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755335,0.00033660914,0.00041441314,0.0010238523,0.0001793169,0.00049245433],"domain_scores_gemma":[0.9963325,0.0012394608,0.0005656836,0.0007538214,0.00095523323,0.00015327752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011637559,0.00036567097,0.0004932015,0.00032756667,0.0003466691,0.0001843153,0.0006565491,0.00047359668,0.00019026978],"category_scores_gemma":[0.0013744124,0.00043621942,0.00019084892,0.00037911866,0.00011054245,0.00037328544,0.0006983197,0.00067776843,0.000019424786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025251845,0.00014884713,0.00013252949,0.000578262,0.0002636435,0.000048538666,0.0007606087,0.7603012,0.0001942933,0.22972065,0.0038216764,0.0037772837],"study_design_scores_gemma":[0.00078037765,0.00007854065,0.000018461496,0.00011997403,0.0000985299,0.0000015911703,0.00039231087,0.6812494,0.000810525,0.31580088,0.0002912947,0.00035816975],"about_ca_topic_score_codex":0.00005755678,"about_ca_topic_score_gemma":0.00007360524,"teacher_disagreement_score":0.17497173,"about_ca_system_score_codex":0.0003515853,"about_ca_system_score_gemma":0.0003379734,"threshold_uncertainty_score":0.99980897},"labels":[],"label_agreement":null},{"id":"W4301014485","doi":"10.48550/arxiv.1301.4506","title":"Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Projection (relational algebra); Constraint (computer-aided design); Projection method; Mathematical optimization; Computer science; Algorithm; Mathematics; Dykstra's projection algorithm; Geometry","score_opus":0.25663021746619086,"score_gpt":0.32247742592782,"score_spread":0.06584720846162917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301014485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08386015,0.00008421265,0.91144586,0.00006576646,0.000072026916,0.003807756,0.000022767987,0.00018364299,0.0004578395],"genre_scores_gemma":[0.214139,0.00031807914,0.7818291,0.0000057220486,0.00006481356,0.00007112726,0.000049115188,0.00007669329,0.0034463245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979395,0.00022635362,0.0002678492,0.001066953,0.00012928875,0.0003700535],"domain_scores_gemma":[0.9974422,0.00060676795,0.00047252738,0.0006158666,0.0007192712,0.00014340738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000693991,0.0003630185,0.00045968007,0.00031639612,0.00028599743,0.00015221504,0.0003012452,0.00030685173,0.000029155244],"category_scores_gemma":[0.0005085326,0.0003490705,0.00009638691,0.0003837754,0.00023769742,0.00057666417,0.00044931434,0.0004997463,0.0000050662234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010037163,0.0023448216,0.0067291795,0.016346151,0.0011994913,0.000031368163,0.006785683,0.7648536,0.00090125983,0.1812038,0.0004173601,0.018183582],"study_design_scores_gemma":[0.00086828205,0.00018479739,0.00005744667,0.0002685963,0.00014354846,0.0000048936786,0.001278903,0.727915,0.0004159443,0.26839137,0.000064999695,0.00040623933],"about_ca_topic_score_codex":0.000104220824,"about_ca_topic_score_gemma":0.00010281715,"teacher_disagreement_score":0.13027886,"about_ca_system_score_codex":0.0003533098,"about_ca_system_score_gemma":0.00017151482,"threshold_uncertainty_score":0.9998961},"labels":[],"label_agreement":null},{"id":"W4301885855","doi":"","title":"The New Butterfly Relaxation Method for Mathematical Programs with Complementarity Constraints","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Butterfly; Complementarity (molecular biology); Mathematical optimization; Relaxation (psychology); Computer science; Applied mathematics; Mathematics; Mathematical economics; Ecology; Biology; Psychology; Social psychology","score_opus":0.05272755244148209,"score_gpt":0.34713966965462445,"score_spread":0.29441211721314237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301885855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026186314,0.00007916711,0.96271527,0.02410026,0.000079627534,0.0025935385,0.00010012949,0.00024754618,0.009822572],"genre_scores_gemma":[0.0042270403,0.000080920014,0.9802884,0.000048662267,0.000043641732,0.0005546222,0.00033031602,0.00009389163,0.014332506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354583,0.0035298872,0.0007922998,0.0007718566,0.00078560115,0.0005745333],"domain_scores_gemma":[0.98387957,0.009769036,0.0008785704,0.0020697392,0.0031396665,0.00026340643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007365799,0.00039340762,0.00047247036,0.000108960776,0.0007036876,0.00055732904,0.0012787106,0.0002448052,0.00020968578],"category_scores_gemma":[0.005207235,0.00026802707,0.00019466809,0.00024334269,0.0005815417,0.00013784661,0.00093366794,0.00062111655,0.000021473234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050614934,0.0003915918,0.000085802545,0.00027938985,0.00018891193,0.0000014231653,0.002645045,0.000028801542,0.000121911646,0.7476022,0.0026685994,0.24593565],"study_design_scores_gemma":[0.0018873158,0.0000027351327,0.000059083664,0.0023351195,0.00011066942,0.000023104101,0.00027964314,0.059723906,0.0074495133,0.9108063,0.01676988,0.00055273843],"about_ca_topic_score_codex":0.000080231664,"about_ca_topic_score_gemma":0.0007911688,"teacher_disagreement_score":0.24538292,"about_ca_system_score_codex":0.00025308572,"about_ca_system_score_gemma":0.0006146572,"threshold_uncertainty_score":0.9999772},"labels":[],"label_agreement":null},{"id":"W4311163083","doi":"10.23952/jnva.7.2023.1.07","title":"Optimization conditions and decomposable algorithms for convertible nonconvex optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Convertible; Mathematical optimization; Optimization algorithm; Algorithm; Computer science; Mathematics; Engineering; Structural engineering","score_opus":0.04357959626343707,"score_gpt":0.3681774466172429,"score_spread":0.32459785035380584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311163083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010434508,0.000107313106,0.99727803,0.0009824277,0.00007656589,0.00020285296,0.00024275517,0.000012299836,0.000054281547],"genre_scores_gemma":[0.007919046,0.00017402969,0.9908488,0.00012816185,0.00015569793,0.000029585106,0.00033066794,0.000021044847,0.00039297502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998476,0.000121875855,0.0005946268,0.00018071043,0.0004764068,0.00015037536],"domain_scores_gemma":[0.99768656,0.0007383314,0.0005228205,0.00009902117,0.00083406223,0.00011920507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00083118177,0.00011766302,0.00035984567,0.00065121363,0.0005077065,0.00007094531,0.00011345261,0.0000448592,0.000933764],"category_scores_gemma":[0.00039416103,0.00011418938,0.00015342502,0.00089536706,0.00004566377,0.00034440964,0.000077172495,0.0001733703,2.765627e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066408276,0.00016253952,0.00048409618,0.000018077551,0.0006779685,0.0000021213434,0.00012607795,0.99523157,0.000015045395,0.0027972064,0.00023400676,0.000184908],"study_design_scores_gemma":[0.001253756,0.00016879835,0.00014656199,0.000004198374,0.0007291917,0.000047199046,0.00023949391,0.99145865,0.000017243936,0.0053351615,0.000480059,0.00011970309],"about_ca_topic_score_codex":0.000005538271,"about_ca_topic_score_gemma":0.000002096634,"teacher_disagreement_score":0.0068755955,"about_ca_system_score_codex":0.00009369436,"about_ca_system_score_gemma":0.00014382444,"threshold_uncertainty_score":0.9999795},"labels":[],"label_agreement":null},{"id":"W4312500027","doi":"10.23952/asvao.4.2022.2.03","title":"Revisiting projection and contraction algorithms for solving variational inequalities and applications","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Contraction (grammar); Variational inequality; Algorithm; Computer science; Inequality; Mathematics; Applied mathematics; Mathematical analysis; Philosophy; Linguistics","score_opus":0.047760652901824956,"score_gpt":0.3465372669410726,"score_spread":0.29877661403924766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312500027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007423639,0.00014369615,0.99747694,0.00015909609,0.000018232959,0.0011127852,0.00009471795,0.000083699764,0.00016844666],"genre_scores_gemma":[0.07385002,0.00037318582,0.9215417,0.00011370843,0.00023759912,0.002324944,0.0011745364,0.000053479223,0.0003308217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841815,0.00010701544,0.0004493351,0.00047132367,0.00034575752,0.00020842878],"domain_scores_gemma":[0.9985776,0.00063056353,0.00033291773,0.00015794727,0.00022582014,0.00007515658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012316927,0.00016774652,0.00032635522,0.00046527982,0.0012256337,0.0001608256,0.00006014556,0.00006518108,0.00007298627],"category_scores_gemma":[0.00020648348,0.00018303275,0.000052306117,0.00092780706,0.00005878607,0.00023229452,0.0001091764,0.00016174276,1.7292659e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007769386,0.00007419342,0.00033805726,0.00016701741,0.00052822975,2.8546836e-7,0.0010636288,0.8042849,0.00020058952,0.15522446,0.00003319428,0.03800779],"study_design_scores_gemma":[0.0006817709,0.00002813251,0.00014836296,0.0000042632064,0.0004887565,0.000005650916,0.0019932454,0.98439056,0.0000333365,0.011738246,0.00028862583,0.00019907235],"about_ca_topic_score_codex":0.000025547199,"about_ca_topic_score_gemma":0.0000050470067,"teacher_disagreement_score":0.18010567,"about_ca_system_score_codex":0.000097521624,"about_ca_system_score_gemma":0.00003878008,"threshold_uncertainty_score":0.9426707},"labels":[],"label_agreement":null},{"id":"W4312992661","doi":"10.23952/jnva.6.2022.6.01","title":"A special issue on the theory and numerical methods for vector optimization problems with respect to variable domination structures","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variable (mathematics); Computer science; Mathematical optimization; Mathematics; Mathematical analysis","score_opus":0.028591433609189292,"score_gpt":0.376746986217499,"score_spread":0.3481555526083097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312992661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020870242,0.000020702704,0.9966151,0.0025944638,0.000059066646,0.00030088113,0.000048669524,0.000004829165,0.00014758506],"genre_scores_gemma":[0.0010573781,0.0000099469935,0.99698395,0.00019619244,0.0012829864,0.00003472878,0.000020356814,0.000015586154,0.0003988944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983555,0.00057474995,0.00034454576,0.0001582743,0.0004547464,0.000112152644],"domain_scores_gemma":[0.9960216,0.0029985101,0.0003251793,0.00010104773,0.00048155914,0.000072081195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027608655,0.00010126796,0.00027077872,0.00038545064,0.00037298852,0.00007387802,0.00012102516,0.000027386475,0.0009853326],"category_scores_gemma":[0.0018811658,0.00006335599,0.00007336634,0.0010092898,0.00002582847,0.00010367235,0.000054985645,0.00019603927,1.7601212e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084367394,0.00009810978,0.000024493966,0.000010783603,0.00064405665,8.4309926e-7,0.00053889054,0.88057745,0.000033228454,0.11408217,0.0004121147,0.002734207],"study_design_scores_gemma":[0.00079824036,0.00063846575,0.00035243618,0.0000073780684,0.0006325925,0.000027892069,0.00036576897,0.91745836,0.000041934596,0.07099225,0.008562805,0.00012188064],"about_ca_topic_score_codex":0.0000023913408,"about_ca_topic_score_gemma":0.0000010120738,"teacher_disagreement_score":0.043089923,"about_ca_system_score_codex":0.00008571962,"about_ca_system_score_gemma":0.00009418491,"threshold_uncertainty_score":0.9999279},"labels":[],"label_agreement":null},{"id":"W4313241233","doi":"10.1088/978-0-7503-5067-9ch14","title":"Polynomial based model for solving unconstrained optimization problem with smoothing parameters","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Smoothing; Mathematical optimization; Polynomial; Mathematics; Applied mathematics; Computer science; Statistics; Mathematical analysis","score_opus":0.07554448851653012,"score_gpt":0.3113277953842066,"score_spread":0.23578330686767646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313241233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.300568e-7,0.0000105654,0.84674954,0.00027544916,0.000044648907,0.0022243718,0.00013523316,0.00028324872,0.15027653],"genre_scores_gemma":[0.000036226586,0.000007639208,0.74796665,0.00012977615,0.000036408426,0.0003092041,0.00030562116,0.00025138195,0.25095713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974568,0.000021190206,0.0006123313,0.0006883523,0.0007476173,0.00047370832],"domain_scores_gemma":[0.99765044,0.0008530318,0.0004688429,0.0005058674,0.00037003792,0.00015175063],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043673304,0.00050479773,0.0005732839,0.0004099608,0.00037193456,0.00011680744,0.0003385915,0.00026903846,0.0017632187],"category_scores_gemma":[0.00020478823,0.00046856722,0.00019160156,0.00008183764,0.00014007308,0.0002676326,0.00012557658,0.0005683437,0.000002573089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015811899,0.000031722517,3.134819e-7,0.00020286934,0.00009476133,0.000005136115,0.00011033721,0.95049983,0.0000023717673,0.046231646,0.0018108245,0.0008520914],"study_design_scores_gemma":[0.0014994917,0.00016276703,3.1658072e-9,0.000125802,0.00010079713,0.000005889774,0.00003456804,0.98146105,0.000022485,0.01403089,0.001985305,0.00057093013],"about_ca_topic_score_codex":0.000004111619,"about_ca_topic_score_gemma":0.000052308627,"teacher_disagreement_score":0.1006806,"about_ca_system_score_codex":0.0004866467,"about_ca_system_score_gemma":0.0007682389,"threshold_uncertainty_score":0.9997766},"labels":[],"label_agreement":null},{"id":"W4313469277","doi":"","title":"The Squared Slacks Transformation in Nonlinear Programming","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Transformation (genetics); Nonlinear system; Nonlinear programming; Mathematics; Mathematical optimization; Computer science; Chemistry","score_opus":0.024370362217969337,"score_gpt":0.31165259404399276,"score_spread":0.2872822318260234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313469277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019838465,0.0007380464,0.9731716,0.0030573525,0.00010129747,0.0017442493,0.0000137208335,0.00052886066,0.00080641074],"genre_scores_gemma":[0.27801606,0.00032008532,0.71895427,0.00024420745,0.0001892571,0.0012316535,0.000030385969,0.000103614235,0.0009104974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733055,0.00021035725,0.0006248659,0.00021138511,0.00053475384,0.0010880952],"domain_scores_gemma":[0.99831,0.0005139647,0.00017409277,0.00060223666,0.00014684777,0.00025283123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018375805,0.0002493525,0.0002535059,0.00031519757,0.00036086267,0.00016097983,0.0004302455,0.0002099177,0.000023777568],"category_scores_gemma":[0.0008966817,0.0002004741,0.00010905452,0.0008439073,0.00010285541,0.0007758045,0.00009333034,0.00056927005,0.000018718723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003728331,0.0016845926,0.023831598,0.0002677777,0.00009927301,0.000027034626,0.009009325,0.0077999975,0.0012751874,0.29107708,0.0021904819,0.66236484],"study_design_scores_gemma":[0.0021719015,0.00019146361,0.006129529,0.00014570531,0.000040049927,0.00012347354,0.0028327724,0.8968992,0.010513768,0.02653478,0.053430244,0.0009870661],"about_ca_topic_score_codex":0.00043687643,"about_ca_topic_score_gemma":0.0014178685,"teacher_disagreement_score":0.88909924,"about_ca_system_score_codex":0.0005189131,"about_ca_system_score_gemma":0.000115455725,"threshold_uncertainty_score":0.81750965},"labels":[],"label_agreement":null},{"id":"W4317493516","doi":"10.1007/s11228-023-00664-5","title":"Limiting Behaviour of the Generalized Simplex Gradient as the Number of Points Tends to Infinity on a Fixed Shape in IRn","year":2023,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Simplex; Mathematics; Infinity; Position (finance); Function (biology); Limiting; Fixed point; Mathematical analysis; Finite set; Upper and lower bounds; Work (physics); Point (geometry); Sample (material); Applied mathematics; Combinatorics; Geometry; Physics","score_opus":0.0724339798274549,"score_gpt":0.3897422809007294,"score_spread":0.31730830107327446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317493516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940478,0.000003120712,0.0030758362,0.0019147315,0.00002385525,0.00026559562,0.00014123665,0.000018784382,0.0005090217],"genre_scores_gemma":[0.9799358,0.0000122406445,0.018998422,0.0002217555,0.0000293809,0.000043646538,0.00007704296,0.000015423355,0.00066626485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982435,0.0002755857,0.00045924957,0.0002088141,0.00062801753,0.00018483229],"domain_scores_gemma":[0.9984193,0.0007850828,0.00021718016,0.00028096797,0.00024350766,0.00005396241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452789,0.00011128027,0.0002895681,0.0003072039,0.00013501011,0.000018419098,0.00020651624,0.00005063616,0.00043175544],"category_scores_gemma":[0.0016854573,0.00007013156,0.00015681452,0.0029802464,0.00004984373,0.00004615877,0.0001646508,0.00013730656,0.000010113009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032227187,0.00067098317,0.22629528,0.0001054029,0.0018041795,0.0000071887416,0.009769751,0.20858617,0.00048504272,0.5481513,0.00060084515,0.0032015394],"study_design_scores_gemma":[0.0006854352,0.000030268182,0.33339915,0.00003007949,0.00029724956,0.0000013552267,0.00047960776,0.6018051,0.0001896845,0.06291559,0.000040253904,0.00012623012],"about_ca_topic_score_codex":0.00020991801,"about_ca_topic_score_gemma":0.00009650079,"teacher_disagreement_score":0.48523575,"about_ca_system_score_codex":0.00004484261,"about_ca_system_score_gemma":0.000056890614,"threshold_uncertainty_score":0.47274193},"labels":[],"label_agreement":null},{"id":"W4318480902","doi":"10.1007/s11590-023-01973-2","title":"Nicely structured positive bases with maximal cosine measure","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Wollongong","keywords":"Basis (linear algebra); Measure (data warehouse); Algorithm; Trigonometric functions; Computer science; Mathematics; Artificial intelligence; Data mining; Geometry","score_opus":0.03126364182703274,"score_gpt":0.3024735883603846,"score_spread":0.2712099465333519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318480902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003460911,0.000008192953,0.98770905,0.006601517,0.00007550262,0.00060040405,0.00006701327,0.0005493775,0.0009280311],"genre_scores_gemma":[0.021340165,0.000029421413,0.97425675,0.0018551646,0.00015434145,0.000099683704,0.000529148,0.00017120091,0.001564147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981247,0.000120926656,0.00026788464,0.0003839543,0.00068901025,0.00041349855],"domain_scores_gemma":[0.9987603,0.00027890463,0.00014756185,0.00034005116,0.0003482876,0.0001249065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020477339,0.00023347468,0.00023417409,0.00031164687,0.00022493348,0.0000964468,0.00020559665,0.00007647052,0.0004922348],"category_scores_gemma":[0.00036669147,0.00020365977,0.00004971808,0.0013429545,0.00012212162,0.00036553212,0.000065393804,0.00020046993,0.000052280175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014977828,0.00003357096,0.00009722619,0.000029170475,0.00006357342,0.00007104491,0.00022416419,0.987172,0.0005606301,0.00091501593,0.010031259,0.00065254205],"study_design_scores_gemma":[0.0027320425,0.00019046999,0.0003948001,0.00016776801,0.00007156039,0.000073194875,0.00032973458,0.9913819,0.0026302545,0.00072731957,0.00057784526,0.00072311773],"about_ca_topic_score_codex":0.000004750903,"about_ca_topic_score_gemma":0.000005449312,"teacher_disagreement_score":0.017879253,"about_ca_system_score_codex":0.00011418264,"about_ca_system_score_gemma":0.000060478837,"threshold_uncertainty_score":0.8305005},"labels":[],"label_agreement":null},{"id":"W4318978979","doi":"10.5206/mt.v3i1.15890","title":"Blends have decent numerical properties","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Mathematics; Interval (graph theory); Quadrature (astronomy); Degree (music); Bounded function; Hermite polynomials; Lebesgue integration; Polynomial; Interval arithmetic; Applied mathematics; Mathematical analysis; Discrete mathematics; Combinatorics; Physics","score_opus":0.12593052257853912,"score_gpt":0.36660747119473575,"score_spread":0.24067694861619662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318978979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091460254,0.000022418848,0.9935944,0.0019159012,0.00014552474,0.00028743327,0.000023271332,0.0006767924,0.0024196336],"genre_scores_gemma":[0.69290847,0.00042417846,0.18179697,0.00016528134,0.00019523133,0.00082514394,0.000048003014,0.0002149992,0.12342174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886644,0.000039884824,0.00020650175,0.00020455677,0.0003488796,0.00033372792],"domain_scores_gemma":[0.9993839,0.00011238547,0.000026452677,0.0002661003,0.00010142763,0.000109719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013200451,0.00011335744,0.00014332747,0.00017192848,0.00024899087,0.000035704583,0.00014170361,0.000055026612,0.0014406693],"category_scores_gemma":[0.000070276306,0.000100725156,0.00007830678,0.00057857804,0.000059248137,0.00013109838,0.000011172319,0.00020380509,0.0004899977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004278907,0.0026036825,0.00048566944,0.0012069725,0.00093779265,0.0002561035,0.022774698,0.5398756,0.008279389,0.031455435,0.054395977,0.33730075],"study_design_scores_gemma":[0.0016319577,0.00017018731,0.00023979352,0.00007847007,0.00009181893,0.00004857211,0.0047282907,0.8162796,0.02564419,0.035526294,0.114749454,0.00081140985],"about_ca_topic_score_codex":0.000014105595,"about_ca_topic_score_gemma":0.00002733555,"teacher_disagreement_score":0.81179744,"about_ca_system_score_codex":0.00007401173,"about_ca_system_score_gemma":0.000064749715,"threshold_uncertainty_score":0.99947214},"labels":[],"label_agreement":null},{"id":"W4319083910","doi":"10.3390/a16020084","title":"About the Performance of a Calculus-Based Approach to Building Model Functions in a Derivative-Free Trust-Region Algorithm","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Calculus (dental); Computer science; Algorithm; Function (biology); Derivative (finance); Situation calculus; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.08335352694491616,"score_gpt":0.3509549059097146,"score_spread":0.26760137896479846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319083910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037276506,0.000041259507,0.9599741,0.00052799593,0.00009216904,0.0010781505,0.000047495258,0.00022711628,0.0007351818],"genre_scores_gemma":[0.04223903,0.00005156911,0.9536865,0.00020492169,0.00011193683,0.00075933145,0.000048276856,0.00012319628,0.0027752703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722826,0.00013518073,0.0006264323,0.0005194451,0.00080750167,0.0006831985],"domain_scores_gemma":[0.99774915,0.00053646567,0.00017293729,0.0010107455,0.00033902246,0.00019166518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954371,0.00029345797,0.00042444823,0.00054197497,0.0002697768,0.0000429084,0.0008286736,0.00013763478,0.000012102988],"category_scores_gemma":[0.0009722579,0.00023476493,0.00012533039,0.0034672874,0.00018596996,0.00025845756,0.00035195408,0.00043774984,0.000028153474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274713,0.0003350105,0.00030164697,0.00015847155,0.000047014983,0.00001121383,0.0019359742,0.9505326,0.0001377651,0.00304213,0.0020750924,0.041360296],"study_design_scores_gemma":[0.0011263834,0.00011370229,0.0001594494,0.0000889799,0.000014555509,0.000009912342,0.00073488674,0.9935737,0.0007514704,0.0029023357,0.00026547644,0.0002591445],"about_ca_topic_score_codex":0.000033767963,"about_ca_topic_score_gemma":0.0000057402,"teacher_disagreement_score":0.043041065,"about_ca_system_score_codex":0.00019370067,"about_ca_system_score_gemma":0.000246486,"threshold_uncertainty_score":0.9573436},"labels":[],"label_agreement":null},{"id":"W4324026219","doi":"10.1016/j.compstruc.2023.107009","title":"Improved Moore-Penrose continuation algorithm for the computation of problems with critical points","year":2023,"lang":"en","type":"article","venue":"Computers & Structures","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Moncton","keywords":"Continuation; Algorithm; Computation; Process (computing); Divergence (linguistics); Limit (mathematics); Task (project management); Computer science; Mathematics; Key (lock); Point (geometry); Mathematical optimization; Geometry; Mathematical analysis","score_opus":0.04342863524996715,"score_gpt":0.3672470424726696,"score_spread":0.32381840722270244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324026219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019295816,0.00004554393,0.9956751,0.0006789531,0.000246661,0.0012028973,0.000043174223,0.00016232501,0.000015794327],"genre_scores_gemma":[0.120935194,0.000009050062,0.8785674,0.00006817855,0.00012679066,0.0001106599,0.00006647141,0.00005010735,0.00006612157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863863,0.00007116875,0.00034254527,0.0002749945,0.0003744291,0.00029822518],"domain_scores_gemma":[0.99690044,0.0020437269,0.00016083248,0.00024912338,0.00058333296,0.00006251722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032580996,0.00016726219,0.0002507425,0.00013493169,0.00019858778,0.00007241487,0.00025940264,0.00006562911,0.000010241759],"category_scores_gemma":[0.00046529673,0.000111030735,0.000065715125,0.0004380574,0.00023562173,0.00014057934,0.00009197896,0.00014222715,0.0000017116912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017941582,0.00014358365,0.000105988904,0.0008342456,0.00037080687,0.000008784099,0.0038058318,0.14377293,0.00132784,0.04765078,0.007751447,0.79404837],"study_design_scores_gemma":[0.0009854997,0.00016613957,0.0007552247,0.000045649373,0.00002884674,0.0000075443136,0.00018807988,0.8922659,0.0009937962,0.10436026,0.000074887226,0.00012813209],"about_ca_topic_score_codex":0.0000070360375,"about_ca_topic_score_gemma":0.0000050908843,"teacher_disagreement_score":0.7939202,"about_ca_system_score_codex":0.000035380788,"about_ca_system_score_gemma":0.00005392407,"threshold_uncertainty_score":0.4527702},"labels":[],"label_agreement":null},{"id":"W4324326670","doi":"10.48550/arxiv.2303.06724","title":"Gröbner and Graver bases for calculating Opportunity Cost Matrices","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Context (archaeology); Integer (computer science); Algebraic number; Matrix (chemical analysis); Computer science; Reduction (mathematics); Opportunity cost; Mathematical optimization; Algebra over a field; Algorithm; Mathematics; Geometry; Programming language; Pure mathematics","score_opus":0.41492373425672263,"score_gpt":0.3215511779930361,"score_spread":0.09337255626368651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324326670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035850115,0.00003023551,0.96052396,0.00013493538,0.00023566853,0.001556544,0.00035231237,0.0004019583,0.000914249],"genre_scores_gemma":[0.7254591,0.001923177,0.21174605,0.00019741668,0.000427694,0.000056415025,0.00057549786,0.00040498073,0.059209656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983359,0.00011622405,0.0002587788,0.0007677744,0.00012824635,0.000393074],"domain_scores_gemma":[0.9971667,0.001325884,0.00028778304,0.0005645523,0.0003711333,0.00028396782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045137748,0.00029341818,0.00039973258,0.00034457722,0.0002687346,0.00007692548,0.00037239914,0.00026876468,0.0001093067],"category_scores_gemma":[0.0013344089,0.00032961526,0.00015040075,0.00040532413,0.00014546736,0.00017511065,0.001066715,0.00045113877,0.00001773517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028940244,0.00037529212,0.0059765084,0.0038951405,0.0006851157,0.000741511,0.00061793544,0.6015859,0.000029969851,0.37081775,0.010606489,0.004378945],"study_design_scores_gemma":[0.0006998646,0.000030092306,0.00016199984,0.00015385321,0.00014986274,0.000003198906,0.00041947333,0.7441188,0.00003353726,0.2525276,0.0012526055,0.0004491194],"about_ca_topic_score_codex":0.00008610486,"about_ca_topic_score_gemma":0.00006626016,"teacher_disagreement_score":0.7487779,"about_ca_system_score_codex":0.00017344023,"about_ca_system_score_gemma":0.00017914889,"threshold_uncertainty_score":0.9999156},"labels":[],"label_agreement":null},{"id":"W4327521332","doi":"10.1007/978-3-030-54621-2_723-1","title":"Blackbox Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science","score_opus":0.03340248210910603,"score_gpt":0.3083465401588456,"score_spread":0.2749440580497396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327521332","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.109668e-7,0.00016239187,0.47095096,0.00008327487,0.00028579752,0.00069395656,0.00008385646,0.00014888715,0.5275906],"genre_scores_gemma":[0.0000030920746,0.00805784,0.549322,0.000028012857,0.00019394193,0.00006688329,0.00090881257,0.00026616076,0.44115323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962075,0.00009603401,0.0012200626,0.00071535754,0.001372757,0.0003883318],"domain_scores_gemma":[0.9965087,0.0004983222,0.0012250826,0.00090561796,0.0006990578,0.00016317611],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044876107,0.0005749128,0.0008045065,0.0007312272,0.00023279856,0.000034247558,0.0005627659,0.00046025944,0.040617153],"category_scores_gemma":[0.000766034,0.000661362,0.0002567,0.00028528983,0.00018013858,0.00045015855,0.0003639423,0.00072162953,0.000033884353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003790587,0.000070734524,0.0000021056542,0.00013951457,0.00008023646,0.000010886818,0.00016086502,0.88023937,3.0565647e-7,0.11300155,0.0048013385,0.0014552099],"study_design_scores_gemma":[0.0011551197,0.0002615767,5.537943e-7,0.00017728863,0.0002661866,0.000020554113,0.000058999653,0.72568434,0.000012805025,0.037677534,0.23353444,0.0011505965],"about_ca_topic_score_codex":0.000003712247,"about_ca_topic_score_gemma":0.0000016158161,"teacher_disagreement_score":0.22873309,"about_ca_system_score_codex":0.0003719873,"about_ca_system_score_gemma":0.00032953668,"threshold_uncertainty_score":0.9995838},"labels":[],"label_agreement":null},{"id":"W4361228973","doi":"10.1016/j.ejor.2023.03.021","title":"Revisiting degeneracy, strict feasibility, stability, in linear programming","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Linear programming; Mathematical optimization; Reduction (mathematics); Interior point method; Simplex; Mathematics; Feasible region; Duality (order theory); Simplex algorithm; Rank (graph theory); Stability (learning theory); Computer science; Discrete mathematics; Combinatorics","score_opus":0.34501571273221165,"score_gpt":0.4916102883578966,"score_spread":0.14659457562568495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361228973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94541234,0.00030551254,0.041307878,0.004704963,0.0002770618,0.0014090961,0.000022635284,0.00010893294,0.0064515932],"genre_scores_gemma":[0.74833214,0.00025764215,0.24870025,0.000031983698,0.001074094,0.0000121333505,0.000023086282,0.00010443187,0.0014642612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99080914,0.004574565,0.001197341,0.00031887667,0.0024664514,0.0006336197],"domain_scores_gemma":[0.99354964,0.0029395435,0.00018441913,0.00032888894,0.0027570408,0.00024043696],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03617419,0.00014175709,0.00028388007,0.0010253172,0.00030725801,0.00021440412,0.0006462524,0.000033981763,0.00031312864],"category_scores_gemma":[0.026573598,0.00012362504,0.00010305891,0.0025278474,0.00016317757,0.00052366353,0.00045687638,0.001249856,0.0001681004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030123866,0.004481122,0.15569443,0.0018968412,0.0004744902,0.014662367,0.015574365,0.21547866,0.029143138,0.08893307,0.029384466,0.44126466],"study_design_scores_gemma":[0.02705702,0.0064876853,0.22405314,0.0046136193,0.00007698393,0.0016077345,0.018798504,0.53532547,0.0175731,0.060713455,0.10007975,0.003613517],"about_ca_topic_score_codex":0.0000033134975,"about_ca_topic_score_gemma":0.0000054026987,"teacher_disagreement_score":0.43765113,"about_ca_system_score_codex":0.0003609838,"about_ca_system_score_gemma":0.00055481447,"threshold_uncertainty_score":0.9924615},"labels":[],"label_agreement":null},{"id":"W4362736486","doi":"10.1007/s10898-023-01281-0","title":"General convex relaxations of implicit functions and inverse functions","year":2023,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Mathematics; Relaxation (psychology); Monotonic function; Convex function; Convex analysis; Implicit function theorem; Applied mathematics; Uniqueness; Subderivative; Proper convex function; Mathematical optimization; Regular polygon; Convex optimization; Mathematical analysis","score_opus":0.03839066513758016,"score_gpt":0.347258696766238,"score_spread":0.30886803162865784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362736486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028236287,0.000050943403,0.9681309,0.00086588576,0.00036600514,0.00021757068,0.00008635476,0.000066828405,0.00197926],"genre_scores_gemma":[0.1025173,0.00094325095,0.88924944,0.00012910375,0.00047150144,0.000024607316,0.000117483614,0.00007793936,0.006469364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984884,0.000090420246,0.00067144545,0.00013382919,0.0004253291,0.00019055684],"domain_scores_gemma":[0.9978258,0.00019546728,0.00061555504,0.00017556261,0.0010423829,0.00014521506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041057897,0.00012017939,0.0002747291,0.00025961376,0.00016144659,0.00003402915,0.00011586993,0.00009901106,0.00016844507],"category_scores_gemma":[0.0012387915,0.00011271381,0.0000977102,0.00148799,0.00010120814,0.00045431277,0.000067453744,0.00016382657,0.000014636033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049136393,0.00008643154,0.0022289567,0.000029534001,0.000091386486,0.000005920744,0.00008087882,0.9736815,0.00012008628,0.00757886,0.015080133,0.00096714334],"study_design_scores_gemma":[0.001866629,0.0003307748,0.0033287727,0.000063123,0.0001775419,0.00019642271,0.0011034824,0.97804654,0.000056107874,0.013410588,0.0012036441,0.00021636335],"about_ca_topic_score_codex":0.000007925046,"about_ca_topic_score_gemma":0.000011475176,"teacher_disagreement_score":0.07888141,"about_ca_system_score_codex":0.00016506501,"about_ca_system_score_gemma":0.00014929404,"threshold_uncertainty_score":0.45963356},"labels":[],"label_agreement":null},{"id":"W4366809314","doi":"10.5220/0007406300002104","title":"Primal Heuristic for the Linear Ordering Problem","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada); Simon Fraser University","funders":"","keywords":"Heuristic; Mathematical optimization; Computer science; Mathematics","score_opus":0.057730932955733325,"score_gpt":0.3799505052787289,"score_spread":0.3222195723229956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366809314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068219303,0.000021987993,0.9875385,0.0005684221,0.00006381422,0.0013013472,0.0000032316782,0.00010559487,0.009714912],"genre_scores_gemma":[0.009958721,0.000013313966,0.9514731,0.000081413855,0.00007658104,0.00012077207,0.0000029030882,0.00003847523,0.0382347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929744,0.000013523974,0.00015281241,0.00014224181,0.00018357932,0.00021042099],"domain_scores_gemma":[0.9984887,0.0010208951,0.00003955425,0.00026655837,0.00015198613,0.000032277232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024442718,0.00007436569,0.000100202196,0.000028072798,0.000084648935,0.000025712918,0.00018064857,0.00003051212,0.0007882845],"category_scores_gemma":[0.00042126223,0.000045785044,0.00003804186,0.00011969499,0.000022805129,0.000069632755,0.0000750716,0.00009710644,0.00013623558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020216774,0.00038411925,0.00055927335,0.001378362,0.00021706664,0.0000034771824,0.001352475,0.11274728,0.0008962993,0.82879555,0.012445165,0.041018758],"study_design_scores_gemma":[0.00077778497,0.00008912445,0.00001901448,0.000017802302,0.000011824829,0.00000440016,0.00024196338,0.9262101,0.0008577542,0.046384484,0.025236191,0.0001495693],"about_ca_topic_score_codex":0.0000022348775,"about_ca_topic_score_gemma":0.0000029428081,"teacher_disagreement_score":0.8134628,"about_ca_system_score_codex":0.00002613182,"about_ca_system_score_gemma":0.000038580667,"threshold_uncertainty_score":0.86311626},"labels":[],"label_agreement":null},{"id":"W4376148934","doi":"10.1017/s0962492922000113","title":"Linear optimization over homogeneous matrix cones","year":2023,"lang":"en","type":"article","venue":"Acta Numerica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Dual cone and polar cone; Conic optimization; Cone (formal languages); Convex cone; Second-order cone programming; Matrix (chemical analysis); Cholesky decomposition; Homogeneous function; Combinatorics; Convex optimization; Regular polygon; Homogeneous; Geometry; Algorithm; Convex analysis; Physics","score_opus":0.04798404328696928,"score_gpt":0.3949699077849262,"score_spread":0.34698586449795693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376148934","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007007109,0.00007774656,0.98295563,0.0017396648,0.0003748206,0.0007788313,0.00006189342,0.0016639385,0.0053403443],"genre_scores_gemma":[0.061247762,0.00083958474,0.9117964,0.0002051663,0.00033181306,0.00012039899,0.00018904508,0.00021072944,0.025059111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860454,0.000061695595,0.00026960875,0.0002778848,0.00041160188,0.0003746808],"domain_scores_gemma":[0.99878186,0.00042672319,0.000111229485,0.0004100443,0.00015844178,0.00011170514],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016440151,0.00015207488,0.00021503361,0.00019623521,0.00014772454,0.00004056729,0.00023860138,0.00008449524,0.0012727672],"category_scores_gemma":[0.00077156496,0.00015076662,0.00006497588,0.0011515951,0.000062698025,0.00017722163,0.00013818646,0.00014382304,0.00044834422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009777312,0.00030164505,0.00034492256,0.00018990184,0.00017286217,0.00016317742,0.0008651857,0.9081239,0.0018816452,0.00354555,0.0742853,0.010028132],"study_design_scores_gemma":[0.0004957362,0.000058507714,0.000053646298,0.000015576219,0.000016190788,0.00001632491,0.00011227206,0.97319275,0.000603094,0.004081464,0.021075502,0.00027890925],"about_ca_topic_score_codex":0.000007690624,"about_ca_topic_score_gemma":7.9505276e-7,"teacher_disagreement_score":0.071159266,"about_ca_system_score_codex":0.000059906353,"about_ca_system_score_gemma":0.000051633688,"threshold_uncertainty_score":0.9996402},"labels":[],"label_agreement":null},{"id":"W4377108336","doi":"10.3390/math11102338","title":"Systems of Linear Equations with Non-Negativity Constraints: Hyper-Rectangle Cover Theory and Its Applications","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); Rectangle; Mathematics; Uniqueness; Matrix (chemical analysis); Linear programming; Applied mathematics; Mathematical optimization; Linear system; Rank (graph theory); Mathematical analysis; Combinatorics; Geometry","score_opus":0.054421355688968984,"score_gpt":0.3519612542378923,"score_spread":0.2975398985489233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377108336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012884135,0.000046744342,0.98186505,0.00005861718,0.000023544935,0.0013326764,0.00013622754,0.00018006486,0.0034729256],"genre_scores_gemma":[0.6262938,0.00012197631,0.36340275,0.00002330485,0.00009547422,0.0009616184,0.00005641111,0.00015256384,0.008892108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860936,0.0000936378,0.00041226455,0.00021360334,0.00042894468,0.00024215708],"domain_scores_gemma":[0.9946745,0.004216587,0.00024334017,0.00039407559,0.0003782862,0.000093193186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009436548,0.00016437887,0.00034530534,0.00017897174,0.00016154739,0.000030392192,0.00016884701,0.00008124029,0.0000848936],"category_scores_gemma":[0.0017727497,0.00013433707,0.00003558507,0.0007765126,0.00023952205,0.00013399792,0.000093940296,0.00014769367,0.00012798875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024464636,0.00050811877,0.000049419417,0.0024268008,0.00017099372,0.0000059696686,0.0035405122,0.010740354,0.0015983866,0.9789464,0.00040280435,0.0015857891],"study_design_scores_gemma":[0.0011999428,0.0001372178,0.000018998066,0.00041767152,0.00012572478,0.000041406867,0.004749826,0.8452696,0.0033974794,0.14373109,0.00048463998,0.00042634943],"about_ca_topic_score_codex":0.0000013147798,"about_ca_topic_score_gemma":0.0000016287381,"teacher_disagreement_score":0.8352153,"about_ca_system_score_codex":0.000037515758,"about_ca_system_score_gemma":0.00008567161,"threshold_uncertainty_score":0.5478107},"labels":[],"label_agreement":null},{"id":"W4377249859","doi":"10.1007/978-3-031-33271-5_6","title":"A Mixed-Integer Linear Programming Reduction of Disjoint Bilinear Programs via Symbolic Variable Elimination","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Reduction (mathematics); Bilinear interpolation; Mathematical optimization; Integer programming; Leverage (statistics); Linear programming; Variable elimination; Algorithm; Mathematics; Artificial intelligence","score_opus":0.05602265575196789,"score_gpt":0.3241523219026889,"score_spread":0.268129666150721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004688886,0.00004149876,0.9971049,0.00018346254,0.000803355,0.0012317759,0.0000060248403,0.00026131645,0.0003208105],"genre_scores_gemma":[0.0053188084,0.00003540819,0.99245936,0.000015758795,0.00043605437,0.00006212651,0.000043667387,0.00011091612,0.0015178827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632984,0.000049643488,0.00078401563,0.0009642546,0.0012899091,0.0005823427],"domain_scores_gemma":[0.99717885,0.00046806462,0.00046320877,0.00078798115,0.00097508676,0.00012679426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013754896,0.00040098245,0.0005750329,0.0009924979,0.000161202,0.00011772486,0.00073630235,0.00034392922,0.000025492798],"category_scores_gemma":[0.0008262483,0.0003633166,0.000121804005,0.0013820587,0.0007333302,0.00028614185,0.0004944868,0.0007963909,0.000023732082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019552272,0.00015892053,0.0000050463086,0.00044090796,0.000028727518,0.000014507721,0.0007985011,0.12774189,0.00027600265,0.021744281,0.0000073623614,0.8487643],"study_design_scores_gemma":[0.00020746473,0.00022558818,0.0000024250185,0.0007237713,0.00001973203,0.00003694682,0.0000023937835,0.7831269,0.00207562,0.21295671,0.0002765081,0.00034594297],"about_ca_topic_score_codex":0.000019263854,"about_ca_topic_score_gemma":0.00002087053,"teacher_disagreement_score":0.84841835,"about_ca_system_score_codex":0.00033322195,"about_ca_system_score_gemma":0.00037442878,"threshold_uncertainty_score":0.99988186},"labels":[],"label_agreement":null},{"id":"W4384575228","doi":"10.23952/asvao.5.2023.2.08","title":"Stable-set and coloring bounds based on 0-1 quadratic optimization","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Combinatorics; Chromatic scale; Mathematics; Quadratic equation; Graph coloring; Semidefinite programming; Graph; Fractional coloring; Independent set; Optimization problem; Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science; Mathematical optimization; Graph power; Line graph","score_opus":0.04479834601375983,"score_gpt":0.3336006379571591,"score_spread":0.2888022919433993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044148844,0.000022106064,0.9931667,0.00020450116,0.000037441387,0.00060662534,0.000042533844,0.00033418438,0.0011710584],"genre_scores_gemma":[0.23117265,0.0005163245,0.7650312,0.00026872812,0.00008540646,0.00026489195,0.001762722,0.00013274144,0.0007653377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997422,0.00014942605,0.00057856285,0.00070352526,0.00068758166,0.00045894744],"domain_scores_gemma":[0.99826247,0.00056437135,0.000271929,0.00047204504,0.00022538664,0.00020381255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000915755,0.00033385813,0.00056813535,0.0012544277,0.0005647939,0.00031152327,0.00015127295,0.00018206994,0.00033272096],"category_scores_gemma":[0.00038055808,0.00032670342,0.00009113849,0.0041971807,0.00011967415,0.00024716117,0.00010253882,0.0002089438,0.000011308812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006389598,0.000050343726,0.00021232593,0.00006715005,0.0002095661,0.0000030156493,0.00028428604,0.9934387,0.000021046426,0.004710805,0.00017192386,0.00076692534],"study_design_scores_gemma":[0.0010131396,0.00006297761,0.00011405333,0.000021184766,0.0004810119,6.5983704e-7,0.00046371008,0.99605644,0.00011070584,0.0012962527,0.000042640302,0.00033722652],"about_ca_topic_score_codex":0.000015921876,"about_ca_topic_score_gemma":0.000016329075,"teacher_disagreement_score":0.22813547,"about_ca_system_score_codex":0.00010838086,"about_ca_system_score_gemma":0.000064056345,"threshold_uncertainty_score":0.9999185},"labels":[],"label_agreement":null},{"id":"W4384575252","doi":"10.23952/asvao.5.2023.2.01","title":"Editorial: A special issue on recent trends in optimization methods and their applications dedicated to Henry Wolkowicz on the occasion of his 75th birthday","year":2023,"lang":"en","type":"editorial","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Data science","score_opus":0.03369340219235849,"score_gpt":0.3860824393959177,"score_spread":0.3523890372035592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575252","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005561002,0.00005618464,0.86663276,0.00052076566,0.1298512,0.0016121902,0.00039694496,0.00016301437,0.00076139777],"genre_scores_gemma":[0.0000246673,0.0040200916,0.35806528,0.000078318044,0.63035595,0.0011929832,0.005107197,0.00028384785,0.0008716755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458885,0.00071851374,0.0014033391,0.0013096391,0.001445336,0.0005343013],"domain_scores_gemma":[0.9925973,0.0043189614,0.0009441807,0.0010418042,0.0008365698,0.00026119236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002946016,0.0007229359,0.0014447542,0.0031053096,0.00038526178,0.00018683662,0.0005198051,0.001023162,0.0004898063],"category_scores_gemma":[0.0026961754,0.0005495397,0.00020196398,0.008536701,0.00017699922,0.000112857975,0.0002838497,0.0009872576,0.000013024764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020568166,0.00015534433,9.754041e-7,0.000048890244,0.0003552882,3.8880992e-7,0.0005418517,0.60527456,0.000011079991,0.00064485276,0.37374702,0.019014064],"study_design_scores_gemma":[0.0014022166,0.00021020541,0.0000054459197,0.00013495161,0.0008861338,2.012239e-7,0.0006406368,0.7275161,0.00020631489,0.0013456494,0.26684764,0.0008045174],"about_ca_topic_score_codex":0.00005471229,"about_ca_topic_score_gemma":0.00008134426,"teacher_disagreement_score":0.50856745,"about_ca_system_score_codex":0.00039204105,"about_ca_system_score_gemma":0.00015329036,"threshold_uncertainty_score":0.9996956},"labels":[],"label_agreement":null},{"id":"W4384575256","doi":"10.23952/asvao.5.2023.2.05","title":"Facial reduction for the Shor SDP relaxation of QCQPs","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Semidefinite programming; Quadratically constrained quadratic program; Mathematics; Quadratic programming; Relaxation (psychology); Quadratic growth; Second-order cone programming; Singularity; Quadratic equation; Dimension (graph theory); Class (philosophy); Reduction (mathematics); Mathematical optimization; Computer science; Algorithm; Combinatorics; Artificial intelligence; Mathematical analysis","score_opus":0.05109399140448403,"score_gpt":0.35090289179345646,"score_spread":0.29980890038897245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002924597,0.000028786153,0.9955477,0.00025686348,0.000053675027,0.00078550936,0.00004052893,0.00010954989,0.0002527628],"genre_scores_gemma":[0.32601798,0.0009893641,0.66883135,0.000037614845,0.000243872,0.00055159634,0.0013673509,0.00008591282,0.001874983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850243,0.00005671427,0.0005117412,0.00032140518,0.0003933252,0.00021437636],"domain_scores_gemma":[0.99858147,0.00040267475,0.00034455612,0.00031231987,0.00030887322,0.00005010232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088162674,0.00014607978,0.00031301432,0.0004904646,0.00034981366,0.000053284,0.00013344004,0.00011229216,0.00007938891],"category_scores_gemma":[0.00041962054,0.00011437839,0.00013232537,0.0027381785,0.000096508105,0.00012669488,0.000053717537,0.00009707172,0.0000035188336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006038355,0.00002653588,0.000026456053,0.000035751254,0.00036585174,9.037603e-8,0.00057184073,0.9749674,0.0003468051,0.0145074,0.00041840115,0.00867309],"study_design_scores_gemma":[0.0004801485,0.000025215635,0.00012596781,0.000004692969,0.0006859296,4.706731e-7,0.0009858924,0.9896851,0.0009866712,0.0067507527,0.0001439734,0.00012513774],"about_ca_topic_score_codex":0.000011226887,"about_ca_topic_score_gemma":0.000008626531,"teacher_disagreement_score":0.3267164,"about_ca_system_score_codex":0.000040953415,"about_ca_system_score_gemma":0.000030811698,"threshold_uncertainty_score":0.46642154},"labels":[],"label_agreement":null},{"id":"W4384825905","doi":"10.1093/imanum/drad050","title":"Adapting the centred simplex gradient to compensate for misaligned sample points","year":2023,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Simplex; Mathematics; Computation; Set (abstract data type); Sample (material); Applied mathematics; Simplex algorithm; Sampling (signal processing); RADIUS; Stability (learning theory); Combinatorics; Mathematical optimization; Algorithm; Mathematical analysis; Computer science; Linear programming; Physics","score_opus":0.12586645594345844,"score_gpt":0.40475094510855686,"score_spread":0.27888448916509845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384825905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01221446,0.000029370185,0.9774687,0.009870368,0.00006245242,0.00024625057,0.000047362486,0.000036283687,0.000024738703],"genre_scores_gemma":[0.30417427,0.000039112423,0.69440484,0.00062043045,0.00023792198,0.000022293707,0.00002594564,0.00005659353,0.00041859897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977889,0.00017953254,0.00074001186,0.0001814218,0.00067914795,0.00043100354],"domain_scores_gemma":[0.9949716,0.0034041659,0.0004251842,0.00026752366,0.0006681686,0.00026338894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008184178,0.000142506,0.0005439837,0.0004959643,0.00022745105,0.00007548391,0.0004323373,0.000032826472,0.00024333202],"category_scores_gemma":[0.004860303,0.00009259231,0.00055505737,0.0033075553,0.00004341523,0.00009500384,0.0001087184,0.00015903127,0.000026892701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013795267,0.000943938,0.0021152482,0.00014124968,0.01180518,0.00015396283,0.008468337,0.83153874,0.0015231248,0.006688854,0.054457054,0.0807848],"study_design_scores_gemma":[0.0011787643,0.00026941148,0.001069212,0.00002929373,0.0011937591,0.00001997781,0.003587166,0.9391095,0.00040882477,0.038334683,0.014511341,0.0002880742],"about_ca_topic_score_codex":0.000029969066,"about_ca_topic_score_gemma":0.0000112176085,"teacher_disagreement_score":0.2919598,"about_ca_system_score_codex":0.0001064495,"about_ca_system_score_gemma":0.000041976484,"threshold_uncertainty_score":0.58185875},"labels":[],"label_agreement":null},{"id":"W4385076334","doi":"10.1016/j.ejor.2023.07.026","title":"A linear programming approach to difference-of-convex piecewise linear approximation","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Piecewise linear function; Polytope; Mathematical optimization; Linear programming; Mathematics; Bottleneck; Linear approximation; Approximation algorithm; Approximation error; Dimension (graph theory); Algorithm; Computer science; Discrete mathematics; Nonlinear system; Combinatorics","score_opus":0.2509848535530079,"score_gpt":0.4458775540522877,"score_spread":0.19489270049927976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385076334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07665802,0.000077766796,0.9059391,0.0019255332,0.00016870532,0.0014299764,0.000026164236,0.000092238115,0.013682476],"genre_scores_gemma":[0.2095851,0.000077544064,0.7841766,0.000038731,0.00070537906,0.00003361104,0.00004236516,0.00010501716,0.005235653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941997,0.0014038514,0.0010120191,0.00028266312,0.00259378,0.00050801015],"domain_scores_gemma":[0.99460423,0.0009210669,0.00023373717,0.00032804027,0.0035722018,0.00034070367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009447556,0.00016480288,0.0003457981,0.0011766771,0.00028188535,0.00011906307,0.0007326332,0.000043248347,0.00009162281],"category_scores_gemma":[0.008192792,0.00013550898,0.00011628615,0.002163695,0.00017696831,0.00030259136,0.00032367688,0.00082682463,0.00021816781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020979368,0.0055089896,0.0013682408,0.0020053613,0.0008140601,0.00079517235,0.028785914,0.45454544,0.035568323,0.13371438,0.036719806,0.29807636],"study_design_scores_gemma":[0.004732916,0.0029900395,0.0039558685,0.000808607,0.00004277897,0.00027253406,0.0047712037,0.9383975,0.008258068,0.009143768,0.025759058,0.00086760736],"about_ca_topic_score_codex":0.0000015521609,"about_ca_topic_score_gemma":3.6128046e-7,"teacher_disagreement_score":0.48385212,"about_ca_system_score_codex":0.00011235226,"about_ca_system_score_gemma":0.00039332334,"threshold_uncertainty_score":0.9808129},"labels":[],"label_agreement":null},{"id":"W4385291775","doi":"10.48550/arxiv.2307.13046","title":"Skydiving to Bootstrap Islands","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; European Commission; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Resnick Sustainability Institute for Science, Energy and Sustainability, California Institute of Technology; Government of Canada; California Institute of Technology; U.S. Department of Energy","keywords":"Space (punctuation); Computation; Point (geometry); Parameter space; Conformal map; Test (biology); Process (computing); Mathematical optimization; Medicine; Applied mathematics; Mathematics; Algorithm; Computer science; Statistics; Mathematical analysis; Geometry","score_opus":0.3285378716142433,"score_gpt":0.30563627273312255,"score_spread":0.022901598881120755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385291775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042138092,0.000009133076,0.94981086,0.0002029334,0.00047477943,0.0007311645,0.00009091224,0.00078503526,0.0057570715],"genre_scores_gemma":[0.88356423,0.00017904345,0.034669038,0.00008237033,0.00022773344,0.0000066805496,0.000045592275,0.00016971011,0.081055574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979912,0.000108490414,0.00025010548,0.0009494071,0.00018762238,0.00051314174],"domain_scores_gemma":[0.9978015,0.00043288217,0.00015857616,0.0010448464,0.0002717723,0.00029045405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034818624,0.0003212106,0.00039778498,0.0005578267,0.00016040428,0.000076836644,0.0009018575,0.0003069199,0.00029328608],"category_scores_gemma":[0.0006131534,0.00038885404,0.00018606479,0.0009009846,0.00007010249,0.00012780388,0.0019473165,0.00076205505,0.0006698839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053976182,0.00011814251,0.0012745855,0.00032203837,0.00018705333,0.00059282605,0.0006042935,0.9317687,0.000017851757,0.057486445,0.007186304,0.00038777338],"study_design_scores_gemma":[0.0007897543,0.000079059544,0.0005949045,0.00037471915,0.00011921748,0.000004525487,0.0006846443,0.5343235,0.00013326805,0.46008807,0.0017635182,0.0010447694],"about_ca_topic_score_codex":0.000034962515,"about_ca_topic_score_gemma":0.00006838272,"teacher_disagreement_score":0.9151418,"about_ca_system_score_codex":0.00031386767,"about_ca_system_score_gemma":0.00016118522,"threshold_uncertainty_score":0.99985635},"labels":[],"label_agreement":null},{"id":"W4385482699","doi":"10.32920/23823903.v1","title":"An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interior point method; Monotone polygon; Mathematics; Arc (geometry); Complementarity (molecular biology); Linear complementarity problem; Algorithm; Combinatorics; Ellipse; Path (computing); Convergence (economics); Geometry; Computer science; Physics","score_opus":0.19956433517390607,"score_gpt":0.4501301531394958,"score_spread":0.25056581796558974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385482699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015438639,0.000043770193,0.98789364,0.00054271263,0.0005388664,0.0066218125,0.0015506493,0.0009308939,0.00033380842],"genre_scores_gemma":[0.0019774071,0.00025456905,0.9876029,0.0001161097,0.00045123216,0.0018630566,0.0018066174,0.00035759024,0.0055705067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453425,0.00030255047,0.0013326047,0.0014637526,0.0012674063,0.001099456],"domain_scores_gemma":[0.9948889,0.001419766,0.00037312685,0.0016086382,0.0012740073,0.00043553358],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021527652,0.0006975351,0.0011320208,0.0012016477,0.000288893,0.00031689825,0.0012606051,0.00046347748,0.001220832],"category_scores_gemma":[0.00064179656,0.0006712011,0.0003539571,0.00086903933,0.00022252422,0.0002910931,0.0024954157,0.0014268362,0.000113139235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091090926,0.010849546,0.0028643906,0.027963009,0.007557653,0.00028561766,0.014652542,0.23075135,0.0023626175,0.13749775,0.057530247,0.50677437],"study_design_scores_gemma":[0.0014591508,0.00032051746,0.00009452417,0.00019587453,0.000058672904,0.000004806163,0.00048704192,0.89519,0.001334479,0.09924917,0.0009088214,0.00069695053],"about_ca_topic_score_codex":0.00094715366,"about_ca_topic_score_gemma":0.00033133212,"teacher_disagreement_score":0.66443866,"about_ca_system_score_codex":0.000612487,"about_ca_system_score_gemma":0.00035345848,"threshold_uncertainty_score":0.9996922},"labels":[],"label_agreement":null},{"id":"W4385489671","doi":"10.32920/23823903","title":"An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interior point method; Monotone polygon; Mathematics; Arc (geometry); Complementarity (molecular biology); Combinatorics; Algorithm; Ellipse; Path (computing); Convergence (economics); Geometry; Computer science","score_opus":0.19956433517390607,"score_gpt":0.4501301531394958,"score_spread":0.25056581796558974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385489671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015438639,0.000043770193,0.98789364,0.00054271263,0.0005388664,0.0066218125,0.0015506493,0.0009308939,0.00033380842],"genre_scores_gemma":[0.0019774071,0.00025456905,0.9876029,0.0001161097,0.00045123216,0.0018630566,0.0018066174,0.00035759024,0.0055705067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453425,0.00030255047,0.0013326047,0.0014637526,0.0012674063,0.001099456],"domain_scores_gemma":[0.9948889,0.001419766,0.00037312685,0.0016086382,0.0012740073,0.00043553358],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021527652,0.0006975351,0.0011320208,0.0012016477,0.000288893,0.00031689825,0.0012606051,0.00046347748,0.001220832],"category_scores_gemma":[0.00064179656,0.0006712011,0.0003539571,0.00086903933,0.00022252422,0.0002910931,0.0024954157,0.0014268362,0.000113139235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091090926,0.010849546,0.0028643906,0.027963009,0.007557653,0.00028561766,0.014652542,0.23075135,0.0023626175,0.13749775,0.057530247,0.50677437],"study_design_scores_gemma":[0.0014591508,0.00032051746,0.00009452417,0.00019587453,0.000058672904,0.000004806163,0.00048704192,0.89519,0.001334479,0.09924917,0.0009088214,0.00069695053],"about_ca_topic_score_codex":0.00094715366,"about_ca_topic_score_gemma":0.00033133212,"teacher_disagreement_score":0.66443866,"about_ca_system_score_codex":0.000612487,"about_ca_system_score_gemma":0.00035345848,"threshold_uncertainty_score":0.9996922},"labels":[],"label_agreement":null},{"id":"W4385633577","doi":"10.1016/j.matcom.2023.07.026","title":"Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation","year":2023,"lang":"en","type":"article","venue":"Mathematics and Computers in Simulation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Conjugate residual method; Nonlinear conjugate gradient method; Derivation of the conjugate gradient method; Algorithm; Line search; Convergence (economics); Gradient method; Mathematics; Point (geometry); Mathematical optimization; Computer science; Rate of convergence; Applied mathematics; Gradient descent; Artificial neural network; Key (lock)","score_opus":0.0930286820697138,"score_gpt":0.38995409366274947,"score_spread":0.29692541159303565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385633577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042361777,0.000009016744,0.95685536,0.000017524371,0.000051920742,0.00058658305,0.00000918768,0.00005026858,0.00005833913],"genre_scores_gemma":[0.102243975,0.000012624993,0.89765847,0.000002908572,0.000012455808,0.0000075943763,0.000024582216,0.00002384552,0.00001355063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.00008070861,0.00077015284,0.00020355654,0.00033244884,0.00019183867],"domain_scores_gemma":[0.9983585,0.0007901494,0.00039292025,0.00016822814,0.00024685648,0.00004336192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078918145,0.00014359744,0.0003701252,0.00044021796,0.00004841653,0.000019055196,0.000087886656,0.000079099686,0.000008341933],"category_scores_gemma":[0.00021918118,0.00014286868,0.000044674427,0.0009402268,0.0000688769,0.00013930803,0.000075897,0.00008190364,4.0650394e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006080346,0.00007956211,0.00008132442,0.00032862794,0.000023495733,0.0000014728419,0.0020450463,0.982014,0.00022794725,0.0063672955,0.0000016122337,0.008823533],"study_design_scores_gemma":[0.0007287868,0.000039516177,0.00008744612,0.00021270364,0.000016663224,0.0000037152345,0.00019414882,0.94824636,0.00037136718,0.04997666,0.0000013697859,0.000121259145],"about_ca_topic_score_codex":0.000009556741,"about_ca_topic_score_gemma":0.0000025489744,"teacher_disagreement_score":0.059882194,"about_ca_system_score_codex":0.000064442465,"about_ca_system_score_gemma":0.00004645686,"threshold_uncertainty_score":0.5826016},"labels":[],"label_agreement":null},{"id":"W4385981530","doi":"10.1137/22m1529178","title":"Structured Systems of Nonlinear Equations","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; National Science Foundation","keywords":"Bottleneck; Robustness (evolution); Minimax; Nonlinear system; Graph; Mathematics; Computer science; System of linear equations; Mathematical optimization; Applied mathematics; Theoretical computer science; Mathematical analysis","score_opus":0.07373569745742763,"score_gpt":0.36892454508304395,"score_spread":0.2951888476256163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385981530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010529585,0.000033578548,0.97499835,0.00021722894,0.00045729327,0.0010527754,0.00006748661,0.0003360589,0.012307626],"genre_scores_gemma":[0.071507595,0.00015497116,0.92513496,0.000037825645,0.0004397695,0.00006905306,0.00002863378,0.00018091564,0.0024462673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973791,0.000042280677,0.0009320287,0.0001774283,0.0010829252,0.0003861868],"domain_scores_gemma":[0.99693984,0.0014064945,0.0006420646,0.0004751852,0.00035844473,0.00017797666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097627915,0.0002178113,0.0004850907,0.0005061014,0.00019893116,0.00008003802,0.00039067928,0.00012449903,0.0001593163],"category_scores_gemma":[0.0012451429,0.00017803772,0.000114031514,0.0009542738,0.00008139611,0.00007970744,0.00008358671,0.0004861595,0.0002168027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032216267,0.0003332498,0.0000022618965,0.00065947534,0.00015113463,0.000026252046,0.001322877,0.071369044,0.0029392422,0.9174902,0.0034716723,0.0022023648],"study_design_scores_gemma":[0.0016556011,0.00016736524,0.000007899384,0.00032213892,0.00007233392,0.00010181878,0.0035160112,0.46475077,0.0041644266,0.5234039,0.0014085482,0.00042921657],"about_ca_topic_score_codex":2.7156693e-7,"about_ca_topic_score_gemma":4.875963e-7,"teacher_disagreement_score":0.39408633,"about_ca_system_score_codex":0.00009669582,"about_ca_system_score_gemma":0.00011248909,"threshold_uncertainty_score":0.72601676},"labels":[],"label_agreement":null},{"id":"W4386248540","doi":"10.1017/9781009303897.006","title":"Zeros and Minima","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Maxima and minima; Section (typography); Action (physics); Nonlinear system; Mathematics; Applied mathematics; Statement (logic); Minification; Variable (mathematics); Calculus (dental); Mathematical optimization; Mathematical analysis; Computer science; Physics","score_opus":0.07804702048451906,"score_gpt":0.2806680041067369,"score_spread":0.20262098362221787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386248540","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017197313,0.000036262052,0.0067083794,0.000020507265,0.000102481456,0.00050615385,0.00029168752,0.0003459721,0.9919714],"genre_scores_gemma":[0.000009202703,0.00027928955,0.0067801434,0.000016588945,0.00007451637,0.00000113139,0.000031690586,0.00011538425,0.99269205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864936,0.000029779572,0.00018234612,0.0004828436,0.00036801837,0.00028763225],"domain_scores_gemma":[0.9985833,0.0003467219,0.00016446495,0.0004940775,0.00021245507,0.0001989898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011249511,0.00030869545,0.00039145813,0.0002530105,0.0001766797,0.00004239038,0.00032903775,0.00033645218,0.000009948689],"category_scores_gemma":[0.000083421786,0.00037199396,0.0001076668,0.000012430785,0.00028956862,0.00007508475,0.0006299658,0.00047548334,0.00003511654],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033307486,0.0000052587466,2.863996e-7,0.00016021171,0.00009485897,0.00029604047,0.000039993458,0.0000034593206,0.000013221129,0.95609397,0.041883487,0.001375937],"study_design_scores_gemma":[0.00093492295,0.00005942214,0.0000031319398,0.00023847635,0.00016624086,0.000023668184,0.00007131871,0.0011414221,0.0002256427,0.001468821,0.99502003,0.0006469285],"about_ca_topic_score_codex":0.0000109930215,"about_ca_topic_score_gemma":6.9469706e-7,"teacher_disagreement_score":0.9546251,"about_ca_system_score_codex":0.00012925896,"about_ca_system_score_gemma":0.00007465484,"threshold_uncertainty_score":0.9998732},"labels":[],"label_agreement":null},{"id":"W4387581030","doi":"10.1016/j.laa.2023.10.006","title":"Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Trigonometric functions; Measure (data warehouse); Linear span; Set (abstract data type); Space (punctuation); Combinatorics; Discrete mathematics; Vector space; Pure mathematics; Computer science; Data mining; Geometry","score_opus":0.07239264080525937,"score_gpt":0.37727456567819156,"score_spread":0.3048819248729322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387581030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095385194,0.00014116059,0.9002361,0.00054333056,0.000020997528,0.0023177415,0.0008083307,0.0002773007,0.000269821],"genre_scores_gemma":[0.19264977,0.000033730805,0.8058096,0.00014066939,0.00017713105,0.00040101566,0.00041545197,0.00010387841,0.0002687265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868685,0.000044771707,0.0002740427,0.000386836,0.00028110726,0.00032638287],"domain_scores_gemma":[0.99798924,0.0008302465,0.00016029556,0.00018913535,0.00072326517,0.00010781309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001841915,0.00020070639,0.00025534787,0.00016702797,0.00053508946,0.00006194076,0.00011868443,0.000082266,0.000019529281],"category_scores_gemma":[0.00030800072,0.00017625921,0.000044622753,0.0007206787,0.00011519509,0.00019173115,0.000068516674,0.00016950526,0.000005023225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008166699,0.00032763326,0.0013313601,0.00093513256,0.0011132539,0.00003724292,0.0048510507,0.01503666,0.047663994,0.88442683,0.0005188219,0.042941336],"study_design_scores_gemma":[0.0044584074,0.00045220825,0.0012569852,0.00087194575,0.00044089856,0.00036277584,0.005605733,0.8547424,0.046433397,0.08292126,0.001009857,0.0014440985],"about_ca_topic_score_codex":0.0000029309183,"about_ca_topic_score_gemma":0.000009321421,"teacher_disagreement_score":0.83970577,"about_ca_system_score_codex":0.000035207682,"about_ca_system_score_gemma":0.00010979396,"threshold_uncertainty_score":0.71876425},"labels":[],"label_agreement":null},{"id":"W4387845108","doi":"10.1007/s12532-023-00248-2","title":"Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Second-order cone programming; Mathematical optimization; Mathematics; Linear programming; Convex optimization; Semidefinite programming; Computer science; Applied mathematics; Quadratic programming; Algorithm; Regular polygon","score_opus":0.05031470689977383,"score_gpt":0.3484830661823973,"score_spread":0.2981683592826235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387845108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008066807,0.000007823443,0.9858714,0.00050954265,0.00011014249,0.0043250853,0.000027375812,0.00095146033,0.00013037685],"genre_scores_gemma":[0.01824838,0.0000045640923,0.97958404,0.000052177544,0.00006336174,0.0009966979,0.0007244619,0.0001575673,0.00016874395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963643,0.0001673163,0.0009976863,0.00065872027,0.00092535827,0.00088663946],"domain_scores_gemma":[0.9964206,0.0020889407,0.0003710958,0.00040014696,0.00051014585,0.00020906504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010835862,0.00040221884,0.00061590824,0.0006337785,0.0003262476,0.00022423967,0.00034488097,0.0002805266,0.00010356722],"category_scores_gemma":[0.0010392003,0.00039278777,0.00020126885,0.001477794,0.00016863733,0.00039032742,0.00016571478,0.0003225438,0.00017019628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013022815,0.0008400594,0.00030047083,0.0030840756,0.00006751094,0.000028124821,0.0032008432,0.9676204,0.00010202388,0.012918248,0.0012599492,0.010448083],"study_design_scores_gemma":[0.0028353592,0.0002008581,0.00001882595,0.00036936265,0.000025510217,0.000004749478,0.00043171522,0.76459277,0.000078803016,0.23053792,0.0005502759,0.00035383424],"about_ca_topic_score_codex":0.0000022813472,"about_ca_topic_score_gemma":0.0000070374026,"teacher_disagreement_score":0.21761967,"about_ca_system_score_codex":0.00040535346,"about_ca_system_score_gemma":0.00012579765,"threshold_uncertainty_score":0.9998524},"labels":[],"label_agreement":null},{"id":"W4388197226","doi":"10.1016/j.compchemeng.2023.108462","title":"Evaluating subgradients for convex relaxations of dynamic process models by adapting current tools","year":2023,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Solver; Mathematical optimization; Ode; Automatic differentiation; Mathematics; Parametric statistics; Ordinary differential equation; Convex optimization; Computer science; Regular polygon; Applied mathematics; Algorithm; Differential equation","score_opus":0.14869098292905453,"score_gpt":0.4295697206097534,"score_spread":0.2808787376806989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388197226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08595197,0.000077687706,0.9129967,0.000034906254,0.00014009007,0.00047227807,0.000036387697,0.00028058793,0.0000093629515],"genre_scores_gemma":[0.44750494,0.000015002942,0.55194825,0.000004427289,0.000045702953,0.00020305428,0.00017277947,0.00007605106,0.000029796613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986138,0.000011631028,0.0004096604,0.00026963212,0.0003446853,0.00035058957],"domain_scores_gemma":[0.9982661,0.0010792003,0.00012790033,0.0001904686,0.00024191407,0.00009441535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030722184,0.00015265384,0.00025688412,0.00012591344,0.000049373033,0.000025218758,0.00024814645,0.00005927331,0.0000029061953],"category_scores_gemma":[0.0013332675,0.00016932971,0.000076159784,0.00050111033,0.000025652042,0.00020036031,0.000104721716,0.00018912528,0.0000019148051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008732094,0.000053413998,0.000002288795,0.000782192,0.000034700104,4.1777574e-7,0.00048154706,0.94724977,0.024623511,0.0016509857,0.00025969435,0.024852753],"study_design_scores_gemma":[0.0004975821,0.000019775998,0.0000012950918,0.00019989598,0.0000121429575,0.0000010912739,0.000027580541,0.9864001,0.0075799874,0.005083703,0.000019939696,0.00015684875],"about_ca_topic_score_codex":3.0071948e-7,"about_ca_topic_score_gemma":2.682009e-8,"teacher_disagreement_score":0.36155298,"about_ca_system_score_codex":0.000113369504,"about_ca_system_score_gemma":0.000031129366,"threshold_uncertainty_score":0.6905065},"labels":[],"label_agreement":null},{"id":"W4389086358","doi":"10.28924/2291-8639-21-2023-129","title":"The Study of Coordinate-Wise Decomposition Descent Method for Optimization Problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Descent (aeronautics); Coordinate descent; Convergence (economics); Variational inequality; Sequence (biology); Mathematical optimization; Decomposition; Applied mathematics; Optimization problem; Type (biology); Descent direction; Function (biology); Gradient descent; Computer science; Artificial neural network","score_opus":0.047184464089374725,"score_gpt":0.4505427958069514,"score_spread":0.4033583317175767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389086358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005472294,0.00003515778,0.99305874,0.0008244257,0.000032192173,0.00051680376,0.000018531437,0.000011437982,0.000030427507],"genre_scores_gemma":[0.4692579,0.00091254857,0.52874917,0.000023375846,0.00019177549,0.00039918238,0.000067782734,0.000027967093,0.0003702902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987009,0.00007767415,0.00059257087,0.00011350213,0.0004256081,0.00008972942],"domain_scores_gemma":[0.99665785,0.0008879229,0.0005825043,0.00013411144,0.0016904726,0.000047133435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009846517,0.00006901061,0.00019467478,0.0004698714,0.00016941906,0.00006934687,0.00028962913,0.000025058167,0.00001069378],"category_scores_gemma":[0.00019918662,0.00004960652,0.00012815886,0.0009317458,0.000032749613,0.00010835808,0.00005484637,0.00007427263,5.2545005e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063065585,0.00051531504,0.0008954349,0.000014260323,0.0019322815,8.7356193e-7,0.00038804155,0.9562348,0.00025148396,0.008336906,0.00025367588,0.031113822],"study_design_scores_gemma":[0.0010895649,0.00016859986,0.0009196068,0.000016702452,0.00069328357,0.0000074267523,0.0015602863,0.97153133,0.0003588024,0.022117713,0.0014500796,0.000086621934],"about_ca_topic_score_codex":0.000007806594,"about_ca_topic_score_gemma":0.000024398514,"teacher_disagreement_score":0.46430954,"about_ca_system_score_codex":0.00004539484,"about_ca_system_score_gemma":0.00002818867,"threshold_uncertainty_score":0.20228952},"labels":[],"label_agreement":null},{"id":"W4389705432","doi":"10.23952/jnva.8.2024.1.07","title":"A modification piecewise convexification method with a classification strategy for box-constrained non-convex optimization programs","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Natural Science Foundation of Chongqing; National Natural Science Foundation of China; Chongqing Postdoctoral Science Foundation; Chongqing Normal University","keywords":"Piecewise; Mathematical optimization; Regular polygon; Mathematics; Constrained optimization problem; Computer science; Optimization problem","score_opus":0.11883119473027529,"score_gpt":0.41675279156275186,"score_spread":0.29792159683247654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389705432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023703822,0.000015147592,0.99565697,0.0012277475,0.000027730439,0.00053746375,0.000053694563,0.000043553744,0.000067283654],"genre_scores_gemma":[0.08693049,0.00009461629,0.911667,0.00002366656,0.00017786497,0.00008705659,0.000682238,0.000029499988,0.00030758267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794203,0.00012983679,0.0008208963,0.0002859217,0.0006088526,0.00021244385],"domain_scores_gemma":[0.995847,0.00069910294,0.0009737985,0.00020180654,0.0021383264,0.00014000743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015962037,0.00017388955,0.00044757966,0.00094369275,0.0001911122,0.0001293849,0.00015871407,0.00011874523,0.000047410624],"category_scores_gemma":[0.00051741156,0.00013947835,0.00018625408,0.0024219651,0.0000666369,0.0004379565,0.000016393407,0.00016849686,0.0000024522483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036631647,0.00038051893,0.00088568934,0.00010240248,0.0016941741,0.0000030054332,0.00048596974,0.9619873,0.00054116425,0.015966004,0.00008741756,0.017500017],"study_design_scores_gemma":[0.0012723587,0.00022319378,0.002662593,0.000020424583,0.0009387622,0.000015806572,0.0005012962,0.9874192,0.0000846995,0.0066282577,0.00008049906,0.00015290173],"about_ca_topic_score_codex":0.000005102719,"about_ca_topic_score_gemma":0.0000060397706,"teacher_disagreement_score":0.08456011,"about_ca_system_score_codex":0.0000810889,"about_ca_system_score_gemma":0.0002688609,"threshold_uncertainty_score":0.5687762},"labels":[],"label_agreement":null},{"id":"W4389986743","doi":"10.1137/1.9781611977806.ch29","title":"Chapter 29: The Proximal Gradient Method","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.18288593152715535,"score_gpt":0.35254314641803286,"score_spread":0.1696572148908775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389986743","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021974192,0.00006581932,0.24697268,0.00072096137,0.000527399,0.011515277,0.00062865874,0.0006923279,0.7388549],"genre_scores_gemma":[0.000009280686,0.00006522284,0.42642188,0.00010498876,0.00090451917,0.0007351678,0.00004738022,0.00034412023,0.57136744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971964,0.000010359435,0.00084961735,0.00063034805,0.00074131705,0.0005719738],"domain_scores_gemma":[0.9964151,0.0019478893,0.00060763967,0.00066254113,0.00018767691,0.00017915557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014993633,0.00063894864,0.00087942136,0.00007963575,0.0006047262,0.00014375623,0.0004522601,0.00090512907,0.00007502127],"category_scores_gemma":[0.00017424673,0.00045428012,0.00071430573,0.00004186242,0.00041404736,0.000029036088,0.00041694028,0.001189925,0.000029038736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002688084,0.000023065857,1.1079448e-8,0.00035470695,0.00042422727,9.573529e-7,0.0016647155,0.00001286811,0.00003686915,0.9739975,0.005619025,0.017839182],"study_design_scores_gemma":[0.0013318144,0.000080841346,1.0050512e-8,0.0002164706,0.0003648321,0.000010085204,0.00071973103,0.0030110306,0.0004673065,0.9255865,0.0676717,0.0005396734],"about_ca_topic_score_codex":9.128031e-7,"about_ca_topic_score_gemma":0.0000023553728,"teacher_disagreement_score":0.1794492,"about_ca_system_score_codex":0.000093814284,"about_ca_system_score_gemma":0.00012408783,"threshold_uncertainty_score":0.9997909},"labels":[],"label_agreement":null},{"id":"W4390673591","doi":"10.1007/s10107-023-02042-3","title":"Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions”","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Counterexample; Mathematics; Corollary; Function (biology); Sequence (biology); Combinatorics; Point (geometry); Discrete mathematics; Algorithm; Geometry","score_opus":0.10855348262170236,"score_gpt":0.42049586975885356,"score_spread":0.31194238713715117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390673591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023334054,0.000119122655,0.9931214,0.00009709624,0.000020566673,0.0012144521,0.0027675843,0.00009161698,0.00023479004],"genre_scores_gemma":[0.05088346,0.0000049108844,0.94660836,0.000004564055,0.000068024754,0.0006948886,0.00053616875,0.00005117701,0.0011484358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834454,0.000058358724,0.00062431436,0.00032251995,0.00036393377,0.00028633323],"domain_scores_gemma":[0.9936652,0.005487808,0.00013340295,0.00024745415,0.00036839544,0.00009770648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641554,0.0001426645,0.0005306657,0.00035511306,0.00010078437,0.000088609886,0.0001193919,0.00007203152,0.00024200471],"category_scores_gemma":[0.0031843262,0.00011886034,0.00022251665,0.00064046413,0.00018005387,0.00018032994,0.000054532844,0.000097792254,9.0834203e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076583907,0.0026508484,0.00007232029,0.02631065,0.007368175,0.000008562072,0.0064930697,0.0018844855,0.0015251186,0.66933405,0.006094542,0.2774923],"study_design_scores_gemma":[0.00052123447,0.0004069493,0.000012529185,0.00052296085,0.0011063449,0.000004472033,0.0015905041,0.8851477,0.00038414847,0.10541936,0.004663573,0.0002202218],"about_ca_topic_score_codex":0.0000059260874,"about_ca_topic_score_gemma":0.000020040286,"teacher_disagreement_score":0.88326323,"about_ca_system_score_codex":0.000034441327,"about_ca_system_score_gemma":0.000056161407,"threshold_uncertainty_score":0.48469839},"labels":[],"label_agreement":null},{"id":"W4390843280","doi":"10.1007/978-3-031-52213-0_10","title":"An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Interior point method; Computer science; Point (geometry); Convergence (economics); Mathematical optimization; Newton's method in optimization; Algorithm; Linear programming; Newton's method; Iterative method; Local convergence; Mathematics; Nonlinear system","score_opus":0.0780736977256255,"score_gpt":0.4255588921074055,"score_spread":0.34748519438178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390843280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003481598,0.000097297656,0.9967662,0.00029364045,0.0009260441,0.0013597402,0.00003452589,0.00019236366,0.00032667152],"genre_scores_gemma":[0.00008916239,0.0000094815005,0.9984012,0.0001964635,0.00045734242,0.000028297645,0.000022359476,0.00014469042,0.0006509781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628717,0.00009219108,0.0007158482,0.0014414926,0.00086423283,0.00059906964],"domain_scores_gemma":[0.9964619,0.0014714998,0.00029366204,0.00091947103,0.00065844366,0.00019498724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023050306,0.00051988167,0.00065617554,0.0011508132,0.00023569273,0.00034925112,0.0010185875,0.0003771647,0.000065001375],"category_scores_gemma":[0.0005982435,0.00046916804,0.00017352164,0.00061207556,0.00026211044,0.0002503984,0.0005366496,0.0007459236,0.000004975177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024508263,0.000026413516,5.978133e-8,0.00016117889,0.000015320118,0.000010875413,0.00052446825,0.92533123,0.00022506973,0.012622432,0.00000366567,0.0610548],"study_design_scores_gemma":[0.00025301924,0.0001427757,3.0440187e-8,0.00038565006,0.000033785516,0.00003554631,0.0000012639802,0.82879543,0.0018473273,0.1680302,0.000076701544,0.000398249],"about_ca_topic_score_codex":0.00001071125,"about_ca_topic_score_gemma":0.00000920009,"teacher_disagreement_score":0.15540777,"about_ca_system_score_codex":0.00056115806,"about_ca_system_score_gemma":0.00041571356,"threshold_uncertainty_score":0.999776},"labels":[],"label_agreement":null},{"id":"W4390850629","doi":"","title":"Polyhedral Newton-min algorithms for complementarity problems - The full report","year":2023,"lang":"en","type":"report","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Complementarity (molecular biology); Algorithm; Computer science; Newton's method; Mathematics; Physics; Nonlinear system","score_opus":0.157142028857505,"score_gpt":0.39233483815519676,"score_spread":0.23519280929769176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390850629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002526917,0.00058894255,0.92292184,0.024078941,0.00095795613,0.004165039,0.00083457533,0.00084221485,0.045357797],"genre_scores_gemma":[0.0006877741,0.0018188318,0.57798,0.00008808332,0.00033351863,0.001730042,0.0064795353,0.00048576746,0.41039646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99124736,0.0029358838,0.0015865274,0.0012007538,0.0021204844,0.00090899516],"domain_scores_gemma":[0.97847,0.0075829774,0.0015490836,0.003450761,0.00867219,0.0002749537],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.020133145,0.00058511825,0.00080275687,0.0003305534,0.0010724541,0.00046327317,0.0018824148,0.0004025323,0.0003693336],"category_scores_gemma":[0.01684885,0.00050538854,0.0004757938,0.0009887461,0.00044084655,0.00020758845,0.0011736166,0.0010159479,0.000057508034],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008382338,0.0028218229,0.0007678366,0.0035758857,0.0015687903,0.00019052916,0.012871886,0.00049425557,0.0006783064,0.14743598,0.6926813,0.13682957],"study_design_scores_gemma":[0.001508824,0.0000034261807,0.00025469315,0.0020540734,0.00024703512,0.00038593638,0.00048550637,0.062227122,0.0028366363,0.05328679,0.8755026,0.0012073548],"about_ca_topic_score_codex":0.0020971133,"about_ca_topic_score_gemma":0.0069905585,"teacher_disagreement_score":0.36503866,"about_ca_system_score_codex":0.00066367653,"about_ca_system_score_gemma":0.0016658816,"threshold_uncertainty_score":0.99973977},"labels":[],"label_agreement":null},{"id":"W4391854644","doi":"10.23952/jnva.8.2024.2.01","title":"Outer approximation for pseudo-convex mixed-integer nonlinear program problems","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hebei Province","keywords":"Integer (computer science); Regular polygon; Mathematics; Nonlinear system; Mathematical optimization; Applied mathematics; Computer science; Physics; Geometry","score_opus":0.041903915878256336,"score_gpt":0.3719113610739486,"score_spread":0.3300074451956923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391854644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023076434,0.00020908703,0.9950748,0.001623934,0.00015608282,0.00039187842,0.00009877466,0.000049271686,0.000088514425],"genre_scores_gemma":[0.0076299673,0.00011153358,0.9901655,0.000048862432,0.00081772124,0.000044404635,0.00013607761,0.000033781045,0.0010121888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813575,0.000067464316,0.00078866916,0.00022619097,0.0005834205,0.00019850953],"domain_scores_gemma":[0.99768525,0.0006707641,0.0003108772,0.0001284425,0.0010817349,0.00012292688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010932254,0.0001616964,0.00043075575,0.0007450634,0.00010321409,0.00022132834,0.00014262897,0.000103182494,0.00013911624],"category_scores_gemma":[0.0005492924,0.00012106391,0.00041099437,0.0010080336,0.000041798085,0.00043164153,0.000036051784,0.0002611849,0.0000059703093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011737904,0.0076778205,0.0035136302,0.0054590977,0.04727727,0.00018119522,0.0065363315,0.40691286,0.0012343683,0.18583985,0.013802691,0.3203911],"study_design_scores_gemma":[0.00045784234,0.00015810593,0.00011205405,0.00005093477,0.0010012724,0.000039131286,0.000059398775,0.9691266,0.00005313029,0.021417473,0.0073917825,0.00013228075],"about_ca_topic_score_codex":0.0000024524138,"about_ca_topic_score_gemma":0.0000064153487,"teacher_disagreement_score":0.5622137,"about_ca_system_score_codex":0.0000725457,"about_ca_system_score_gemma":0.00015669319,"threshold_uncertainty_score":0.4936843},"labels":[],"label_agreement":null},{"id":"W4392163585","doi":"10.3390/mca29020017","title":"An Iterative Method for Computing π by Argument Reduction of the Tangent Function","year":2024,"lang":"en","type":"article","venue":"Mathematical and Computational Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"","keywords":"Reduction (mathematics); Argument (complex analysis); Tangent; Function (biology); Mathematics; Applied mathematics; Computer science; Mathematical optimization; Geometry; Medicine","score_opus":0.034868800622525654,"score_gpt":0.397759140954994,"score_spread":0.3628903403324683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392163585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096799666,0.00010455754,0.9966565,0.00090170105,0.000025362542,0.0010364816,0.00007152566,0.000065450986,0.00017043603],"genre_scores_gemma":[0.09261633,0.000003406245,0.90620714,0.000041580457,0.00008036454,0.00051667,0.00006943146,0.000021508928,0.00044357832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999028,0.000060890532,0.0003153849,0.00023638672,0.00025243172,0.000106869324],"domain_scores_gemma":[0.9987154,0.0008134766,0.00007649754,0.00014216897,0.00019878884,0.000053696887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031720923,0.00009669804,0.00013254103,0.000049608723,0.00020718995,0.000063326195,0.00010037562,0.000038999893,0.000039734274],"category_scores_gemma":[0.000045252425,0.00006883523,0.00005632217,0.00026902085,0.000080443766,0.00009559569,0.000037783902,0.00008935336,0.0000043428386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073427727,0.00020087128,0.0000012916554,0.0002725194,0.00004418672,2.7519853e-8,0.00043949735,0.009083398,0.0008530364,0.9631286,0.0010447028,0.024924522],"study_design_scores_gemma":[0.0000723983,0.000028299088,0.000008599371,0.000025935346,0.000022595825,0.0000061656406,0.000105604435,0.48147574,0.00036946964,0.5168602,0.000981819,0.00004320216],"about_ca_topic_score_codex":6.5585806e-7,"about_ca_topic_score_gemma":1.5930824e-7,"teacher_disagreement_score":0.47239235,"about_ca_system_score_codex":0.000039911698,"about_ca_system_score_gemma":0.000034123346,"threshold_uncertainty_score":0.2807019},"labels":[],"label_agreement":null},{"id":"W4392404102","doi":"10.23952/jano.6.2024.1.08","title":"Modified relaxed CQ-algorithms for a split equality problem in Hilbert spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hilbert space; Mathematics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.0543469595364946,"score_gpt":0.3622265552854344,"score_spread":0.3078795957489398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005966536,0.00023325512,0.99571735,0.0011749589,0.00009635327,0.0005638837,0.000007951359,0.00004336279,0.0015662415],"genre_scores_gemma":[0.03939164,0.00027618412,0.9597233,0.000060195427,0.00015849007,0.000050539194,0.000010492703,0.00004827594,0.0002808932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828964,0.000050518505,0.0007657685,0.00024895289,0.00038572313,0.00025938224],"domain_scores_gemma":[0.99860317,0.0006789352,0.0002561602,0.000113573435,0.00021045242,0.00013769027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091173773,0.00017017827,0.00041257596,0.00029097951,0.000068966285,0.00014638738,0.00012663072,0.00012972427,0.00003810138],"category_scores_gemma":[0.0002618837,0.00013789767,0.000087025044,0.00052913063,0.00005491983,0.0002997324,0.000044931472,0.00032710604,0.000001443052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048477104,0.00022579437,0.000009460524,0.00037907774,0.00007109078,0.000011509046,0.00092357106,0.87547225,0.00011360022,0.09689301,0.00052705104,0.024888838],"study_design_scores_gemma":[0.0010673186,0.00015447133,0.000009553119,0.000107921245,0.000032936754,0.0000208033,0.00014782301,0.90532273,0.00012576887,0.09165113,0.0011977219,0.00016180419],"about_ca_topic_score_codex":0.0000027833973,"about_ca_topic_score_gemma":3.9033606e-7,"teacher_disagreement_score":0.03879499,"about_ca_system_score_codex":0.00013254702,"about_ca_system_score_gemma":0.00010257402,"threshold_uncertainty_score":0.56233037},"labels":[],"label_agreement":null},{"id":"W4393046351","doi":"10.1007/s10589-024-00567-7","title":"Inexact direct-search methods for bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Università degli Studi di Padova","keywords":"Bilevel optimization; Mathematics; Mathematical optimization; Trust region; Optimization problem; Computer science","score_opus":0.09613370230575952,"score_gpt":0.4657332647181794,"score_spread":0.36959956241241987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393046351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019978147,0.00070478686,0.9931093,0.0010742669,0.00007817457,0.0022270815,0.00010699575,0.00048864674,0.002208749],"genre_scores_gemma":[0.0010627849,0.00028741398,0.9942879,0.000102523954,0.00017121596,0.0018616007,0.0007694223,0.0000892675,0.0013678491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981679,0.00013118255,0.00051992555,0.0006007068,0.0002941606,0.0002861713],"domain_scores_gemma":[0.9966093,0.0021816697,0.00009009514,0.00023231706,0.0007197191,0.00016691604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173479,0.00022811088,0.00024782043,0.0004288906,0.00042602938,0.00032177885,0.0001832755,0.00012015865,0.00021709748],"category_scores_gemma":[0.0002919556,0.00022508018,0.00008464535,0.0011053924,0.00013322159,0.00040131068,0.000083752464,0.0001711625,0.000012360211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005868288,0.000075389034,0.0000031212605,0.0001904371,0.00004145428,1.7911759e-7,0.00010419391,0.83716136,0.00001075128,0.13287732,0.0005157046,0.029014237],"study_design_scores_gemma":[0.00035441964,0.000034685712,0.0000034905952,0.000044828048,0.000034161978,0.000009787709,0.000031552765,0.91949314,0.000034031986,0.064604945,0.015127691,0.00022725367],"about_ca_topic_score_codex":0.0000017383295,"about_ca_topic_score_gemma":3.599103e-7,"teacher_disagreement_score":0.08233181,"about_ca_system_score_codex":0.00011406504,"about_ca_system_score_gemma":0.00020461793,"threshold_uncertainty_score":0.9178503},"labels":[],"label_agreement":null},{"id":"W4393059302","doi":"10.48550/arxiv.2403.13290","title":"A Log-domain Interior Point Method for Convex Quadratic Games","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interior point method; Point (geometry); Quadratic equation; Regular polygon; Domain (mathematical analysis); Mathematics; Mathematical economics; Applied mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.14078314705358005,"score_gpt":0.31297262732428366,"score_spread":0.1721894802707036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393059302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007374905,0.00010085516,0.9878129,0.0003718154,0.0004943242,0.001582006,0.00020882422,0.00036868788,0.0016857286],"genre_scores_gemma":[0.15275595,0.00014784,0.8194478,0.00014137392,0.00021236962,0.00004487604,0.0000804276,0.00021584115,0.026953526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974127,0.0002975974,0.00042994675,0.0011939574,0.00015004842,0.0005157469],"domain_scores_gemma":[0.9971539,0.0009752942,0.00028644994,0.0010201773,0.00034407852,0.00022010785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007824814,0.00046412335,0.0007359238,0.00051441794,0.00012013305,0.00012982245,0.00079224515,0.00040808192,0.00032390043],"category_scores_gemma":[0.00065567886,0.0004997497,0.00045160676,0.0004876678,0.00017630165,0.00012349551,0.0018883276,0.0009856367,0.0001103463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003889998,0.0002539081,0.000037023805,0.0046853595,0.0010068776,0.000644641,0.0018986644,0.10583766,0.00023195642,0.87588567,0.0072872196,0.0018420224],"study_design_scores_gemma":[0.00048381626,0.00005589371,0.0000012837354,0.00024358377,0.00014461525,0.0000072970383,0.0006715042,0.4095405,0.00015229,0.5875966,0.0007681624,0.0003344777],"about_ca_topic_score_codex":0.000028944152,"about_ca_topic_score_gemma":0.00004621304,"teacher_disagreement_score":0.30370283,"about_ca_system_score_codex":0.00052898674,"about_ca_system_score_gemma":0.0003410827,"threshold_uncertainty_score":0.9997454},"labels":[],"label_agreement":null},{"id":"W4394008837","doi":"10.1016/j.aml.2024.109104","title":"Finite termination of the optimal solution sequence in parametric optimization","year":2024,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Alberta","keywords":"Mathematics; Sequence (biology); Parametric statistics; Applied mathematics; Mathematical optimization; Statistics","score_opus":0.04921363519071296,"score_gpt":0.33185956518379345,"score_spread":0.28264592999308047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394008837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017394096,0.000027936085,0.9795426,0.00095381547,0.00011345431,0.00077574595,0.000010410736,0.000110660374,0.0010712794],"genre_scores_gemma":[0.30306605,0.000027524986,0.6964688,0.000091021815,0.000031797947,0.00012265066,0.000010983342,0.000051098516,0.00013009341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828416,0.000042118005,0.00056937296,0.0002727516,0.00055659947,0.00027500623],"domain_scores_gemma":[0.99818385,0.0011150287,0.00018379261,0.00041584115,0.000066071036,0.000035438792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041156,0.000176307,0.00023575182,0.00044633687,0.000066956854,0.000062933424,0.00032666296,0.000093363735,0.00005368541],"category_scores_gemma":[0.0006345778,0.0001400556,0.00007629215,0.0017095191,0.00014566944,0.00018916879,0.000117237905,0.00028576236,0.000015874666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000813374,0.00014610137,0.000010145426,0.0008078667,0.00002742753,0.0000069862417,0.0014485043,0.9251813,0.009176002,0.059693314,0.00047184923,0.0030223576],"study_design_scores_gemma":[0.00027678168,0.000009481347,0.000010790959,0.00019803383,0.000023456549,0.000007277734,0.00012403126,0.9773754,0.0053870277,0.01639514,0.00004061864,0.00015196187],"about_ca_topic_score_codex":0.000003058644,"about_ca_topic_score_gemma":0.0000017306673,"teacher_disagreement_score":0.28567195,"about_ca_system_score_codex":0.00020718278,"about_ca_system_score_gemma":0.00005950323,"threshold_uncertainty_score":0.57113016},"labels":[],"label_agreement":null},{"id":"W4394866546","doi":"10.48550/arxiv.2404.09437","title":"Revisiting some classical linearizations of the quadratic binary optimization problem","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Binary number; Mathematics; Quadratic equation; Quadratic unconstrained binary optimization; Mathematical optimization; Optimization problem; Binary quadratic form; Applied mathematics; Quadratic programming; Mathematical economics; Quadratic function; Physics; Geometry; Arithmetic","score_opus":0.11239751572339816,"score_gpt":0.26697908515295266,"score_spread":0.15458156942955448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394866546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00956436,0.00013928702,0.9843152,0.0009486934,0.00034233075,0.0012929,0.00008840313,0.0002891419,0.0030196435],"genre_scores_gemma":[0.785691,0.00053755,0.19105302,0.00006150195,0.0004196416,0.000012283249,0.000117785676,0.00019357934,0.021913616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806416,0.00029221235,0.00046523617,0.0006699484,0.00022235073,0.00028610136],"domain_scores_gemma":[0.99771523,0.00040754164,0.00042967676,0.0009150793,0.00043225155,0.00010021547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032617524,0.0002866141,0.00039774223,0.0003008443,0.00020511236,0.00007264564,0.0007320749,0.00032407386,0.00012350657],"category_scores_gemma":[0.00058106746,0.00025585096,0.0002644355,0.0012134707,0.00024163756,0.00017289775,0.0021886213,0.0010801702,0.000026061669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009249583,0.00006744742,0.000053037093,0.0007463396,0.00007085436,0.000019102494,0.00012202192,0.7925849,0.000019766347,0.20605376,0.0001708017,0.000082724124],"study_design_scores_gemma":[0.00017250796,0.000014684907,0.00000875227,0.00058623106,0.00015362866,0.0000018328243,0.00009612326,0.7786432,0.0000605527,0.22002925,0.000042509644,0.00019071206],"about_ca_topic_score_codex":0.000008350819,"about_ca_topic_score_gemma":0.0000032407406,"teacher_disagreement_score":0.79326224,"about_ca_system_score_codex":0.00027672804,"about_ca_system_score_gemma":0.0004423896,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W4396244315","doi":"10.48550/arxiv.2404.19517","title":"Inexact subgradient methods for semialgebraic functions","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"U.S. Air Force; Agence Nationale de la Recherche","keywords":"Subgradient method; Mathematics; Mathematical optimization; Computer science; Mathematical economics","score_opus":0.21538610707852596,"score_gpt":0.3425719024340184,"score_spread":0.12718579535549246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396244315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043901065,0.0002044381,0.9892907,0.00015054898,0.0010392193,0.0012034255,0.00015963516,0.00048718072,0.0030747182],"genre_scores_gemma":[0.2415811,0.00042236573,0.6673976,0.000075682285,0.0005574554,0.000043694254,0.00028665818,0.00031318248,0.08932223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978021,0.00023664026,0.00031120863,0.0010790438,0.000099182806,0.00047184422],"domain_scores_gemma":[0.9969957,0.0012227003,0.00019266258,0.0009606142,0.00040411318,0.00022423932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006856543,0.00038326703,0.00047281405,0.0005719304,0.00019978423,0.00009240596,0.0005869219,0.0004037457,0.00026655046],"category_scores_gemma":[0.00081161904,0.00042470492,0.0004321064,0.0008031204,0.00013540624,0.00010221692,0.0014060885,0.0010367051,0.00012597087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014223934,0.00026868342,0.00003897603,0.001391481,0.0006972302,0.000094908726,0.00042158228,0.34332275,0.000074214346,0.63704586,0.010144607,0.006357456],"study_design_scores_gemma":[0.00032132727,0.000041747324,0.0000023796981,0.000098023054,0.0002296187,0.0000025236284,0.000110421344,0.43610588,0.00014332512,0.55722946,0.0054017273,0.0003136075],"about_ca_topic_score_codex":0.000017987053,"about_ca_topic_score_gemma":0.000023000257,"teacher_disagreement_score":0.3218931,"about_ca_system_score_codex":0.0005983967,"about_ca_system_score_gemma":0.0003248914,"threshold_uncertainty_score":0.9998205},"labels":[],"label_agreement":null},{"id":"W4398137369","doi":"10.1007/s00453-024-01235-2","title":"Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Horizon 2020; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Theory of computation; Approximation algorithm; Algorithm; Dual (grammatical number); Computer science; Mathematics; Combinatorics; Mathematical optimization; Discrete mathematics","score_opus":0.036672352847535714,"score_gpt":0.3668054544250911,"score_spread":0.3301331015775554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398137369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001453168,0.0010959414,0.9904277,0.0025621678,0.00075127,0.0010195508,0.0002611801,0.0007399909,0.0029969146],"genre_scores_gemma":[0.0007747645,0.00009292482,0.9680981,0.0002867352,0.00078692375,0.00049588305,0.0003115057,0.0001916338,0.028961541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966982,0.00029684257,0.00066066935,0.0008039829,0.0007645261,0.0007757798],"domain_scores_gemma":[0.9973426,0.0012342868,0.00013941359,0.0007533956,0.00034050422,0.00018983822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014567652,0.0004032615,0.0003672813,0.00021109621,0.00071619806,0.0006098852,0.0004357838,0.00021969958,0.00053133856],"category_scores_gemma":[0.0004451276,0.00030071728,0.00020108625,0.0012599519,0.00020487234,0.00067936344,0.00024825297,0.0007694893,0.0001724306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005637169,0.00050748186,0.0000054061875,0.0004746308,0.0008659101,0.000050934403,0.0025770855,0.0035298688,0.030890556,0.06382081,0.22907564,0.6681453],"study_design_scores_gemma":[0.00045102512,0.00007952083,0.0000014252225,0.000033516564,0.00009719393,0.000090514484,0.00045826583,0.8809641,0.012690548,0.03827226,0.06646093,0.00040068224],"about_ca_topic_score_codex":0.00007480111,"about_ca_topic_score_gemma":0.000007565371,"teacher_disagreement_score":0.87743425,"about_ca_system_score_codex":0.00030417944,"about_ca_system_score_gemma":0.00023488236,"threshold_uncertainty_score":0.9999445},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.14334393503401258,"score_gpt":0.4705291716964854,"score_spread":0.3271852366624728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398183091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016658497,0.00041733123,0.9972161,0.00008442465,0.00041837618,0.0009841162,0.0003714152,0.0002728882,0.00006876578],"genre_scores_gemma":[0.010072422,0.00006998765,0.9887226,0.000006644984,0.00005715628,0.00009931327,0.00027897634,0.00007751795,0.0006153434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974609,0.00044390588,0.00094563136,0.0003946682,0.00040534252,0.0003495412],"domain_scores_gemma":[0.9886378,0.009308412,0.00041419518,0.00041215392,0.0011237221,0.00010370492],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0010117777,0.00021000182,0.00047299644,0.0008343852,0.00027995926,0.00003982211,0.0002571897,0.00016243558,0.00031189632],"category_scores_gemma":[0.014102086,0.00021318784,0.00023653507,0.0023137631,0.0001818862,0.00028563352,0.00013809156,0.00020807973,0.0000025760387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030081912,0.00031829256,0.00007961413,0.0008367103,0.00019699408,8.2279195e-7,0.0006288207,0.9080796,0.0002076647,0.056555234,0.00074633484,0.032319795],"study_design_scores_gemma":[0.0004755427,0.00009940121,0.000028587729,0.00017054814,0.0001588628,0.000003150629,0.00012038188,0.97416866,0.00081695575,0.023596616,0.00017471981,0.00018660446],"about_ca_topic_score_codex":0.000007273466,"about_ca_topic_score_gemma":0.0000012106832,"teacher_disagreement_score":0.066089,"about_ca_system_score_codex":0.0001165101,"about_ca_system_score_gemma":0.00021548936,"threshold_uncertainty_score":0.99420255},"labels":[],"label_agreement":null},{"id":"W4399019256","doi":"10.1007/s10107-024-02093-0","title":"Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Lift (data mining); Mathematics; Polytope; Operator (biology); Set (abstract data type); Combinatorics; Computer science; Data mining; Chemistry","score_opus":0.07086910854673105,"score_gpt":0.3824650289993057,"score_spread":0.3115959204525746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399019256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026006098,0.0010121581,0.99063766,0.001582315,0.000089717854,0.003061597,0.000040211766,0.00047331207,0.0005024154],"genre_scores_gemma":[0.047166254,0.000057254863,0.94631255,0.00010517847,0.00023411443,0.0013616338,0.000016327302,0.00017772452,0.0045689424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978632,0.000069058726,0.0004194757,0.00045981727,0.0005631641,0.0006253168],"domain_scores_gemma":[0.99614036,0.0030538337,0.000057016918,0.00044573806,0.00017520276,0.00012785805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401185,0.00029462454,0.0003916053,0.00011788878,0.00035374294,0.000721728,0.00030155687,0.00011082279,0.0003000114],"category_scores_gemma":[0.000988632,0.0001636356,0.00009074874,0.0005203886,0.00027371987,0.00030755837,0.00016993763,0.00037386696,0.000047541373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020554877,0.00037258322,0.000023741895,0.0051149316,0.0006458365,0.00007253814,0.0046643764,0.00040559846,0.0000844826,0.8151465,0.0047540683,0.16850981],"study_design_scores_gemma":[0.0024759383,0.00080058817,0.000005132012,0.0013280504,0.00053683715,0.00023163245,0.004396592,0.61204165,0.0020518638,0.23346944,0.14148375,0.0011785319],"about_ca_topic_score_codex":0.000014884861,"about_ca_topic_score_gemma":0.000008658907,"teacher_disagreement_score":0.61163604,"about_ca_system_score_codex":0.00006240155,"about_ca_system_score_gemma":0.00013632466,"threshold_uncertainty_score":0.695964},"labels":[],"label_agreement":null},{"id":"W4399058324","doi":"10.1007/978-3-031-60597-0_5","title":"Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue Constraint","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Constraint algorithm; Lagrange multiplier; Constraint (computer-aided design); Mathematical optimization; Algorithm; Mathematics; Geometry","score_opus":0.03826571048057999,"score_gpt":0.3209499019446277,"score_spread":0.2826841914640477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006629586,0.00010813373,0.996772,0.00078245864,0.0006596042,0.0010277928,0.000048133836,0.000017287683,0.000518273],"genre_scores_gemma":[0.3540762,0.000020387992,0.6437056,0.00034372375,0.0002619018,0.00006455515,0.000002874258,0.000076585784,0.0014481235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982586,0.00003320502,0.0004624064,0.00037096484,0.0006218219,0.00025303545],"domain_scores_gemma":[0.996583,0.0020877486,0.00024485003,0.0007600585,0.0002930711,0.000031284053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069438067,0.00020396327,0.00026382873,0.000093709,0.00027022624,0.000066388406,0.0012226803,0.00011379042,0.000016029688],"category_scores_gemma":[0.0005883909,0.00010279596,0.00017597561,0.00035125896,0.0018924142,0.00006607775,0.00067661784,0.00052289234,0.0000010175772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008176717,0.000022417928,0.0000036092063,0.0004310826,0.000041629806,0.0000016300935,0.003910739,0.86044675,0.0021018411,0.06911684,0.000024229674,0.06389105],"study_design_scores_gemma":[0.00013467454,0.000029265242,0.0000043188106,0.0007619813,0.00002080945,0.000010178915,0.0000074246486,0.7828594,0.021710051,0.19412675,0.00021041434,0.00012474981],"about_ca_topic_score_codex":0.0000065916797,"about_ca_topic_score_gemma":0.00022295963,"teacher_disagreement_score":0.35400993,"about_ca_system_score_codex":0.00014644918,"about_ca_system_score_gemma":0.00035792796,"threshold_uncertainty_score":0.6972679},"labels":[],"label_agreement":null},{"id":"W4399448783","doi":"","title":"Global Optimization with quantified constraints and integral objective function: an Interval Branch and Bound Approach","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Branch and bound; Interval (graph theory); Interval arithmetic; Mathematical optimization; Function (biology); Computer science; Upper and lower bounds; Global optimization; Mathematics; Mathematical analysis; Combinatorics","score_opus":0.026639456301263017,"score_gpt":0.28780349733632,"score_spread":0.26116404103505697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399448783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07671644,0.000080685095,0.90399086,0.0004623452,0.00004325195,0.00037660918,0.000023229164,0.00014595375,0.018160598],"genre_scores_gemma":[0.5957469,0.00003362438,0.4032416,0.00003607111,0.000018543918,0.000023061863,0.000068899084,0.000023649913,0.00080768665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726707,0.00127887,0.0002851093,0.0005649244,0.0003318405,0.0002722001],"domain_scores_gemma":[0.99639434,0.00052250846,0.00018436403,0.00063555257,0.0020662264,0.0001969857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017625307,0.00021089333,0.00023543731,0.000105222476,0.00044907545,0.00035276645,0.00025358857,0.00011225506,0.00012601359],"category_scores_gemma":[0.001036932,0.00019227392,0.000029969433,0.00051110896,0.0012870574,0.0004790485,0.00020081288,0.00018960609,0.0000033634317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005609683,0.0017081004,0.0112972865,0.00025502784,0.00031535092,0.000006060513,0.024287643,0.0010670841,0.00047495228,0.7985212,0.00035383485,0.16115244],"study_design_scores_gemma":[0.0042735566,0.000031028947,0.008661052,0.0007137801,0.0001185929,0.00027468667,0.004461024,0.9345751,0.0039809444,0.04156392,0.0004139323,0.000932411],"about_ca_topic_score_codex":0.00011598089,"about_ca_topic_score_gemma":0.0007645117,"teacher_disagreement_score":0.933508,"about_ca_system_score_codex":0.00008164312,"about_ca_system_score_gemma":0.00011704143,"threshold_uncertainty_score":0.7840703},"labels":[],"label_agreement":null},{"id":"W4399772402","doi":"10.1515/demo-2024-0003","title":"Using sums-of-squares to prove Gaussian product inequalities","year":2024,"lang":"en","type":"article","venue":"Dependence Modeling","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Gaussian; Product (mathematics); Applied mathematics; Least-squares function approximation; Statistics; Geometry; Physics","score_opus":0.26428939519167055,"score_gpt":0.45457052654969377,"score_spread":0.19028113135802321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399772402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06525785,0.0004330109,0.93281466,0.00024048652,0.00016896875,0.0004686508,0.000017543345,0.0001758677,0.00042296425],"genre_scores_gemma":[0.63636947,0.000015442252,0.36305138,0.000014671167,0.000102485144,0.000025387348,0.0000026668404,0.000043155716,0.0003753404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811864,0.00006460677,0.00044069806,0.00041378933,0.0006177232,0.00034453333],"domain_scores_gemma":[0.9990263,0.00017999143,0.000046258112,0.00037237082,0.0002739176,0.000101147285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107985,0.00016121252,0.0002313642,0.000316183,0.000087270724,0.00010812185,0.00024560915,0.000052726784,0.00006057614],"category_scores_gemma":[0.0009376164,0.00014746319,0.00005912971,0.00051590934,0.000032300963,0.0004073144,0.00014872053,0.0002272292,0.000020458187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024350446,0.000033862187,0.00003145872,0.0008693642,0.000038655136,0.000032128235,0.004531433,0.92874587,0.008914172,0.05001206,0.000052232048,0.006714422],"study_design_scores_gemma":[0.000056142468,0.000024429439,3.1162543e-7,0.0003855965,0.000012539494,0.000012590497,0.00084964954,0.9424936,0.011237721,0.04472601,0.000033115,0.0001682816],"about_ca_topic_score_codex":0.00008156836,"about_ca_topic_score_gemma":0.000020749558,"teacher_disagreement_score":0.5711116,"about_ca_system_score_codex":0.000110536406,"about_ca_system_score_gemma":0.0002083166,"threshold_uncertainty_score":0.60133743},"labels":[],"label_agreement":null},{"id":"W4400083923","doi":"10.1007/978-3-031-57603-4_11","title":"Decomposition-Based Algorithms for Mixed-Integer Linear Programs with Integer Subproblems","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Integer (computer science); Integer programming; Decomposition; Branch and price; Algorithm; Integer points in convex polyhedra; Mathematics; Computer science; Chemistry","score_opus":0.10371198352641102,"score_gpt":0.4669312734795457,"score_spread":0.3632192899531347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400083923","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006996649,0.00020909953,0.1965102,0.032664437,0.0047728466,0.019715764,0.0007494297,0.00060616387,0.7440724],"genre_scores_gemma":[0.022753991,0.0019203011,0.3186157,0.0001440517,0.00056294346,0.009413782,0.0012001849,0.00030949232,0.64507955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97841245,0.00027748506,0.0021204972,0.0036865242,0.012936728,0.0025663238],"domain_scores_gemma":[0.988396,0.00065266306,0.00015443559,0.0019504713,0.0082972115,0.0005492022],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.017333008,0.0009935473,0.00075215986,0.01583913,0.003195338,0.005820809,0.008044276,0.00031276923,0.001537208],"category_scores_gemma":[0.0015234803,0.0009220873,0.00024785582,0.0067702974,0.0109509,0.0063441596,0.0041738716,0.0026241255,0.00039821066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003641815,0.0005521721,0.00003655032,0.00030421908,0.00020194887,0.00027352816,0.00040223214,0.2230521,0.00008087789,0.7702958,0.0011120562,0.0033243664],"study_design_scores_gemma":[0.0021483533,0.0007699134,0.00008487417,0.0029894714,0.000045560017,0.000057822377,0.003983457,0.70098,0.0005134104,0.14520887,0.14178571,0.0014325624],"about_ca_topic_score_codex":0.00030355185,"about_ca_topic_score_gemma":0.0068674684,"teacher_disagreement_score":0.6250869,"about_ca_system_score_codex":0.0074253087,"about_ca_system_score_gemma":0.00161583,"threshold_uncertainty_score":0.9996769},"labels":[],"label_agreement":null},{"id":"W4400408820","doi":"10.3390/a17070303","title":"On Implementing a Two-Step Interior Point Method for Solving Linear Programs","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Interior point method; Point (geometry); Algorithm; Mathematical optimization; Mathematics; Dual (grammatical number); Regular polygon; Linear programming; Computer science; Inverse; Value (mathematics); Applied mathematics; Geometry; Statistics","score_opus":0.07593134455603959,"score_gpt":0.45626274862926486,"score_spread":0.3803314040732253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400408820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021980163,0.00013267055,0.9956432,0.0005637202,0.00042205406,0.001457518,0.00004188834,0.0005790296,0.0009400949],"genre_scores_gemma":[0.0008940012,0.000013732556,0.9947888,0.00011322407,0.00047417302,0.0005980305,0.00005205796,0.00015291225,0.0029130322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975151,0.00007880102,0.00055151246,0.0006124317,0.00045779682,0.00078437105],"domain_scores_gemma":[0.997583,0.0015259972,0.00009952073,0.00040272478,0.00024212133,0.00014665212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001603019,0.0002816772,0.00034906223,0.0002619421,0.00022303246,0.00025964616,0.00029259903,0.00008404044,0.00025320466],"category_scores_gemma":[0.00086062745,0.00024808708,0.00022391957,0.00047743352,0.000043477976,0.00025746756,0.00023060165,0.00036037187,0.00007931178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036811714,0.00012037299,0.000002838615,0.0004605044,0.00019703723,0.00006177224,0.0009047478,0.00026272685,0.0005389594,0.045740005,0.0020952767,0.94957894],"study_design_scores_gemma":[0.00075523084,0.00030433486,3.1019383e-7,0.00030120966,0.000043308224,0.000041509178,0.00042799735,0.9290216,0.002375914,0.048168562,0.018273884,0.00028616076],"about_ca_topic_score_codex":0.00002062032,"about_ca_topic_score_gemma":0.000017413584,"teacher_disagreement_score":0.9492928,"about_ca_system_score_codex":0.00017983736,"about_ca_system_score_gemma":0.000088543726,"threshold_uncertainty_score":0.99999714},"labels":[],"label_agreement":null},{"id":"W4401286355","doi":"10.23952/asvao.6.2024.3.09","title":"A dynamical system approach with finite-time stability for solving generalized monotone inclusion without maximality","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Inclusion (mineral); Stability (learning theory); Mathematics; Applied mathematics; Mathematical optimization; Computer science; Physics; Geometry; Machine learning","score_opus":0.03069521363441782,"score_gpt":0.31259575979207666,"score_spread":0.28190054615765886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009987968,0.00009615033,0.9872245,0.00006094726,0.000017577277,0.0015636075,0.00011105039,0.0004116021,0.0005265539],"genre_scores_gemma":[0.35160062,0.000025688614,0.6469387,0.000016252621,0.000042961205,0.00034782244,0.00083356636,0.00006436512,0.00013005313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713516,0.00015101065,0.00068224984,0.00095279,0.00066185335,0.00041694465],"domain_scores_gemma":[0.9982645,0.000500551,0.00019615499,0.00052739476,0.00033346633,0.00017791285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014514892,0.00036318912,0.0008112345,0.0004912043,0.00064986653,0.00028451657,0.00019690773,0.0002038151,0.00007967764],"category_scores_gemma":[0.00017454932,0.00028875063,0.00018113072,0.0019303925,0.00013550057,0.00024496854,0.0003161066,0.00022067963,0.0000025847635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030379914,0.00013440901,0.00010310204,0.0007285134,0.0008891346,0.0000018322561,0.00091646897,0.9753431,0.0003313179,0.020475902,0.000014275947,0.0007581512],"study_design_scores_gemma":[0.0009866508,0.00004855571,0.000013632931,0.000042372412,0.0013026787,0.0000029562996,0.00036202656,0.9946369,0.00028152583,0.001960641,0.000012538123,0.00034950578],"about_ca_topic_score_codex":0.000025757103,"about_ca_topic_score_gemma":0.000010904809,"teacher_disagreement_score":0.34161264,"about_ca_system_score_codex":0.00030668208,"about_ca_system_score_gemma":0.000092550225,"threshold_uncertainty_score":0.9999565},"labels":[],"label_agreement":null},{"id":"W4401286409","doi":"10.23952/asvao.6.2024.3.01","title":"A special issue on iterative methods for nonlinear programming problems, dedicated to Professor Le Dung Muu on the occasion of his 75th birthday","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Sociology","score_opus":0.05172041763459125,"score_gpt":0.40747263034755526,"score_spread":0.35575221271296403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047373286,0.0000482191,0.9948972,0.001158707,0.00006711911,0.0026347362,0.00006097737,0.00010770906,0.0005516021],"genre_scores_gemma":[0.0024172682,0.000075296644,0.99458474,0.000118607124,0.00058601354,0.00070057786,0.00035122375,0.0000714179,0.0010948661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977836,0.0002732511,0.0006190486,0.00058937486,0.0004265539,0.0003081654],"domain_scores_gemma":[0.9978853,0.0010616413,0.00023067297,0.00035501862,0.00035624264,0.00011114371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015543791,0.00027173414,0.00052549987,0.00060180755,0.00033300096,0.00016888618,0.00018975492,0.00013904378,0.00015594832],"category_scores_gemma":[0.00061614375,0.00018960274,0.00015261612,0.0027155986,0.000082653794,0.00010828424,0.00008116631,0.0002362509,0.0000075115986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029779648,0.00037271183,0.0000063786756,0.0003556886,0.0010754191,0.0000014480316,0.0041802465,0.84718794,0.0005430139,0.053845868,0.002122679,0.090010785],"study_design_scores_gemma":[0.00044495222,0.00018383628,0.0000026346427,0.00010976619,0.00042002596,4.5336054e-7,0.0009161259,0.9839814,0.004568745,0.001318651,0.007832538,0.00022091069],"about_ca_topic_score_codex":0.000008939531,"about_ca_topic_score_gemma":0.000014823671,"teacher_disagreement_score":0.13679339,"about_ca_system_score_codex":0.0000860332,"about_ca_system_score_gemma":0.000088813154,"threshold_uncertainty_score":0.7731775},"labels":[],"label_agreement":null},{"id":"W4401634722","doi":"10.28924/2291-8639-22-2024-136","title":"Polynomiograph Comparison and Stability of a New Iteration Process","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Process (computing); Calculus (dental); Mathematical economics; Applied mathematics; Computer science; Orthodontics; Machine learning; Medicine","score_opus":0.04508105079940712,"score_gpt":0.4333310196925643,"score_spread":0.3882499688931572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401634722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101625316,0.0007868365,0.8964732,0.0008253818,0.000023246734,0.000100759324,0.000021401367,0.00000918072,0.00013465417],"genre_scores_gemma":[0.96529603,0.0002958608,0.034221698,0.000010046726,0.00010358362,0.0000071037475,0.000009102975,0.000005577647,0.00005101445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990045,0.000021932989,0.00048327565,0.00011264543,0.00032621212,0.00005147276],"domain_scores_gemma":[0.99884576,0.0002167818,0.00022483537,0.00007946554,0.00056169776,0.00007145831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028258347,0.00005974268,0.00019629428,0.00056009955,0.000029931163,0.00009549469,0.0001280031,0.000026481026,0.00007235181],"category_scores_gemma":[0.00007850402,0.000049348157,0.00010103281,0.0006554593,0.000057728466,0.00020361762,0.0000261989,0.00010162933,4.0669826e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030432307,0.0016671091,0.1822752,0.00061544904,0.015461983,0.000014869117,0.0118654845,0.0093915,0.009884343,0.21916258,0.0020846808,0.5472725],"study_design_scores_gemma":[0.0018692921,0.00030640178,0.022477757,0.0003329259,0.003658137,0.00012584645,0.004025428,0.54239815,0.02290194,0.38909113,0.0122261625,0.00058680726],"about_ca_topic_score_codex":0.000011006528,"about_ca_topic_score_gemma":0.00001663046,"teacher_disagreement_score":0.8636707,"about_ca_system_score_codex":0.000022013468,"about_ca_system_score_gemma":0.0000629763,"threshold_uncertainty_score":0.20123595},"labels":[],"label_agreement":null},{"id":"W4402137846","doi":"10.21105/jcon.00161","title":"JSOSuite.jl: Solving continuous optimization problems with JuliaSmoothOptimizers","year":2024,"lang":"en","type":"article","venue":"JuliaCon Proceedings","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Cover (algebra); Problem solver; Computer science; Mathematical optimization; Optimization problem; Interface (matter); Continuous optimization; Nonlinear system; Nonlinear programming; Algorithm; Mathematics; Programming language; Computational science; Parallel computing; Engineering; Multi-swarm optimization","score_opus":0.02889421817613323,"score_gpt":0.3111285277013711,"score_spread":0.28223430952523787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402137846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029030044,0.0005865085,0.9349536,0.0020119126,0.00041691153,0.0021927124,0.000019205085,0.0027421515,0.054174013],"genre_scores_gemma":[0.027296742,0.0002939914,0.94383574,0.00024387297,0.00035340805,0.00046581132,0.000029831572,0.00037103746,0.027109584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970592,0.00001940536,0.0005704764,0.00080899,0.0008207505,0.00072113605],"domain_scores_gemma":[0.9983794,0.00026664155,0.00018674158,0.00021415533,0.0007129931,0.00024005533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000624738,0.00041823453,0.00045708264,0.00043703956,0.00022924345,0.00071437936,0.0003439277,0.00020053628,0.00058733916],"category_scores_gemma":[0.0005656532,0.00034654743,0.000111088506,0.0012784611,0.00017392173,0.0012907387,0.00012657614,0.0005539803,0.00009951746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007485754,0.00096908177,0.0011281237,0.009676604,0.001265219,0.00033903838,0.019416865,0.5257303,0.0050159977,0.19189313,0.20862728,0.035189785],"study_design_scores_gemma":[0.0015065578,0.0003910158,0.0000070936017,0.0011524627,0.00013982509,0.00016402935,0.0010958359,0.95569396,0.0019959034,0.010452905,0.026491903,0.0009084822],"about_ca_topic_score_codex":0.0000060344214,"about_ca_topic_score_gemma":0.0000014718931,"teacher_disagreement_score":0.42996368,"about_ca_system_score_codex":0.0002393123,"about_ca_system_score_gemma":0.00014846853,"threshold_uncertainty_score":0.9998987},"labels":[],"label_agreement":null},{"id":"W4402337571","doi":"10.23952/asvao.7.2025.1.07","title":"An interior-point algorithm for linear optimization based on a new algebraically equivalent transformation","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interior point method; Transformation (genetics); Point (geometry); Mathematics; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.03239406937468434,"score_gpt":0.3482734682234519,"score_spread":0.3158793988487676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402337571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053878142,0.0000472858,0.9969604,0.00048177593,0.00008313938,0.0013780129,0.00010892765,0.00042588628,0.00046069527],"genre_scores_gemma":[0.013922751,0.00013837869,0.9825584,0.00027439295,0.00019662766,0.00024301832,0.0023547288,0.0001148932,0.00019675438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970842,0.00012421403,0.0008522722,0.0008347007,0.0006696505,0.00043498457],"domain_scores_gemma":[0.998315,0.00037170207,0.00019077143,0.0004974376,0.000305054,0.00032003835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087441935,0.00041550456,0.0005756115,0.0011743968,0.00029382823,0.0004314527,0.00023366635,0.00024673462,0.0004828688],"category_scores_gemma":[0.00013242687,0.00038458363,0.00027106158,0.0020499714,0.00007136474,0.0005815731,0.00003226666,0.00024702956,0.0000073343676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010168815,0.00010116015,0.0000010462229,0.00010812084,0.0003132244,0.0000013944993,0.0005782574,0.94177854,0.000051745035,0.008627649,0.00011115936,0.04822601],"study_design_scores_gemma":[0.0012090357,0.00027816955,0.000001913405,0.00006324648,0.0008887171,0.0000014418742,0.00021684261,0.9933318,0.0005157929,0.0029466867,0.00012908217,0.0004173093],"about_ca_topic_score_codex":0.0000115051,"about_ca_topic_score_gemma":0.000008402566,"teacher_disagreement_score":0.05155322,"about_ca_system_score_codex":0.00018637122,"about_ca_system_score_gemma":0.00016114269,"threshold_uncertainty_score":0.9998606},"labels":[],"label_agreement":null},{"id":"W4403305947","doi":"10.1017/9781009302180.009","title":"More Iterative Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.053653581986610153,"score_gpt":0.29761500762749393,"score_spread":0.24396142564088377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305947","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020482269,0.00020244461,0.027995063,0.00006217723,0.00027457858,0.0007415925,0.0008079725,0.00045206357,0.96946204],"genre_scores_gemma":[0.0000056212416,0.00015133985,0.016517457,0.00003734091,0.00023476254,0.0000028183747,0.00009784746,0.00017459696,0.9827782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978423,0.000034524794,0.00029290866,0.00078585424,0.0006341241,0.00041027492],"domain_scores_gemma":[0.998085,0.0002603225,0.00019626562,0.0007491268,0.00045339236,0.00025589135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012105078,0.0005513747,0.0005706722,0.00041366162,0.00020071598,0.00011001601,0.00060322037,0.00048795072,0.000043490287],"category_scores_gemma":[0.000046268913,0.0006115197,0.00030069667,0.000024899104,0.00038446797,0.0001419288,0.0007364599,0.0010927492,0.00010842364],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003342846,0.000011476932,3.88894e-8,0.00023610382,0.00027163752,0.0010332625,0.00018108703,0.000021086777,0.00000476396,0.94805604,0.048860647,0.0012904295],"study_design_scores_gemma":[0.00046943995,0.000052867108,1.397846e-7,0.000407192,0.00024647886,0.00003796823,0.0001037081,0.0048949714,0.00019039706,0.0022171347,0.9907178,0.00066185114],"about_ca_topic_score_codex":0.000012234496,"about_ca_topic_score_gemma":6.883815e-7,"teacher_disagreement_score":0.9458389,"about_ca_system_score_codex":0.0004871474,"about_ca_system_score_gemma":0.0001560496,"threshold_uncertainty_score":0.9996336},"labels":[],"label_agreement":null},{"id":"W4403882513","doi":"10.13140/rg.2.2.16095.47527","title":"A nonsmooth exact penalty method for equality-constrained optimization: complexity and implementation","year":2024,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Mathematics; Penalty method; Constrained optimization; Computer science; Mathematical economics","score_opus":0.06994607995498192,"score_gpt":0.40728013169165983,"score_spread":0.3373340517366779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403882513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043005386,0.0006526687,0.9831535,0.00671759,0.00019603889,0.005458978,0.001808641,0.0011301698,0.00045234457],"genre_scores_gemma":[0.0044725435,0.00030995876,0.9884033,0.0005498156,0.0002603629,0.0039232103,0.0008372642,0.0002492876,0.0009942494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995238,0.00054171454,0.0012814399,0.0012654627,0.0007187722,0.0009546206],"domain_scores_gemma":[0.99589026,0.0012105339,0.0006674696,0.0011768738,0.00061444705,0.00044041773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029959225,0.0007591678,0.0010111548,0.0008414991,0.00040375508,0.0006483383,0.0006216478,0.000670759,0.00030447042],"category_scores_gemma":[0.0009804692,0.00079329626,0.0003572449,0.0005565954,0.00023702487,0.0002311915,0.0017311545,0.001356551,0.0000043009345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036007626,0.00051611336,0.00033485665,0.004990857,0.00081227167,0.000048964823,0.0019193569,0.21995236,0.0004104263,0.6957091,0.007988759,0.066956826],"study_design_scores_gemma":[0.0007279316,0.0000898021,0.00006293251,0.00015776284,0.00015706637,0.00005373298,0.00029750704,0.6830616,0.0007382557,0.3136804,0.00042632784,0.0005466753],"about_ca_topic_score_codex":0.0021183481,"about_ca_topic_score_gemma":0.0020940255,"teacher_disagreement_score":0.46310925,"about_ca_system_score_codex":0.00095865596,"about_ca_system_score_gemma":0.00094379636,"threshold_uncertainty_score":0.9994518},"labels":[],"label_agreement":null},{"id":"W4404035066","doi":"10.1109/tac.2024.3491819","title":"Online Interior-Point Methods for Time-Varying Equality-Constrained Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Interior point method; Mathematical optimization; Computer science; Constrained optimization; Control theory (sociology); Point (geometry); Mathematics; Control (management); Geometry; Artificial intelligence","score_opus":0.04994227561214397,"score_gpt":0.4123384443887305,"score_spread":0.36239616877658654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404035066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064133856,0.000066689645,0.9941052,0.0014306264,0.00056695665,0.0019014968,0.00028767835,0.0013126219,0.00026458886],"genre_scores_gemma":[0.026017694,0.000017981169,0.9707354,0.0002205382,0.00006713793,0.00059246516,0.000026053192,0.00012323965,0.0021995255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974558,0.0004103241,0.00087111443,0.0004936742,0.00032147518,0.00044765288],"domain_scores_gemma":[0.9944792,0.0045266533,0.00012890354,0.00045836862,0.00024619547,0.00016069088],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012892457,0.00033021672,0.0005541444,0.0005000941,0.00024194598,0.00020078834,0.00024005976,0.00016232871,0.0020205667],"category_scores_gemma":[0.00041075377,0.00030868687,0.00033153396,0.0005427672,0.00010580803,0.0003609972,0.0000026014523,0.00030950646,0.00006823402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008746794,0.00037160452,2.953693e-8,0.00059442985,0.00042771478,0.0000057819925,0.0006031936,0.5625127,0.0033745014,0.0010335858,0.00015504016,0.43083394],"study_design_scores_gemma":[0.0018097592,0.00018337571,1.3922087e-7,0.00031336708,0.00020498307,0.000020747846,0.00009596345,0.9893089,0.0024316227,0.005083306,0.00025282893,0.00029501106],"about_ca_topic_score_codex":0.000003352914,"about_ca_topic_score_gemma":0.000003078496,"teacher_disagreement_score":0.43053895,"about_ca_system_score_codex":0.0002714646,"about_ca_system_score_gemma":0.00018785424,"threshold_uncertainty_score":0.9999365},"labels":[],"label_agreement":null},{"id":"W4404047414","doi":"10.1137/24m1643736","title":"Average Cost Optimality of Partially Observed MDPs: Contraction of Nonlinear Filters and Existence of Optimal Solutions and Approximations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Contraction (grammar); Nonlinear system; Approximations of π; Applied mathematics; Mathematical optimization; Mathematical economics","score_opus":0.07192745471939384,"score_gpt":0.3343259066051525,"score_spread":0.26239845188575867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404047414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01255936,0.0007744017,0.9853299,0.0005002235,0.00008137229,0.00048442624,0.00013060647,0.000022495906,0.000117213356],"genre_scores_gemma":[0.55469185,0.0022992576,0.4427828,0.000022259275,0.000058684047,0.000018831,0.00002236314,0.000025351073,0.00007860974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983873,0.0001721802,0.00071951497,0.00020407588,0.00032978875,0.00018714115],"domain_scores_gemma":[0.9980539,0.00074741594,0.00040571572,0.00013333176,0.000536345,0.00012327566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008255883,0.00015081855,0.00038847124,0.00022317724,0.00015351552,0.00007377823,0.00007270824,0.00009598329,0.00003648849],"category_scores_gemma":[0.00076080457,0.00013269891,0.00006754853,0.0002343872,0.00024277336,0.0004937728,0.00003450107,0.0002480122,2.1385493e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028791503,0.00016518592,0.00009246633,0.00033249796,0.00012670533,0.0000050081458,0.00039721144,0.98519325,0.0012258614,0.008134506,0.000016248903,0.0040231333],"study_design_scores_gemma":[0.0016267339,0.00029034237,0.0002781292,0.00027963446,0.00008781574,0.000055977507,0.00018506632,0.99554104,0.0003651424,0.0011329495,0.000049072154,0.00010811509],"about_ca_topic_score_codex":0.0000046737523,"about_ca_topic_score_gemma":0.0000035975117,"teacher_disagreement_score":0.5425471,"about_ca_system_score_codex":0.000036562218,"about_ca_system_score_gemma":0.000101978214,"threshold_uncertainty_score":0.5411305},"labels":[],"label_agreement":null},{"id":"W4404910912","doi":"10.1007/978-3-030-54621-2_445-1","title":"Nondifferentiable Optimization","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.02878496451378674,"score_gpt":0.3089569060354497,"score_spread":0.2801719415216629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404910912","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.0949477e-7,0.00038258813,0.4865121,0.00005271306,0.00041006913,0.0005459012,0.00006501746,0.00019370753,0.5118376],"genre_scores_gemma":[0.0000043784494,0.004986601,0.4173788,0.0000096902695,0.00022282863,0.00003120802,0.00050969946,0.00024693267,0.57660985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678254,0.00003121762,0.0011140617,0.0007228583,0.00097232306,0.00037700008],"domain_scores_gemma":[0.99741,0.00031408423,0.00066203007,0.0007493247,0.0007057261,0.0001588611],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026579647,0.0005982876,0.00077647076,0.0008034355,0.0001050782,0.00007402786,0.00040808998,0.0006577238,0.008742126],"category_scores_gemma":[0.00032525018,0.0006135916,0.0002586014,0.00025801087,0.00015810443,0.00033603873,0.00024270774,0.0006102823,0.00014692123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019229452,0.000047687085,0.000001093985,0.0004682271,0.00012701003,0.0000114282675,0.000105001636,0.82553566,7.497072e-7,0.16764425,0.005302207,0.00073743396],"study_design_scores_gemma":[0.00049905415,0.00011170733,2.0087569e-7,0.00069181493,0.0003648121,0.000012099609,0.000019977799,0.83749986,0.000037339585,0.11548273,0.044507496,0.00077291543],"about_ca_topic_score_codex":0.0000025780425,"about_ca_topic_score_gemma":0.0000023069354,"teacher_disagreement_score":0.06913328,"about_ca_system_score_codex":0.00021958761,"about_ca_system_score_gemma":0.00021496571,"threshold_uncertainty_score":0.9996315},"labels":[],"label_agreement":null},{"id":"W4405193449","doi":"10.28924/2291-8639-22-2024-233","title":"An Interior Point Algorithm for Quadratic Programming Based on a New Step-Length","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Qassim University","keywords":"Line search; Mathematics; Interior point method; Quadratic equation; Convergence (economics); Quadratic programming; Logarithm; Mathematical optimization; Function (biology); Point (geometry); Polynomial; Quadratic function; Algorithm; Computer science","score_opus":0.0290597347853111,"score_gpt":0.40683996146244533,"score_spread":0.37778022667713423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405193449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002820103,0.0001010505,0.99753094,0.0015912736,0.00006456436,0.00029447573,0.00004352433,0.00003157311,0.00006057714],"genre_scores_gemma":[0.05783113,0.000059970083,0.9409164,0.00011825407,0.0005445905,0.000104118575,0.000045849414,0.000026784714,0.00035289084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864346,0.000037250993,0.00051795534,0.00020843893,0.00047006743,0.00012285895],"domain_scores_gemma":[0.9983386,0.0004974475,0.00021395493,0.00017309148,0.0006157585,0.00016117138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004675046,0.00011661236,0.00023490707,0.0008100125,0.000069863534,0.0003291066,0.00031243742,0.00004146821,0.00009870845],"category_scores_gemma":[0.00011353501,0.00009495289,0.00024748783,0.0005550214,0.00003774578,0.00024922585,0.000021752056,0.00016017516,0.0000030883537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003154551,0.00023517972,0.000039483184,0.000023416957,0.0011934536,0.000008966699,0.00017489068,0.0033878724,0.00010970567,0.014392631,0.00043185087,0.979971],"study_design_scores_gemma":[0.00041840662,0.00020206149,0.000034609195,0.00007019185,0.00044593043,0.000016889479,0.0002376829,0.9704489,0.00021500712,0.012048504,0.015750349,0.00011146802],"about_ca_topic_score_codex":0.000007651825,"about_ca_topic_score_gemma":0.000013710352,"teacher_disagreement_score":0.97985953,"about_ca_system_score_codex":0.00010058997,"about_ca_system_score_gemma":0.000142795,"threshold_uncertainty_score":0.38720667},"labels":[],"label_agreement":null},{"id":"W4405506994","doi":"10.1016/j.ejor.2024.12.021","title":"Degree reduction techniques for polynomial optimization problems","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Reduction (mathematics); Polynomial; Mathematics; Mathematical optimization; Degree of a polynomial; Computer science","score_opus":0.2434671354178104,"score_gpt":0.456043609627804,"score_spread":0.2125764742099936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405506994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003639462,0.00042561535,0.9886832,0.0029609322,0.0003085936,0.00072245154,0.000017864655,0.00007031024,0.0064470684],"genre_scores_gemma":[0.045154493,0.00038681654,0.9454105,0.000022054599,0.0025975897,0.00004615847,0.000031169086,0.00013244119,0.006218766],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967454,0.00080985826,0.00069762155,0.00023746924,0.0011931907,0.00031643323],"domain_scores_gemma":[0.9960238,0.0007320804,0.00010504933,0.00017061588,0.002822864,0.00014562572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008323474,0.00012499628,0.00017261317,0.00079539604,0.00032051734,0.0004553477,0.00036601597,0.000042106498,0.00028531885],"category_scores_gemma":[0.0027423017,0.00010344778,0.00011596992,0.0006220909,0.00014519128,0.00076100044,0.000087772736,0.0006491442,0.000029198267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084134936,0.00063780474,0.000008683835,0.0008171489,0.0003836367,0.00028577162,0.0024104272,0.2950952,0.026797645,0.06702246,0.34786674,0.25783312],"study_design_scores_gemma":[0.0024283773,0.0037994462,0.000041788117,0.0016222061,0.000066410066,0.0017738254,0.000799784,0.6453969,0.020153668,0.026629813,0.29654488,0.000742937],"about_ca_topic_score_codex":8.697637e-7,"about_ca_topic_score_gemma":4.1057513e-7,"teacher_disagreement_score":0.35030168,"about_ca_system_score_codex":0.00026595706,"about_ca_system_score_gemma":0.0005357088,"threshold_uncertainty_score":0.43909281},"labels":[],"label_agreement":null},{"id":"W4405882182","doi":"10.1007/s10957-024-02558-4","title":"Polynomial Optimization: Tightening RLT-Based Branch-and-Bound Schemes with Conic Constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Consellería de Cultura, Educación e Ordenación Universitaria, Xunta de Galicia","keywords":"Mathematics; Conic section; Theory of computation; Branch and bound; Mathematical optimization; Polynomial; Applied mathematics; Geometry; Mathematical analysis; Algorithm","score_opus":0.019067063736665012,"score_gpt":0.3252841599980738,"score_spread":0.3062170962614088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405882182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003656497,0.0012231973,0.99659,0.00064258906,0.000045681023,0.0003941803,0.000015961825,0.000075041986,0.00064770377],"genre_scores_gemma":[0.119608276,0.0007281522,0.87847644,0.00016369617,0.0002948467,0.00008461415,0.000028261447,0.00007716122,0.00053856324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986444,0.00014394135,0.00050703576,0.00023549021,0.00028603777,0.00018307114],"domain_scores_gemma":[0.99788284,0.0010701043,0.0002781657,0.00017328384,0.00043155954,0.00016403716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081447035,0.00018095704,0.00026365338,0.00030223836,0.0002941403,0.00026177033,0.00013874061,0.000093060866,0.00042113167],"category_scores_gemma":[0.00021598619,0.00014530664,0.000054591666,0.0004969428,0.0004891168,0.00046967724,0.000031921103,0.0002916007,0.0000023695761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014376307,0.00007859971,0.000026429509,0.00013083861,0.00012278711,0.000008341421,0.0001679996,0.8774859,0.00005374504,0.11048397,0.00017078425,0.011126877],"study_design_scores_gemma":[0.0021090007,0.0002266965,0.000008598785,0.00040667027,0.00025999956,0.0005523196,0.00047318518,0.96845,0.00069819915,0.020998474,0.0053992607,0.0004175557],"about_ca_topic_score_codex":2.2319587e-7,"about_ca_topic_score_gemma":2.4959084e-7,"teacher_disagreement_score":0.11924263,"about_ca_system_score_codex":0.00005353367,"about_ca_system_score_gemma":0.00028798424,"threshold_uncertainty_score":0.59254324},"labels":[],"label_agreement":null},{"id":"W4405989077","doi":"10.1016/j.sysconle.2024.106004","title":"New inequalities for comparing ordinary differential equations arising in global dynamic optimization","year":2025,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ordinary differential equation; Inequality; Applied mathematics; Mathematical optimization; Differential equation; Mathematical analysis","score_opus":0.03566855162121531,"score_gpt":0.3595273807648062,"score_spread":0.32385882914359093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405989077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00576682,0.00015097602,0.98994106,0.0013201723,0.00059567863,0.0017543089,0.000032475356,0.0001285621,0.00030994255],"genre_scores_gemma":[0.9119567,0.000003076388,0.08646774,0.00016584301,0.00009573452,0.0002517017,0.00006498058,0.00003009594,0.0009640945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981579,0.00020484837,0.0006578228,0.00031286376,0.00027813445,0.000388385],"domain_scores_gemma":[0.99853367,0.00081260124,0.00018371976,0.00027887724,0.0001257423,0.000065410495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031125682,0.00019589547,0.00048942154,0.0002715448,0.00012231681,0.00016008365,0.00021132539,0.00008910497,0.00002231334],"category_scores_gemma":[0.0004459414,0.0002067694,0.000086395325,0.00042870338,0.000028451857,0.00022940342,0.00005178347,0.0001435292,0.0000034775064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011712054,0.000040580304,0.0012206747,0.00029021595,0.00009340395,0.000002266858,0.00012378856,0.9566721,0.00040233822,0.039773446,0.0006594992,0.0006045847],"study_design_scores_gemma":[0.0037635579,0.000018984158,0.00017829839,0.00026949696,0.000035425048,0.0000013816943,0.00027361902,0.9922672,0.000003821343,0.002935661,0.00008007711,0.0001725075],"about_ca_topic_score_codex":0.0002500613,"about_ca_topic_score_gemma":0.00010603659,"teacher_disagreement_score":0.9061899,"about_ca_system_score_codex":0.00061264983,"about_ca_system_score_gemma":0.000113245136,"threshold_uncertainty_score":0.84318113},"labels":[],"label_agreement":null},{"id":"W4406233261","doi":"10.1007/978-3-030-54621-2_292-1","title":"Interior Point Methods for Semidefinite Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Interior point method; Point (geometry); Computer science; Mathematical optimization; Mathematics; Geometry","score_opus":0.05319793775319912,"score_gpt":0.40450160126788653,"score_spread":0.3513036635146874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406233261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.799272e-8,0.0006362894,0.6821331,0.00010839977,0.00042815195,0.0013846927,0.00006134696,0.0001806125,0.31506735],"genre_scores_gemma":[2.4258392e-7,0.0016680348,0.6209185,0.000011424376,0.00013778322,0.00016782331,0.00021527694,0.00021137652,0.37666953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997525,0.00004625121,0.0010851104,0.0006180423,0.00038062525,0.00034497568],"domain_scores_gemma":[0.99678457,0.0012053285,0.00061835954,0.0005407362,0.00072944973,0.00012154281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008577487,0.00047631506,0.0007487496,0.0005723781,0.0000790476,0.00006730786,0.00031880333,0.00046818572,0.00077747373],"category_scores_gemma":[0.0014876616,0.0004744712,0.00033439518,0.00015943083,0.00013012436,0.00021509528,0.00022209814,0.00044710175,0.000025559491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013830443,0.00008451542,9.600847e-7,0.0037737198,0.00052125315,0.000013072498,0.0011090051,0.087061636,0.000014233691,0.64958644,0.005727962,0.25196886],"study_design_scores_gemma":[0.00047804674,0.00021895044,4.00809e-8,0.00096172065,0.00033230387,0.000012500414,0.00006071104,0.26446608,0.000082328566,0.3264671,0.40629306,0.0006271744],"about_ca_topic_score_codex":0.0000011821196,"about_ca_topic_score_gemma":0.0000015041132,"teacher_disagreement_score":0.4005651,"about_ca_system_score_codex":0.000189446,"about_ca_system_score_gemma":0.00016899122,"threshold_uncertainty_score":0.9997707},"labels":[],"label_agreement":null},{"id":"W4406370873","doi":"10.28924/2291-8639-23-2025-10","title":"Another Updated Parameter for the Hestenes-Stiefel Conjugate Gradient Method","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Qassim University","keywords":"Conjugate gradient method; Mathematics; Conjugate residual method; Derivation of the conjugate gradient method; Convergence (economics); Nonlinear conjugate gradient method; Applied mathematics; Computation; Robustness (evolution); Mathematical optimization; Trust region; Algorithm; Computer science; Gradient descent; Artificial intelligence","score_opus":0.03837450525588489,"score_gpt":0.42783693171869946,"score_spread":0.3894624264628146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406370873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004316966,0.00016529344,0.99396396,0.00488296,0.000051480743,0.00024335197,0.000035072673,0.000007326062,0.0002188744],"genre_scores_gemma":[0.11219375,0.0007105706,0.8804156,0.0012810371,0.00028569993,0.00028754654,0.00004216218,0.000024785782,0.004758828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904543,0.000047145313,0.00043748162,0.00012306766,0.00025627593,0.00009058873],"domain_scores_gemma":[0.99710196,0.0013818785,0.00030317614,0.00016701933,0.0010115554,0.000034394277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005667047,0.000078851175,0.0002027456,0.00037056662,0.0001167946,0.000090687696,0.00035747423,0.000032262513,0.00006426726],"category_scores_gemma":[0.00021989737,0.00005081909,0.00021401508,0.0005332791,0.00006080609,0.00008231287,0.000047151785,0.00010504121,9.787476e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003108533,0.0007390171,0.0029676976,0.000038700135,0.023908634,0.0000050061367,0.00040228464,0.051022932,0.0011197395,0.6315454,0.010694652,0.27724504],"study_design_scores_gemma":[0.0017771715,0.00006277055,0.0023435808,0.000035910874,0.003243368,0.000030304098,0.0004889101,0.40194544,0.0026146367,0.32387492,0.26335335,0.00022964655],"about_ca_topic_score_codex":0.0000074897707,"about_ca_topic_score_gemma":0.000012569329,"teacher_disagreement_score":0.3509225,"about_ca_system_score_codex":0.00004385223,"about_ca_system_score_gemma":0.000043747434,"threshold_uncertainty_score":0.20723423},"labels":[],"label_agreement":null},{"id":"W4407837941","doi":"10.1080/03155986.2025.2467512","title":"New non-monotone line search-based adaptive trust region for solving unconstrained optimization problems","year":2025,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Line search; Trust region; Mathematical optimization; Line (geometry); Computer science; Mathematics","score_opus":0.10381943918655086,"score_gpt":0.39474135937529664,"score_spread":0.2909219201887458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407837941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024792913,0.000068055655,0.98712087,0.0012752268,0.0001494113,0.004240537,0.00007208018,0.00008386371,0.006742028],"genre_scores_gemma":[0.31772107,0.00016642967,0.6556962,0.0004889022,0.00049213273,0.0028927743,0.0012766485,0.00007858781,0.021187207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683446,0.00011456598,0.0010494941,0.00027341608,0.0011796665,0.0005484287],"domain_scores_gemma":[0.9939401,0.0014151328,0.00017166571,0.00031998457,0.0039205095,0.00023256558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026060948,0.00023067063,0.00033464338,0.001171995,0.00089637586,0.00085747003,0.0002816777,0.0002265838,0.000046615503],"category_scores_gemma":[0.0021172173,0.0002106692,0.000070032795,0.0011311093,0.00018799337,0.0022165836,0.00012913144,0.00041320856,0.000017316754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025248431,0.00003492102,0.000060615654,0.0005573192,0.00004999741,6.1318275e-7,0.000715824,0.8054155,0.000026698755,0.17964283,0.0060525956,0.007190603],"study_design_scores_gemma":[0.0025278379,0.00023119953,0.000021770305,0.00035978135,0.000008070205,0.0000061787,0.0014640657,0.98398006,0.00036573666,0.0018233301,0.009013148,0.00019879511],"about_ca_topic_score_codex":0.00018274462,"about_ca_topic_score_gemma":0.00001642595,"teacher_disagreement_score":0.33142462,"about_ca_system_score_codex":0.00036625707,"about_ca_system_score_gemma":0.0020077783,"threshold_uncertainty_score":0.859084},"labels":[],"label_agreement":null},{"id":"W4408593510","doi":"10.1007/s11424-025-4478-8","title":"Near Optimal Approximations and Finite Memory Policies for POMPDs with Continuous Spaces","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Science and Complexity","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Approximations of π; Mathematics; Applied mathematics; Mathematical economics; Computer science; Mathematical optimization; Algebra over a field; Pure mathematics","score_opus":0.0828848079858771,"score_gpt":0.3689295139047915,"score_spread":0.2860447059189144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408593510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33211774,0.00043462426,0.66386354,0.0014060438,0.00013144316,0.0005986534,0.000016523567,0.000019247358,0.0014121893],"genre_scores_gemma":[0.62328905,0.000038671315,0.37564823,0.00006346296,0.00006855058,0.000017266962,4.4583985e-7,0.00000883408,0.0008654762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988991,0.000035940924,0.00030485675,0.00012728025,0.00043652186,0.00019631824],"domain_scores_gemma":[0.9979711,0.00040122174,0.00026201195,0.00011748238,0.001148787,0.000099401914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732587,0.000084825566,0.00027033535,0.00022885542,0.0005183206,0.00038725813,0.0001951152,0.000024902482,0.0000020776827],"category_scores_gemma":[0.0007289584,0.000058845108,0.000020990583,0.0004797637,0.0011161453,0.00044514317,0.000069482834,0.000106378,1.8255916e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005714348,0.00052767457,0.004559804,0.002314704,0.00028266446,0.000023981964,0.011454776,0.0411334,0.0022822456,0.9249683,0.0041494896,0.0077315466],"study_design_scores_gemma":[0.0031565137,0.0010281908,0.0025949308,0.00085879315,0.00009297572,0.00050409517,0.023773734,0.919594,0.0006711901,0.04368061,0.0036718785,0.00037309603],"about_ca_topic_score_codex":0.000023255407,"about_ca_topic_score_gemma":0.0000057369093,"teacher_disagreement_score":0.8812877,"about_ca_system_score_codex":0.000051033014,"about_ca_system_score_gemma":0.00034959326,"threshold_uncertainty_score":0.4112484},"labels":[],"label_agreement":null},{"id":"W4410327619","doi":"10.23952/jnva.9.2025.4.03","title":"Solving indefinite quadratic programs by dynamical systems: Preliminary investigations","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Università di Pisa","keywords":"Quadratic equation; Dynamical systems theory; Applied mathematics; Computer science; Mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Physics; Geometry","score_opus":0.029832970227306896,"score_gpt":0.33989274560598676,"score_spread":0.31005977537867985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410327619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014983049,0.0004678349,0.98258686,0.0014471007,0.000071225375,0.00015945002,0.000037839378,0.000017646627,0.00022901165],"genre_scores_gemma":[0.22200212,0.00016768716,0.7750379,0.0001478162,0.00018704044,0.000021865397,0.0001948461,0.00002275287,0.0022179605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983096,0.00015679466,0.0007544593,0.00014372573,0.00049152825,0.00014386981],"domain_scores_gemma":[0.9977961,0.000817848,0.00042147283,0.00012631409,0.00072333205,0.00011492421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068344636,0.000116210744,0.00037954946,0.0006345359,0.00018499355,0.00012472818,0.00014469193,0.000087174594,0.000032151278],"category_scores_gemma":[0.0011653574,0.00009650308,0.0001579141,0.0014498984,0.00006728143,0.00024309412,0.000053585354,0.00026803862,0.0000014334032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057310285,0.00499708,0.10581445,0.0013508281,0.026683288,0.00007570008,0.0027052832,0.4256255,0.000751347,0.40963584,0.008438984,0.01334859],"study_design_scores_gemma":[0.0004320251,0.000089045614,0.0015645887,0.000077897224,0.0010332153,0.000013737721,0.00022757135,0.97875065,0.0000064984356,0.017319456,0.00038841178,0.00009692788],"about_ca_topic_score_codex":0.0000134436,"about_ca_topic_score_gemma":0.000007097754,"teacher_disagreement_score":0.55312514,"about_ca_system_score_codex":0.000086975284,"about_ca_system_score_gemma":0.00021705661,"threshold_uncertainty_score":0.39352813},"labels":[],"label_agreement":null},{"id":"W4410527792","doi":"10.23952/jnva.9.2025.5.05","title":"Optimality and stability conditions for Benson efficient solutions in vector optimization problems","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Viet Nam National University Ho Chi Minh City","keywords":"Stability (learning theory); Mathematical optimization; Vector optimization; Mathematics; Vector (molecular biology); Optimization problem; Computer science; Applied mathematics; Chemistry; Machine learning; Recombinant DNA; Multi-swarm optimization","score_opus":0.05317492915233687,"score_gpt":0.3727366640209108,"score_spread":0.319561734868574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026125656,0.00010728363,0.971791,0.0014940695,0.000030443742,0.00024793242,0.00015611119,0.000005934186,0.000041550396],"genre_scores_gemma":[0.28558865,0.0000974827,0.7140578,0.00003514128,0.000054604487,0.000021622576,0.000080850885,0.0000073843707,0.00005649738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881476,0.00009898989,0.00057700876,0.00015135155,0.00022592199,0.00013195237],"domain_scores_gemma":[0.99790365,0.0008772444,0.0002457869,0.00009017498,0.0008214792,0.00006164276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011060499,0.00008478627,0.00029964038,0.0005672931,0.00016541911,0.000044701417,0.00006186223,0.000059248192,0.000064080974],"category_scores_gemma":[0.0012747667,0.00007511284,0.00011354526,0.00095453125,0.00005668717,0.00012947326,0.000036622096,0.00013040063,9.818453e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045335484,0.0003366429,0.002403275,0.000060531813,0.00037155455,5.115184e-7,0.00012962143,0.9741001,0.000041828687,0.022379583,0.00002011083,0.00011086409],"study_design_scores_gemma":[0.00076819875,0.00003859591,0.010270923,0.000021873173,0.0003948915,0.000002709764,0.00008940086,0.9772602,0.000015673519,0.011036872,0.000038254748,0.00006244439],"about_ca_topic_score_codex":0.0000114458,"about_ca_topic_score_gemma":0.000036841142,"teacher_disagreement_score":0.25946298,"about_ca_system_score_codex":0.00013858719,"about_ca_system_score_gemma":0.000143941,"threshold_uncertainty_score":0.30630127},"labels":[],"label_agreement":null},{"id":"W4410716737","doi":"10.1007/s11222-025-10635-5","title":"Local Polynomial $$L_p$$-norm Regression","year":2025,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia, Okanagan Campus; Kelowna General Hospital","funders":"","keywords":"Mathematics; Polynomial regression; Polynomial; Norm (philosophy); Regression; Combinatorics; Discrete mathematics; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.023666688970982248,"score_gpt":0.3763456907777759,"score_spread":0.3526790018067937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410716737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015374953,0.00008424291,0.9946785,0.0001217507,0.00014271836,0.00010714685,0.000023032479,0.0000502262,0.0032549002],"genre_scores_gemma":[0.20751165,0.000032157124,0.7902082,0.00009530264,0.00005722221,0.0000020207522,0.00001308963,0.00001583838,0.00206449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992086,0.000037581016,0.00021568411,0.00018181046,0.00015308161,0.00020323067],"domain_scores_gemma":[0.99905586,0.00058294355,0.000062693696,0.00013078918,0.00011076972,0.000056953402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017505685,0.00009686606,0.0001492493,0.00008115868,0.00022558162,0.000051939674,0.00008553089,0.00004397346,0.000028797192],"category_scores_gemma":[0.00034417654,0.00008619846,0.000013789412,0.00015639408,0.00009312716,0.000029088016,0.00018214462,0.00015798229,0.0000037726945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030833315,0.000058965554,0.00022157462,0.00018976691,0.000030359857,0.000023304736,0.0002774859,0.0013394632,0.000046856752,0.32402462,0.025637757,0.64811903],"study_design_scores_gemma":[0.0005767273,0.000033737902,0.00028126957,0.00014301157,0.000012762577,0.000005312317,0.00027550926,0.8759925,0.00022116922,0.119841665,0.002475808,0.00014056273],"about_ca_topic_score_codex":0.000009914598,"about_ca_topic_score_gemma":0.0000054246257,"teacher_disagreement_score":0.874653,"about_ca_system_score_codex":0.000039797298,"about_ca_system_score_gemma":0.000057295456,"threshold_uncertainty_score":0.3515071},"labels":[],"label_agreement":null},{"id":"W4410734459","doi":"10.1007/s10898-025-01503-7","title":"A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Piecewise linear function; Quadratic equation; Applied mathematics; Conjugate gradient method; Piecewise; Piecewise linear manifold; Linear programming; Mathematical optimization; Algorithm; Mathematical analysis; Statistics","score_opus":0.019510155178864126,"score_gpt":0.3542534389129457,"score_spread":0.3347432837340816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410734459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005188322,0.00011821133,0.9941042,0.0029237936,0.0005040475,0.0005525182,0.000062053405,0.000039471775,0.0011768935],"genre_scores_gemma":[0.0026764025,0.00010640638,0.9951027,0.0004131747,0.00021720037,0.000010160293,0.00001305225,0.000027309876,0.001433581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973402,0.00025483358,0.0012317046,0.0002062433,0.00067355885,0.00029343474],"domain_scores_gemma":[0.99595016,0.0004992132,0.0007996471,0.00038730394,0.0021927871,0.00017089242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157725,0.00022577557,0.00054440566,0.00023654019,0.00019770958,0.00006619245,0.00048671468,0.00012600515,0.00015537927],"category_scores_gemma":[0.0014208292,0.00016866579,0.00019682516,0.0019646427,0.000116040785,0.00033570142,0.00017102456,0.00030695152,0.000030877985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001307194,0.0002347434,0.000054010445,0.00004002108,0.00020467574,0.000008754676,0.00009759604,0.9866779,0.000049088423,0.0021661501,0.0034756486,0.006860718],"study_design_scores_gemma":[0.0013415095,0.0002757105,0.00007755457,0.00019265985,0.00015619207,0.00003448656,0.00010439815,0.9922769,0.00015632094,0.00395821,0.0012818297,0.00014424349],"about_ca_topic_score_codex":0.000010221685,"about_ca_topic_score_gemma":0.0000038768962,"teacher_disagreement_score":0.0067164744,"about_ca_system_score_codex":0.00029008975,"about_ca_system_score_gemma":0.00049025164,"threshold_uncertainty_score":0.68779916},"labels":[],"label_agreement":null},{"id":"W4410779970","doi":"10.29121/shodhkosh.v5.i7.2024.5260","title":"APPROXIMATION OF FIXED POINT FOR F ITERATIVE ALGORITHM AND SOLUTION OF A DELAY DIFFERENTIAL EQUATION","year":2024,"lang":"en","type":"article","venue":"ShodhKosh Journal of Visual and Performing Arts","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Criminal Justice Association","funders":"","keywords":"Fixed point; Mathematics; Differential equation; Algorithm; Delay differential equation; Iterative method; Applied mathematics; Mathematical analysis","score_opus":0.07231536721585902,"score_gpt":0.3967296519639655,"score_spread":0.32441428474810646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410779970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20477393,0.00027653863,0.7945479,0.000074716634,0.00009892681,0.00018802358,0.000014623947,0.0000061144337,0.000019230278],"genre_scores_gemma":[0.71183306,0.00015614154,0.28776586,0.0000036098759,0.00013374095,0.000007133707,0.000010191643,0.000015109601,0.000075165124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989217,0.0000457739,0.0005293494,0.000103108614,0.0002829364,0.000117122436],"domain_scores_gemma":[0.9987832,0.00042766766,0.00028325338,0.00004289327,0.00040862,0.00005437511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006605004,0.00009687328,0.00025177345,0.00023852164,0.00007756346,0.00003800485,0.000038424285,0.000056561792,0.000021368493],"category_scores_gemma":[0.00028614188,0.00007557547,0.00006604488,0.00010979771,0.00007193068,0.00042341993,0.000030785715,0.00012665283,1.4092696e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054186635,0.00045660345,0.0000969599,0.0027691787,0.000328598,0.000009124132,0.014278683,0.0009216199,0.032536145,0.017425517,0.00016175391,0.9304739],"study_design_scores_gemma":[0.00068251655,0.000851569,0.000051461782,0.00052383274,0.000066605164,0.00008721704,0.00040000278,0.9539032,0.024074104,0.019232772,0.000042277887,0.00008441746],"about_ca_topic_score_codex":0.0000014988317,"about_ca_topic_score_gemma":5.676805e-7,"teacher_disagreement_score":0.9529816,"about_ca_system_score_codex":0.000030225881,"about_ca_system_score_gemma":0.00005621425,"threshold_uncertainty_score":0.30818784},"labels":[],"label_agreement":null},{"id":"W4410790929","doi":"10.1007/s10957-025-02696-3","title":"New Trends in Optimization, Control, and Their Applications: Guest Editorial","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Theory of computation; Mathematics; Control (management); Mathematical optimization; Mathematical economics; Computer science; Algorithm; Artificial intelligence","score_opus":0.011263314702512017,"score_gpt":0.3316541827842908,"score_spread":0.3203908680817788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410790929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009297451,0.0007403095,0.99619,0.00079258846,0.0005335861,0.00052249344,0.000014509869,0.000032901306,0.001164277],"genre_scores_gemma":[0.007621523,0.002844242,0.9722862,0.00038162607,0.01213881,0.0005399528,0.00007211437,0.00008494269,0.0040305583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984227,0.00021097605,0.00075623504,0.00023559749,0.00019792924,0.00017660842],"domain_scores_gemma":[0.99753225,0.0010855122,0.00042666856,0.00025370604,0.0005562484,0.000145587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371401,0.00018273218,0.00034502533,0.0007307525,0.00021301873,0.000103518265,0.00022535752,0.00015007315,0.00008047852],"category_scores_gemma":[0.00038119894,0.00015875358,0.00005634703,0.0011819944,0.00012526601,0.0004064874,0.00005391296,0.0002897072,7.381741e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022657574,0.00021913071,0.00009057129,0.00004434454,0.00008570483,5.3275767e-7,0.0002225369,0.68242794,0.00003409475,0.28010175,0.0070528686,0.029493941],"study_design_scores_gemma":[0.010390491,0.00019428029,0.000100150886,0.00022217022,0.00024352726,0.000075774085,0.001540436,0.22348216,0.00023833332,0.6484324,0.114382945,0.0006973653],"about_ca_topic_score_codex":0.0000014239231,"about_ca_topic_score_gemma":0.0000017134018,"teacher_disagreement_score":0.45894578,"about_ca_system_score_codex":0.00006832669,"about_ca_system_score_gemma":0.00015412224,"threshold_uncertainty_score":0.6473783},"labels":[],"label_agreement":null},{"id":"W4411090176","doi":"10.1007/s10589-025-00701-z","title":"The cosine measure relative to a subspace","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University; University of British Columbia, Okanagan Campus; University of British Columbia; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Measure (data warehouse); Subspace topology; Trigonometric functions; Statistics; Mathematical analysis; Geometry; Data mining; Computer science","score_opus":0.027199923112818897,"score_gpt":0.3709157982805363,"score_spread":0.3437158751677174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411090176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019308074,0.00014533712,0.981249,0.0116929645,0.00002350736,0.0010355416,0.000012956157,0.00010386119,0.005717575],"genre_scores_gemma":[0.010717491,0.000082847924,0.9797144,0.0007811609,0.00005059532,0.00095376413,0.00006803491,0.000025352878,0.0076063354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.00006542348,0.0002624691,0.00025104685,0.00024913865,0.00015516065],"domain_scores_gemma":[0.99772817,0.0012042134,0.00007802512,0.00021196154,0.0006843163,0.000093299146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020014873,0.000112878355,0.00011130051,0.00013726279,0.000820845,0.00011715859,0.00016648881,0.000047404807,0.000024258843],"category_scores_gemma":[0.000462286,0.00009332445,0.000028153583,0.0010575616,0.0001132711,0.00012045686,0.000089309025,0.00012043032,0.000016546583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212404,0.000027011642,0.000014375308,0.0000056618055,0.000016539363,6.6364194e-8,0.000047779715,0.5010219,0.000002002713,0.4929234,0.0020640627,0.0038679428],"study_design_scores_gemma":[0.00039462015,0.000016437254,0.00013937503,0.00002956582,0.000016214837,0.0000023101468,0.00013833016,0.73203313,0.000014301753,0.24220367,0.024889171,0.00012289653],"about_ca_topic_score_codex":9.971554e-7,"about_ca_topic_score_gemma":0.0000042871393,"teacher_disagreement_score":0.25071973,"about_ca_system_score_codex":0.0000700848,"about_ca_system_score_gemma":0.00011160266,"threshold_uncertainty_score":0.6313359},"labels":[],"label_agreement":null},{"id":"W4411747739","doi":"10.1093/imanum/draf053","title":"Using generalized simplex methods to approximate derivatives","year":2025,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"University of Wollongong","keywords":"Mathematics; Simplex; Applied mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.13789866636310025,"score_gpt":0.5229728484829245,"score_spread":0.38507418211982425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411747739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072497865,0.00015242943,0.9911556,0.0010512249,0.00004541556,0.000099176366,0.0000034565887,0.000017449109,0.0002254316],"genre_scores_gemma":[0.012730023,0.00002259509,0.9864859,0.00032920888,0.00004919896,0.0000034669204,0.000001133843,0.000017010754,0.00036148133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766827,0.0005419594,0.00085561466,0.00019613825,0.0004476762,0.00029031932],"domain_scores_gemma":[0.9975424,0.0008014374,0.00042006903,0.0002658651,0.0007678639,0.00020239346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000972157,0.0001628267,0.00082957355,0.0011636383,0.00012219195,0.00007429713,0.00036116806,0.000053891235,0.0003992439],"category_scores_gemma":[0.0027115108,0.00012713407,0.00046885276,0.005011028,0.000057528305,0.00018440437,0.00014671746,0.00023675672,0.0000022493277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041475217,0.0008260134,0.0018005477,0.00013243945,0.013017621,0.000080641556,0.0012360263,0.81406057,0.023703072,0.012195725,0.0023065363,0.13022606],"study_design_scores_gemma":[0.0007375504,0.00006635757,0.00018636693,0.00003623458,0.0016879586,0.000017388562,0.00047676178,0.92802554,0.008903141,0.05680492,0.0028105015,0.0002472596],"about_ca_topic_score_codex":0.000015169211,"about_ca_topic_score_gemma":8.876117e-7,"teacher_disagreement_score":0.12997879,"about_ca_system_score_codex":0.00016393317,"about_ca_system_score_gemma":0.00009749653,"threshold_uncertainty_score":0.5184377},"labels":[],"label_agreement":null},{"id":"W4412461910","doi":"10.18280/mmep.120632","title":"Robust and Hybrid Conjugate Gradient Method for Modern Unconstrained Optimization Methods","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjugate gradient method; Nonlinear conjugate gradient method; Conjugate; Derivation of the conjugate gradient method; Gradient method; Computer science; Conjugate residual method; Mathematical optimization; Mathematics; Applied mathematics; Gradient descent; Artificial intelligence; Artificial neural network; Mathematical analysis","score_opus":0.07542429257836512,"score_gpt":0.3521379164602834,"score_spread":0.2767136238819183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412461910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014743312,0.00025980294,0.9980429,0.00023173368,0.00004981592,0.00077441876,0.000009383096,0.00021486863,0.00026964064],"genre_scores_gemma":[0.001839766,0.00009397985,0.9972852,0.000019895324,0.000017033086,0.00021205458,0.000007950238,0.000049920738,0.00047423548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986323,0.000052089094,0.00045441938,0.00037517957,0.00013619149,0.0003497922],"domain_scores_gemma":[0.9979634,0.0014978208,0.000062551,0.00021026375,0.00013735553,0.00012858819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011605046,0.00023465909,0.00041579737,0.00018709258,0.00013246745,0.000100724385,0.00009699645,0.00009001284,0.0000077252935],"category_scores_gemma":[0.0005781599,0.00021536738,0.00005456982,0.00016978837,0.00005474968,0.000106837615,0.00007477481,0.00018612709,3.463381e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080115315,0.000036383517,2.1279247e-7,0.0012828454,0.00005021645,4.6605527e-7,0.00024413549,0.8782111,0.00010804756,0.11534398,0.00001175461,0.0047028554],"study_design_scores_gemma":[0.00037791303,0.000020884703,3.1820093e-8,0.00019403704,0.000040566203,0.0000098181135,0.000018504867,0.6690388,0.00027779472,0.32982683,0.0000563804,0.00013846482],"about_ca_topic_score_codex":0.0000015210821,"about_ca_topic_score_gemma":1.2274708e-7,"teacher_disagreement_score":0.21448286,"about_ca_system_score_codex":0.000039535087,"about_ca_system_score_gemma":0.000023013507,"threshold_uncertainty_score":0.87824273},"labels":[],"label_agreement":null},{"id":"W4412516298","doi":"10.1007/s10107-025-02251-y","title":"A hierarchy of eigencomputations for polynomial optimization on the sphere","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Numerical analysis; Polynomial; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis","score_opus":0.06842122437044813,"score_gpt":0.3972293464250283,"score_spread":0.32880812205458015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412516298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045333002,0.000017629063,0.99210083,0.0014844546,0.0000491423,0.0017376095,0.0000073501005,0.000095120005,0.0040545254],"genre_scores_gemma":[0.021430312,0.0000023857192,0.9767697,0.00007828817,0.000039462426,0.00046945448,0.000008087818,0.00003072351,0.0011716142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986519,0.00007887808,0.0004908087,0.00020748355,0.00028977668,0.0002811279],"domain_scores_gemma":[0.99577457,0.003453043,0.00013642864,0.00033269112,0.00025430645,0.00004894894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754613,0.00014164408,0.00025643932,0.000121866105,0.00022985984,0.00005975791,0.00027124444,0.00007627792,0.00017629753],"category_scores_gemma":[0.00352121,0.00009906051,0.00012698062,0.0005387429,0.00016024566,0.00006555837,0.00007595838,0.00015626493,0.0000073381566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058899335,0.000509848,0.000005104621,0.00055658445,0.00008520611,6.3747024e-7,0.0004750836,0.048839126,0.000022072421,0.8897329,0.0015614544,0.058153108],"study_design_scores_gemma":[0.00044726083,0.00009757546,0.0000012301774,0.00017806466,0.000035915527,0.0000010854463,0.00045333628,0.59600896,0.0006286951,0.40075517,0.0012877233,0.0001049544],"about_ca_topic_score_codex":8.857583e-7,"about_ca_topic_score_gemma":0.0000010051127,"teacher_disagreement_score":0.54716986,"about_ca_system_score_codex":0.00006116524,"about_ca_system_score_gemma":0.000088233326,"threshold_uncertainty_score":0.42154714},"labels":[],"label_agreement":null},{"id":"W4412531322","doi":"10.1007/s10957-025-02779-1","title":"Inertial Stochastic Reflected Forward Backward Method with Applications to Traffic Network Problems","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Graduiertenakademie, Technische Universität Dresden; National Natural Science Foundation of China; Centre Scientifique et Technique du Bâtiment; Queen's University Belfast; Natural Science Foundation of Chongqing; London Mathematical Society","keywords":"Inertial frame of reference; Theory of computation; Mathematics; Traffic network; Mathematical optimization; Applied mathematics; Algorithm; Classical mechanics; Physics","score_opus":0.022307215823819712,"score_gpt":0.3735591459496065,"score_spread":0.35125193012578676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412531322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069794645,0.00016100072,0.9964551,0.0008070096,0.000026782778,0.0016321748,0.000008986733,0.00006654796,0.00077260286],"genre_scores_gemma":[0.00553793,0.00008029834,0.9918811,0.0002477745,0.00021294922,0.00082403445,0.000016865857,0.00004079324,0.0011582955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982559,0.0002565739,0.00068108103,0.00026561818,0.0002851727,0.00025564362],"domain_scores_gemma":[0.99694055,0.0011468246,0.00041782187,0.00032604995,0.0009729559,0.00019576614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012166322,0.00018929428,0.0003478787,0.00037490745,0.00037139465,0.00008611004,0.00029324892,0.00009574726,0.00006781391],"category_scores_gemma":[0.00032264186,0.0001556377,0.00006239249,0.0018428004,0.00009490594,0.00020795745,0.00006528596,0.00029202187,0.0000037151478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017465289,0.00012604595,0.0000025349643,0.00004431825,0.00008660565,3.1861543e-7,0.0001432179,0.8405713,0.00004117438,0.14361186,0.0003241119,0.014873868],"study_design_scores_gemma":[0.0039799884,0.00063468004,0.00003303718,0.00051843893,0.0006263496,0.00019030384,0.0011998031,0.5591444,0.000296391,0.4052662,0.027268782,0.00084167597],"about_ca_topic_score_codex":2.4910395e-7,"about_ca_topic_score_gemma":0.000002134846,"teacher_disagreement_score":0.28142694,"about_ca_system_score_codex":0.00008294542,"about_ca_system_score_gemma":0.00019729428,"threshold_uncertainty_score":0.6346721},"labels":[],"label_agreement":null},{"id":"W4412604322","doi":"10.1080/03155986.2025.2535919","title":"Strict complementarity and non-degeneracy of solutions to copositive programming problems","year":2025,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Complementarity (molecular biology); Degeneracy (biology); Mathematical optimization; Mathematics; Mixed complementarity problem; Computer science; Applied mathematics; Mathematical economics; Physics; Quantum mechanics; Nonlinear system; Bioinformatics","score_opus":0.11476285452994311,"score_gpt":0.43647131937173,"score_spread":0.3217084648417869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412604322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048011135,0.00022837632,0.9267897,0.0017693406,0.0001731474,0.0073335073,0.00040415526,0.00006506578,0.015225568],"genre_scores_gemma":[0.9318868,0.00008544358,0.06562128,0.00012307492,0.000044190758,0.0008309913,0.00019910092,0.000010201506,0.001198946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785745,0.00012792203,0.0007209427,0.00013407548,0.00083616714,0.00032341748],"domain_scores_gemma":[0.99656034,0.0007439528,0.00009555494,0.00016605298,0.0023027956,0.00013129656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026028606,0.00010878593,0.00020737377,0.00071682315,0.00064086495,0.00038209753,0.00013776709,0.00006706837,0.000019523144],"category_scores_gemma":[0.0011227026,0.00009801537,0.00002096619,0.0008382333,0.0001419671,0.00121997,0.0002957575,0.00021908768,0.00001022948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012596798,0.00012364142,0.0024867626,0.001516099,0.00013271601,5.760843e-7,0.00601457,0.014308046,0.0003359541,0.9412573,0.008197234,0.02550113],"study_design_scores_gemma":[0.005944264,0.0011267215,0.015858673,0.0016455217,0.000041639807,0.0000358136,0.026855845,0.6774931,0.0021063813,0.00876885,0.25923368,0.0008894943],"about_ca_topic_score_codex":0.00047471505,"about_ca_topic_score_gemma":0.000059850056,"teacher_disagreement_score":0.93248844,"about_ca_system_score_codex":0.000148727,"about_ca_system_score_gemma":0.0003520635,"threshold_uncertainty_score":0.492908},"labels":[],"label_agreement":null},{"id":"W4412793654","doi":"10.1007/s11590-025-02221-5","title":"Computing approximate Nash equilibria for integer programming games","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Université de Toulouse; Institut de Valorisation des Données; Princeton University","keywords":"Integer programming; Computational intelligence; Nash equilibrium; Integer (computer science); Computer science; Mathematical optimization; Game theory; Mathematics; Mathematical economics; Artificial intelligence; Programming language","score_opus":0.03253869857474278,"score_gpt":0.36418847203313565,"score_spread":0.33164977345839286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412793654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005011574,0.000026877982,0.99309975,0.0036453442,0.00023710553,0.0012233843,0.0000069447988,0.0003517158,0.0009077013],"genre_scores_gemma":[0.002936557,0.000008246395,0.9942585,0.0010601389,0.000084447965,0.00014731225,0.000076600365,0.00005841553,0.0013697626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983741,0.00009605001,0.00045097995,0.0003964812,0.00024158513,0.00044079515],"domain_scores_gemma":[0.9984887,0.00068080303,0.0001719601,0.00031949556,0.00027506775,0.000063931424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165842,0.00020277876,0.00026494465,0.00029032232,0.00027582093,0.00018373906,0.00026692165,0.00008498023,0.00006797387],"category_scores_gemma":[0.0012112953,0.00020720366,0.00009935184,0.0006433776,0.00009641597,0.00027923135,0.00013745119,0.00019315284,0.000003951225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042555617,0.00008566565,0.00007262857,0.00028978297,0.00007382598,0.0000016870082,0.00031932167,0.9593876,0.00044310212,0.015701598,0.008669013,0.01491324],"study_design_scores_gemma":[0.0008524701,0.000016827942,0.0000023575433,0.000108186956,0.0000242229,0.0000017798594,0.00015933736,0.9929567,0.0005323004,0.0018638383,0.0032817281,0.00020028227],"about_ca_topic_score_codex":0.0000014482981,"about_ca_topic_score_gemma":5.9548057e-7,"teacher_disagreement_score":0.03356909,"about_ca_system_score_codex":0.00013040066,"about_ca_system_score_gemma":0.000056486315,"threshold_uncertainty_score":0.844952},"labels":[],"label_agreement":null},{"id":"W4413235386","doi":"10.23952/jnva.9.2025.6.06","title":"Simplified primal-dual forward-backward splitting algorithm for solving structured monotone inclusion with applications","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Guangzhou University","keywords":"Monotone polygon; Dual (grammatical number); Algorithm; Inclusion (mineral); Mathematics; Mathematical optimization; Computer science; Applied mathematics","score_opus":0.01787832362825571,"score_gpt":0.34835329388513037,"score_spread":0.33047497025687467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413235386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022374166,0.00009267547,0.9964003,0.00071644876,0.000022697435,0.00035828305,0.0000927136,0.00001456042,0.00006490634],"genre_scores_gemma":[0.017754262,0.00004843604,0.9814222,0.00008793697,0.00025148023,0.000029198045,0.00007935805,0.000016253485,0.0003109183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838483,0.000041505125,0.00067998044,0.00021042969,0.00049942255,0.00018383017],"domain_scores_gemma":[0.99686414,0.0009220375,0.00055901136,0.00015491172,0.0014024699,0.00009741917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007457652,0.00014845793,0.00045266503,0.0006383855,0.0005055849,0.00007305736,0.00015645857,0.00008514554,0.000037823705],"category_scores_gemma":[0.00038498582,0.00011423961,0.00019928154,0.0011732925,0.000042776584,0.00021455187,0.00016784917,0.00020856198,2.9097737e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015338714,0.0020239137,0.0069799796,0.00080858363,0.025941562,0.00002674102,0.0029563745,0.3735317,0.003666682,0.1532697,0.00072608807,0.4285348],"study_design_scores_gemma":[0.0014814954,0.00008704241,0.0012811321,0.000031790718,0.0014438618,0.00001298125,0.00017229869,0.9338318,0.00026272307,0.060119256,0.0011305576,0.00014507177],"about_ca_topic_score_codex":0.000004426089,"about_ca_topic_score_gemma":0.000009917035,"teacher_disagreement_score":0.56030005,"about_ca_system_score_codex":0.00010733248,"about_ca_system_score_gemma":0.00024280843,"threshold_uncertainty_score":0.4658556},"labels":[],"label_agreement":null},{"id":"W4413239810","doi":"10.1007/s40065-025-00553-9","title":"Retraction Note: An elementary proof of the Brouwer’s fixed point theorem","year":2025,"lang":"en","type":"article","venue":"Arabian Journal of Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":true,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Elementary proof; Mathematics; Fixed-point theorem; Fixed point; Brouwer fixed-point theorem; Discrete mathematics; Point (geometry); Combinatorics; Calculus (dental); Mathematical analysis; Geometry","score_opus":0.033393888334530705,"score_gpt":0.36314552134393463,"score_spread":0.3297516330094039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413239810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06417724,0.00009739829,0.9277004,0.0021879796,0.0006911012,0.00080426456,0.000014083454,0.000028068107,0.004299468],"genre_scores_gemma":[0.21255071,0.000046177494,0.78538215,0.00016753167,0.0001428007,0.000007866932,0.0000019596202,0.000050352362,0.0016504243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975538,0.00022111264,0.0011441486,0.00012433287,0.00073603244,0.0002205534],"domain_scores_gemma":[0.99687207,0.000651133,0.001109921,0.00058464665,0.0006995465,0.00008270246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018043037,0.00016353295,0.00040427368,0.00021750391,0.00011917422,0.000034771474,0.0006155464,0.000118748176,0.0002269329],"category_scores_gemma":[0.0020952632,0.00010928421,0.00019607546,0.0004883745,0.00014473182,0.0003796851,0.000102063306,0.0006026574,0.0000019789525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007912137,0.01327138,0.0020402297,0.0063682287,0.0018962083,0.00010346057,0.024837613,0.017300297,0.027803292,0.68809193,0.046291944,0.17120418],"study_design_scores_gemma":[0.0014895288,0.00035599666,0.00022109605,0.001065329,0.00020366981,0.00016596627,0.003971812,0.029049749,0.075620465,0.8868789,0.0007612173,0.00021627541],"about_ca_topic_score_codex":0.0000014150664,"about_ca_topic_score_gemma":0.000007507924,"teacher_disagreement_score":0.19878694,"about_ca_system_score_codex":0.00014842843,"about_ca_system_score_gemma":0.00021963776,"threshold_uncertainty_score":0.44564807},"labels":[{"model":"gemma","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W4413393306","doi":"10.23919/acc63710.2025.11107557","title":"A Log-domain Interior Point Method for Convex Quadratic Games","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular polygon; Interior point method; Point (geometry); Quadratic equation; Domain (mathematical analysis); Computer science; Mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.046944069263635695,"score_gpt":0.4441962776889496,"score_spread":0.3972522084253139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413393306","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016792666,0.000035243964,0.9863344,0.0026972713,0.00010672106,0.0009294442,0.000011623871,0.00014764324,0.009569729],"genre_scores_gemma":[0.0009574242,0.000007024597,0.9590125,0.0006444117,0.000023336463,0.00027412485,0.0000053441872,0.000025017269,0.039050817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882066,0.00011795344,0.0003626514,0.0002621856,0.00015915622,0.00027739612],"domain_scores_gemma":[0.99797493,0.0013485462,0.00006702854,0.00034897387,0.0001970398,0.00006349731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064557756,0.00013750631,0.0003049882,0.00018383104,0.000079739664,0.00005276915,0.00021256573,0.00007149515,0.0006296538],"category_scores_gemma":[0.0017870194,0.0001142577,0.00009819591,0.00027579596,0.00005644986,0.000104000515,0.000118733675,0.00011727462,0.0000191636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013443237,0.00016440573,0.000029177188,0.00062967587,0.00017437057,0.000005489826,0.0007964858,0.00025547066,0.0020978355,0.93306375,0.03627286,0.02637607],"study_design_scores_gemma":[0.0013362467,0.00008457329,0.0000064233514,0.00008011962,0.000024700177,0.0000051812262,0.0017054355,0.17548905,0.0065126866,0.8034936,0.011073998,0.00018795615],"about_ca_topic_score_codex":0.000006724932,"about_ca_topic_score_gemma":0.000023829143,"teacher_disagreement_score":0.17523357,"about_ca_system_score_codex":0.00009295266,"about_ca_system_score_gemma":0.00010152262,"threshold_uncertainty_score":0.6894268},"labels":[],"label_agreement":null},{"id":"W4413469480","doi":"10.1007/s10013-025-00760-z","title":"Solving Algorithm NCL’s Subproblems: The Need for Interior Methods","year":2025,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Algorithm; Karush–Kuhn–Tucker conditions; Computer science; Solver; Nonlinear system; Mathematics; Mathematical optimization; Physics","score_opus":0.05960940871927504,"score_gpt":0.4374120519074757,"score_spread":0.3778026431882006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413469480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002486611,0.000653434,0.9945568,0.0024182587,0.0004947426,0.0007798905,0.0000093385115,0.00003970401,0.0007991723],"genre_scores_gemma":[0.00023561744,0.00018783599,0.9967683,0.00017481684,0.00015625994,0.000051047806,0.000001006278,0.000056829358,0.0023683056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729574,0.00023361719,0.0014151328,0.00016506441,0.0004899988,0.0004004214],"domain_scores_gemma":[0.99327666,0.003951746,0.0009559428,0.0005009459,0.0012110592,0.00010363885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046759937,0.00025076972,0.0006758642,0.00036105094,0.00029207315,0.00014806764,0.00087438006,0.0001225418,0.000073294694],"category_scores_gemma":[0.006039564,0.0001605218,0.00036750836,0.0005992986,0.00014101504,0.00024658578,0.00020722995,0.00050774874,0.000004752261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016457112,0.0014526757,0.000030148758,0.0042596795,0.0019758448,0.000034399483,0.01147847,0.0017833527,0.008489354,0.18361752,0.04743146,0.73928255],"study_design_scores_gemma":[0.001882228,0.00023678115,0.0000040334294,0.0010080476,0.00030256604,0.00018264064,0.0069991006,0.31172365,0.0049651926,0.658186,0.014222665,0.00028709328],"about_ca_topic_score_codex":5.623615e-7,"about_ca_topic_score_gemma":0.0000015081245,"teacher_disagreement_score":0.73899543,"about_ca_system_score_codex":0.00016259226,"about_ca_system_score_gemma":0.0002432561,"threshold_uncertainty_score":0.7230359},"labels":[],"label_agreement":null},{"id":"W4415156424","doi":"10.48550/arxiv.2504.09375","title":"Efficient Gradient-Enhanced Bayesian Optimizer with Comparisons to Conjugate-Gradient and Quasi-Newton Optimizers for Unconstrained Local Optimization","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Bayesian probability; Probabilistic logic; Bayesian optimization; Function (biology); Minification; Surrogate model; Local optimum","score_opus":0.051636972948274705,"score_gpt":0.34230644899450363,"score_spread":0.29066947604622895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415156424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016572276,0.000102537575,0.9734742,0.0016943888,0.00050901633,0.006014216,0.0003883648,0.00040102386,0.0008439469],"genre_scores_gemma":[0.13438815,0.00008200541,0.8610188,0.00025844728,0.00009971885,0.0015913332,0.00040861487,0.00017103473,0.0019819408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476695,0.0002469312,0.001221147,0.0018416543,0.00075399736,0.0011693225],"domain_scores_gemma":[0.99527484,0.0010410647,0.0005993001,0.0012738219,0.0010970517,0.00071390695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069452776,0.0010164176,0.0015022934,0.00073802465,0.00052796496,0.00019039874,0.00069968787,0.00054543756,0.00010957915],"category_scores_gemma":[0.0008101065,0.00095215876,0.00026285817,0.000776997,0.00060805853,0.000100873556,0.00085903984,0.0009558282,0.000010058832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007866122,0.00055479654,0.00039530022,0.00062983035,0.00033665527,0.000010748121,0.00096245925,0.99263924,0.00002271468,0.0020028711,0.0009830163,0.0006757797],"study_design_scores_gemma":[0.0042093913,0.0005463254,0.000053656804,0.0008752892,0.0003112323,0.000009735,0.0014425954,0.98956734,0.001171333,0.00049284747,0.00025215428,0.0010680797],"about_ca_topic_score_codex":0.000062509505,"about_ca_topic_score_gemma":0.000081421786,"teacher_disagreement_score":0.117815875,"about_ca_system_score_codex":0.000675473,"about_ca_system_score_gemma":0.0006284377,"threshold_uncertainty_score":0.9992929},"labels":[],"label_agreement":null},{"id":"W4415163885","doi":"10.1007/s10898-025-01547-9","title":"Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Trigonometric functions; Relaxation (psychology); Nonlinear system; Differentiable function; Nonlinear programming; Variable (mathematics); Domain (mathematical analysis); Function (biology); Sequence (biology)","score_opus":0.02355425099976231,"score_gpt":0.3442385037937763,"score_spread":0.32068425279401397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415163885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100791505,0.00023727167,0.99550813,0.0005601997,0.00067513797,0.0011564594,0.00014009293,0.000105438696,0.0015164522],"genre_scores_gemma":[0.0010446473,0.000121349,0.9975897,0.000079514204,0.00022777842,0.00006180701,0.00012764179,0.000036775935,0.0007107522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972007,0.00012682134,0.0011186582,0.00036295733,0.0007238561,0.00046699203],"domain_scores_gemma":[0.99488163,0.0002467484,0.0009159763,0.00032366128,0.0034160197,0.00021594667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006680904,0.0003351358,0.0005856046,0.0004403881,0.00027133824,0.00022823349,0.00039262383,0.00022509925,0.000070788854],"category_scores_gemma":[0.0011607631,0.00027823995,0.00025312242,0.0048888642,0.000117776945,0.0008023254,0.0000730017,0.00021841533,0.0000026910188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031172976,0.00058798457,0.00071059307,0.000053805074,0.00024814904,0.000006429822,0.000009018254,0.93860173,1.4943794e-7,0.0019425022,0.00231968,0.05520823],"study_design_scores_gemma":[0.0036033283,0.00072787836,0.00005607226,0.00016389074,0.0002768006,0.000100390615,0.00021004614,0.9907065,0.0000085554675,0.0019691295,0.0019193968,0.00025803217],"about_ca_topic_score_codex":0.0000056027206,"about_ca_topic_score_gemma":0.000012577354,"teacher_disagreement_score":0.054950196,"about_ca_system_score_codex":0.0012423228,"about_ca_system_score_gemma":0.000697659,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W4415890381","doi":"10.1007/jhep11(2025)003","title":"Skydiving to bootstrap islands","year":2025,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Stichting DOEN; European Commission; European Research Council; Government of Canada; Ministry of Colleges and Universities; Simonsen Foundation; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Resnick Sustainability Institute for Science, Energy and Sustainability, California Institute of Technology; California Institute of Technology; U.S. Department of Energy","keywords":"Parameter space; Space (punctuation); Point (geometry); Conformal map; Test (biology)","score_opus":0.033867182041813264,"score_gpt":0.35246263769214253,"score_spread":0.31859545565032926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415890381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030993058,0.000044234122,0.99227965,0.00051307696,0.00027619142,0.000032781576,0.0000026334087,0.000017851153,0.003734301],"genre_scores_gemma":[0.80585957,0.0000702831,0.1868343,0.00040057045,0.00046283432,0.0000039045776,0.0000011123913,0.000027256003,0.0063401405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989021,0.000045297056,0.00037504904,0.000099957404,0.0003825843,0.0001950028],"domain_scores_gemma":[0.99880385,0.00027657507,0.00019280895,0.00019788962,0.00043420636,0.00009467176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018284383,0.000108918786,0.00026748088,0.00017114454,0.000072149196,0.00004077938,0.00027091018,0.000044440498,0.00003800053],"category_scores_gemma":[0.00024161919,0.00009322405,0.00009874062,0.00051326526,0.000023066648,0.00018208915,0.00008427463,0.00019017942,0.0000034545965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004730674,0.00018899865,0.00005778299,0.000032002947,0.00013413935,0.000025733274,0.00015712797,0.027028171,0.00024767482,0.93374276,0.013175688,0.025162583],"study_design_scores_gemma":[0.00065790483,0.000113382855,0.00010959885,0.00013750621,0.000033393473,0.000011484507,0.00007668551,0.0019986413,0.009943914,0.97849,0.008292529,0.00013495846],"about_ca_topic_score_codex":0.000004500745,"about_ca_topic_score_gemma":0.000003120182,"teacher_disagreement_score":0.8054453,"about_ca_system_score_codex":0.00008963247,"about_ca_system_score_gemma":0.00012575761,"threshold_uncertainty_score":0.38015667},"labels":[],"label_agreement":null},{"id":"W4415897674","doi":"10.1016/j.ejco.2025.100122","title":"On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations","year":2025,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National d’Etudes Spatiales","keywords":"Normalization (sociology); Linear programming; Integer programming; Integer (computer science); Decomposition; Convergence (economics); Dual (grammatical number)","score_opus":0.03781785189837309,"score_gpt":0.361781206708843,"score_spread":0.3239633548104699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415897674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024877705,0.000032482596,0.9895934,0.004233747,0.00024761524,0.00032723165,0.00002316765,0.000044386063,0.0030102415],"genre_scores_gemma":[0.21954486,0.00016386296,0.77725893,0.0014356736,0.00013266488,0.000043450636,0.00017191147,0.000052057407,0.0011965624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980719,0.00032365866,0.0006172599,0.00021642238,0.00060841884,0.00016235084],"domain_scores_gemma":[0.995661,0.0027062234,0.00035554366,0.00016068437,0.0010400673,0.000076438846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052586553,0.00018027927,0.00019604788,0.00055293884,0.00071977125,0.0001234357,0.00017799709,0.00006580569,0.00022135682],"category_scores_gemma":[0.001378488,0.00014044077,0.00008048211,0.0008647134,0.0001299448,0.00028485764,0.000048203172,0.00038133835,0.000006401468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053601845,0.00017805025,0.00002562136,0.000008738247,0.00004355469,0.0000014232594,0.00008544865,0.76540667,0.000052329535,0.2313382,0.001597572,0.0012087936],"study_design_scores_gemma":[0.000518924,0.0001255613,0.00055134017,0.00013468903,0.000026880565,0.00004351931,0.00005117754,0.8527537,0.0002935547,0.1452646,0.00012909087,0.000106981024],"about_ca_topic_score_codex":0.0000014081339,"about_ca_topic_score_gemma":0.0000014237597,"teacher_disagreement_score":0.2170571,"about_ca_system_score_codex":0.00013595149,"about_ca_system_score_gemma":0.00016631592,"threshold_uncertainty_score":0.5727008},"labels":[],"label_agreement":null},{"id":"W4416125868","doi":"10.48550/arxiv.2504.04269","title":"Direct-search methods for decentralized blackbox optimization","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Convergence (economics); Optimization problem; Function (biology); Global optimization; Key (lock); Constrained optimization","score_opus":0.21489595613628715,"score_gpt":0.36642727105703776,"score_spread":0.15153131492075061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416125868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002706461,0.000105238854,0.9913983,0.00008839272,0.0003643387,0.001962296,0.00016061658,0.0003493893,0.005300802],"genre_scores_gemma":[0.004127887,0.0014098804,0.9702117,0.000036485242,0.00006493814,0.000021025477,0.00019221425,0.000072645445,0.023863247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996973,0.00068240176,0.00040062983,0.0011665286,0.0001450727,0.0006323763],"domain_scores_gemma":[0.9953868,0.0020460568,0.00025530416,0.0010964164,0.0009860692,0.00022939417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010459413,0.00041921844,0.0006809755,0.0005841036,0.00025995678,0.00009497118,0.0009556575,0.0005217746,0.00035827866],"category_scores_gemma":[0.0015547768,0.0004996505,0.00036286731,0.00095144863,0.0001669421,0.00018949946,0.0011251931,0.0006253077,0.000011264433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018326874,0.0001434749,0.000032782827,0.0004830681,0.0002106855,0.000011172473,0.00013539751,0.93336457,0.000010083938,0.06336504,0.00059501297,0.0014654369],"study_design_scores_gemma":[0.0012558707,0.000031149662,0.000002490117,0.00013405693,0.00019442309,6.0911196e-7,0.000114418974,0.93500894,0.0010081517,0.06022331,0.0016055573,0.00042104296],"about_ca_topic_score_codex":0.000022242111,"about_ca_topic_score_gemma":0.0000070887263,"teacher_disagreement_score":0.021186603,"about_ca_system_score_codex":0.0006253845,"about_ca_system_score_gemma":0.00054220424,"threshold_uncertainty_score":0.9997455},"labels":[],"label_agreement":null},{"id":"W4416452333","doi":"10.48550/arxiv.2505.16564","title":"Graph splitting methods: Fixed points and strong convergence for linear subspaces","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Social Fund; European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Fixed point; Graph; Monotone polygon; Linear operators; Linear map; Graph theory","score_opus":0.18977182423648217,"score_gpt":0.4788410518948429,"score_spread":0.28906922765836074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416452333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06429202,0.0005452322,0.931986,0.00059039466,0.00048694594,0.0014343695,0.00013062675,0.00019169747,0.00034274173],"genre_scores_gemma":[0.004153018,0.0005628759,0.99086154,0.000069014,0.0001552772,0.00029608826,0.00005797804,0.00006193302,0.003782253],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975321,0.0002856658,0.0005981416,0.00081402843,0.00027949427,0.00049053086],"domain_scores_gemma":[0.995654,0.0025711977,0.00037748637,0.0007315696,0.0005172179,0.00014855557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014071653,0.0003752162,0.0006305352,0.00026173322,0.00021779255,0.00005792423,0.00046355443,0.0003336751,0.000097971104],"category_scores_gemma":[0.00506837,0.0003788598,0.0001781741,0.00028056363,0.000158025,0.0001298122,0.0010667462,0.00072984485,0.000008139345],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012785925,0.0018718027,0.6206686,0.0532998,0.0060496237,0.00011434728,0.016581858,0.033896405,0.0040739607,0.1524409,0.009576575,0.10014754],"study_design_scores_gemma":[0.004153906,0.0002392886,0.0070515727,0.0029361215,0.0006876797,0.000012054168,0.003500869,0.5550149,0.040713258,0.37734562,0.0055352324,0.0028094822],"about_ca_topic_score_codex":0.000017873781,"about_ca_topic_score_gemma":0.00001608537,"teacher_disagreement_score":0.613617,"about_ca_system_score_codex":0.00008406705,"about_ca_system_score_gemma":0.00019836039,"threshold_uncertainty_score":0.9998663},"labels":[],"label_agreement":null},{"id":"W4416569324","doi":"10.1007/978-3-030-93954-0_81-1","title":"Computational Convex Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Subderivative; Proper convex function; Convex analysis; Convex optimization; Piecewise; Computation; Toolbox; Regular polygon; Effective domain","score_opus":0.05212188373798878,"score_gpt":0.37392107720342826,"score_spread":0.3217991934654395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416569324","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1815897e-8,0.000026506319,0.484178,0.00013376295,0.000023318731,0.00013083796,0.000043714732,0.00007798372,0.51538587],"genre_scores_gemma":[0.0000056472336,0.000026845028,0.3203114,0.000107065935,0.000022540278,0.000005668768,0.00021030792,0.000022559088,0.67928797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985652,0.000013912471,0.00038220602,0.00033359145,0.0005521041,0.00015298974],"domain_scores_gemma":[0.99814206,0.0007874908,0.00014073393,0.00035737627,0.0004983806,0.000073982585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012693352,0.00022047649,0.000515752,0.00075609254,0.0000687494,0.000035508692,0.00020892211,0.00022079065,0.016711978],"category_scores_gemma":[0.00011159414,0.00021121168,0.00027346716,0.000195865,0.00007988204,0.000042311665,0.00013057538,0.0002941862,0.0002143612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034268442,0.000011621584,0.0000018484676,0.00003803257,0.0011945231,0.000006931504,0.000010539129,0.013019994,1.899789e-8,0.95664287,0.026525162,0.0025450317],"study_design_scores_gemma":[0.00016528867,0.000007649223,0.0000010453832,0.0000245787,0.0004567105,0.0000013573507,0.00000469616,0.17224331,0.0000014180846,0.76809925,0.05878312,0.00021155436],"about_ca_topic_score_codex":0.0000018299883,"about_ca_topic_score_gemma":0.0000095350915,"teacher_disagreement_score":0.1885436,"about_ca_system_score_codex":0.00010784976,"about_ca_system_score_gemma":0.00015975378,"threshold_uncertainty_score":0.9841869},"labels":[],"label_agreement":null},{"id":"W4417520195","doi":"10.1007/s10898-025-01579-1","title":"A kinematic smoothing method for tightening convex relaxations of ordinary differential equations","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Ode; Ordinary differential equation; Regular polygon; Smoothing; Kinematics; Parametric statistics; Relaxation (psychology); Numerical analysis","score_opus":0.03904311108766726,"score_gpt":0.4234424510741223,"score_spread":0.38439933998645504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417520195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023958574,0.000120724326,0.99726963,0.0007502685,0.00030362923,0.000493572,0.000026456899,0.000025833808,0.00077028124],"genre_scores_gemma":[0.017983839,0.000032319113,0.9815075,0.00003755599,0.00006546383,0.00001886013,0.000015613847,0.00001740328,0.00032144855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979092,0.00018718098,0.0011395855,0.00014281571,0.00042912897,0.00019207678],"domain_scores_gemma":[0.99532396,0.0014586092,0.0011903933,0.0001939229,0.001760375,0.00007274378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070612336,0.0001462628,0.00046615113,0.00028422903,0.00016503475,0.000049904207,0.00024918604,0.00011626999,0.00010241043],"category_scores_gemma":[0.005924536,0.00013216792,0.00020261719,0.0009040091,0.000049636135,0.00040125253,0.00006358551,0.00016776769,5.316163e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011768562,0.00019798089,0.00006296832,0.00021027478,0.00017753484,0.0000015553175,0.00013515881,0.89669484,0.00018779666,0.09848144,0.00077509216,0.002957704],"study_design_scores_gemma":[0.001466015,0.00012940406,0.00004309366,0.00027430826,0.0002238988,0.000014316072,0.0001848327,0.9496252,0.00019411831,0.047657233,0.00008830374,0.000099308876],"about_ca_topic_score_codex":0.0000035574005,"about_ca_topic_score_gemma":0.0000022714848,"teacher_disagreement_score":0.05293036,"about_ca_system_score_codex":0.0002692475,"about_ca_system_score_gemma":0.0002760101,"threshold_uncertainty_score":0.70926505},"labels":[],"label_agreement":null},{"id":"W51219890","doi":"","title":"EXACT REGULARIZATION OF LINEAR PROGRAMS","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Mathematics; Backus–Gilbert method; Regularization perspectives on support vector machines; Proximal gradient methods for learning; Solution set; Applied mathematics; Regular polygon; Mathematical optimization; Mathematical analysis; Set (abstract data type); Tikhonov regularization; Computer science; Inverse problem; Geometry; Artificial intelligence","score_opus":0.060784660766952055,"score_gpt":0.37682716498208285,"score_spread":0.3160425042151308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51219890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024805332,0.000013341112,0.9794708,0.00034085914,0.000014590426,0.00030521926,0.0000010275586,0.00012587171,0.017247742],"genre_scores_gemma":[0.026978647,0.000013797803,0.952845,0.000020088637,0.000065789034,0.000012184944,0.000012110846,0.000019927673,0.020032475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.000025343756,0.0002149298,0.000105713625,0.00025840622,0.00012736935],"domain_scores_gemma":[0.9994071,0.000064566615,0.000068499656,0.00021512763,0.00020190512,0.00004278138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016241462,0.000059361282,0.00010369469,0.000063527965,0.000030632993,0.000007442332,0.000093858645,0.00004503793,0.0005211073],"category_scores_gemma":[0.0002657459,0.00005021308,0.000029938348,0.00024999134,0.000038345494,0.00014006435,0.000033904813,0.00005911526,0.00003278499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052580202,0.0013214016,0.0006584669,0.00023431318,0.000071867784,0.00000259035,0.0009836706,0.016143778,0.0021526315,0.43822813,0.0022536595,0.53789693],"study_design_scores_gemma":[0.0013286127,0.0001922731,0.00007421545,0.000057282854,0.000019324703,0.000008638152,0.0002442146,0.83896023,0.07134363,0.06763413,0.019824006,0.00031341737],"about_ca_topic_score_codex":0.0000014590382,"about_ca_topic_score_gemma":0.000004450142,"teacher_disagreement_score":0.8228165,"about_ca_system_score_codex":0.000026189156,"about_ca_system_score_gemma":0.000023509045,"threshold_uncertainty_score":0.57057595},"labels":[],"label_agreement":null},{"id":"W586051108","doi":"10.1090/fic/055","title":"Lectures on Global Optimization","year":2009,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Field (mathematics); Management science; Graduate students; Global optimization; Optimization problem; Science and engineering; Engineering optimization; Engineering ethics; Engineering; Mathematics; Algorithm; Sociology","score_opus":0.0283330245687139,"score_gpt":0.34349124565755984,"score_spread":0.31515822108884595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W586051108","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019086667,0.000020114105,0.42642507,0.00022625913,0.000028947657,0.000710809,0.000037366823,0.00038331802,0.5721662],"genre_scores_gemma":[0.000015490237,0.000040408508,0.55563855,0.0015052236,0.00030302422,0.00006789848,0.00006227305,0.00015732949,0.4422098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582046,0.00012787967,0.00084631034,0.0008507176,0.0015403067,0.0008143078],"domain_scores_gemma":[0.99639165,0.0012100472,0.00069735246,0.0010290482,0.00029947725,0.0003723976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037011458,0.0008166535,0.0012870949,0.00007064573,0.00026809177,0.00013912003,0.00067605986,0.00048906857,0.0006462611],"category_scores_gemma":[0.000719101,0.00072336255,0.0008067625,0.0002098945,0.0009836738,0.000054005268,0.00017796783,0.0010086133,0.00024318958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006152293,0.0003879022,4.276858e-7,0.0004888342,0.0005195051,0.000028632468,0.00067367544,0.012678158,0.00000176451,0.5830096,0.3533073,0.048842635],"study_design_scores_gemma":[0.0004719174,0.00045425943,5.6762246e-7,0.00035878035,0.0001548023,0.00002359972,0.0001051508,0.04020488,0.000017466158,0.9395829,0.017760813,0.00086489157],"about_ca_topic_score_codex":0.0000020354787,"about_ca_topic_score_gemma":0.0000012505385,"teacher_disagreement_score":0.35657325,"about_ca_system_score_codex":0.0012975705,"about_ca_system_score_gemma":0.0005147517,"threshold_uncertainty_score":0.99952173},"labels":[],"label_agreement":null},{"id":"W61549919","doi":"10.1023/a:1011220302800","title":"On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Extrapolation; Convergence (economics); Rate of convergence; Context (archaeology); Asymptotically optimal algorithm; Applied mathematics; Mathematical optimization; Nonlinear system; Penalty method; Newton's method; Interior point method; Algorithm; Mathematical analysis; Computer science; Key (lock)","score_opus":0.029885781864656596,"score_gpt":0.3180605713322898,"score_spread":0.2881747894676332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61549919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004492096,0.000030606563,0.99533546,0.0022436043,0.00003552957,0.00079076405,0.000040144965,0.000040373634,0.0010343],"genre_scores_gemma":[0.051789153,0.00020447915,0.94337183,0.0012357659,0.00011370196,0.00050675287,0.00009212105,0.00005175623,0.002634411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.000089657995,0.00030767207,0.00021882971,0.00037727845,0.00013579203],"domain_scores_gemma":[0.998102,0.0007885687,0.00014133434,0.0003037801,0.0006043305,0.000059995808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019610183,0.00012080626,0.00012062537,0.00006800245,0.0004230406,0.000034628956,0.0002660573,0.00005321073,0.0005737224],"category_scores_gemma":[0.00030967916,0.00007847996,0.000045086395,0.0008130074,0.0002747745,0.000084957974,0.00008394657,0.0001537165,0.0000142226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034656096,0.000069704605,0.00006159457,0.0000056871477,0.000013320028,1.3181557e-7,0.000058151825,0.76864076,0.0000049982987,0.22849533,0.00042258287,0.0022242488],"study_design_scores_gemma":[0.00025589092,0.000013312409,0.00011150666,0.000010732436,0.000010366692,0.000009338147,0.00008066492,0.91457015,0.000045189674,0.08263823,0.002168614,0.00008598459],"about_ca_topic_score_codex":0.0000023069051,"about_ca_topic_score_gemma":0.0000010279359,"teacher_disagreement_score":0.1459294,"about_ca_system_score_codex":0.000028866043,"about_ca_system_score_gemma":0.00009458441,"threshold_uncertainty_score":0.6281858},"labels":[],"label_agreement":null},{"id":"W637201025","doi":"","title":"Comments on two direct methods in linear programming.","year":2004,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Linear programming; Mathematics; Algorithm","score_opus":0.08404061104516997,"score_gpt":0.40932384978153796,"score_spread":0.325283238736368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W637201025","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9032875,0.00010090226,0.08077063,0.0022178253,0.00030147098,0.0017056674,0.00005901279,0.00035665018,0.011200397],"genre_scores_gemma":[0.14846072,0.000028371393,0.84829307,0.00010364154,0.000036773938,0.0000025431516,0.000024825395,0.00005805397,0.0029919993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974929,0.00048424097,0.00029668104,0.0005123913,0.0006679478,0.0005458311],"domain_scores_gemma":[0.9981718,0.0005249624,0.00023630405,0.0006246872,0.00021274395,0.00022952583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015827982,0.00025766648,0.0004761954,0.00057762244,0.0003127758,0.000024095863,0.0006797193,0.0001959111,0.00030239727],"category_scores_gemma":[0.0008773188,0.00031031983,0.00017091376,0.0010492628,0.00022453882,0.00052869227,0.0003669493,0.00073549093,0.000115370596],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010151232,0.024160752,0.2577889,0.002468247,0.0022464048,0.0029454124,0.054060053,0.13103488,0.03489121,0.072237305,0.001758462,0.40625715],"study_design_scores_gemma":[0.14722238,0.007160851,0.19260605,0.0057424754,0.0009382018,0.00021245085,0.022695448,0.01703698,0.1648548,0.33610934,0.09524283,0.010178201],"about_ca_topic_score_codex":0.00008306879,"about_ca_topic_score_gemma":0.000216575,"teacher_disagreement_score":0.76752245,"about_ca_system_score_codex":0.00056221936,"about_ca_system_score_gemma":0.00011032163,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W644136860","doi":"10.1017/cbo9781107282094","title":"A Gentle Introduction to Optimization","year":2014,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reading (process); Section (typography); Focus (optics); Point (geometry); Selection (genetic algorithm); Computer science; Mathematics education; Range (aeronautics); Management science; Engineering; Mathematics; Artificial intelligence; Linguistics","score_opus":0.031259141744188625,"score_gpt":0.2665371823380287,"score_spread":0.23527804059384008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644136860","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001145206,0.000006860983,0.4763946,0.00006814807,0.00018773915,0.00057410664,0.00005726598,0.0001711493,0.522539],"genre_scores_gemma":[9.130933e-7,0.000021190459,0.101785176,0.000052892898,0.0009677877,0.0000041035782,0.00017327732,0.00009444915,0.89690024],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807054,0.00013306533,0.00025281424,0.0006707662,0.0005096142,0.0003631938],"domain_scores_gemma":[0.99796623,0.00014820289,0.00023431481,0.000825321,0.0005539985,0.00027195615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021409975,0.00034043053,0.00043216563,0.0004225137,0.00020657585,0.000057715086,0.00051567395,0.0003454978,0.0000304766],"category_scores_gemma":[0.00023443931,0.0004249708,0.00013323837,0.000051626994,0.0001052635,0.000115001,0.00042850012,0.0004586212,0.00005143406],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000621785,0.000018573499,6.2646016e-8,0.00013288428,0.000062725296,0.000019536094,0.000038775856,0.019397512,0.0000071374598,0.29578078,0.6837234,0.0007564553],"study_design_scores_gemma":[0.00045953118,0.00006321699,1.7228245e-7,0.0000660071,0.00010010159,0.00000943276,0.00001783302,0.018337833,0.00015232257,0.000051720217,0.9803286,0.00041320917],"about_ca_topic_score_codex":0.0000075888543,"about_ca_topic_score_gemma":8.865927e-7,"teacher_disagreement_score":0.3746094,"about_ca_system_score_codex":0.0008574931,"about_ca_system_score_gemma":0.00022373191,"threshold_uncertainty_score":0.99982023},"labels":[],"label_agreement":null},{"id":"W658468290","doi":"","title":"Numerical Stability in Linear Programming and Semidefinite Programming","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Semidefinite programming; Interior point method; Mathematical optimization; Numerical analysis; Mathematics; Rate of convergence; Linear programming; Numerical stability; Convergence (economics); Active set method; Computer science; Algorithm; Applied mathematics; Nonlinear programming; Nonlinear system","score_opus":0.027185293245432215,"score_gpt":0.28275847432759366,"score_spread":0.2555731810821614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W658468290","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99568456,0.00012902863,0.002338449,0.00018224337,0.00009103043,0.0011372067,0.000022389626,0.00014084633,0.00027425206],"genre_scores_gemma":[0.022385776,0.00013020092,0.82396007,0.000004049697,0.00004837888,0.000007759024,0.00084354926,0.00011503372,0.15250516],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99827814,0.0001181342,0.00025880916,0.0004903681,0.00043864563,0.00041587435],"domain_scores_gemma":[0.9988214,0.0001995472,0.0002835214,0.0003049761,0.0002805609,0.00010999063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034454136,0.0002637258,0.0005420365,0.0003525192,0.00013807043,0.00002720819,0.0002369439,0.00032666212,0.00007182191],"category_scores_gemma":[0.00015654291,0.0003139431,0.000100752695,0.000494968,0.00013679954,0.00022842403,0.000080246195,0.00051276933,0.0000061999513],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022693658,0.004296561,0.041778572,0.01894263,0.00054164283,0.0008176796,0.5224734,0.0031238121,0.0014028569,0.003160656,0.000995276,0.40019757],"study_design_scores_gemma":[0.011005457,0.0014599512,0.017608896,0.0037764993,0.0006831814,0.00003480604,0.85145587,0.08160703,0.0050679087,0.014114655,0.008351534,0.004834215],"about_ca_topic_score_codex":0.010400139,"about_ca_topic_score_gemma":0.0235092,"teacher_disagreement_score":0.9732988,"about_ca_system_score_codex":0.00015166597,"about_ca_system_score_gemma":0.00009812168,"threshold_uncertainty_score":0.9999313},"labels":[],"label_agreement":null},{"id":"W66820110","doi":"10.1023/a:1013040428127","title":"Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Lambda; Linear complementarity problem; Eigenvalues and eigenvectors; Matrix (chemical analysis); Upper and lower bounds; Positive-definite matrix; Interior point method; Mathematical analysis; Physics; Algorithm","score_opus":0.11355539285635675,"score_gpt":0.4153717938177717,"score_spread":0.30181640096141493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66820110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075891105,0.00019927553,0.99782395,0.0007765614,0.000024951702,0.00082315283,0.00003612158,0.000011911293,0.00022819598],"genre_scores_gemma":[0.007876814,0.00015180623,0.99150896,0.00006767417,0.00007788004,0.00010086144,0.000006339686,0.00001823247,0.0001914123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.00019454848,0.0005967991,0.00010943496,0.00021052273,0.00012253401],"domain_scores_gemma":[0.9968099,0.0018941283,0.00057967583,0.00019090733,0.00046439958,0.000060982853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742685,0.000097012206,0.0002453801,0.000085234125,0.00029820192,0.000027553013,0.00022687319,0.00003793403,0.00023966155],"category_scores_gemma":[0.00034067628,0.00006956851,0.00012969786,0.00024106709,0.00015108717,0.00015870524,0.000049169383,0.00014510311,5.7595486e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001425547,0.0005086672,0.0000631668,0.00015500169,0.00029486234,6.744435e-7,0.0012509481,0.29840183,0.0002560569,0.6810163,0.0004945713,0.017415343],"study_design_scores_gemma":[0.0010995329,0.00012201799,0.000010717293,0.00004839497,0.000159849,0.000030060395,0.00082587916,0.79945606,0.00045075145,0.19484021,0.0028504473,0.000106077794],"about_ca_topic_score_codex":0.0000010765643,"about_ca_topic_score_gemma":8.155482e-7,"teacher_disagreement_score":0.5010542,"about_ca_system_score_codex":0.00002914388,"about_ca_system_score_gemma":0.000021787622,"threshold_uncertainty_score":0.28369215},"labels":[],"label_agreement":null},{"id":"W68594018","doi":"10.1007/s101070050009","title":"The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated function; Mathematics; Smoothing; Path (computing); Mathematical optimization; Complementarity (molecular biology); Algorithm; Linear complementarity problem; Convergence (economics); Mixed complementarity problem; Nonlinear system; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.044286893431667286,"score_gpt":0.3637298191637047,"score_spread":0.3194429257320374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68594018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018774202,0.000016327493,0.977729,0.00012256406,0.00005263397,0.0024460205,0.000059461705,0.00014381717,0.0006559229],"genre_scores_gemma":[0.016566744,0.0000060137795,0.9821502,0.000016275593,0.000050223745,0.0005728299,0.000039947117,0.000048703845,0.00054904347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976555,0.000060383783,0.000706352,0.0003377683,0.0006139495,0.0006260522],"domain_scores_gemma":[0.9982875,0.0005222515,0.00018157321,0.0005196607,0.00028840016,0.00020060969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089098036,0.00025285114,0.00040775092,0.000037836806,0.0005462279,0.00011866722,0.00041205512,0.000078027304,0.00026974414],"category_scores_gemma":[0.00024222332,0.00017002971,0.0001582459,0.00048076455,0.00027502072,0.00031839666,0.00008071088,0.00019509769,0.000022530066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016363036,0.001430596,0.0005161797,0.00089234795,0.00037332927,0.000013042889,0.0012021102,0.00071267376,0.00003117745,0.024996143,0.000072723626,0.969596],"study_design_scores_gemma":[0.0020837751,0.0011647521,0.000023515495,0.00035371818,0.0001415431,0.000040086245,0.0018465262,0.8853069,0.00038188716,0.103392035,0.004845159,0.0004201388],"about_ca_topic_score_codex":0.000026678206,"about_ca_topic_score_gemma":0.00006547565,"teacher_disagreement_score":0.96917593,"about_ca_system_score_codex":0.00014493192,"about_ca_system_score_gemma":0.00010293963,"threshold_uncertainty_score":0.69336104},"labels":[],"label_agreement":null},{"id":"W6912203017","doi":"10.5281/zenodo.15306818","title":"Appendix to New Exact Methods for Solving Quadratic Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Travelling salesman problem; Quadratic equation; 2-opt; Traveling purchaser problem; Exact solutions in general relativity; Bottleneck traveling salesman problem","score_opus":0.08026362994544722,"score_gpt":0.391977227434625,"score_spread":0.31171359748917776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912203017","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018812603,0.000057514488,0.9646257,0.0014816123,0.00009131005,0.0019113353,0.000048871447,0.0008440972,0.030751444],"genre_scores_gemma":[0.0020835632,0.000037643393,0.9801668,0.0002508336,0.00015430033,9.0290786e-7,0.0005382362,0.0016434771,0.015124231],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973991,0.00040647935,0.00053940114,0.00062990305,0.00036878063,0.0006563219],"domain_scores_gemma":[0.9976256,0.00041731962,0.00013675449,0.00063663424,0.0008499405,0.00033377905],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002021744,0.00023493616,0.00031919722,0.00050361955,0.002002795,0.00079861464,0.0011912574,0.000100775374,0.0046329685],"category_scores_gemma":[0.005794894,0.00025296968,0.00009766573,0.0012666433,0.00008009376,0.00029481493,0.00101159,0.0003393449,0.0017851541],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014735106,0.00019997066,7.5986503e-7,0.0005252263,0.00013117996,0.0000040402806,0.0028842364,0.0023219993,0.009939616,0.080404,0.22066343,0.6827782],"study_design_scores_gemma":[0.00096719345,0.00023668795,0.000008393621,0.00018662316,0.000039528204,0.000022937214,0.00061471487,0.022082811,0.003931604,0.047200467,0.92436427,0.00034474224],"about_ca_topic_score_codex":0.000009750241,"about_ca_topic_score_gemma":9.409873e-7,"teacher_disagreement_score":0.7037009,"about_ca_system_score_codex":0.00032298316,"about_ca_system_score_gemma":0.000030306881,"threshold_uncertainty_score":0.99999225},"labels":[],"label_agreement":null},{"id":"W6924862492","doi":"10.15468/dl.gztwcy","title":"Occurrence Download","year":2025,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Matching (statistics); Range (aeronautics); Set (abstract data type); Identification (biology); Download","score_opus":0.02981882541928356,"score_gpt":0.3034579170162835,"score_spread":0.27363909159699995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924862492","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074753907,0.000013640841,0.000899638,0.00016929743,0.0004038147,0.00060055376,0.99737453,0.00015967837,0.00037136773],"genre_scores_gemma":[1.6456833e-7,0.00011550633,0.00019368729,0.00027398803,0.000001401417,0.00001031511,0.9994028,1.4049437e-8,0.0000021150008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978248,0.00010956439,0.0005675085,0.00028860458,0.0008141331,0.00039539783],"domain_scores_gemma":[0.9977563,0.00013360742,0.00035532893,0.0008475093,0.00073173846,0.0001755105],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036170334,0.00034333338,0.00040118303,0.00020320844,0.00033719713,0.00015954365,0.0008045763,0.00044962484,0.0022584435],"category_scores_gemma":[0.0016743486,0.00035975114,0.00016727627,0.000714127,0.00019551859,0.000951716,0.000682785,0.00049241335,0.023069106],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039473623,0.00005782013,0.00006934363,0.00048099385,0.000033618864,0.000002209207,0.000020944863,0.00004829584,4.2076964e-9,0.0000019918086,0.9978265,0.0014187666],"study_design_scores_gemma":[0.0004395123,0.000020861553,0.0000029060857,0.00000766295,0.000049595164,0.0000024684764,0.000090111214,0.0000026916484,0.0000021212284,0.0000457667,0.99903864,0.0002976464],"about_ca_topic_score_codex":0.00007452461,"about_ca_topic_score_gemma":0.00001080159,"teacher_disagreement_score":0.020810664,"about_ca_system_score_codex":0.0006189113,"about_ca_system_score_gemma":0.00037612845,"threshold_uncertainty_score":0.99988544},"labels":[],"label_agreement":null},{"id":"W6930331234","doi":"10.5281/zenodo.1346276","title":"EcologicalNetworks.jl - analysing ecological networks of species interactions","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Ecological network; Measure (data warehouse); Ecological systems theory; Nestedness; Natural (archaeology); R package","score_opus":0.07219712731602704,"score_gpt":0.31383071108100447,"score_spread":0.24163358376497743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930331234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08211353,0.00008892959,0.6033014,0.0010328195,0.00042268634,0.0018135706,0.00012666511,0.0015515054,0.30954885],"genre_scores_gemma":[0.97336835,0.000115976785,0.018459529,0.000078524004,0.00020010449,1.3256411e-7,0.0005924588,0.0008663188,0.006318609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.997849,0.00046216763,0.00045106327,0.00040054467,0.0004085178,0.0004286908],"domain_scores_gemma":[0.9979957,0.00033179088,0.00023510684,0.00050533056,0.0007849723,0.00014714406],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00082522695,0.00015555005,0.00030494493,0.00027615184,0.0009108349,0.00027613284,0.00080874196,0.000098927434,0.050589625],"category_scores_gemma":[0.0016396837,0.00014509313,0.00010736658,0.0009665933,0.00020987543,0.00027721075,0.0010698886,0.0004748233,0.0016406248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065355253,0.0036155926,0.00045566264,0.0004656122,0.0008395607,0.00007650923,0.0019820647,0.3128612,0.008593176,0.22376601,0.29948878,0.14720227],"study_design_scores_gemma":[0.0011397884,0.00061886455,0.0036308726,0.000079674785,0.00005261645,0.00009808881,0.0010177998,0.19978927,0.00029321344,0.0061893333,0.78663564,0.0004548341],"about_ca_topic_score_codex":0.0000015265837,"about_ca_topic_score_gemma":6.206248e-7,"teacher_disagreement_score":0.89125484,"about_ca_system_score_codex":0.00020187633,"about_ca_system_score_gemma":0.0000040234722,"threshold_uncertainty_score":0.9991367},"labels":[],"label_agreement":null},{"id":"W6931810382","doi":"10.5443/1643","title":"Ground penetrating radar data for ice patches in the Mackenzie Mountains, Northwest Territories, 2007-2008","year":2012,"lang":"en","type":"dataset","venue":"Canadian Polar Data Network","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Transect; Radar; Ground-penetrating radar; Elevation (ballistics); Global Positioning System; Sea ice","score_opus":0.10485945843008901,"score_gpt":0.3540612270909554,"score_spread":0.24920176866086638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931810382","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023584482,0.004671637,0.0013619576,0.00038815755,0.0011660835,0.0018144725,0.99053776,0.000029352079,0.00002823747],"genre_scores_gemma":[0.0000048884526,0.0009806062,0.044620983,0.00084144203,0.007265728,0.000110144436,0.94595945,0.00012984076,0.00008691287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947832,0.00044962988,0.00089776184,0.0011821461,0.00077873387,0.0019085096],"domain_scores_gemma":[0.98787713,0.0019728313,0.00043539624,0.008872666,0.00016639092,0.00067557],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033919697,0.0006379461,0.0006653253,0.00027802994,0.0007824929,0.0005263947,0.009079799,0.0005788021,0.00034059794],"category_scores_gemma":[0.0022145822,0.00058404467,0.00005585715,0.00079816073,0.00020297016,0.0012448983,0.0012855568,0.001458806,0.000049460916],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012334742,0.000047149955,0.00035609302,0.00028318338,0.00008505832,0.00006979123,0.00005509429,0.000028183864,2.3916096e-8,0.0001585847,0.99820805,0.0006964345],"study_design_scores_gemma":[0.00037223528,0.000024143355,0.00018190268,0.00018796691,0.00014623384,0.000041518313,0.00026012244,0.001078743,2.508335e-8,0.00072936853,0.9963594,0.0006183207],"about_ca_topic_score_codex":0.6119003,"about_ca_topic_score_gemma":0.9879541,"teacher_disagreement_score":0.37605378,"about_ca_system_score_codex":0.00068611675,"about_ca_system_score_gemma":0.002620543,"threshold_uncertainty_score":0.9996611},"labels":[],"label_agreement":null},{"id":"W6939122458","doi":"10.60692/wxqmq-y5136","title":"Mapping Annual Global Forest Gain From 1983 to 2021 With Landsat Imagery","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Forest cover; Land cover; Sample (material); Global warming; Forest inventory; Satellite imagery; Climate change; Global climate","score_opus":0.047100458528740265,"score_gpt":0.28180077736777676,"score_spread":0.2347003188390365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939122458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21579094,9.615767e-7,0.7779169,0.00017412331,0.00018796942,0.00072882214,0.0012654264,0.0005576459,0.0033772094],"genre_scores_gemma":[0.94427955,2.2578823e-7,0.054100383,0.00012922577,0.00019415157,0.00018104263,0.00023000789,0.00003171104,0.0008537135],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99809855,0.00006759619,0.00055897114,0.00020626427,0.0006485864,0.0004200371],"domain_scores_gemma":[0.9987192,0.000049150374,0.00020025639,0.0004507618,0.00039016394,0.0001904719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037973098,0.00020834111,0.00028317113,0.0003368316,0.00015677318,0.0002146208,0.00023015215,0.00009109602,0.000059728278],"category_scores_gemma":[0.00015137083,0.00016608782,0.00005107882,0.0012573274,0.000025177,0.0008528289,0.00016326334,0.00010504983,0.003396855],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061653764,0.000017917326,0.53867483,0.0016551302,0.00046983967,0.00021084379,0.3339126,0.09297656,0.000003045441,0.0028960793,0.021365304,0.0072013163],"study_design_scores_gemma":[0.008631338,0.00031612138,0.14121425,0.0021948454,0.00008201415,0.00017218097,0.47454825,0.36350262,0.00028692145,0.00063906773,0.006111409,0.0023009903],"about_ca_topic_score_codex":0.000016365395,"about_ca_topic_score_gemma":0.0000023862249,"teacher_disagreement_score":0.7284886,"about_ca_system_score_codex":0.000237033,"about_ca_system_score_gemma":0.00006196753,"threshold_uncertainty_score":0.9973791},"labels":[],"label_agreement":null},{"id":"W6939260097","doi":"10.60692/m9028-5sc24","title":"Global optimization workshop 2012","year":2014,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Global optimization; Global challenges; Eleventh; Series (stratigraphy); Global strategy; Multi-objective optimization","score_opus":0.055035258148786674,"score_gpt":0.29421297756954734,"score_spread":0.23917771942076066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939260097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019066642,0.0000014055221,0.97597945,0.00007428374,0.00028946612,0.00041947435,0.000039359045,0.00050225673,0.02078764],"genre_scores_gemma":[0.7648524,2.1115169e-7,0.23371333,0.00012269158,0.00015761523,0.00008681349,0.000040752664,0.000023282997,0.0010028852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981707,0.00012629096,0.00065444614,0.00016388202,0.0005471867,0.00033750842],"domain_scores_gemma":[0.9985573,0.000037562335,0.00032825046,0.00049841555,0.00042811668,0.0001503012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056861335,0.00019563222,0.00024453382,0.00019128408,0.00017531437,0.0002111989,0.00024284562,0.00014823493,0.00016388902],"category_scores_gemma":[0.00033524298,0.00017198056,0.000067031004,0.00056163006,0.000035653517,0.0014881154,0.00009085829,0.00009333196,0.00069211173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011426515,0.000011500071,0.012942424,0.00080832496,0.00008934029,0.0000020668788,0.017772209,0.9131672,8.4044984e-8,0.045242686,0.0043260194,0.0055239303],"study_design_scores_gemma":[0.0013437726,0.00002845511,0.00075558014,0.0001220911,0.000022704719,0.00003866911,0.003935888,0.9919179,0.00001797778,0.0001615899,0.0013217087,0.0003336376],"about_ca_topic_score_codex":8.699173e-7,"about_ca_topic_score_gemma":1.7247145e-7,"teacher_disagreement_score":0.7629458,"about_ca_system_score_codex":0.0002508394,"about_ca_system_score_gemma":0.00003133183,"threshold_uncertainty_score":0.8895927},"labels":[],"label_agreement":null},{"id":"W6949538012","doi":"10.5281/zenodo.15306819","title":"Appendix to New Exact Methods for Solving Quadratic Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Travelling salesman problem; Quadratic equation; 2-opt; Traveling purchaser problem; Exact solutions in general relativity; Bottleneck traveling salesman problem","score_opus":0.08026362994544722,"score_gpt":0.391977227434625,"score_spread":0.31171359748917776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949538012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018812603,0.000057514488,0.9646257,0.0014816123,0.00009131005,0.0019113353,0.000048871447,0.0008440972,0.030751444],"genre_scores_gemma":[0.0020835632,0.000037643393,0.9801668,0.0002508336,0.00015430033,9.0290786e-7,0.0005382362,0.0016434771,0.015124231],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973991,0.00040647935,0.00053940114,0.00062990305,0.00036878063,0.0006563219],"domain_scores_gemma":[0.9976256,0.00041731962,0.00013675449,0.00063663424,0.0008499405,0.00033377905],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002021744,0.00023493616,0.00031919722,0.00050361955,0.002002795,0.00079861464,0.0011912574,0.000100775374,0.0046329685],"category_scores_gemma":[0.005794894,0.00025296968,0.00009766573,0.0012666433,0.00008009376,0.00029481493,0.00101159,0.0003393449,0.0017851541],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014735106,0.00019997066,7.5986503e-7,0.0005252263,0.00013117996,0.0000040402806,0.0028842364,0.0023219993,0.009939616,0.080404,0.22066343,0.6827782],"study_design_scores_gemma":[0.00096719345,0.00023668795,0.000008393621,0.00018662316,0.000039528204,0.000022937214,0.00061471487,0.022082811,0.003931604,0.047200467,0.92436427,0.00034474224],"about_ca_topic_score_codex":0.000009750241,"about_ca_topic_score_gemma":9.409873e-7,"teacher_disagreement_score":0.7037009,"about_ca_system_score_codex":0.00032298316,"about_ca_system_score_gemma":0.000030306881,"threshold_uncertainty_score":0.99999225},"labels":[],"label_agreement":null},{"id":"W6981341250","doi":"","title":"ECOHYDROLOGICAL MODELING OF BEAVER DAMS","year":2023,"lang":"en","type":"dissertation","venue":"University Library (University of Saskatchewan)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Beaver; Hydrology (agriculture); Biota; Riparian zone; Ecohydrology; Streamflow; Flood myth; Floodplain; Range (aeronautics)","score_opus":0.0301410290553754,"score_gpt":0.25689079078020904,"score_spread":0.22674976172483363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981341250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455961,0.00007487168,0.030061783,0.0003221792,0.00039857306,0.0009518922,0.0007109881,0.0008344742,0.021049146],"genre_scores_gemma":[0.42949063,0.0007778919,0.15498759,0.000014403179,0.000074920375,1.5231474e-7,0.00267773,0.00017137325,0.4118053],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99820733,0.00013057046,0.00025795115,0.00050507893,0.00055952853,0.00033955468],"domain_scores_gemma":[0.9983665,0.000302751,0.00044176372,0.0004910919,0.00022407892,0.00017385406],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012538563,0.000294884,0.00071563886,0.0008102988,0.0002198582,0.000010417701,0.0010247469,0.0005994453,0.0012091539],"category_scores_gemma":[0.000051380008,0.00040133958,0.00035585233,0.0009880349,0.00019117074,0.0009616211,0.00039700675,0.0005335487,0.00005453974],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017389713,0.0053943,0.0064920215,0.017799623,0.007334163,0.0055742864,0.5727703,0.27567592,0.0018298746,0.031173123,0.036013503,0.02255317],"study_design_scores_gemma":[0.0031956977,0.00035361637,0.00039416677,0.0007684743,0.000586164,0.0000045024053,0.7320834,0.22060679,0.00063878926,0.038337007,0.0017049377,0.0013264795],"about_ca_topic_score_codex":0.00035669017,"about_ca_topic_score_gemma":0.00048580367,"teacher_disagreement_score":0.5161055,"about_ca_system_score_codex":0.00008273365,"about_ca_system_score_gemma":0.00047179163,"threshold_uncertainty_score":0.99984384},"labels":[],"label_agreement":null},{"id":"W6992571350","doi":"","title":"Linear programming : pivoting on polyhedra and arrangements","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Linear programming; Simplex algorithm; Polyhedron; Simplex; Disjoint sets; Path (computing); Integer programming; Monotone polygon","score_opus":0.04244236594538283,"score_gpt":0.3396750347738066,"score_spread":0.2972326688284238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992571350","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78865623,0.00066101283,0.000054532324,0.00010447588,0.0017044037,0.005640759,0.0010147901,0.0017686997,0.2003951],"genre_scores_gemma":[0.3596223,0.0012744296,0.5356831,0.00054814044,0.00073842914,0.0011692169,0.0024051166,0.0018883038,0.096671],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99475807,0.0002982344,0.0010723493,0.0013002384,0.0014968406,0.0010742771],"domain_scores_gemma":[0.9968121,0.0006175277,0.00073765,0.0008058904,0.0005663372,0.00046046],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010245566,0.00090109976,0.00084795983,0.0006815477,0.0013077769,0.00015625634,0.00058227294,0.00073967315,0.00032160385],"category_scores_gemma":[0.0029587203,0.0009586142,0.00023463018,0.0006897203,0.000073306,0.0006911174,0.00018867162,0.0021127071,0.00022584629],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028167223,0.0006100005,0.000017500222,0.001088148,0.00031496736,0.000081903425,0.0000440058,0.00022771402,0.0021761854,0.07648924,0.000009538449,0.91865915],"study_design_scores_gemma":[0.018344535,0.003155297,0.0009039119,0.012394627,0.0018633186,0.000230606,0.0076250886,0.010249291,0.1694749,0.23903187,0.5221489,0.014577674],"about_ca_topic_score_codex":0.000025355519,"about_ca_topic_score_gemma":0.00031853095,"teacher_disagreement_score":0.90408146,"about_ca_system_score_codex":0.0006633131,"about_ca_system_score_gemma":0.000052294403,"threshold_uncertainty_score":0.9999924},"labels":[],"label_agreement":null},{"id":"W6992594759","doi":"","title":"Low-Rank Plus Sparse Decompositions of Large-Scale Matrices via Semidefinite Optimization","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Symmetric matrix; Bounded function; Positive-definite matrix; Semidefinite programming; Matrix (chemical analysis); Relaxation (psychology); Coefficient matrix; Matrix decomposition","score_opus":0.020282673383910165,"score_gpt":0.28144910201349327,"score_spread":0.2611664286295831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992594759","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7243053,0.00023159929,0.26815027,0.0005904046,0.0008380017,0.00222035,0.0012120744,0.00070929114,0.0017427352],"genre_scores_gemma":[0.0028009014,0.0015893187,0.54595906,0.000009731627,0.00006449528,0.000005483265,0.005173648,0.00020629751,0.44419104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799603,0.00011990703,0.00036914664,0.00044632997,0.00066713407,0.00040147462],"domain_scores_gemma":[0.9975699,0.0002927387,0.00070773694,0.00050965266,0.00078334956,0.00013659983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027320208,0.00031033874,0.00069627934,0.0008878001,0.0002832971,0.000021417587,0.00050942076,0.0004112579,0.0006927835],"category_scores_gemma":[0.000085410844,0.0003882785,0.00025589555,0.0009811762,0.00010207789,0.00033957593,0.00014093559,0.00034170615,0.00009385956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010984141,0.0011961182,0.00012336795,0.00710759,0.00085201743,0.0001468436,0.22848102,0.747413,0.0033917741,0.0013514824,0.007090423,0.0017479856],"study_design_scores_gemma":[0.0048736962,0.0003457163,0.0003942134,0.0022009485,0.001015169,0.000010650783,0.28956538,0.68581456,0.008662206,0.00546748,0.00017135937,0.0014786073],"about_ca_topic_score_codex":0.0017955259,"about_ca_topic_score_gemma":0.011207256,"teacher_disagreement_score":0.7215044,"about_ca_system_score_codex":0.00017141685,"about_ca_system_score_gemma":0.00016088635,"threshold_uncertainty_score":0.9998569},"labels":[],"label_agreement":null},{"id":"W6999511363","doi":"","title":"Computing the local minimizers of a large and sparse trust-region subproblem","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Term (time); Unitary state; Context (archaeology)","score_opus":0.0336967362855328,"score_gpt":0.3121879698376278,"score_spread":0.27849123355209504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999511363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9608717,0.0009251384,0.0017848323,0.00010949922,0.0010500158,0.0041645723,0.0009978517,0.0005479812,0.02954841],"genre_scores_gemma":[0.9554336,0.00045668086,0.037446037,0.00012518802,0.00005495289,0.00009875242,0.00045724827,0.00038556012,0.0055419654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952058,0.00045929034,0.0012857759,0.0009578164,0.0011909159,0.0009003991],"domain_scores_gemma":[0.9959646,0.0010096754,0.0010814217,0.00088428374,0.00076704944,0.00029296865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001347748,0.0007429621,0.0010117022,0.00042873438,0.0010959804,0.00007273246,0.0007573207,0.00074162934,0.00010519419],"category_scores_gemma":[0.0017550755,0.0006366341,0.00031016985,0.0008209123,0.0002523201,0.0004142672,0.0002703459,0.0017783344,0.000030233474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010540871,0.001256882,0.000078096746,0.0048473557,0.00088905025,0.000261182,0.00040981674,0.0071109515,0.002058806,0.75764936,0.000036483827,0.2243479],"study_design_scores_gemma":[0.01929694,0.0011400264,0.0010679516,0.007559786,0.0016635201,0.00053234637,0.018772196,0.029469818,0.07996633,0.8120246,0.022687003,0.005819513],"about_ca_topic_score_codex":0.00009513096,"about_ca_topic_score_gemma":0.00050758704,"teacher_disagreement_score":0.21852839,"about_ca_system_score_codex":0.00059774495,"about_ca_system_score_gemma":0.00014391298,"threshold_uncertainty_score":0.9996085},"labels":[],"label_agreement":null},{"id":"W7001050464","doi":"","title":"Indigenous-Land Relationships in the Grand River Valley 1784-1851 | Dr. Gary Warrick","year":2022,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"River valley; Indigenous; Drainage basin; Grand Challenges","score_opus":0.022056227817140377,"score_gpt":0.247205983881936,"score_spread":0.22514975606479562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001050464","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047259517,0.0004288727,0.000028014258,0.00022687066,0.00012930055,0.0014204893,0.00018315457,0.00015543522,0.9973806],"genre_scores_gemma":[0.00009168594,0.0005295395,0.009756024,0.00016945103,0.00010508764,0.000121066376,0.00038894638,0.0002010414,0.98863715],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99661994,0.0006098534,0.00090968364,0.0002860694,0.0011184228,0.00045605787],"domain_scores_gemma":[0.9972727,0.0010599195,0.00070603576,0.0007031578,0.00015608409,0.00010210565],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011571584,0.00039884163,0.0005061145,0.0002764354,0.00034606308,0.0000881883,0.00076664163,0.000399515,0.3511182],"category_scores_gemma":[0.0008693491,0.00034039962,0.00016214055,0.000055902005,0.00024787773,7.640557e-7,0.00020123899,0.0011553381,0.0026448525],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057822363,0.00012267094,0.00004552003,0.0003730695,0.000058088393,0.000044711567,0.0031576024,0.0022861871,1.0936912e-8,0.0001161752,0.99324125,0.00049688393],"study_design_scores_gemma":[0.00093682506,0.00008522682,0.000029316916,0.00010473581,0.00004434362,0.00008674346,0.0005132591,0.00012970965,3.5949535e-7,0.0007461123,0.9969699,0.0003534653],"about_ca_topic_score_codex":0.001382462,"about_ca_topic_score_gemma":0.0023721664,"teacher_disagreement_score":0.34847334,"about_ca_system_score_codex":0.00015955446,"about_ca_system_score_gemma":0.00010348219,"threshold_uncertainty_score":0.9999048},"labels":[],"label_agreement":null},{"id":"W7008768167","doi":"","title":"Conjugate gradient in Hilbert spaces","year":2004,"lang":"ca","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Unitary state; Context (archaeology); Boundary (topology); Domain (mathematical analysis)","score_opus":0.0275057395495786,"score_gpt":0.30571840137527373,"score_spread":0.27821266182569515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008768167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8523704,0.0016478043,0.000045224635,0.0003105063,0.0040727393,0.0075581656,0.0037373635,0.0009009896,0.12935685],"genre_scores_gemma":[0.84808415,0.0062969993,0.06455935,0.000763121,0.00024551406,0.0015016105,0.0045316247,0.0020742987,0.07194332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98763,0.0010917675,0.0030354217,0.0027709077,0.0028638982,0.0026079821],"domain_scores_gemma":[0.99236405,0.0013171387,0.0016970366,0.0019901283,0.0015109379,0.0011207118],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0022282558,0.0021043334,0.0023476242,0.0020523658,0.0016573984,0.00038951167,0.001806702,0.0020017868,0.0017322217],"category_scores_gemma":[0.00557718,0.0023877618,0.00076166255,0.0027927437,0.00033421267,0.0017753671,0.0005357256,0.004946,0.0021880176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001439809,0.0041731945,0.00011990045,0.005603334,0.0010963532,0.0018877565,0.00036764154,0.023292236,0.009529672,0.8525767,0.000021783853,0.099891625],"study_design_scores_gemma":[0.018867489,0.001647467,0.0009163614,0.011121471,0.0010044227,0.00032646095,0.006273599,0.0064450023,0.11045125,0.74460053,0.08835906,0.009986857],"about_ca_topic_score_codex":0.0009234403,"about_ca_topic_score_gemma":0.0054974575,"teacher_disagreement_score":0.10797614,"about_ca_system_score_codex":0.0055558714,"about_ca_system_score_gemma":0.00044887222,"threshold_uncertainty_score":0.9996423},"labels":[],"label_agreement":null},{"id":"W7010424643","doi":"","title":"Integer least squares search and reduction strategies","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Reduction (mathematics); Integer (computer science); Column (typography); Permutation (music); Least-squares function approximation; Integer programming","score_opus":0.048366807500623395,"score_gpt":0.3399282805223126,"score_spread":0.2915614730216892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010424643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87589127,0.0011958089,0.000077944635,0.00004286862,0.0018599022,0.0022566193,0.0008305039,0.00082170725,0.11702335],"genre_scores_gemma":[0.9384148,0.0008373272,0.022674581,0.00002170067,0.00023868679,0.00029746108,0.0011027427,0.0005260116,0.03588668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994904,0.0005494224,0.00095033325,0.0010905396,0.0014213948,0.0010843334],"domain_scores_gemma":[0.99672616,0.00041215203,0.0003893399,0.0008549336,0.0010989613,0.0005184822],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012665096,0.00083728373,0.00082861993,0.0007789901,0.0011779069,0.0002762555,0.0005647456,0.0009552533,0.00092475646],"category_scores_gemma":[0.0011749162,0.0008607466,0.00021982117,0.0007325383,0.0001861893,0.002145671,0.00021533591,0.002554436,0.00025961638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005772216,0.00065860996,0.000013248166,0.0026894303,0.0004783842,0.00004890171,0.00020543074,0.00062258024,0.029822476,0.6837232,0.000036129524,0.28112438],"study_design_scores_gemma":[0.004633198,0.0008981728,0.0014916648,0.0029567415,0.0009607547,0.0006023264,0.04300532,0.0017748377,0.14941789,0.753442,0.03417859,0.006638526],"about_ca_topic_score_codex":0.00016497918,"about_ca_topic_score_gemma":0.00044651047,"teacher_disagreement_score":0.27448586,"about_ca_system_score_codex":0.00066151976,"about_ca_system_score_gemma":0.00013527325,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W7017520897","doi":"","title":"Applied Hilbert's Nullstellensatz for Combinatorial Problems","year":2016,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Gestational period; TSG101; Hyporeflexia; Articular cartilage damage; Diafiltration; Liquation","score_opus":0.023666603613966625,"score_gpt":0.26356573425171276,"score_spread":0.23989913063774612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017520897","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75638187,0.00080486486,0.084066495,0.0073866006,0.013608096,0.03687676,0.0026110495,0.0025409476,0.09572333],"genre_scores_gemma":[0.0021074852,0.00018900285,0.062997036,0.000005101573,0.00016487595,0.000011393818,0.00069055037,0.00013334183,0.9337012],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833375,0.000043778,0.00022122914,0.00048339675,0.0004976837,0.00042014464],"domain_scores_gemma":[0.99804467,0.00035800837,0.00044066706,0.0004591078,0.0005672363,0.00013032285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021771161,0.0003093933,0.00061139447,0.00024734464,0.00027473414,0.000019916459,0.0005290201,0.00046940104,0.00045395005],"category_scores_gemma":[0.000106867934,0.00031607752,0.00021466173,0.00017690587,0.0001080115,0.00016089465,0.000077055236,0.00023257965,0.00006660689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008993722,0.0026425996,0.00006661908,0.020140843,0.002731484,0.00006770815,0.39421532,0.00051714416,0.028955659,0.3788426,0.09536306,0.06746327],"study_design_scores_gemma":[0.032348856,0.0014799266,0.00009157942,0.0026736709,0.0013261116,0.000008033835,0.2189835,0.0031524487,0.033244297,0.6590247,0.0432974,0.004369464],"about_ca_topic_score_codex":0.0004791948,"about_ca_topic_score_gemma":0.0018495014,"teacher_disagreement_score":0.8379779,"about_ca_system_score_codex":0.00015943326,"about_ca_system_score_gemma":0.0001467965,"threshold_uncertainty_score":0.99992913},"labels":[],"label_agreement":null},{"id":"W7018862105","doi":"","title":"The eigenstep method: A new iterative method for unconstrained quadratic optimization.","year":2005,"lang":"en","type":"dissertation","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Method of steepest descent; Gradient descent; Dimension (graph theory); Iterative method; Hessian matrix; Descent (aeronautics); Minification; Convex optimization; Gradient method","score_opus":0.04927350243141356,"score_gpt":0.37260301460566986,"score_spread":0.3233295121742563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018862105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010097328,0.0004595432,0.98728734,0.0010941022,0.0003300436,0.0027067203,0.00026868927,0.00016571111,0.006678112],"genre_scores_gemma":[0.00017977555,0.00013793794,0.83786666,0.0000496131,0.00020189906,0.000012712776,0.0008255068,0.00014035929,0.16058554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537194,0.00093955133,0.0007699377,0.0009755841,0.0011481297,0.0007948577],"domain_scores_gemma":[0.99136925,0.0042896583,0.0013106508,0.0009982979,0.0016165124,0.0004156091],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00238082,0.0006771467,0.0010561105,0.0005945051,0.0018411129,0.00018261536,0.0014090142,0.0008565792,0.0012500855],"category_scores_gemma":[0.0028760622,0.00068441307,0.0006516321,0.0010041391,0.00019320894,0.0008560699,0.00018760239,0.0011001206,0.000040756695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016765906,0.0019342515,0.00048883306,0.0051490213,0.009579935,0.00016088098,0.092624746,0.37314063,0.0055121793,0.16040988,0.045722667,0.28851107],"study_design_scores_gemma":[0.027333956,0.0017915793,0.0011173754,0.002712552,0.0050263493,0.00015117209,0.11316778,0.57457024,0.014531949,0.17719118,0.075103365,0.0073025245],"about_ca_topic_score_codex":0.000039702623,"about_ca_topic_score_gemma":0.0019258482,"teacher_disagreement_score":0.28120854,"about_ca_system_score_codex":0.0005398215,"about_ca_system_score_gemma":0.0011935841,"threshold_uncertainty_score":0.99966294},"labels":[],"label_agreement":null},{"id":"W7021229974","doi":"","title":"Numerical methods for underdetermined box-constrained integer least squares problems","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Underdetermined system; Integer (computer science); Search algorithm; Beam search; Regularization (linguistics); Search tree; Process (computing); Backtracking; Optimization problem","score_opus":0.058739964251852364,"score_gpt":0.3918565949952357,"score_spread":0.3331166307433833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021229974","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02969305,0.0020314085,0.3797178,0.0010061732,0.015125236,0.046422623,0.019011587,0.00903542,0.4979567],"genre_scores_gemma":[0.035333183,0.00020043273,0.8858907,0.00017794587,0.00022447492,0.0030525518,0.0016546674,0.0011677188,0.07229828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99281675,0.0009771977,0.0018367224,0.0017793066,0.0010876276,0.0015024071],"domain_scores_gemma":[0.99129134,0.003924866,0.0011650492,0.0012989821,0.0016847679,0.00063500245],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0021646484,0.0012867331,0.0016336596,0.0008093658,0.0012641585,0.00017596006,0.0012470649,0.0013218854,0.0009741323],"category_scores_gemma":[0.010721922,0.0011263497,0.00079496345,0.0007800475,0.0001954003,0.00089853717,0.00017789201,0.001688083,0.00018297082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006916988,0.00056012627,0.000002359481,0.0023587947,0.00062152045,0.000029382347,0.00003541434,0.00016670408,0.022877477,0.19294733,0.000035457295,0.77967376],"study_design_scores_gemma":[0.004477584,0.00067621015,0.000012514936,0.0018281571,0.0004141397,0.000079275625,0.00051878847,0.0038940872,0.093887694,0.8374122,0.05393158,0.0028678125],"about_ca_topic_score_codex":0.00002580696,"about_ca_topic_score_gemma":0.00009629851,"teacher_disagreement_score":0.77680594,"about_ca_system_score_codex":0.0011078073,"about_ca_system_score_gemma":0.00023124542,"threshold_uncertainty_score":0.99998844},"labels":[],"label_agreement":null},{"id":"W7024023018","doi":"","title":"Rahoitusriski Helsingin pörssissä noteeratuissa valtio-omisteisissa yhtiöissä","year":2022,"lang":"fi","type":"other","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Data collection; Quarter (Canadian coin); Term (time); Work (physics)","score_opus":0.03754478893764627,"score_gpt":0.3430726348752779,"score_spread":0.3055278459376316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024023018","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001141928,0.003340156,0.15992841,0.0014215125,0.0014180844,0.002740791,0.00041670498,0.0009347573,0.82978815],"genre_scores_gemma":[0.00004344323,0.0023802689,0.23065163,0.00044963227,0.0008915043,0.00034155158,0.00048304265,0.0016753153,0.76308364],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98982704,0.0009480446,0.0018841147,0.0022472048,0.0030446928,0.0020489146],"domain_scores_gemma":[0.9929243,0.001403407,0.0011722475,0.003041377,0.0005664898,0.00089222507],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0010792685,0.0017146227,0.0020676276,0.0015478005,0.0010757553,0.00053671707,0.0020442451,0.0012199477,0.6793841],"category_scores_gemma":[0.0021528364,0.0017966524,0.0008476119,0.0020251262,0.00043584793,0.0003184912,0.0015862818,0.0029567939,0.008244158],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024063267,0.0023618655,0.00011660308,0.0017085841,0.0016446859,0.0006123338,0.0014806435,0.008493046,0.00017425654,0.057457916,0.863722,0.06198743],"study_design_scores_gemma":[0.0023474835,0.00022330816,0.000009732389,0.00026082582,0.00019467431,0.000110819165,0.0010091471,0.02256675,0.00029018748,0.004888381,0.96614885,0.0019498339],"about_ca_topic_score_codex":0.0001279279,"about_ca_topic_score_gemma":0.000090409674,"teacher_disagreement_score":0.67113996,"about_ca_system_score_codex":0.0017741943,"about_ca_system_score_gemma":0.00082439627,"threshold_uncertainty_score":0.99956},"labels":[],"label_agreement":null},{"id":"W7027598455","doi":"","title":"A Convergent Hierarchy of Certificates for Constrained Signomial Positivity","year":2020,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Set (abstract data type); Point (geometry); Interchangeability; Term (time); Function (biology); Representation (politics)","score_opus":0.04059218090551665,"score_gpt":0.2859568264352635,"score_spread":0.24536464552974685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027598455","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9235846,0.00013870501,0.060388353,0.0055000917,0.0007025819,0.0054018702,0.0022748911,0.00029929384,0.0017096573],"genre_scores_gemma":[0.1493902,0.00023395737,0.43542778,0.000021846165,0.000119086566,0.000011368481,0.0036225244,0.00018647092,0.41098675],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9986691,0.00008572548,0.00024722083,0.0003762452,0.0003590792,0.0002626406],"domain_scores_gemma":[0.9981142,0.0003921126,0.00048070078,0.00026189798,0.0006110837,0.00013999078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001632009,0.00023366246,0.0006579379,0.0002384716,0.00012771918,0.0000102127315,0.00036942196,0.00026063394,0.0003659323],"category_scores_gemma":[0.0002463158,0.00028124257,0.0002759418,0.00021792286,0.00021412341,0.00013165137,0.00006315695,0.00022076482,0.000009851602],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015201152,0.00237525,0.00025869985,0.022638684,0.0036535554,0.00017736426,0.5643625,0.0013774303,0.29166597,0.05075864,0.02506515,0.022465553],"study_design_scores_gemma":[0.013269234,0.002508785,0.0005123529,0.0013140287,0.0017129174,0.0000088453835,0.44659454,0.07730366,0.41141212,0.039432302,0.0033463961,0.0025848073],"about_ca_topic_score_codex":0.0008620283,"about_ca_topic_score_gemma":0.0015509637,"teacher_disagreement_score":0.77419436,"about_ca_system_score_codex":0.000083269086,"about_ca_system_score_gemma":0.00022443329,"threshold_uncertainty_score":0.999964},"labels":[],"label_agreement":null},{"id":"W7028269134","doi":"","title":"Exchange and Cooperation Programme CELADE","year":2014,"lang":"es","type":"other","venue":"DIGITAL REPOSITORY Economic Commission for Latin America and the Caribbean (United Nations)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Population; Latin Americans; Work (physics); Qualitative research; Field (mathematics)","score_opus":0.020159025692012965,"score_gpt":0.2742136675790296,"score_spread":0.25405464188701665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028269134","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072828756,0.0016419579,0.105267525,0.0036792757,0.00072241767,0.006684233,0.0010913013,0.00040386428,0.8797811],"genre_scores_gemma":[0.030388216,0.0018130922,0.016010609,0.00009818487,0.00072287436,0.0008559674,0.0013391932,0.000543084,0.9482288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997861,0.00023323893,0.0007219533,0.00058976474,0.0002138487,0.0003801623],"domain_scores_gemma":[0.99530244,0.002800654,0.00078186527,0.0005679056,0.00026142446,0.0002856865],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027600877,0.00047338774,0.00068084925,0.0015731977,0.0009806298,0.0010583183,0.00030705435,0.0002907891,0.00019472322],"category_scores_gemma":[0.0012416654,0.0003781182,0.0001585055,0.0007048427,0.00084691436,0.00030194677,0.00027310874,0.00035010357,0.000037283105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010232277,0.0006169846,0.00030080596,0.002167612,0.0013788468,0.0000085992115,0.004318455,0.0020120246,0.000077397926,0.4003168,0.16528364,0.4224956],"study_design_scores_gemma":[0.002424902,0.00014553565,0.000014021908,0.00018885842,0.00010717646,0.000023066417,0.0006761196,0.17893967,0.000023610824,0.0018133668,0.8152483,0.00039534635],"about_ca_topic_score_codex":0.000060282353,"about_ca_topic_score_gemma":0.000012768306,"teacher_disagreement_score":0.6499647,"about_ca_system_score_codex":0.00015412408,"about_ca_system_score_gemma":0.000106827174,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W7028800862","doi":"","title":"Heavy metals, selenium, and Pacific Dunlin: patterns of accumulation, exposure from prey and toxicity risks","year":2012,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Feather; Cadmium; Mercury (programming language); Waterfowl; Ecotoxicology; Toxicity; Habitat; Wader; Trophic level","score_opus":0.05587053438282469,"score_gpt":0.3154632818656087,"score_spread":0.259592747482784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028800862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876764,0.000614971,0.0086138435,0.00003238455,0.00017424801,0.00067290216,0.00089431665,0.000090386355,0.0012305948],"genre_scores_gemma":[0.97758675,0.0012398934,0.009227023,0.0000054787765,0.00009124335,0.0000032755497,0.001850754,0.00007993432,0.009915653],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99809515,0.00021075066,0.00038097333,0.00052973087,0.00046122266,0.00032219253],"domain_scores_gemma":[0.997957,0.00046857557,0.0004610014,0.00045064976,0.00043068666,0.00023210948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018554361,0.00037454537,0.0006066721,0.0004996061,0.00018334258,0.00004344733,0.0002664113,0.00051085936,0.00033375862],"category_scores_gemma":[0.0001885895,0.0004191327,0.000101975726,0.00039708428,0.00007565558,0.00054709363,0.000119534954,0.00045466292,0.000005278919],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088638486,0.00059752184,0.98590404,0.0015319248,0.00087848713,0.00004094529,0.0012179367,0.00043083908,0.00014496701,0.0018598023,0.0016976636,0.0048094797],"study_design_scores_gemma":[0.020698737,0.0013672656,0.3844584,0.003229972,0.0065162317,2.427729e-7,0.36257803,0.017795295,0.10656447,0.02510181,0.06334231,0.008347234],"about_ca_topic_score_codex":0.00022687169,"about_ca_topic_score_gemma":0.014290055,"teacher_disagreement_score":0.6014457,"about_ca_system_score_codex":0.00008991684,"about_ca_system_score_gemma":0.00008304264,"threshold_uncertainty_score":0.9998261},"labels":[],"label_agreement":null},{"id":"W7032876335","doi":"","title":"15/8/12 Occupy Radio: TPP Stumbles; 70 Years With The Bomb","year":2015,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nuclear weapon; State (computer science); General partnership; Vice president; Politics; Government (linguistics); Launched; National security; National laboratory","score_opus":0.015200706417167902,"score_gpt":0.24217042994704455,"score_spread":0.22696972352987665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7032876335","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005803919,0.0002788599,0.00004896106,0.0002797187,0.00012947869,0.0009976161,0.00022401608,0.0002650388,0.9977705],"genre_scores_gemma":[0.00002212988,0.00019375264,0.022205558,0.0001886133,0.0001811003,0.000042524498,0.00017046308,0.00027964875,0.9767162],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973021,0.00016231103,0.00060885475,0.0002657381,0.0012020599,0.00045890704],"domain_scores_gemma":[0.9974594,0.00032617443,0.0007419833,0.000808672,0.00042529235,0.00023849163],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005604652,0.0004320889,0.000569013,0.00012260536,0.00008698167,0.00008653378,0.00067446165,0.00037193298,0.24173866],"category_scores_gemma":[0.0005038878,0.00032114994,0.000115165756,0.000027379667,0.00031098328,5.375223e-7,0.00016220543,0.000534006,0.006601608],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010010193,0.00005467117,7.2187817e-7,0.000296039,0.00012454715,0.000029991903,0.00032303127,0.0010576813,3.7504552e-8,0.0000964735,0.997106,0.00081069686],"study_design_scores_gemma":[0.0009381051,0.00015111314,0.000001380413,0.00020896547,0.0000693787,0.00009119405,0.00032422857,0.00014166125,0.0000021841363,0.0000917204,0.9975989,0.00038118672],"about_ca_topic_score_codex":0.0006499172,"about_ca_topic_score_gemma":0.0014803206,"teacher_disagreement_score":0.23513705,"about_ca_system_score_codex":0.00011237114,"about_ca_system_score_gemma":0.0001594791,"threshold_uncertainty_score":0.99992406},"labels":[],"label_agreement":null},{"id":"W7033639929","doi":"","title":"The role of turbulence in broadcast spawning and larval settlement in freshwater dreissenid mussels","year":2009,"lang":"en","type":"dissertation","venue":"The Atrium (University of Guelph)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Turbulence; Benthic zone; Wake; Hydraulic roughness; Surface finish; Mussel; Plankton; Larva","score_opus":0.015498361373719611,"score_gpt":0.2709684010370784,"score_spread":0.2554700396633588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033639929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934294,0.0017198678,0.00064453983,0.0006808029,0.00008028556,0.0010124175,0.00010264864,0.00002666782,0.002303351],"genre_scores_gemma":[0.96961534,0.0019980595,0.022499578,0.000009678157,0.000032315686,0.000001475929,0.00014636498,0.000035926674,0.0056612887],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99873465,0.00015301802,0.00025850773,0.00021419064,0.00038838,0.00025126358],"domain_scores_gemma":[0.9987921,0.00036806345,0.0003057535,0.00033718333,0.00015900725,0.00003785141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006064658,0.00015685431,0.00031106998,0.00023385757,0.00014809304,0.000015481095,0.0005142701,0.00013482611,0.000064923915],"category_scores_gemma":[0.00012644914,0.0001291472,0.0000664557,0.00035986546,0.00013342957,0.00013203791,0.000118385404,0.0003877168,0.0000034246843],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008658188,0.0023501562,0.011044007,0.004494625,0.0010840856,0.00052230153,0.3273697,0.03173597,0.12821941,0.059737634,0.0037914084,0.42099252],"study_design_scores_gemma":[0.008149246,0.0007440377,0.18999743,0.002676173,0.0004538582,0.000031771397,0.4299944,0.07870607,0.013032862,0.2628114,0.011482155,0.001920587],"about_ca_topic_score_codex":0.00042088833,"about_ca_topic_score_gemma":0.0074098394,"teacher_disagreement_score":0.4190719,"about_ca_system_score_codex":0.00007625669,"about_ca_system_score_gemma":0.00007699556,"threshold_uncertainty_score":0.526647},"labels":[],"label_agreement":null},{"id":"W7034332725","doi":"","title":"A Tractable Approach To Inverse Optimization Under Euclidean Norm","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Optimization problem; Inverse problem; Nonlinear programming; Continuous optimization; Inverse; Heuristic; Measure (data warehouse); Penalty method; Linear programming; Euclidean distance; Constrained optimization","score_opus":0.042956928560126194,"score_gpt":0.28304876418987834,"score_spread":0.24009183562975214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034332725","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56924,0.000064993874,0.37923828,0.0026295818,0.0016347893,0.007055331,0.0005278193,0.0021636705,0.03744554],"genre_scores_gemma":[0.00024769473,0.000083691615,0.34172854,0.000015947518,0.000032567077,0.0000029925502,0.0011597902,0.000104227845,0.65662456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99796903,0.000089559726,0.00023815176,0.0005693698,0.00068443664,0.000449423],"domain_scores_gemma":[0.9982551,0.00013769498,0.00031062847,0.0005240329,0.00053472107,0.00023787718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028458997,0.00032320363,0.0005555357,0.0008198338,0.00026202385,0.000040925,0.0005540984,0.00040287926,0.00038142983],"category_scores_gemma":[0.00016754786,0.00039767736,0.00017337679,0.0010312852,0.0000617663,0.00035612573,0.00013135346,0.0003899972,0.0002126323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043666599,0.00056618184,0.00002193376,0.0014937212,0.0003532808,0.000038444767,0.16266687,0.8026359,0.00035697658,0.0027820398,0.027119473,0.0015285183],"study_design_scores_gemma":[0.0022751507,0.00023286577,0.00024742793,0.0004819023,0.00038728205,0.0000055863566,0.6973261,0.29154807,0.00065370556,0.0048343567,0.00063339603,0.0013741193],"about_ca_topic_score_codex":0.0053128563,"about_ca_topic_score_gemma":0.014897592,"teacher_disagreement_score":0.619179,"about_ca_system_score_codex":0.00025724334,"about_ca_system_score_gemma":0.00017479715,"threshold_uncertainty_score":0.99984753},"labels":[],"label_agreement":null},{"id":"W7034634892","doi":"","title":"Tolkar på resande fot: Om österbottniska frilanstolkars arbetsområde","year":2007,"lang":"fi","type":"other","venue":"Osuva (University of Vaasa)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Population; Quarter (Canadian coin)","score_opus":0.04102275399135497,"score_gpt":0.3002791199983098,"score_spread":0.25925636600695484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034634892","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008756891,0.0007994604,0.30535078,0.0007122411,0.00060361123,0.0013766536,0.0004896506,0.00028406564,0.68950784],"genre_scores_gemma":[0.0008228625,0.0016530207,0.23839198,0.00007803042,0.00028019847,9.211556e-7,0.00014494102,0.00043761212,0.75819045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99503994,0.0003057758,0.0006268306,0.0011471036,0.0016560296,0.0012243307],"domain_scores_gemma":[0.9953883,0.0006611705,0.0011413035,0.0016611901,0.00054348184,0.0006045123],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007524032,0.00082802214,0.0014955277,0.0018066127,0.0005033439,0.000060698952,0.0017104931,0.0013480939,0.039732516],"category_scores_gemma":[0.00028874344,0.001099703,0.00059257634,0.0012979532,0.0009502934,0.0003972022,0.00077553204,0.0012634547,0.0027816219],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036156378,0.0066377763,0.0026431289,0.011832332,0.0070586517,0.0072985976,0.028858798,0.004924741,0.0017517124,0.07642525,0.6441257,0.2048277],"study_design_scores_gemma":[0.0053063696,0.0005250945,0.00034760163,0.0018657291,0.0006475147,0.00007448011,0.007801496,0.009286544,0.00027989346,0.0037705305,0.9681409,0.0019538486],"about_ca_topic_score_codex":0.00037386076,"about_ca_topic_score_gemma":0.00090886845,"teacher_disagreement_score":0.32401523,"about_ca_system_score_codex":0.00058163994,"about_ca_system_score_gemma":0.00043404935,"threshold_uncertainty_score":0.9999484},"labels":[],"label_agreement":null},{"id":"W7035015226","doi":"","title":"Wintertime Infiltration and the Thermal Dynamics of Black Spruce Peatlands within the Boreal Plains","year":2022,"lang":"en","type":"dissertation","venue":"University Library (University of Saskatchewan)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Peat; Boreal; Black spruce; Taiga; Permafrost; Frost (temperature); Hydrology (agriculture); Infiltration (HVAC)","score_opus":0.008736196678356132,"score_gpt":0.2163962671197225,"score_spread":0.2076600704413664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035015226","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94295233,0.00010168505,0.0047954954,0.002824596,0.00023054639,0.0016859735,0.0008986187,0.00018663189,0.046324134],"genre_scores_gemma":[0.8762876,0.00027625987,0.010934315,0.000034908368,0.000040686286,3.1670027e-7,0.003202739,0.00006521635,0.10915798],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9983859,0.00037479997,0.00022652923,0.00030940468,0.0005110116,0.00019237379],"domain_scores_gemma":[0.99804586,0.00062422786,0.0006607849,0.00046492813,0.00012837183,0.00007583389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026567047,0.00024255858,0.00045341943,0.0002708505,0.0005378548,0.000026112639,0.0009877214,0.00020509459,0.0007508391],"category_scores_gemma":[0.000042194904,0.00021507654,0.000203912,0.00054613635,0.00085229473,0.00080806704,0.00041460493,0.0006612734,0.0000018972391],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015373934,0.0006255795,0.004579287,0.001666847,0.0019267736,0.00021832154,0.8488183,0.00858562,0.00011223553,0.11044683,0.0038995505,0.0037467054],"study_design_scores_gemma":[0.0032468706,0.0001659731,0.0028171758,0.00012231551,0.0004024872,0.000006064306,0.95012194,0.035673674,0.00013404647,0.006335433,0.000597576,0.00037645755],"about_ca_topic_score_codex":0.0007953607,"about_ca_topic_score_gemma":0.0037926186,"teacher_disagreement_score":0.1041114,"about_ca_system_score_codex":0.00010189762,"about_ca_system_score_gemma":0.00043871533,"threshold_uncertainty_score":0.87705666},"labels":[],"label_agreement":null},{"id":"W7035997090","doi":"","title":"2004 Another Bad Year For Journalists","year":2005,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Prison; Globe; Dozen; Quarter (Canadian coin); Harm; China","score_opus":0.014798409745300225,"score_gpt":0.26055745049349816,"score_spread":0.24575904074819793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035997090","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.536977e-7,0.00028012425,0.00049421546,0.0002913297,0.00016959055,0.00090320053,0.00030551403,0.00019749197,0.99735796],"genre_scores_gemma":[0.000002925987,0.00024952283,0.14436309,0.00016552079,0.00036900287,0.0000384478,0.00008669399,0.00028825298,0.8544365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800915,0.00006269606,0.0007279287,0.00020819764,0.0005978357,0.00039417896],"domain_scores_gemma":[0.99805987,0.00027942457,0.00073683035,0.00044066808,0.0003619566,0.00012125522],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034705963,0.00034297892,0.00049172196,0.00014623384,0.000068241556,0.000059350932,0.00039152364,0.00044372972,0.61131245],"category_scores_gemma":[0.0005882871,0.00033522275,0.00021004709,0.00001171452,0.000110401,3.3000356e-7,0.00006771898,0.0002963895,0.005821992],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064453765,0.000060546885,2.729153e-7,0.00047047093,0.0000793994,0.0000038381972,0.000059718663,0.00054513925,1.3350486e-7,0.00036362166,0.9955739,0.0027785085],"study_design_scores_gemma":[0.0010287613,0.00007147139,2.921245e-7,0.00026045876,0.000041874515,0.000032085292,0.00003873392,0.00018107958,0.000010970275,0.00019992016,0.9977993,0.00033507988],"about_ca_topic_score_codex":0.00015963346,"about_ca_topic_score_gemma":0.00039303303,"teacher_disagreement_score":0.6054905,"about_ca_system_score_codex":0.00010077871,"about_ca_system_score_gemma":0.00005449023,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W7036240459","doi":"","title":"Annual Report of the Municipal Officers of the Town of Appleton, Maine","year":2012,"lang":"en","type":"article","venue":"DigitalCommons (California Polytechnic State University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Annual report; Work (physics); Government (linguistics); Quarter (Canadian coin)","score_opus":0.027577545043835125,"score_gpt":0.27413938828947026,"score_spread":0.24656184324563513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036240459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492821,0.00018745016,0.08494695,0.0015619841,0.000459834,0.0034588263,0.015348779,0.00032371157,0.14443034],"genre_scores_gemma":[0.9900708,0.000021841064,0.0055541145,0.000011124292,0.0000123859045,0.0000016552971,0.000017436878,0.000029367542,0.004281278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982523,0.00010351773,0.0005387397,0.00016827055,0.0005555494,0.00038165346],"domain_scores_gemma":[0.99742633,0.00034763542,0.0007123401,0.0011545406,0.00025523634,0.000103888815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035697644,0.00017720292,0.00035420255,0.0002724244,0.00009992129,0.000004275559,0.0009776714,0.00009103242,0.00005764702],"category_scores_gemma":[0.00050539,0.00012546804,0.00026781028,0.0015347908,0.0007069253,0.00024764374,0.0008917362,0.00024570886,0.0000023237285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019394264,0.010378805,0.14709413,0.0022038836,0.0029732217,0.00021712517,0.013869315,0.030270249,0.010597251,0.71773547,0.037256703,0.025464399],"study_design_scores_gemma":[0.007926583,0.0006115028,0.013262405,0.0011654774,0.0009424175,0.0005815935,0.023098893,0.005438186,0.17187257,0.025145749,0.7475759,0.0023787268],"about_ca_topic_score_codex":0.00007111601,"about_ca_topic_score_gemma":0.000041419356,"teacher_disagreement_score":0.7103192,"about_ca_system_score_codex":0.00013570437,"about_ca_system_score_gemma":0.00017034555,"threshold_uncertainty_score":0.5116438},"labels":[],"label_agreement":null},{"id":"W7039019937","doi":"","title":"Lexiques et grammaires comparés des expressions figées. La classe C1 dans le français du Québec, le français normé et l’italien","year":2015,"lang":"fr","type":"other","venue":"Institutional Research Information System (University of Udine)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Triacetin; Fusible alloy","score_opus":0.07825269982630607,"score_gpt":0.3262344334935878,"score_spread":0.24798173366728177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039019937","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028903044,0.00045001446,0.49383357,0.002196874,0.00012795776,0.0012908342,0.0013456435,0.00023668987,0.49762812],"genre_scores_gemma":[0.78298134,0.00089708803,0.10420845,0.000079282414,0.00021100309,0.00005677661,0.00202793,0.0001877697,0.10935037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99312353,0.0016455693,0.00091635284,0.00045392712,0.0030770884,0.0007835436],"domain_scores_gemma":[0.9917576,0.0013842457,0.00068925216,0.00076150737,0.0047506406,0.00065680797],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0042143906,0.0005101734,0.00088878785,0.0017706774,0.0020287868,0.00027459266,0.00139134,0.0006977807,0.0018454958],"category_scores_gemma":[0.0026648315,0.00057050335,0.000285812,0.0013686403,0.0041584685,0.004523492,0.0010391339,0.001307989,0.001735905],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040158068,0.00074133195,0.00073364336,0.0045963745,0.0005197034,0.00013134518,0.066472396,0.04060314,0.00013076329,0.70212936,0.18063505,0.0029052836],"study_design_scores_gemma":[0.0031686337,0.0001559785,0.0017932601,0.002966631,0.00004349515,0.00013566314,0.04625949,0.052153613,0.00010088132,0.0010139656,0.89156806,0.00064032694],"about_ca_topic_score_codex":0.11388845,"about_ca_topic_score_gemma":0.03663805,"teacher_disagreement_score":0.78009105,"about_ca_system_score_codex":0.001827882,"about_ca_system_score_gemma":0.010069315,"threshold_uncertainty_score":0.9996746},"labels":[],"label_agreement":null},{"id":"W7095288794","doi":"","title":"University of Alberta Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quadratic growth; Generalization; Permission; Quadratic programming; Quadratic equation; Quadratically constrained quadratic program; Association (psychology)","score_opus":0.08391273288734713,"score_gpt":0.36318207996218543,"score_spread":0.2792693470748383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095288794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026902894,0.00042994253,0.9625249,0.0015833592,0.000004491337,0.0018661203,0.000008087318,0.000062112296,0.006618085],"genre_scores_gemma":[0.38334912,0.00007306398,0.6156309,0.0000124846865,0.0000030539597,0.000021959697,0.000014547144,0.000011154801,0.00088369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916595,0.00013955364,0.00023898149,0.00017450115,0.00013954472,0.00014147212],"domain_scores_gemma":[0.9985034,0.00059445825,0.00009484573,0.00024190034,0.00043133768,0.00013405329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728091,0.00009879889,0.00021977116,0.00009015784,0.00013213223,0.000032265085,0.00016656816,0.00005426144,0.000018965588],"category_scores_gemma":[0.00058438646,0.0000940749,0.000011343694,0.00036445603,0.00034291975,0.00021862483,0.000105644045,0.00009578327,0.0000013570667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010273697,0.0011412667,0.0026663928,0.0006139678,0.000095154086,0.0000036899125,0.040702756,0.00084204035,0.0033149752,0.93075967,0.00007063683,0.01968669],"study_design_scores_gemma":[0.007139062,0.00028753714,0.00021518838,0.00027600979,0.00011039708,0.000032109372,0.064459,0.881258,0.001859286,0.040831268,0.0027113638,0.0008207864],"about_ca_topic_score_codex":0.00009313424,"about_ca_topic_score_gemma":0.0013847442,"teacher_disagreement_score":0.8899284,"about_ca_system_score_codex":0.000038101796,"about_ca_system_score_gemma":0.00020102401,"threshold_uncertainty_score":0.3836263},"labels":[],"label_agreement":null},{"id":"W7096028071","doi":"","title":"University of Alberta METHODOLOGIES FOR MANY-INPUT FEEDBACK-DIRECTED OPTIMIZATION","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Permission; Work (physics); Association (psychology); Documentation","score_opus":0.13379078585009702,"score_gpt":0.384994189499361,"score_spread":0.25120340364926397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096028071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032096088,0.000024596296,0.99013335,0.00017302104,0.00006463584,0.00040971494,0.0000073811443,0.00014410813,0.008722255],"genre_scores_gemma":[0.001708844,0.000047222875,0.9788027,0.000012551597,0.000026990263,0.00000325073,0.000018560417,0.000020164984,0.019359741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991782,0.00012612599,0.00015868862,0.00013111939,0.00014865166,0.0002572661],"domain_scores_gemma":[0.99715984,0.002116752,0.000114390066,0.00022743907,0.0003083229,0.000073276686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004433872,0.00009317166,0.00020489508,0.00009804019,0.0000828445,0.0000062480444,0.00016559269,0.00008723297,0.0008929621],"category_scores_gemma":[0.0022710233,0.00008989042,0.0000635939,0.00024745904,0.0000698787,0.00027845503,0.00008840106,0.000058067755,0.000009724729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011156334,0.0013344405,0.0021400126,0.0011498162,0.0006932569,0.0000021244318,0.008318652,0.4210829,0.0015455137,0.47352877,0.04946245,0.03962639],"study_design_scores_gemma":[0.0021517663,0.000117622585,0.00027499188,0.00003266186,0.0001056699,0.0000057126163,0.0028940022,0.9570326,0.011865384,0.018315697,0.0067596505,0.00044424608],"about_ca_topic_score_codex":0.000047038546,"about_ca_topic_score_gemma":0.000020681791,"teacher_disagreement_score":0.53594965,"about_ca_system_score_codex":0.00005011948,"about_ca_system_score_gemma":0.000028004397,"threshold_uncertainty_score":0.9777309},"labels":[],"label_agreement":null},{"id":"W7096566001","doi":"","title":"Semidefinite Programming and Graph Partitioning with Preferences Suely Oliveira","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Adjacency matrix; Laplacian matrix; Eigenvalues and eigenvectors; Graph partition; Semidefinite programming; Partition (number theory); Spectral graph theory; Graph; Symmetric matrix","score_opus":0.06781354990981632,"score_gpt":0.35632742880326085,"score_spread":0.28851387889344454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096566001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082768075,0.00008115939,0.9008678,0.0000692779,0.000015949134,0.00037230324,0.0000016712919,0.00023646555,0.015587269],"genre_scores_gemma":[0.25736877,0.000036964782,0.74125093,0.000031849155,0.00002188681,0.000023488064,0.000004588627,0.000019814592,0.001241686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899334,0.000023379645,0.00019019275,0.00019927413,0.00028032847,0.00031349083],"domain_scores_gemma":[0.99911934,0.00040286864,0.00006593779,0.00013213677,0.00016555798,0.0001141614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043271104,0.000106604835,0.00012275472,0.00012202893,0.0001497378,0.00007903879,0.00006916022,0.00004280704,0.00011101312],"category_scores_gemma":[0.00015253358,0.00007829414,0.0000148598565,0.0003362899,0.00012472473,0.00021646486,0.0000417083,0.00013200856,0.0000063831835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033973172,0.0006302329,0.1248687,0.00055963633,0.00027720552,0.00013134959,0.005931933,0.001307513,0.00029137495,0.5407302,0.0004427681,0.32448938],"study_design_scores_gemma":[0.00799593,0.0028612744,0.036129113,0.0012970079,0.00022708216,0.00045710627,0.02119718,0.01998777,0.021669142,0.8721724,0.0125679765,0.0034379868],"about_ca_topic_score_codex":0.0000117104255,"about_ca_topic_score_gemma":0.00013771738,"teacher_disagreement_score":0.33144227,"about_ca_system_score_codex":0.000015896996,"about_ca_system_score_gemma":0.000022054805,"threshold_uncertainty_score":0.31927425},"labels":[],"label_agreement":null},{"id":"W7097076153","doi":"","title":"Canada.","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Linearization; Matrix (chemical analysis); Ambiguity; Context (archaeology); Class (philosophy)","score_opus":0.042246560702907415,"score_gpt":0.3539697973498883,"score_spread":0.3117232366469809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097076153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010325661,0.0000252258,0.6620469,0.010120484,0.0000507898,0.00017934098,0.0000058584355,0.00014790508,0.3263909],"genre_scores_gemma":[0.025794782,0.000004796645,0.8630041,0.00074114907,0.000087180066,0.0000060187845,0.0000012556259,0.000012722055,0.11034803],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957275,0.000007336219,0.00007227255,0.000058963375,0.00017741144,0.00011124136],"domain_scores_gemma":[0.99969107,0.00008561269,0.000010809932,0.000112636604,0.000050854553,0.000048990194],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000044564837,0.000032164604,0.000041526637,0.000015497504,0.000027932589,0.000005694506,0.00006650766,0.000010964253,0.002290191],"category_scores_gemma":[0.00016853685,0.000026990627,0.0000066396087,0.00007341723,0.00000741567,0.000048416467,0.000019896674,0.00004263623,0.000039954175],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032722317,0.000048522954,0.000049845625,0.000009939696,0.00001151087,0.000006000577,0.000040268536,0.0034854824,0.000039324423,0.2634877,0.6809068,0.051911347],"study_design_scores_gemma":[0.00028825918,0.0000060971056,0.00004153515,0.000002648453,0.0000019256738,0.0000063809207,0.000059773352,0.07626088,0.0033731163,0.014390648,0.90543556,0.00013319358],"about_ca_topic_score_codex":0.033914164,"about_ca_topic_score_gemma":0.66357285,"teacher_disagreement_score":0.6296587,"about_ca_system_score_codex":0.00009589812,"about_ca_system_score_gemma":0.0002220022,"threshold_uncertainty_score":0.9986218},"labels":[],"label_agreement":null},{"id":"W7105885683","doi":"10.23952/jano.7.2025.3.05","title":"Parametric analysis of objective function coefficients and right-hand-side parameters of linear programming models across the entire feasible range","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Range (aeronautics); Linear programming; Function (biology); Parametric statistics; Linear model; Linear-fractional programming","score_opus":0.023831044428219275,"score_gpt":0.3255235906922811,"score_spread":0.30169254626406183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105885683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048312843,0.0009363078,0.94954383,0.000082454586,0.00011144553,0.0008219372,0.000028398343,0.000008471987,0.00015432271],"genre_scores_gemma":[0.79721725,0.0014260007,0.20119515,0.000030034505,0.00002155948,0.000016135044,0.000011885857,0.00002494998,0.000057010533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966411,0.0001350151,0.0016273924,0.00036746185,0.000855428,0.0003736059],"domain_scores_gemma":[0.9949862,0.0012874497,0.0019704807,0.00028684075,0.0013104343,0.0001586406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516467,0.00031087804,0.0012143422,0.0011321005,0.00042335992,0.00014516922,0.00023819391,0.00023117069,0.000025670495],"category_scores_gemma":[0.00056069734,0.00022824614,0.00029864543,0.00597052,0.0005577658,0.00033822883,0.0001672369,0.00048756812,2.018137e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014229935,0.0006144948,0.00025213993,0.00024842,0.0020142088,0.0000016000989,0.0017293177,0.9609475,0.00007105659,0.0010194498,0.0000064322917,0.031672385],"study_design_scores_gemma":[0.0020841903,0.00043631738,0.0003180978,0.0001481469,0.0027576424,0.00000431783,0.0020886522,0.98858315,0.0012750436,0.0021088787,0.000020091598,0.00017548443],"about_ca_topic_score_codex":0.000015403088,"about_ca_topic_score_gemma":0.0000013403,"teacher_disagreement_score":0.7489044,"about_ca_system_score_codex":0.00012045087,"about_ca_system_score_gemma":0.00014728153,"threshold_uncertainty_score":0.93076074},"labels":[],"label_agreement":null},{"id":"W7105920295","doi":"10.23952/jano.7.2025.3.01","title":"Editorial: Special issue on recent trends in optimization models and algorithms, dedicated to Tamás Terlaky on the occasion of his 70th birthday","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Magyar Tudományos Akadémia","keywords":"Work (physics)","score_opus":0.024562234204166852,"score_gpt":0.32084547849776884,"score_spread":0.296283244293602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105920295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000278633,0.00016336357,0.9823983,0.0060075256,0.006210982,0.0010224014,0.000033339245,0.000022332486,0.003863129],"genre_scores_gemma":[0.024989674,0.025444333,0.90267414,0.0014772069,0.043662943,0.00011214807,0.00011283652,0.00028535916,0.0012413656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953801,0.00031591125,0.0019449663,0.0005639398,0.0013316517,0.00046340062],"domain_scores_gemma":[0.9961836,0.000994621,0.0012202831,0.00037884546,0.0008943168,0.00032838894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014376321,0.0004931957,0.0010577744,0.0016581547,0.00025609502,0.00015538951,0.00037041013,0.0004351811,0.00053370546],"category_scores_gemma":[0.00084244757,0.0003752007,0.00011281697,0.0028158373,0.00019349565,0.00032742697,0.00019186467,0.0009350539,0.0000028265952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002344164,0.0007779637,0.00000429873,0.00006453692,0.00008236723,0.00000378569,0.0008845094,0.8827343,0.000029301753,0.0027427883,0.020440629,0.08989133],"study_design_scores_gemma":[0.003053446,0.0011683998,0.000022144926,0.00049259135,0.00010902647,0.000004978708,0.00040334233,0.98010427,0.0005060761,0.0025003925,0.0113069005,0.00032845113],"about_ca_topic_score_codex":0.0000065348477,"about_ca_topic_score_gemma":7.538807e-7,"teacher_disagreement_score":0.097369924,"about_ca_system_score_codex":0.00043449187,"about_ca_system_score_gemma":0.00020778447,"threshold_uncertainty_score":0.99987},"labels":[],"label_agreement":null},{"id":"W7133049612","doi":"","title":"Refinement methods for reach control on a simplex","year":2008,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Simplex; Affine transformation; Simplex algorithm; Iterative method; Vertex (graph theory); Minification; Optimization problem","score_opus":0.1274294337251623,"score_gpt":0.558572395259424,"score_spread":0.43114296153426174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133049612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019036332,0.00066123344,0.97199255,0.0011904181,0.00056044117,0.006380887,0.00011023424,0.00017974684,0.018734133],"genre_scores_gemma":[0.00022473073,0.0012210952,0.79763746,0.0003447442,0.00033664293,0.0018910547,0.0010287849,0.0003539066,0.19696157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942286,0.0008037274,0.0013282659,0.001299302,0.0011062727,0.001233833],"domain_scores_gemma":[0.9895923,0.0056905197,0.0011529888,0.001435045,0.0017191616,0.00040997722],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001693357,0.0010051619,0.0015583617,0.0006190758,0.0007441585,0.000111613255,0.000672622,0.00081726024,0.0018301893],"category_scores_gemma":[0.006787544,0.0010282964,0.0005723873,0.0006626747,0.00012917409,0.000112695874,0.00006380886,0.0010559668,0.0001740963],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011314608,0.0043564844,0.0000050425365,0.0066507664,0.0027627572,0.00007396157,0.055732515,0.036566544,0.0062847277,0.051932137,0.08763635,0.7366841],"study_design_scores_gemma":[0.013128267,0.0024121918,0.00001863858,0.0008279823,0.0006566009,0.000022902706,0.013694758,0.53742343,0.011784409,0.012223235,0.40556815,0.0022394536],"about_ca_topic_score_codex":0.000042562486,"about_ca_topic_score_gemma":0.000024690633,"teacher_disagreement_score":0.7344447,"about_ca_system_score_codex":0.0007015967,"about_ca_system_score_gemma":0.000648126,"threshold_uncertainty_score":0.99921674},"labels":[],"label_agreement":null},{"id":"W7133097997","doi":"","title":"Theory Embedded Learning","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parameterized complexity; Flexibility (engineering); Rigidity (electromagnetism); Mathematical theory; Mathematical problem; Work (physics)","score_opus":0.058106579701264094,"score_gpt":0.45399470918543644,"score_spread":0.39588812948417235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133097997","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03139184,0.002197197,0.6734118,0.00071784534,0.005021154,0.0059560896,0.000037649042,0.0044886796,0.27677774],"genre_scores_gemma":[0.0017527158,0.0016274729,0.04149727,0.000026033425,0.00036945968,0.00038178285,0.00080521737,0.0006657624,0.9528743],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99446076,0.00096872274,0.0008872154,0.0010378594,0.0015022518,0.0011431833],"domain_scores_gemma":[0.9935476,0.0033916628,0.0008220222,0.0009319738,0.0009535087,0.0003532278],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018176787,0.0007999165,0.00095639104,0.0007416728,0.000762735,0.00024689117,0.0007183289,0.00084977056,0.011322307],"category_scores_gemma":[0.01049729,0.000887168,0.00034542062,0.0016816464,0.0001553229,0.00019679517,0.00023139933,0.0025653767,0.008086049],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018454728,0.00097263657,0.000055543675,0.00812013,0.0020444007,0.00056671805,0.54774123,0.17636651,0.0027314173,0.10612577,0.017920448,0.1355097],"study_design_scores_gemma":[0.0024563575,0.00045045387,0.00010801619,0.0019688036,0.0005154472,0.000020061523,0.5629513,0.31286874,0.0056572356,0.10016687,0.010107025,0.002729688],"about_ca_topic_score_codex":0.000021780954,"about_ca_topic_score_gemma":0.000028901446,"teacher_disagreement_score":0.6760965,"about_ca_system_score_codex":0.00030062738,"about_ca_system_score_gemma":0.000519604,"threshold_uncertainty_score":0.9997358},"labels":[],"label_agreement":null},{"id":"W7139956706","doi":"10.23919/cnc-usnc-ursi64444.2025.11420068","title":"Heterogeneous Tolerance Strategies in H-LU Decomposition for Integral Equations","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Integral equation; Decomposition; Decomposition method (queueing theory); Differential equation; Stability (learning theory)","score_opus":0.04432015280215252,"score_gpt":0.4221197334004109,"score_spread":0.3777995805982584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139956706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002749651,0.00044572976,0.9850803,0.0012327327,0.00035105913,0.002195925,0.000060026814,0.00009552906,0.0077890162],"genre_scores_gemma":[0.43561634,0.00021699404,0.55462533,0.00022672204,0.00006810472,0.000656013,0.00007500778,0.00004844682,0.008467056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974143,0.00014889053,0.0009715225,0.00054001185,0.00030259226,0.00062270736],"domain_scores_gemma":[0.99698406,0.0017157556,0.00014925883,0.0004729824,0.00058690895,0.00009104405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039884268,0.00032346084,0.00046580637,0.00059802446,0.00026578692,0.0003360513,0.0003641952,0.00022855206,0.00048685088],"category_scores_gemma":[0.00070516526,0.00034254242,0.00017005696,0.001002023,0.00014297078,0.00056986074,0.00012300903,0.0003434206,0.000028449942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019599278,0.0006560007,0.000026987309,0.00054965995,0.000078493365,0.000006423752,0.0006544905,0.4912692,0.00038599357,0.4783061,0.00037357514,0.027497059],"study_design_scores_gemma":[0.0014651483,0.00011357737,0.000013950263,0.00029223828,0.000026341419,0.000002344252,0.0021962398,0.7836275,0.0030121747,0.20868061,0.0003278895,0.00024197245],"about_ca_topic_score_codex":0.00003518395,"about_ca_topic_score_gemma":0.00071262656,"teacher_disagreement_score":0.4328667,"about_ca_system_score_codex":0.00044929518,"about_ca_system_score_gemma":0.0005724855,"threshold_uncertainty_score":0.99990267},"labels":[],"label_agreement":null},{"id":"W7142866237","doi":"10.23952/jano.8.2026.1.05","title":"A corrector-predictor feasible interior-point algorithm for $P_{*}(\\kappa)$-weighted linear complementarity problem based on the algebraic equivalent transformation","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Algebraic number; Complementarity (molecular biology); Line search; Polynomial; Predictor–corrector method; Linear complementarity problem; Complementarity theory; Transformation (genetics); Simple (philosophy)","score_opus":0.029414867818872082,"score_gpt":0.32030225463917167,"score_spread":0.2908873868202996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142866237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019021258,0.00010704165,0.98911214,0.0049443017,0.0004660473,0.0035060497,0.00015982128,0.000048963902,0.001465444],"genre_scores_gemma":[0.037857268,0.0005263496,0.9593421,0.0012986248,0.00030627256,0.00023806024,0.00016710527,0.00009704197,0.00016714733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953289,0.00028357888,0.0022151305,0.0004810806,0.0010635366,0.0006277483],"domain_scores_gemma":[0.99490803,0.0018481411,0.0013668104,0.00038574147,0.0011843217,0.00030692157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001840229,0.0005695244,0.001006286,0.00062593777,0.00068218115,0.00028561437,0.000510795,0.00027689122,0.0006052549],"category_scores_gemma":[0.00030361072,0.00042384252,0.0003568121,0.0010742455,0.0002484323,0.0004164108,0.00011887778,0.0009236614,0.0000041876756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003975781,0.001977031,0.000018325616,0.0010320791,0.00066353247,0.000004954561,0.0018834553,0.8769813,0.00018479861,0.023897832,0.0032502457,0.08613065],"study_design_scores_gemma":[0.00639893,0.0012904078,0.000009474334,0.00061533885,0.00034200333,0.0000087828,0.0008607057,0.9752596,0.0012167753,0.011725653,0.0019161078,0.00035621296],"about_ca_topic_score_codex":0.0000048324173,"about_ca_topic_score_gemma":8.8825425e-7,"teacher_disagreement_score":0.09827829,"about_ca_system_score_codex":0.0006023118,"about_ca_system_score_gemma":0.0005201567,"threshold_uncertainty_score":0.99982136},"labels":[],"label_agreement":null},{"id":"W82584263","doi":"10.1007/0-306-48332-7_78","title":"Criss-Cross Pivoting Rules","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04159238333358787,"score_gpt":0.3473829017767931,"score_spread":0.3057905184432052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82584263","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000071102345,0.00021698428,0.3969853,0.00003597203,0.00020746182,0.00044186058,0.00004893746,0.00013470663,0.6019217],"genre_scores_gemma":[0.000011025365,0.00569057,0.4499879,0.00001552094,0.0003383016,0.000019394003,0.00029148182,0.00020784099,0.54343796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969826,0.000041500454,0.0011025952,0.0005755172,0.0008966785,0.0004011292],"domain_scores_gemma":[0.9967986,0.00049097434,0.0009598961,0.00067442976,0.0009263398,0.00014976731],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036933666,0.00049905974,0.0006963818,0.00044092373,0.00016193416,0.00005923237,0.0004385493,0.0005603879,0.0045362096],"category_scores_gemma":[0.0011133841,0.0005345511,0.0002044288,0.00013916225,0.00021338204,0.00036498703,0.00020353396,0.0005297527,0.000096711294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066006214,0.00013755386,0.00008327329,0.0005634077,0.00016995538,0.00004943508,0.00048802735,0.7470543,0.0000017776432,0.22909614,0.0061905826,0.016099574],"study_design_scores_gemma":[0.0025121046,0.00029453615,0.000019302315,0.0013633921,0.00036023062,0.00007410297,0.00011330998,0.31571516,0.000084473555,0.3568528,0.31998748,0.0026231217],"about_ca_topic_score_codex":0.0000044589756,"about_ca_topic_score_gemma":0.000002282703,"teacher_disagreement_score":0.4313391,"about_ca_system_score_codex":0.00016859747,"about_ca_system_score_gemma":0.0001693263,"threshold_uncertainty_score":0.9997106},"labels":[],"label_agreement":null},{"id":"W91728630","doi":"10.1007/978-1-4614-0769-0","title":"Handbook on Semidefinite, Conic and Polynomial Optimization","year":2011,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":323,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Conic optimization; Conic section; Semidefinite programming; Semidefinite embedding; Thriving; Mathematical optimization; Mathematics; Quadratically constrained quadratic program; Computer science; Convex optimization; Regular polygon; Quadratic programming; Sociology; Geometry","score_opus":0.11131052856995459,"score_gpt":0.442183815253248,"score_spread":0.3308732866832934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91728630","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009218873,0.00019548973,0.012673731,0.007257761,0.0026277471,0.0071516596,0.0002698706,0.00022756499,0.9686743],"genre_scores_gemma":[0.010967711,0.014851604,0.14686918,0.00021502335,0.00048004717,0.0032092773,0.00052378204,0.00020096368,0.82268244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9797885,0.00071119634,0.0019903996,0.003315342,0.011808048,0.0023865327],"domain_scores_gemma":[0.9922372,0.0006628068,0.00016622737,0.0019319096,0.0044366,0.00056526833],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.01784525,0.0008469857,0.0006910182,0.017779289,0.0037763568,0.0045353854,0.007546738,0.00033209583,0.0036474806],"category_scores_gemma":[0.004184849,0.00088414486,0.00013485273,0.006999392,0.01247581,0.007929158,0.006873775,0.002653973,0.00033842918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000386809,0.0005886304,0.000075245625,0.00012958501,0.00012617928,0.00025083224,0.0010392402,0.26824227,0.000094048984,0.72062,0.005867459,0.002579727],"study_design_scores_gemma":[0.006129406,0.001285877,0.0015166475,0.0044918125,0.00006079001,0.00015305591,0.00938713,0.61305517,0.00097217126,0.14737046,0.2122097,0.0033677511],"about_ca_topic_score_codex":0.00034526517,"about_ca_topic_score_gemma":0.0026555185,"teacher_disagreement_score":0.5732495,"about_ca_system_score_codex":0.008226146,"about_ca_system_score_gemma":0.0018284802,"threshold_uncertainty_score":0.99964696},"labels":[],"label_agreement":null},{"id":"W986320461","doi":"10.1017/cbo9780511808241.026","title":"Logarithms and Exponentials","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Logarithm; Section (typography); Base (topology); Mathematics; Exponential function; Combinatorics; Object (grammar); Arithmetic; Binary number; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence; Operating system","score_opus":0.06847074762314512,"score_gpt":0.2694702140344252,"score_spread":0.2009994664112801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W986320461","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025364083,0.00020751744,0.019807283,0.000014473043,0.0000920748,0.0005515429,0.00019541635,0.00019269282,0.97891366],"genre_scores_gemma":[0.000025287658,0.001424367,0.014868776,0.000021824677,0.00009497613,0.0000010415029,0.000032397264,0.00008780548,0.9834435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984475,0.00004682647,0.00023096627,0.00053580996,0.00042896217,0.00030992867],"domain_scores_gemma":[0.998484,0.00024234455,0.0002281207,0.0005508218,0.0002632735,0.00023145253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009877206,0.00036715504,0.00049680896,0.0002599536,0.00026134096,0.000034654626,0.00035267737,0.0004048993,0.000020509471],"category_scores_gemma":[0.00006161622,0.00043937116,0.00013399556,0.000009103791,0.00045912157,0.000108588385,0.0005658518,0.0005168138,0.000014455489],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005726371,0.000015579992,3.9021313e-7,0.00013525586,0.00015470687,0.0006779957,0.000078566896,0.000006722237,0.00001479187,0.92591685,0.07083313,0.0021087679],"study_design_scores_gemma":[0.00083492004,0.00004320028,0.0000017755142,0.00012414776,0.000113440314,0.00009942824,0.000024661873,0.0004547155,0.00021480487,0.00022574894,0.99734396,0.0005192214],"about_ca_topic_score_codex":0.000018389823,"about_ca_topic_score_gemma":8.123105e-7,"teacher_disagreement_score":0.9265108,"about_ca_system_score_codex":0.00016148285,"about_ca_system_score_gemma":0.000094781884,"threshold_uncertainty_score":0.9998058},"labels":[],"label_agreement":null}]}