{"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008139139,0.0177311,0.082725644,0.002750711,0.0021484173,0.000046209858,0.00032176045,0.0005971364,0.8928651],"genre_scores_gemma":[0.018818107,0.013982793,0.0204228,0.0011390246,0.0016828494,0.00013040521,0.00030748989,0.0006459818,0.9428707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976486,0.00003616766,0.00000997821,0.000046778103,0.00012445441,0.000017737095],"domain_scores_gemma":[0.99973124,0.00010710891,0.00001117422,0.000039722585,0.000094892326,0.000015799045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003390397,0.0011634977,0.00077452,0.0013542294,0.00085495884,0.0016254762,0.0007730051,0.00088794326,0.0827934],"category_scores_gemma":[0.0010353916,0.00046726834,0.00050448667,0.0012268721,0.0011353522,0.0024702626,0.0011136906,0.0020632069,0.0383017],"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.000014777454,0.000029700128,0.000061560226,0.00020499519,0.0000079385945,0.0000555627,0.00019074917,0.0021648977,0.00094160554,0.50378203,0.28453276,0.20801342],"study_design_scores_gemma":[0.0000033043882,0.000012299065,0.00010125318,0.000112664755,0.0000040167542,0.00009251292,0.000034331068,0.001430732,0.00037709635,0.24658519,0.75123817,0.0000083537625],"about_ca_topic_score_codex":0.00077165524,"about_ca_topic_score_gemma":0.0012917897,"teacher_disagreement_score":0.0827934,"about_ca_system_score_codex":0.0010383456,"about_ca_system_score_gemma":0.00067771494,"threshold_uncertainty_score":0.27697152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016051984,0.00012907051,0.99753016,0.000028496865,0.000057351273,0.000017561199,0.000011299556,0.00007178165,0.0005491148],"genre_scores_gemma":[0.14001332,0.0005285228,0.85175467,0.00014392006,0.00017538745,0.00024106601,0.0001396389,0.00021676096,0.0067867488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937195,0.00020740034,0.000044608394,0.00010473606,0.0002400452,0.000031333348],"domain_scores_gemma":[0.9987979,0.00057884085,0.00013158191,0.00011947421,0.00031231975,0.000059861115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015768124,0.00092789985,0.0014850943,0.00039216474,0.0002975894,0.0010582539,0.0018186987,0.0014650912,0.0033594319],"category_scores_gemma":[0.0038479536,0.0006214047,0.00095316884,0.00044162516,0.0007220828,0.0012987939,0.001482563,0.0016994851,0.00096417964],"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.0004545441,0.00011463175,0.0006391414,0.00056290434,0.00017130487,0.00023108069,0.0001647294,0.75085783,0.022999944,0.04101381,0.0035392572,0.17925072],"study_design_scores_gemma":[0.000008977826,0.000045535544,0.000033222215,0.0000070416568,0.000007619949,0.000028117836,0.0000027096223,0.9971084,0.0006629007,0.00095468346,0.0011335136,0.000007350598],"about_ca_topic_score_codex":0.0014640682,"about_ca_topic_score_gemma":0.0014650739,"teacher_disagreement_score":0.0033594319,"about_ca_system_score_codex":0.00032905984,"about_ca_system_score_gemma":0.00095187157,"threshold_uncertainty_score":0.011238456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011691619,0.023379045,0.7091895,0.0011999577,0.0008107462,0.00006502117,0.00028038726,0.0009352741,0.2629709],"genre_scores_gemma":[0.035513073,0.03554081,0.6464558,0.0006918285,0.0013587121,0.00036536908,0.00069210236,0.0016939385,0.27768832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959403,0.00007110171,0.000014678532,0.00006368291,0.00023776547,0.000018839935],"domain_scores_gemma":[0.99958843,0.00022352985,0.000017835764,0.000067623005,0.000088562236,0.000014036857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058854424,0.001558605,0.0010937027,0.0010409441,0.00052623724,0.0021525186,0.0014684874,0.0011179195,0.028145714],"category_scores_gemma":[0.0019264375,0.0009327364,0.00063573755,0.0028591768,0.0010308832,0.0028546087,0.00086582254,0.0030380115,0.013081856],"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.000029180237,0.00005812217,0.0000663001,0.00047559352,0.00002837109,0.000033064876,0.00006692616,0.025652556,0.0012995856,0.34745836,0.10633318,0.5184987],"study_design_scores_gemma":[0.000021104528,0.000026574766,0.00023041364,0.0003188695,0.00003339032,0.00017887447,0.00003399305,0.073966354,0.0021915867,0.5904649,0.33250636,0.000027566659],"about_ca_topic_score_codex":0.0009230065,"about_ca_topic_score_gemma":0.0021259796,"teacher_disagreement_score":0.028145714,"about_ca_system_score_codex":0.00090882,"about_ca_system_score_gemma":0.0011794745,"threshold_uncertainty_score":0.09415674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013697074,0.00005692872,0.9974281,0.00005250164,0.00002635315,0.000011436793,0.0000071812274,0.00012840347,0.0009193996],"genre_scores_gemma":[0.25531757,0.000370781,0.73422104,0.00019974586,0.00012376615,0.00033966158,0.00012709886,0.00026274272,0.009037663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995123,0.00018074317,0.000014185753,0.0000545303,0.00019660465,0.000041613606],"domain_scores_gemma":[0.9991912,0.00042633267,0.000055955537,0.00006310684,0.00022534667,0.000037948386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011579992,0.00065921806,0.0010656005,0.00042703183,0.0005902,0.0005822745,0.001141334,0.00072838564,0.0033070873],"category_scores_gemma":[0.0024046516,0.0003493478,0.00045763337,0.0005209816,0.0009539234,0.0006901895,0.0012028344,0.0015368192,0.00068919006],"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.00011442583,0.000066205204,0.0004927596,0.00022743233,0.000033357122,0.00013226358,0.00014016578,0.7818667,0.0055572204,0.07408506,0.0038610385,0.13342339],"study_design_scores_gemma":[0.0000057254733,0.000009589955,0.000017102531,0.0000030869708,0.000001670698,0.000009378173,0.0000029399728,0.99530375,0.00044063487,0.0034886238,0.0007140613,0.000003413858],"about_ca_topic_score_codex":0.0044994946,"about_ca_topic_score_gemma":0.0027983645,"teacher_disagreement_score":0.0044994946,"about_ca_system_score_codex":0.00055961363,"about_ca_system_score_gemma":0.0016948486,"threshold_uncertainty_score":0.011063278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046438905,0.006357818,0.31831682,0.0015526679,0.0016775749,0.000059690887,0.0006029843,0.0013951203,0.66539353],"genre_scores_gemma":[0.07434864,0.00800997,0.1410885,0.00060977915,0.0016921076,0.00014229737,0.0012561412,0.0013449203,0.7715076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997919,0.000024472038,0.0000063490015,0.000056717814,0.00009973271,0.000020791762],"domain_scores_gemma":[0.9998117,0.00004355449,0.000011183424,0.00006218471,0.000057771515,0.000013560677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021712357,0.00090228673,0.0007413201,0.00076451496,0.0007478027,0.0014974009,0.00066779414,0.00045162567,0.04171574],"category_scores_gemma":[0.0008775523,0.0004009777,0.0004493463,0.0017947579,0.0007626663,0.002116542,0.0007747104,0.0022275015,0.017997608],"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.00002924107,0.00003183425,0.00006005832,0.000118104785,0.00001298701,0.000023389444,0.00007438333,0.0036819857,0.0012512204,0.54971313,0.16867267,0.27633098],"study_design_scores_gemma":[0.000009846224,0.000022779604,0.00025120578,0.000039562092,0.000013383637,0.00013981748,0.00003256782,0.010430966,0.0018106526,0.53600055,0.45123333,0.000015263706],"about_ca_topic_score_codex":0.0009048467,"about_ca_topic_score_gemma":0.0019426107,"teacher_disagreement_score":0.04171574,"about_ca_system_score_codex":0.0011123922,"about_ca_system_score_gemma":0.0009961203,"threshold_uncertainty_score":0.13955307},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016535982,0.2896804,0.041159432,0.026424982,0.018784983,0.00004866407,0.0003809065,0.00044509556,0.62142193],"genre_scores_gemma":[0.02278595,0.1460444,0.0174857,0.005575668,0.02341491,0.0001782376,0.0004747014,0.0007668335,0.7832736],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936146,0.00017318275,0.000029859539,0.00007229831,0.00033127755,0.000031856387],"domain_scores_gemma":[0.99841475,0.0008273245,0.00008249825,0.00019604799,0.0003544754,0.00012490839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010146222,0.0014328907,0.0014675866,0.002996028,0.0013783744,0.0037215266,0.0007204222,0.0012460777,0.029715229],"category_scores_gemma":[0.004189602,0.0005352821,0.00046773272,0.005376889,0.0021332512,0.004734542,0.0013700717,0.0029654698,0.013991591],"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.000016709333,0.000022392633,0.00010034065,0.00021531757,0.000012240674,0.000014496954,0.00012855703,0.0011815483,0.0001420964,0.19382474,0.6634498,0.14089175],"study_design_scores_gemma":[0.000005273712,0.000013934242,0.00036811322,0.00027263782,0.00001084455,0.000053636086,0.00007860652,0.0010034033,0.00010196071,0.16910559,0.82897675,0.000009343871],"about_ca_topic_score_codex":0.0013071807,"about_ca_topic_score_gemma":0.003348518,"teacher_disagreement_score":0.029715229,"about_ca_system_score_codex":0.0018827216,"about_ca_system_score_gemma":0.0014423397,"threshold_uncertainty_score":0.099407375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010559322,0.0025895867,0.9032842,0.004797777,0.005884675,0.00026113619,0.00049840286,0.00052530825,0.07159963],"genre_scores_gemma":[0.21277921,0.005847272,0.6560984,0.0041721687,0.006039214,0.0007400298,0.0013410462,0.001966715,0.11101598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998511,0.00038760874,0.000091069036,0.00023125295,0.0006240984,0.00015495265],"domain_scores_gemma":[0.99869627,0.00072706037,0.000039144503,0.00026044034,0.00020055682,0.000076437995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015806389,0.0015120562,0.0018429997,0.0013540257,0.0015516263,0.0024472566,0.001766654,0.0011255575,0.013029023],"category_scores_gemma":[0.0051690154,0.00074829644,0.004153793,0.0016727399,0.002423437,0.004810515,0.005899329,0.008546064,0.0033499985],"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.0001646865,0.00024119642,0.00018504374,0.00035492005,0.0000737917,0.00030663586,0.00040735758,0.014558586,0.003383025,0.84724545,0.026863268,0.10621604],"study_design_scores_gemma":[0.00003053335,0.000069608235,0.00015623707,0.000044815464,0.000038497266,0.00019110974,0.00007885518,0.02650952,0.0020866643,0.93043673,0.040323272,0.00003421377],"about_ca_topic_score_codex":0.0021789942,"about_ca_topic_score_gemma":0.0021189908,"teacher_disagreement_score":0.013029023,"about_ca_system_score_codex":0.0008312074,"about_ca_system_score_gemma":0.00110263,"threshold_uncertainty_score":0.043586373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048981616,0.20878863,0.31314868,0.0035921787,0.0012916559,0.00006461924,0.00028796657,0.0005782857,0.4673498],"genre_scores_gemma":[0.16632791,0.24754652,0.2777587,0.0027285966,0.0049067214,0.00057154824,0.0007530043,0.0006892051,0.29871774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997284,0.00006646041,0.000011633199,0.000039712322,0.00013825581,0.000015565678],"domain_scores_gemma":[0.99962866,0.00024866103,0.000018900786,0.00003684452,0.00005293284,0.000013989845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041406738,0.0016387774,0.0013367669,0.0010303947,0.000512699,0.0018622634,0.0009890962,0.0010221609,0.008103172],"category_scores_gemma":[0.001553835,0.00059893273,0.0006817241,0.003568369,0.0017654562,0.001981171,0.0010450593,0.0030065204,0.003663505],"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.000028484365,0.000061351624,0.0001443448,0.0006687127,0.000031765063,0.00016125446,0.00016888078,0.010588926,0.0011812709,0.7110754,0.114126645,0.16176295],"study_design_scores_gemma":[0.00001435524,0.000027230393,0.00055362325,0.00017673665,0.000021595646,0.0003996218,0.00006305358,0.02011762,0.0003919029,0.8233391,0.1548743,0.00002084701],"about_ca_topic_score_codex":0.0014680304,"about_ca_topic_score_gemma":0.0019495552,"teacher_disagreement_score":0.008103172,"about_ca_system_score_codex":0.0008861029,"about_ca_system_score_gemma":0.0005552179,"threshold_uncertainty_score":0.027107775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12257929,0.0024110964,0.35661557,0.0063188197,0.0017913074,0.00010926649,0.000911918,0.00055559096,0.50870717],"genre_scores_gemma":[0.6725965,0.0016541816,0.05296916,0.001397154,0.0010797656,0.0002090231,0.0012340364,0.00066509465,0.2681951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996123,0.00011711563,0.000015519807,0.000086446285,0.00010516766,0.000063542],"domain_scores_gemma":[0.99932265,0.00020416976,0.000071531984,0.000109175344,0.00015469133,0.00013777387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005845304,0.00083648524,0.0006927499,0.0013344403,0.0010085539,0.002459166,0.0008448235,0.0011654239,0.029455468],"category_scores_gemma":[0.0026849092,0.00036883252,0.0006636205,0.00076694036,0.0013363837,0.0041569583,0.0025840816,0.0035371582,0.003508258],"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.000023657401,0.000026569345,0.000052104562,0.000030038871,0.0000064389374,0.000016788556,0.000041838848,0.001178834,0.00023345365,0.98125976,0.0068676635,0.0102627715],"study_design_scores_gemma":[0.0000098511755,0.0000127410385,0.000064138374,0.0000131582265,0.000004989534,0.0000596161,0.00004141697,0.009601025,0.00020758175,0.98153406,0.0084462995,0.000005094202],"about_ca_topic_score_codex":0.00025991694,"about_ca_topic_score_gemma":0.0003157206,"teacher_disagreement_score":0.029455468,"about_ca_system_score_codex":0.00083386776,"about_ca_system_score_gemma":0.00036475257,"threshold_uncertainty_score":0.09853828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003653321,0.00005106901,0.9940328,0.00008562838,0.00002408906,0.000042654454,0.000028674425,0.00022053326,0.0018611932],"genre_scores_gemma":[0.07338588,0.00010370575,0.9228226,0.00007545373,0.00004097984,0.00016727725,0.00022821761,0.00021804338,0.0029577683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920684,0.00017434734,0.000039350434,0.00016888464,0.00032614986,0.00008452479],"domain_scores_gemma":[0.99825734,0.0010853396,0.00009559024,0.00020672279,0.000279836,0.00007515963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641325,0.0010141901,0.0013418889,0.0013350004,0.0007301989,0.0015579351,0.0021793873,0.0017091946,0.00774025],"category_scores_gemma":[0.0051659,0.0009024724,0.0014023768,0.0017009516,0.0010682172,0.0015090398,0.002614451,0.004075406,0.0013075573],"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.00025887328,0.0002458827,0.00068327616,0.00022046395,0.00007424862,0.00011535582,0.0002328319,0.3169681,0.006837622,0.13947219,0.010141436,0.5247497],"study_design_scores_gemma":[0.00004813532,0.00005112683,0.00011476625,0.000013284841,0.000011668483,0.00003624225,0.000024266456,0.9644319,0.0012468938,0.031161176,0.0028499577,0.000010646417],"about_ca_topic_score_codex":0.003284077,"about_ca_topic_score_gemma":0.003675471,"teacher_disagreement_score":0.00774025,"about_ca_system_score_codex":0.001024753,"about_ca_system_score_gemma":0.0016122544,"threshold_uncertainty_score":0.025893748},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002301384,0.00015866963,0.9951733,0.00013286113,0.0000629458,0.000050957377,0.000045149696,0.00026093348,0.0018137938],"genre_scores_gemma":[0.03269897,0.00017044686,0.9636718,0.00009115249,0.00006700198,0.00020481713,0.00018245308,0.00020950592,0.0027037938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992907,0.00020745568,0.00002862278,0.00009681411,0.0003129761,0.000063506355],"domain_scores_gemma":[0.9983032,0.0010967812,0.00006838516,0.000098397366,0.0003421851,0.00009101101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144356,0.0012120792,0.0017784847,0.0012060325,0.00094824174,0.0012349307,0.0017655593,0.0022583522,0.0077540143],"category_scores_gemma":[0.004658587,0.0010093839,0.0007664801,0.0019592775,0.0009093366,0.0015135068,0.0018652271,0.0035222585,0.0016081019],"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.00032922308,0.00025782973,0.0003733341,0.00022469743,0.0000833788,0.00010874417,0.000111894966,0.41691712,0.004449695,0.06466906,0.01577404,0.49670103],"study_design_scores_gemma":[0.00005032679,0.000036010555,0.00006467827,0.000015742595,0.000009746008,0.000022097724,0.000008438965,0.9774302,0.00056572305,0.019647533,0.00214192,0.000007607512],"about_ca_topic_score_codex":0.0037484306,"about_ca_topic_score_gemma":0.005178853,"teacher_disagreement_score":0.0077540143,"about_ca_system_score_codex":0.00079341565,"about_ca_system_score_gemma":0.0017832681,"threshold_uncertainty_score":0.025939822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013299176,0.00013548492,0.99394774,0.00009705007,0.000032847565,0.000031656327,0.00003066385,0.00021292808,0.0041815876],"genre_scores_gemma":[0.08046191,0.00033838282,0.90678537,0.00020662587,0.00007713067,0.0004058592,0.00020638954,0.00042533455,0.011093082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995671,0.00014723864,0.0000120054165,0.000048510872,0.00020431925,0.000020742431],"domain_scores_gemma":[0.9996698,0.00012851052,0.000034875142,0.00004186163,0.0001003856,0.000024626932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075727055,0.00074485753,0.00071222574,0.0006005307,0.00044815347,0.00061505375,0.0007293817,0.0009751502,0.0047239056],"category_scores_gemma":[0.0017025288,0.0003439498,0.0005383352,0.0005996653,0.0007721853,0.00064392586,0.0014326738,0.001409961,0.0020174973],"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.000067071196,0.00006475036,0.00039037384,0.00032455588,0.00004596571,0.0001988435,0.00017758775,0.61643165,0.016545642,0.13090514,0.014211932,0.22063644],"study_design_scores_gemma":[0.00001250728,0.000022805261,0.000041632095,0.000015801248,0.0000029640412,0.000038465332,0.000007484296,0.98586094,0.0012636908,0.0071401186,0.0055836895,0.000009970399],"about_ca_topic_score_codex":0.0016658717,"about_ca_topic_score_gemma":0.0016916735,"teacher_disagreement_score":0.0047239056,"about_ca_system_score_codex":0.00048440124,"about_ca_system_score_gemma":0.0010600621,"threshold_uncertainty_score":0.01580304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011577695,0.00011135519,0.9976554,0.000050544913,0.00001924079,0.000013015059,0.000009318118,0.00006748683,0.0009159164],"genre_scores_gemma":[0.11822394,0.00076572626,0.87257385,0.00017457208,0.00012432835,0.00044840536,0.00016131703,0.00017423759,0.0073535633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.00016521785,0.000031767504,0.0000800359,0.00023154804,0.000045742458],"domain_scores_gemma":[0.99907756,0.0006006313,0.00006772039,0.0000821477,0.00014146618,0.00003039352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122577,0.0009776563,0.00092271715,0.00076653634,0.00047356373,0.0012070817,0.0011208672,0.0012616935,0.003597388],"category_scores_gemma":[0.0045469403,0.0004907491,0.00061190984,0.0011100676,0.00088708237,0.0016402949,0.001305248,0.0016344251,0.0008511256],"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.0001040703,0.000058534242,0.0006475929,0.00022360189,0.00009102104,0.0000780582,0.000103712235,0.39908102,0.0036661879,0.25806618,0.0048193634,0.3330606],"study_design_scores_gemma":[0.000022339214,0.000029860745,0.000056531822,0.000014288658,0.000007042282,0.000033284377,0.000008356061,0.9514448,0.0008353619,0.043605734,0.003935789,0.000006559235],"about_ca_topic_score_codex":0.0016164574,"about_ca_topic_score_gemma":0.0019204918,"teacher_disagreement_score":0.003597388,"about_ca_system_score_codex":0.00048940064,"about_ca_system_score_gemma":0.0008420961,"threshold_uncertainty_score":0.012034416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002421588,0.066718265,0.19222648,0.0070158164,0.0055942466,0.000074671654,0.001844302,0.000923682,0.723181],"genre_scores_gemma":[0.039948244,0.042793177,0.039658416,0.0014115828,0.0019332803,0.00019396617,0.0020211092,0.0006993762,0.87134093],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974114,0.000040092757,0.0000115169,0.000055408425,0.00013291498,0.000018930821],"domain_scores_gemma":[0.99981433,0.000056557907,0.000010979988,0.000035063254,0.000063450316,0.000019708395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048838055,0.00088797463,0.00085004396,0.00050131354,0.00033493128,0.0012994553,0.0006230414,0.0007833384,0.07927204],"category_scores_gemma":[0.0010688035,0.0002522868,0.0005197468,0.00084515446,0.0006116938,0.0011582705,0.00096144143,0.0017209781,0.03478158],"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.000043230404,0.000043137497,0.00021967007,0.0007220496,0.00006123816,0.00007112761,0.00005977641,0.014092673,0.0017713371,0.21880648,0.4752222,0.28888708],"study_design_scores_gemma":[0.000013837143,0.000044743283,0.0006895474,0.00024249058,0.000020763613,0.00017637426,0.00004382175,0.021567,0.00096827286,0.17956774,0.7966464,0.000019068559],"about_ca_topic_score_codex":0.0012056798,"about_ca_topic_score_gemma":0.0020210305,"teacher_disagreement_score":0.07927204,"about_ca_system_score_codex":0.00081247,"about_ca_system_score_gemma":0.0008098388,"threshold_uncertainty_score":0.26519138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003803048,0.000057738333,0.9941208,0.00010262027,0.000052935084,0.00005363328,0.000025252964,0.00037365785,0.0014103071],"genre_scores_gemma":[0.08809227,0.000079618774,0.9065218,0.00011622485,0.00003058707,0.00026599414,0.00012265716,0.00014612048,0.0046247635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961996,0.00009146698,0.000019063345,0.00008558734,0.00014193269,0.000042016483],"domain_scores_gemma":[0.99911934,0.00040847904,0.00006720286,0.0000914332,0.00024715706,0.000066477536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009038067,0.00065652706,0.0010736627,0.0005881896,0.0008811674,0.00078777707,0.001553517,0.0017082243,0.007511001],"category_scores_gemma":[0.0028954176,0.0005854548,0.00047711175,0.00071628735,0.0007027377,0.00095985335,0.0016158582,0.0020655242,0.001316739],"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.0003767984,0.00027963993,0.000861666,0.00018150902,0.00007273691,0.00014797856,0.00016956104,0.44363803,0.008781691,0.060048148,0.007967577,0.47747466],"study_design_scores_gemma":[0.00004706957,0.00004361543,0.00007744956,0.000011259804,0.00000641127,0.000031126165,0.000007851553,0.9903543,0.0009475935,0.0069306334,0.0015321609,0.000010520676],"about_ca_topic_score_codex":0.004042245,"about_ca_topic_score_gemma":0.00585579,"teacher_disagreement_score":0.007511001,"about_ca_system_score_codex":0.0006938319,"about_ca_system_score_gemma":0.0028183064,"threshold_uncertainty_score":0.025126755},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081495405,0.6017474,0.31917083,0.003442023,0.0021730564,0.00011441787,0.0003276075,0.00073099224,0.071478754],"genre_scores_gemma":[0.017054703,0.75018716,0.19206344,0.001754734,0.0048846575,0.00036717264,0.00081854546,0.0006023396,0.032267183],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983248,0.0004170176,0.00015962191,0.00027032045,0.00076108595,0.00006720458],"domain_scores_gemma":[0.9986098,0.00082737725,0.00005597532,0.00013425668,0.00032343785,0.00004921616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002007779,0.0018834386,0.001507633,0.002546832,0.00059757713,0.0032433218,0.0016548723,0.0022363288,0.0116016595],"category_scores_gemma":[0.003762213,0.0010812965,0.0013368306,0.0046513686,0.0014712589,0.0042447764,0.0017768778,0.004044749,0.010965703],"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.00004530417,0.0001419191,0.00046149234,0.0029785887,0.00010524518,0.00012406307,0.00014433655,0.019069204,0.0008535016,0.25939056,0.054828458,0.66185725],"study_design_scores_gemma":[0.000013633911,0.00008032429,0.00048584986,0.0011515007,0.000029069564,0.0004758546,0.000055524724,0.015765542,0.0005270466,0.16339695,0.8179787,0.00003994112],"about_ca_topic_score_codex":0.0017636335,"about_ca_topic_score_gemma":0.0009794702,"teacher_disagreement_score":0.0116016595,"about_ca_system_score_codex":0.0012868942,"about_ca_system_score_gemma":0.001593699,"threshold_uncertainty_score":0.038811386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013566104,0.000045234883,0.9977558,0.000029834035,0.000010117842,0.000020047777,0.000009474353,0.00009618364,0.00067674485],"genre_scores_gemma":[0.07330146,0.00014445434,0.92345136,0.000058992417,0.000026808584,0.00025708927,0.00012821656,0.00017937867,0.0024522566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994306,0.00017447256,0.000032021733,0.00007678165,0.00023419998,0.000051830284],"domain_scores_gemma":[0.9992981,0.00035556266,0.00006297686,0.00008179477,0.00015204566,0.00004948365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457554,0.0009038312,0.001088751,0.0006091017,0.0005731439,0.0006979719,0.0014868822,0.0011888682,0.0040318496],"category_scores_gemma":[0.0026649283,0.0004917903,0.0008882065,0.00078413973,0.0007837091,0.0014532469,0.0018963955,0.0019485339,0.00121558],"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.00017339096,0.00016152661,0.0004607479,0.00032513318,0.00005455286,0.00021489538,0.00017984265,0.7187539,0.008309719,0.09556373,0.0033752448,0.17242739],"study_design_scores_gemma":[0.000016649652,0.00001927406,0.000045189656,0.000007839286,0.0000038875696,0.00004162761,0.000005755047,0.989626,0.00079055683,0.008066853,0.0013685011,0.000007996769],"about_ca_topic_score_codex":0.0022028363,"about_ca_topic_score_gemma":0.0017629822,"teacher_disagreement_score":0.0040318496,"about_ca_system_score_codex":0.0006567708,"about_ca_system_score_gemma":0.0018947708,"threshold_uncertainty_score":0.013487816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02381614,0.008747508,0.88064736,0.004928158,0.0008065071,0.00006781046,0.00020448281,0.000086241474,0.080695786],"genre_scores_gemma":[0.55713946,0.028916487,0.31873307,0.0041530738,0.0064322776,0.0007544902,0.0015583995,0.0005816021,0.08173109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973646,0.0014329411,0.00009829435,0.0003297692,0.0006220961,0.00015230168],"domain_scores_gemma":[0.98988664,0.007768923,0.000584822,0.00048899,0.00090711477,0.0003635615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004931242,0.0022098622,0.0022110792,0.0023049125,0.0015476362,0.0036340714,0.0023357314,0.002698562,0.006877935],"category_scores_gemma":[0.020774486,0.0012541518,0.0014623397,0.0054178988,0.0063527226,0.00771416,0.003316865,0.008195143,0.0009576803],"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.000024120354,0.000049923325,0.00017205201,0.0001093868,0.00002491216,0.0000628083,0.000106241154,0.022988547,0.00017782341,0.96088886,0.004695298,0.010700067],"study_design_scores_gemma":[0.0000072423672,0.000015273132,0.00012321616,0.000032120606,0.000008488036,0.000034409743,0.000028062994,0.066892095,0.00004845938,0.9290331,0.0037654862,0.000011900913],"about_ca_topic_score_codex":0.0035113117,"about_ca_topic_score_gemma":0.0030151543,"teacher_disagreement_score":0.006877935,"about_ca_system_score_codex":0.002092012,"about_ca_system_score_gemma":0.0012805235,"threshold_uncertainty_score":0.026079237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001971811,0.0015721202,0.9725219,0.000570294,0.00015256056,0.000027865817,0.000076651726,0.00016696578,0.022939904],"genre_scores_gemma":[0.32202554,0.009463043,0.55011994,0.0011608264,0.0012074416,0.00082586746,0.0006767496,0.0016680006,0.112852596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898595,0.0004379833,0.000036911857,0.00013276785,0.00031473103,0.000091573165],"domain_scores_gemma":[0.9985355,0.0009923737,0.000094045376,0.00014395016,0.00016394237,0.000070170165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020036527,0.0025258402,0.0019682671,0.0008534901,0.00070336787,0.0025002146,0.0019136391,0.0019048622,0.008694461],"category_scores_gemma":[0.006963611,0.0014890601,0.0018918989,0.0015784287,0.0023938934,0.00393628,0.0030254277,0.0072109653,0.0021651478],"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.000039209368,0.000043414388,0.000059248774,0.00013330644,0.000028734707,0.000040163315,0.000106263426,0.25054705,0.00087717926,0.709059,0.009419147,0.029647298],"study_design_scores_gemma":[0.000009283204,0.000018614019,0.000034552755,0.000024516203,0.000009234524,0.000015555132,0.000020299058,0.5836495,0.00020990669,0.41054806,0.005447994,0.000012462525],"about_ca_topic_score_codex":0.0033144823,"about_ca_topic_score_gemma":0.0037517725,"teacher_disagreement_score":0.008694461,"about_ca_system_score_codex":0.0019805187,"about_ca_system_score_gemma":0.0013563585,"threshold_uncertainty_score":0.029085875},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010533425,0.00023178705,0.9870832,0.00017371029,0.000024652212,0.00004364093,0.000017346256,0.00007718374,0.001815153],"genre_scores_gemma":[0.3029319,0.0007579889,0.6882754,0.00023513747,0.00013279637,0.0004997551,0.00011873619,0.00018127343,0.006867063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993506,0.00024353688,0.000029577332,0.0001044856,0.0002236387,0.00004823224],"domain_scores_gemma":[0.9981651,0.0010917323,0.0002539666,0.0001371409,0.00021949127,0.00013267038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019424352,0.0009985414,0.00094647624,0.0009183598,0.0004633991,0.0012438223,0.0014291805,0.0015077105,0.0027253248],"category_scores_gemma":[0.0054861074,0.00084353524,0.00084951514,0.00056167174,0.001742369,0.002439791,0.0029800197,0.0029609194,0.00044441933],"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.00013802695,0.00014357228,0.0008277408,0.00043582582,0.000059913564,0.00015791987,0.0003217707,0.60530853,0.0065030106,0.32401583,0.0016279479,0.06045994],"study_design_scores_gemma":[0.000014896932,0.00006686709,0.000059674174,0.000018154455,0.000004185799,0.000031568557,0.000017315042,0.96379405,0.0007986662,0.034059852,0.0011256861,0.000009083111],"about_ca_topic_score_codex":0.0006010878,"about_ca_topic_score_gemma":0.0007669777,"teacher_disagreement_score":0.0027253248,"about_ca_system_score_codex":0.0005824863,"about_ca_system_score_gemma":0.00089929224,"threshold_uncertainty_score":0.010272741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024675976,0.00296949,0.8392628,0.0025640933,0.00065791764,0.00006176872,0.00017079648,0.00010387683,0.12953325],"genre_scores_gemma":[0.52843916,0.008111728,0.39803508,0.001916463,0.0021220038,0.00036717934,0.00051582255,0.00067118555,0.05982136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844295,0.0006221514,0.000089017856,0.00023136403,0.00053136976,0.00008320269],"domain_scores_gemma":[0.997834,0.0014085872,0.00012615859,0.00020462392,0.0003199988,0.00010661953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019700383,0.0010010136,0.0012263095,0.0016494156,0.0013156591,0.003554329,0.0020349051,0.0013370113,0.0085774325],"category_scores_gemma":[0.008464179,0.0006000681,0.0013083845,0.0019211794,0.0057239826,0.0071138535,0.004438533,0.005378542,0.001060894],"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.0000066658968,0.0000071240174,0.000023597973,0.00002059536,0.0000034177758,0.000006608184,0.000064164604,0.0020008201,0.000099324185,0.9891556,0.00054578704,0.008066301],"study_design_scores_gemma":[0.0000042158063,0.000010677272,0.00003846743,0.000010243087,0.0000021261699,0.000014324566,0.000026203501,0.0073277773,0.00005642156,0.9894638,0.0030415126,0.000004197341],"about_ca_topic_score_codex":0.0015061157,"about_ca_topic_score_gemma":0.0019182494,"teacher_disagreement_score":0.0085774325,"about_ca_system_score_codex":0.0013348808,"about_ca_system_score_gemma":0.00076363824,"threshold_uncertainty_score":0.028694391},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30935282,0.0014847022,0.62077165,0.0031201886,0.0004810729,0.00015944336,0.0003616523,0.00043383503,0.06383467],"genre_scores_gemma":[0.8525236,0.00092088425,0.07634731,0.00079670816,0.0004573121,0.0003533913,0.0003589025,0.00039238506,0.06784945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999049,0.00037293104,0.000041912346,0.0001598224,0.00022072265,0.00015564295],"domain_scores_gemma":[0.99221474,0.0045615938,0.0008410531,0.00054214627,0.00078612554,0.0010543017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022439994,0.00076935155,0.00150323,0.0020727748,0.0020893477,0.0033549087,0.002518895,0.0022966298,0.0085405465],"category_scores_gemma":[0.01888084,0.0007199994,0.0012284116,0.0008483131,0.0033196325,0.0034030783,0.004623396,0.0031096851,0.0009378251],"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.000041137453,0.00001829533,0.00017464778,0.00003814169,0.000013134634,0.00003593908,0.00008751117,0.008271252,0.00049340754,0.9873532,0.0012654593,0.0022079088],"study_design_scores_gemma":[0.000034096713,0.00003326858,0.00025945707,0.000020966687,0.000012916129,0.000080468315,0.0000692618,0.120064855,0.00047189379,0.87698287,0.0019450544,0.000024846962],"about_ca_topic_score_codex":0.0011568845,"about_ca_topic_score_gemma":0.0010336643,"teacher_disagreement_score":0.0085405465,"about_ca_system_score_codex":0.001712864,"about_ca_system_score_gemma":0.0012955404,"threshold_uncertainty_score":0.02857095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03686388,0.025739338,0.13382517,0.010597218,0.002421614,0.000059065394,0.0006679414,0.00037742936,0.7894484],"genre_scores_gemma":[0.70805246,0.022660747,0.041068695,0.0029652382,0.0052107754,0.00013388977,0.0007125009,0.00025784978,0.21893793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966407,0.000074231415,0.000015204745,0.00007249823,0.00013742402,0.000036602207],"domain_scores_gemma":[0.99938667,0.00035552503,0.000048834714,0.000055640096,0.00010693198,0.00004633779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048522867,0.0005742624,0.00039658503,0.0013195744,0.0008417492,0.0019484736,0.0006278666,0.00063612236,0.016744029],"category_scores_gemma":[0.0017586047,0.00030242366,0.00036682255,0.0017824798,0.0026808237,0.0034603951,0.0010856553,0.0030040573,0.0026605332],"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.0000040707705,0.000004533255,0.000022371161,0.00003355969,0.0000010843432,0.000016969085,0.00007954664,0.00019411497,0.00019766248,0.98997235,0.004066813,0.0054068584],"study_design_scores_gemma":[0.0000025222448,0.0000121074445,0.0001403569,0.000022053195,0.0000019244085,0.000103680184,0.000054600565,0.0005846554,0.00017785755,0.9483377,0.05055689,0.000005742341],"about_ca_topic_score_codex":0.0007222648,"about_ca_topic_score_gemma":0.00050134724,"teacher_disagreement_score":0.016744029,"about_ca_system_score_codex":0.000988361,"about_ca_system_score_gemma":0.0005320523,"threshold_uncertainty_score":0.0560143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017001816,0.000085412634,0.9969926,0.000046956542,0.000024559384,0.000018918283,0.000008748796,0.00006223354,0.0010603141],"genre_scores_gemma":[0.12742232,0.0002854684,0.86814487,0.000115846,0.000074024785,0.0002999507,0.000091766444,0.00032191846,0.003243729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988418,0.00059464853,0.000036411493,0.00011903103,0.00034884116,0.0000592661],"domain_scores_gemma":[0.9981462,0.0011848564,0.00009878013,0.00016931462,0.00032244617,0.00007841437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040788646,0.0010832843,0.001352389,0.0007557642,0.0005165942,0.000937178,0.0014021931,0.0011800072,0.0025883745],"category_scores_gemma":[0.0072556436,0.00068393245,0.0008991765,0.00054341526,0.0018291649,0.0011881426,0.0027349123,0.0026024734,0.00088558084],"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.000185271,0.00012476798,0.0006933435,0.00037200237,0.00008051493,0.0001351438,0.00019009736,0.7824449,0.0065600043,0.12182457,0.00268779,0.08470161],"study_design_scores_gemma":[0.000011651244,0.000022253793,0.00003869086,0.00001576087,0.0000048402917,0.000025757821,0.0000052683263,0.98583186,0.0010505038,0.011733039,0.0012545384,0.0000058476503],"about_ca_topic_score_codex":0.0007342436,"about_ca_topic_score_gemma":0.00061538065,"teacher_disagreement_score":0.0040788646,"about_ca_system_score_codex":0.00057151366,"about_ca_system_score_gemma":0.0011164752,"threshold_uncertainty_score":0.021571338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005861174,0.00010993915,0.99781847,0.0000429275,0.000040742907,0.000025439862,0.00001962375,0.00023347013,0.0011232749],"genre_scores_gemma":[0.032161124,0.00040889022,0.96064484,0.00010917238,0.00007877323,0.00017714582,0.00009491097,0.00025223618,0.0060729636],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943274,0.00017161749,0.000023643304,0.000061363564,0.0002760251,0.000034617555],"domain_scores_gemma":[0.9994968,0.00024627426,0.000039944283,0.00006692989,0.00011827034,0.000031770043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007640546,0.00075497845,0.00076149125,0.0005934358,0.00031811386,0.000734266,0.0011719608,0.00088003837,0.0046467306],"category_scores_gemma":[0.0017589068,0.0003590935,0.0006597058,0.000630497,0.00063968083,0.0009259785,0.001210502,0.0011815656,0.0020021163],"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.00014328423,0.00018275439,0.0007829715,0.0005983155,0.00017495632,0.0003359948,0.00020262392,0.2782274,0.028219383,0.09801431,0.022492738,0.57062525],"study_design_scores_gemma":[0.000039684208,0.00007697513,0.00022547223,0.000031650296,0.00001588317,0.00017831831,0.000017677672,0.9448152,0.0071959016,0.016467044,0.0309014,0.00003484007],"about_ca_topic_score_codex":0.0013349386,"about_ca_topic_score_gemma":0.0021839007,"teacher_disagreement_score":0.0046467306,"about_ca_system_score_codex":0.00025233682,"about_ca_system_score_gemma":0.0011517347,"threshold_uncertainty_score":0.015544832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004053128,0.00010425373,0.9928893,0.00005699388,0.000027451995,0.000044430923,0.000030296022,0.00008612297,0.0027080367],"genre_scores_gemma":[0.15881781,0.00036347457,0.8324926,0.00021397887,0.00006150004,0.00047120094,0.00013398977,0.00011829462,0.007327153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.00012766429,0.000028040862,0.00007569495,0.00019404665,0.000031299503],"domain_scores_gemma":[0.9996977,0.00010896298,0.000041757932,0.00007335297,0.00006279114,0.000015564947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079844304,0.0007069329,0.0006722946,0.00052227755,0.00042765652,0.0005025414,0.0012147635,0.0011306017,0.0055924435],"category_scores_gemma":[0.0013568618,0.00033386075,0.00069823134,0.0006976421,0.000667736,0.0010779091,0.0009956876,0.0010098548,0.0010388701],"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.00018019255,0.00016402903,0.00076940464,0.0005625041,0.00008980697,0.000448424,0.00019864082,0.5038792,0.05755463,0.2721118,0.0034185003,0.16062291],"study_design_scores_gemma":[0.00003704801,0.00007814729,0.00019448402,0.000023005166,0.000006955547,0.000117040436,0.000008446767,0.9639879,0.004678883,0.023587326,0.0072615114,0.000019293695],"about_ca_topic_score_codex":0.00052822835,"about_ca_topic_score_gemma":0.0013440077,"teacher_disagreement_score":0.0055924435,"about_ca_system_score_codex":0.0003079042,"about_ca_system_score_gemma":0.00078423944,"threshold_uncertainty_score":0.018708587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082104787,0.00014306819,0.99571,0.00014794832,0.000027602362,0.000027823358,0.000028426159,0.000093513845,0.00300062],"genre_scores_gemma":[0.0906069,0.0012919533,0.89833856,0.00033197386,0.0002795447,0.00071676646,0.00027995638,0.00029332293,0.007861111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974865,0.0014559414,0.00010486587,0.00024711085,0.00060549524,0.00010013674],"domain_scores_gemma":[0.9942931,0.0043007084,0.00035470733,0.00040455008,0.00048767403,0.00015927365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033442369,0.0019130117,0.00124909,0.0009087663,0.0005723916,0.0021998377,0.0017359533,0.0011445485,0.00947323],"category_scores_gemma":[0.005567559,0.0010325236,0.0014568911,0.001193268,0.0029492318,0.0021016733,0.002758854,0.006488386,0.0019594457],"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.000039623228,0.00012360545,0.00020427788,0.00038092153,0.00006239961,0.00010188589,0.00023006304,0.46286255,0.0022773268,0.4808144,0.004537007,0.04836587],"study_design_scores_gemma":[0.000017630875,0.000034527413,0.000026581767,0.00003083733,0.0000052080595,0.000030564133,0.000032750962,0.8458392,0.0006122646,0.14822502,0.0051355697,0.000009820513],"about_ca_topic_score_codex":0.00089161814,"about_ca_topic_score_gemma":0.0013155005,"teacher_disagreement_score":0.00947323,"about_ca_system_score_codex":0.0010456981,"about_ca_system_score_gemma":0.0013545409,"threshold_uncertainty_score":0.031691134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20538542,0.012516961,0.69648993,0.0068991664,0.0007356746,0.00017385457,0.0013121316,0.0006568114,0.07583011],"genre_scores_gemma":[0.93108094,0.0060535786,0.048660424,0.00070062664,0.0009841885,0.0002619749,0.0007790953,0.00033601435,0.011143232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700445,0.001050942,0.00021845737,0.0006694786,0.0007989246,0.000257713],"domain_scores_gemma":[0.99088013,0.0047114063,0.0010880274,0.00149101,0.001114698,0.0007147462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030632026,0.00068929093,0.0012153722,0.0023025342,0.0009303258,0.0028583452,0.0013117447,0.0015621908,0.0028758186],"category_scores_gemma":[0.019065933,0.00040125416,0.0006762159,0.0012584295,0.005096302,0.004883477,0.0039906804,0.0024622339,0.0007799489],"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.00006427799,0.000012382011,0.0010299054,0.0001438442,0.000044955512,0.00013001052,0.00021792298,0.013282598,0.0030113969,0.9651683,0.0027382495,0.014156036],"study_design_scores_gemma":[0.000013370473,0.000078851466,0.0018288827,0.000063027706,0.000022287788,0.00037372697,0.00015240775,0.042234685,0.0018987334,0.9319496,0.021339746,0.000044626173],"about_ca_topic_score_codex":0.0006254382,"about_ca_topic_score_gemma":0.00028064704,"teacher_disagreement_score":0.0030632026,"about_ca_system_score_codex":0.0012448226,"about_ca_system_score_gemma":0.00058220734,"threshold_uncertainty_score":0.016199946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017095478,0.0019431829,0.94877934,0.0019055922,0.00026442716,0.00006453374,0.00014064019,0.0001228725,0.029683996],"genre_scores_gemma":[0.5269744,0.009280885,0.41563106,0.0017295909,0.0030002347,0.00071900367,0.0007001765,0.0008893841,0.04107526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989373,0.0004071382,0.00005707345,0.00016358188,0.00033975116,0.00009523056],"domain_scores_gemma":[0.9932417,0.005048199,0.00045868062,0.00037286806,0.0006631304,0.00021531906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039314874,0.0013303643,0.00096619636,0.0014939834,0.0012326703,0.002472075,0.0019664948,0.0016775132,0.007362368],"category_scores_gemma":[0.015280947,0.00075669243,0.0015917782,0.0023101862,0.0031592578,0.006055383,0.0025764094,0.0055049052,0.000694278],"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.00003955955,0.00004621849,0.00024453242,0.00013688068,0.000023414308,0.00007322594,0.00023597959,0.037907876,0.0018714858,0.9277884,0.003460181,0.028172227],"study_design_scores_gemma":[0.000024515843,0.000066094064,0.0003058231,0.000041000985,0.00002020584,0.000116648545,0.00007817891,0.41495177,0.0010039252,0.57798505,0.0053804526,0.000026368116],"about_ca_topic_score_codex":0.0019863446,"about_ca_topic_score_gemma":0.0018214145,"teacher_disagreement_score":0.007362368,"about_ca_system_score_codex":0.0013100179,"about_ca_system_score_gemma":0.0014789448,"threshold_uncertainty_score":0.024629593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001251364,0.0002045404,0.9943856,0.00009746363,0.00013858109,0.000026760405,0.00007259686,0.0002327206,0.0035904497],"genre_scores_gemma":[0.030183513,0.00049906253,0.95772696,0.00023340898,0.0001160214,0.00020631711,0.0002842133,0.00072980183,0.010020694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923134,0.00029781644,0.000044225573,0.000109146415,0.00028281147,0.000034713015],"domain_scores_gemma":[0.9991124,0.00030495867,0.00007807496,0.00017860957,0.000257564,0.00006823211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452322,0.0013078967,0.0009118176,0.0009652532,0.00046857054,0.0013654038,0.0012181667,0.0013152787,0.008336661],"category_scores_gemma":[0.0028797416,0.0006802019,0.00093586056,0.0008655013,0.0011442117,0.0016649845,0.0018314586,0.0017922694,0.0043901624],"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.00018727095,0.000086513675,0.0006333549,0.0005245751,0.00013560604,0.00032707013,0.00020723391,0.24849682,0.03010111,0.4988683,0.019863047,0.20056906],"study_design_scores_gemma":[0.000024984804,0.00008194023,0.000115998424,0.000046823374,0.000018648265,0.00019080422,0.000011996829,0.9129029,0.0060532005,0.044705007,0.03581374,0.000033871627],"about_ca_topic_score_codex":0.0007308062,"about_ca_topic_score_gemma":0.0009546002,"teacher_disagreement_score":0.008336661,"about_ca_system_score_codex":0.00043752245,"about_ca_system_score_gemma":0.0008547776,"threshold_uncertainty_score":0.027888894},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006283184,0.002730474,0.13802984,0.0011680844,0.0014404602,0.00003347995,0.00043139549,0.00071166916,0.84917134],"genre_scores_gemma":[0.20181295,0.0054043634,0.06803392,0.0010565085,0.0016138494,0.00015525523,0.001632296,0.0016535734,0.7186373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997042,0.000058512873,0.000014550053,0.00006759299,0.00013279617,0.000022410037],"domain_scores_gemma":[0.9998735,0.000032191263,0.0000054021457,0.000032970373,0.000045516037,0.0000104531655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031900615,0.0007824204,0.00063495093,0.0013738903,0.00096539984,0.0022465044,0.00057730434,0.0004358551,0.027649682],"category_scores_gemma":[0.0005451464,0.000364037,0.00058078655,0.00088600535,0.0016532793,0.004430866,0.001822561,0.0027937803,0.010389707],"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.000007707712,0.000008958146,0.000021197695,0.00004981907,0.000004267813,0.00002132454,0.000098669996,0.00024152665,0.0006923673,0.9567741,0.014685807,0.027394138],"study_design_scores_gemma":[0.0000055454466,0.0000119680135,0.000109636974,0.00004216865,0.000008942282,0.00022020031,0.000058204223,0.0016326036,0.0018085403,0.70107347,0.2950159,0.000012770843],"about_ca_topic_score_codex":0.0003137953,"about_ca_topic_score_gemma":0.00049770565,"teacher_disagreement_score":0.027649682,"about_ca_system_score_codex":0.001182224,"about_ca_system_score_gemma":0.00052254373,"threshold_uncertainty_score":0.09249735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006389156,0.00024757022,0.98353124,0.00032418582,0.00023876646,0.00008245467,0.00008513261,0.00032406065,0.008777414],"genre_scores_gemma":[0.16636607,0.00035181156,0.81707394,0.00021177481,0.0001800892,0.00029366126,0.00028639854,0.0003905513,0.014845752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.0004918422,0.00005760589,0.0001765969,0.00033646077,0.000114585055],"domain_scores_gemma":[0.998672,0.00067775365,0.00006504186,0.00017788129,0.0002958532,0.000111589485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002220654,0.0013214867,0.0021461996,0.0010427068,0.0009892946,0.0016976949,0.0025769693,0.0016586407,0.01531081],"category_scores_gemma":[0.0041648694,0.0007900098,0.0009066478,0.001579855,0.0012000432,0.0015550443,0.0018293808,0.00323019,0.0029398703],"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.0008226558,0.0002966884,0.00038611377,0.0003469611,0.00007885615,0.00014669335,0.00015696454,0.61275476,0.0035363417,0.19615033,0.017339213,0.16798449],"study_design_scores_gemma":[0.00007454732,0.00008414184,0.00005215351,0.000020501646,0.000011686445,0.00005751079,0.000019826091,0.9634959,0.0008723131,0.031638768,0.0036585506,0.000014118782],"about_ca_topic_score_codex":0.0021446776,"about_ca_topic_score_gemma":0.0024124691,"teacher_disagreement_score":0.01531081,"about_ca_system_score_codex":0.0014026574,"about_ca_system_score_gemma":0.0021784615,"threshold_uncertainty_score":0.05121982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017778933,0.0028071292,0.9532828,0.0012466322,0.00028085627,0.00006768778,0.00006679897,0.00007616659,0.024392946],"genre_scores_gemma":[0.6610938,0.009680791,0.29999238,0.00057194853,0.0011252668,0.00071359315,0.00037636756,0.00037765366,0.026068302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992855,0.0003471561,0.000026897296,0.000084125786,0.0001895052,0.000066786],"domain_scores_gemma":[0.9991166,0.00046908142,0.000091690985,0.00008182392,0.00014916479,0.000091676986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021613562,0.0012438163,0.0013313973,0.0011864591,0.0010907946,0.0023781091,0.00092094124,0.0009986702,0.003623188],"category_scores_gemma":[0.0044908933,0.0004442495,0.0013182316,0.001237414,0.003373982,0.0029985213,0.0031678681,0.0030688085,0.00069846364],"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.00000981983,0.00001129638,0.000111270754,0.00007103197,0.000015159566,0.000025786183,0.000047628797,0.02792473,0.00031851238,0.96306014,0.00094991154,0.007454748],"study_design_scores_gemma":[0.000008812486,0.000032061424,0.00006835642,0.00002960913,0.0000062098393,0.000035092868,0.000034106626,0.2004776,0.0002654835,0.7957469,0.0032843063,0.0000114618515],"about_ca_topic_score_codex":0.0008157868,"about_ca_topic_score_gemma":0.00075791165,"teacher_disagreement_score":0.003623188,"about_ca_system_score_codex":0.00095470255,"about_ca_system_score_gemma":0.0012984402,"threshold_uncertainty_score":0.012120783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009575013,0.00019847522,0.9749921,0.00017015499,0.000058737292,0.00011940269,0.00026792227,0.012365608,0.002252538],"genre_scores_gemma":[0.09978524,0.00009830948,0.8938463,0.00015930776,0.000025643723,0.00045267193,0.00092018384,0.0019730832,0.00273924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933344,0.00013973188,0.00003850018,0.00013187324,0.00026962193,0.00008690004],"domain_scores_gemma":[0.9991511,0.00039675427,0.000056032964,0.00009564673,0.00022911943,0.000071370356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011628906,0.0013329599,0.0010360552,0.0006600067,0.00059193705,0.00082954066,0.0016060806,0.0012801009,0.0089583965],"category_scores_gemma":[0.004397538,0.00061063946,0.0008551445,0.0010724984,0.00065277517,0.0010018647,0.0013203708,0.0016824307,0.0041273716],"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.00051695533,0.0003198036,0.0018497299,0.0004535029,0.00015593147,0.0004058488,0.00029577804,0.58622456,0.015346695,0.018674744,0.037764516,0.33799207],"study_design_scores_gemma":[0.00007584767,0.00003739462,0.00010935529,0.000007975917,0.0000057106645,0.000035243385,0.000021219232,0.9925458,0.0018042505,0.0025933492,0.002753167,0.000010702514],"about_ca_topic_score_codex":0.0110318065,"about_ca_topic_score_gemma":0.016704319,"teacher_disagreement_score":0.0110318065,"about_ca_system_score_codex":0.0007781909,"about_ca_system_score_gemma":0.0029588044,"threshold_uncertainty_score":0.029968858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001125638,0.0026700294,0.97689474,0.0022172534,0.00038636965,0.000043968055,0.00010640173,0.0008997995,0.015655756],"genre_scores_gemma":[0.0932051,0.0063517606,0.8381323,0.0014240429,0.0011581671,0.0004925873,0.0003711732,0.0022775822,0.05658731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872524,0.0005113333,0.000041600426,0.00015661673,0.000492899,0.00007235813],"domain_scores_gemma":[0.9987124,0.0007537795,0.00015856819,0.00013055137,0.00018284502,0.000061831335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019456762,0.0017773311,0.0012103025,0.0009032566,0.00092603225,0.0020083082,0.0018150165,0.002745445,0.010715957],"category_scores_gemma":[0.0054279314,0.0011807571,0.0016554751,0.0011883843,0.002641536,0.0032613783,0.0028353338,0.00443598,0.0036133684],"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.000073437375,0.00003425015,0.000530173,0.00043348203,0.00009074006,0.0003241147,0.0004671807,0.34937206,0.0017137126,0.51580495,0.046343923,0.08481201],"study_design_scores_gemma":[0.000020177726,0.000028856464,0.00019821232,0.00013593526,0.00001753939,0.00008670916,0.000048053967,0.72812146,0.000914356,0.1936527,0.07672571,0.000050309576],"about_ca_topic_score_codex":0.0113591915,"about_ca_topic_score_gemma":0.009564516,"teacher_disagreement_score":0.0113591915,"about_ca_system_score_codex":0.0014953947,"about_ca_system_score_gemma":0.0018304243,"threshold_uncertainty_score":0.03584844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046332967,0.041953746,0.8215121,0.0031666234,0.0022874477,0.00003186224,0.0002589168,0.000433269,0.12572266],"genre_scores_gemma":[0.3173191,0.0794664,0.38486794,0.004144214,0.011306868,0.00059601344,0.00063956995,0.0013774021,0.2002824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.00014733494,0.000030300365,0.00010859881,0.0002535894,0.000036591628],"domain_scores_gemma":[0.9985953,0.0009511234,0.00006831305,0.00014626568,0.00019858393,0.000040369447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001697749,0.0012390877,0.0013894963,0.0014282729,0.00059628015,0.0023415543,0.0011851817,0.0015684688,0.007642683],"category_scores_gemma":[0.004637455,0.0005154946,0.0011852488,0.0016622735,0.0022459358,0.0034337153,0.0011857186,0.00552625,0.0024608113],"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.000011154839,0.000018272096,0.00005271076,0.00012724032,0.000017764865,0.000029266808,0.000062164974,0.0037443563,0.0008425337,0.9497399,0.0100171305,0.035337575],"study_design_scores_gemma":[0.0000060476586,0.000012523311,0.0001464508,0.000037872414,0.000010206394,0.000078957055,0.000012570072,0.017750738,0.00039978456,0.95662975,0.0249034,0.000011627855],"about_ca_topic_score_codex":0.0008407575,"about_ca_topic_score_gemma":0.0007992675,"teacher_disagreement_score":0.007642683,"about_ca_system_score_codex":0.0014366283,"about_ca_system_score_gemma":0.000728679,"threshold_uncertainty_score":0.025567353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032634616,0.0001787597,0.9946991,0.00009679037,0.000035707842,0.000016197011,0.000016390515,0.00003760438,0.0016558943],"genre_scores_gemma":[0.19139206,0.000628509,0.80181885,0.0001725344,0.00014025302,0.00014814858,0.00009236731,0.00013754422,0.0054698167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928206,0.0003058782,0.000027389122,0.00008314144,0.00025896195,0.000042597734],"domain_scores_gemma":[0.9993718,0.00025971612,0.000058306785,0.000084151514,0.00017555231,0.000050522773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840281,0.0009741798,0.00072844845,0.00086228404,0.0004938241,0.00090137543,0.0013177583,0.0012503195,0.0019283098],"category_scores_gemma":[0.002114039,0.00035735796,0.00082923315,0.0010986102,0.0012210138,0.0019973246,0.0014279765,0.0015794309,0.00054055155],"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.00009980133,0.00008866842,0.00047927708,0.00017452316,0.00003716075,0.00008065364,0.00012609188,0.6712062,0.008356286,0.19789298,0.0036784108,0.11777998],"study_design_scores_gemma":[0.0000067127376,0.000057965757,0.0000861615,0.000010666706,0.0000039900933,0.000031867443,0.000013392194,0.96532947,0.0014642508,0.0300445,0.0029404194,0.0000105786],"about_ca_topic_score_codex":0.0018250445,"about_ca_topic_score_gemma":0.0018320306,"teacher_disagreement_score":0.0019283098,"about_ca_system_score_codex":0.0007304689,"about_ca_system_score_gemma":0.0011925009,"threshold_uncertainty_score":0.008377194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02906694,0.0005586063,0.95790106,0.00044568072,0.00021882137,0.000046888716,0.000033468077,0.00029183793,0.011436705],"genre_scores_gemma":[0.7047071,0.0005126468,0.28235197,0.0003352046,0.00014853512,0.00029545612,0.000078297366,0.000359266,0.011211459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.00013538363,0.000010755011,0.00003358716,0.000107051215,0.00002393068],"domain_scores_gemma":[0.99899703,0.0006466068,0.000052911706,0.000098845485,0.00015507363,0.000049534407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096903567,0.00048514517,0.00081574987,0.0004209075,0.00045284326,0.00094678154,0.00085646525,0.00088659563,0.0048820176],"category_scores_gemma":[0.005904667,0.00036884026,0.00030444257,0.00042806496,0.0008925501,0.0013066404,0.0013953429,0.0011587363,0.00061315944],"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.00020006411,0.0000829978,0.00059835974,0.0001278803,0.000036892554,0.00007332778,0.000086779364,0.8236041,0.0037650976,0.10028327,0.0031986027,0.06794259],"study_design_scores_gemma":[0.00000739855,0.000010261207,0.000023140665,0.000004497198,0.0000018799193,0.0000056952144,0.0000029041134,0.9931132,0.00020451532,0.0062005525,0.0004238266,0.0000021404564],"about_ca_topic_score_codex":0.0013263917,"about_ca_topic_score_gemma":0.001284904,"teacher_disagreement_score":0.0048820176,"about_ca_system_score_codex":0.0004219657,"about_ca_system_score_gemma":0.00062635535,"threshold_uncertainty_score":0.01633197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001487805,0.0002616837,0.99653554,0.00006909167,0.00003846312,0.000023401635,0.000015087589,0.0001406076,0.0014283228],"genre_scores_gemma":[0.075730085,0.0009718133,0.9158699,0.00013260411,0.00015121784,0.00036500316,0.00017726327,0.0002718367,0.006330244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892706,0.0003888683,0.000045951136,0.0001234508,0.00046040554,0.00005430776],"domain_scores_gemma":[0.9986236,0.00081797317,0.0001256469,0.00017316086,0.00021640753,0.0000432278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001583002,0.0010339308,0.00094128365,0.0008490563,0.0003819948,0.0010613974,0.0014479706,0.001071421,0.0034690946],"category_scores_gemma":[0.005891222,0.000591619,0.0011983973,0.00093875756,0.0012749139,0.0014139141,0.0019956517,0.0033915108,0.0011816196],"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.000120962766,0.00008239391,0.00065854,0.00035954564,0.000088318324,0.00006606018,0.00018880112,0.5356079,0.004560392,0.24578133,0.0041983263,0.20828746],"study_design_scores_gemma":[0.000013803125,0.000027780943,0.000046560053,0.00001815695,0.000005951678,0.000018203747,0.0000069882885,0.9697641,0.0007130125,0.025875011,0.0035038248,0.0000066114085],"about_ca_topic_score_codex":0.0008075401,"about_ca_topic_score_gemma":0.0009356786,"teacher_disagreement_score":0.0034690946,"about_ca_system_score_codex":0.0006254436,"about_ca_system_score_gemma":0.00091826665,"threshold_uncertainty_score":0.011605203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038955247,0.00048151682,0.9947743,0.00014390661,0.000098079465,0.00005270413,0.00003495304,0.00036514064,0.003659758],"genre_scores_gemma":[0.032348026,0.001492701,0.9562243,0.00036700588,0.00023243838,0.00063322886,0.00023061656,0.0008938555,0.007577779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836963,0.0006335419,0.00007036274,0.00016991941,0.00067412463,0.00008245126],"domain_scores_gemma":[0.99836844,0.0009025219,0.000095712545,0.00028135185,0.00030667032,0.000045301607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018446327,0.0019326995,0.0014080052,0.0016415914,0.0010223131,0.0014190179,0.0015912139,0.0018926221,0.012226305],"category_scores_gemma":[0.0077817435,0.0010021557,0.0013153026,0.002441192,0.0021961692,0.0017727629,0.002963843,0.0042435834,0.0060447366],"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.000092157934,0.000078043246,0.00035973973,0.0004954105,0.000078323385,0.00014222976,0.00022733919,0.22654384,0.002880874,0.5003546,0.016159244,0.2525882],"study_design_scores_gemma":[0.000058349826,0.000042954314,0.00007775144,0.00009608724,0.000019959234,0.000102912214,0.00003255387,0.6590077,0.0018583705,0.28936115,0.049321573,0.000020689698],"about_ca_topic_score_codex":0.0037733372,"about_ca_topic_score_gemma":0.0037278256,"teacher_disagreement_score":0.012226305,"about_ca_system_score_codex":0.0009716455,"about_ca_system_score_gemma":0.0016694671,"threshold_uncertainty_score":0.040901065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029454296,0.0014644099,0.9180783,0.0010339757,0.00033571207,0.000107829546,0.00030855948,0.00027515183,0.048941888],"genre_scores_gemma":[0.34884334,0.0016994964,0.59433323,0.0008293212,0.00068268663,0.00059932563,0.0011446717,0.0005879787,0.05127991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.00058553915,0.0000519217,0.00018548517,0.00041497193,0.00014159376],"domain_scores_gemma":[0.9978492,0.0013715819,0.00018794365,0.0001543166,0.0002568231,0.00018014565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023841339,0.0017806336,0.0012633975,0.002006775,0.0014628837,0.0033703842,0.0018829653,0.0015291527,0.008260891],"category_scores_gemma":[0.007855499,0.00096847076,0.0009459588,0.002250969,0.0024026975,0.0034738139,0.0022069237,0.005295396,0.00090872607],"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.00008053933,0.000034317003,0.00016477803,0.00011213313,0.000021388209,0.00003404144,0.00008830857,0.021453327,0.000638295,0.93958473,0.0043603056,0.033427864],"study_design_scores_gemma":[0.000017034154,0.000026011037,0.00011947938,0.000034163288,0.000011036604,0.000038858885,0.0000277081,0.06315036,0.0002795394,0.9316743,0.0046113124,0.0000102987115],"about_ca_topic_score_codex":0.002133038,"about_ca_topic_score_gemma":0.0029950151,"teacher_disagreement_score":0.008260891,"about_ca_system_score_codex":0.0021318812,"about_ca_system_score_gemma":0.00097174733,"threshold_uncertainty_score":0.027635396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0296839,0.00092619983,0.9520572,0.0015817999,0.00031725882,0.00016242164,0.0003860434,0.00016907114,0.014716232],"genre_scores_gemma":[0.57051116,0.0030236458,0.39853734,0.0016972626,0.00091034954,0.0015477521,0.0010368626,0.00069295184,0.022042792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654335,0.0016466109,0.00020978726,0.0006576281,0.0006283989,0.00031419512],"domain_scores_gemma":[0.9746798,0.017242743,0.0012608697,0.00096865045,0.004421378,0.0014264673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009506902,0.0025611522,0.0025859443,0.002624114,0.0019390171,0.0041953255,0.0031555132,0.002996146,0.008960196],"category_scores_gemma":[0.039658904,0.0021210657,0.0023491136,0.0019836228,0.0059802933,0.01095691,0.0062107034,0.010724499,0.0014235387],"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.00020338602,0.00008014544,0.0003551685,0.00029076886,0.00004835368,0.00015697342,0.00038539688,0.02381557,0.003183994,0.9573456,0.0028649934,0.011269792],"study_design_scores_gemma":[0.00008325738,0.00013045952,0.00024970557,0.00012592932,0.000038742135,0.00014216808,0.00018322468,0.16810104,0.0020978285,0.8257829,0.0029990813,0.000065834254],"about_ca_topic_score_codex":0.0009317167,"about_ca_topic_score_gemma":0.0011468633,"teacher_disagreement_score":0.009506902,"about_ca_system_score_codex":0.0016649503,"about_ca_system_score_gemma":0.0035752777,"threshold_uncertainty_score":0.05027789},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026127648,0.0011281219,0.9391246,0.0019007659,0.00019908794,0.000035098943,0.00020965542,0.00015119475,0.031123918],"genre_scores_gemma":[0.69250244,0.0022307504,0.27247286,0.0010283483,0.00091713795,0.0003296139,0.00080941187,0.00047294592,0.029236492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.0005467509,0.000053334104,0.00016001734,0.00028933838,0.00009583253],"domain_scores_gemma":[0.9978523,0.0011441539,0.00017755231,0.00028672646,0.00030651444,0.00023264633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002456891,0.0011907927,0.001335972,0.001547013,0.0011092615,0.003592515,0.0017377432,0.001217165,0.005703254],"category_scores_gemma":[0.007820705,0.0006900596,0.001269191,0.0014809106,0.0030565131,0.006311529,0.003552136,0.0064619617,0.00064609153],"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.000010260097,0.000012095738,0.00003999197,0.000020317377,0.0000041719395,0.000006586155,0.000033968045,0.0017421129,0.00012763498,0.99305034,0.0008342387,0.004118279],"study_design_scores_gemma":[0.0000035479402,0.0000065920253,0.000022538781,0.000007700269,0.0000026258253,0.000009262132,0.000012016225,0.013633507,0.00006408509,0.98523235,0.0010030209,0.0000028690092],"about_ca_topic_score_codex":0.00076684577,"about_ca_topic_score_gemma":0.0009341261,"teacher_disagreement_score":0.005703254,"about_ca_system_score_codex":0.0012156988,"about_ca_system_score_gemma":0.0010661397,"threshold_uncertainty_score":0.019079268},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045037314,0.00021481387,0.88385147,0.0009562363,0.00044306036,0.00015556352,0.00042387875,0.0006482268,0.0682694],"genre_scores_gemma":[0.5921814,0.00061647943,0.34258905,0.00086680724,0.00055323396,0.00039041272,0.001427395,0.0013858345,0.059989303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992762,0.00020434981,0.000028913755,0.00011448193,0.00027075436,0.000105258914],"domain_scores_gemma":[0.99956197,0.00015440494,0.000034764496,0.00010469685,0.00009530547,0.000048760856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007477133,0.000862722,0.00094867335,0.0006531193,0.0005938904,0.0018136995,0.0012258966,0.00061263255,0.008577839],"category_scores_gemma":[0.0018089525,0.00033137086,0.0016615512,0.0006098037,0.0011410541,0.0019608336,0.002059993,0.0030283143,0.0019170501],"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.00007531278,0.00018559527,0.00008349494,0.00009300349,0.000024950969,0.00008419877,0.000114045164,0.021487303,0.0022040058,0.9156582,0.011274091,0.048715957],"study_design_scores_gemma":[0.000029433791,0.0000556184,0.00006297379,0.00001364284,0.000014093011,0.00006768433,0.00004060442,0.112179995,0.002078866,0.87928754,0.0061538774,0.000015606727],"about_ca_topic_score_codex":0.0006621523,"about_ca_topic_score_gemma":0.0008974432,"teacher_disagreement_score":0.008577839,"about_ca_system_score_codex":0.00068118767,"about_ca_system_score_gemma":0.0010844117,"threshold_uncertainty_score":0.028695762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021099593,0.00022951319,0.99257094,0.0004978134,0.00009143956,0.000017354023,0.000034337412,0.000038182035,0.00441054],"genre_scores_gemma":[0.13673703,0.0011356127,0.82286716,0.00078009744,0.00086700683,0.000321204,0.000253876,0.0003976162,0.036640476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988556,0.0005319312,0.000057414327,0.00019671115,0.00028304718,0.000075343654],"domain_scores_gemma":[0.99881566,0.0006416823,0.00008646946,0.00013718645,0.00020873101,0.00011032897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003403685,0.0010791374,0.0012884961,0.0008627155,0.0009471772,0.0020870098,0.0029525638,0.0020421068,0.007391117],"category_scores_gemma":[0.0060411366,0.00089189544,0.0012141499,0.001182031,0.0018136926,0.004827939,0.004119455,0.0032959871,0.0010925647],"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.00005951387,0.00006962623,0.00018231229,0.00010358618,0.000074317744,0.00009391203,0.000112328125,0.105951436,0.0020112328,0.8392683,0.0055346927,0.04653865],"study_design_scores_gemma":[0.000019985402,0.000032721888,0.000068007255,0.000016644197,0.000019193161,0.00005369484,0.000014311898,0.64711547,0.000459132,0.34680912,0.0053727725,0.000018990768],"about_ca_topic_score_codex":0.0020289922,"about_ca_topic_score_gemma":0.0027556103,"teacher_disagreement_score":0.007391117,"about_ca_system_score_codex":0.0013179403,"about_ca_system_score_gemma":0.002009665,"threshold_uncertainty_score":0.024725795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07344269,0.0007278159,0.9115822,0.0005680374,0.0003643064,0.00055960054,0.00017381106,0.0013255884,0.0112559395],"genre_scores_gemma":[0.20849791,0.0002030729,0.7867105,0.00032341768,0.00006617277,0.00027896784,0.0002665237,0.00023075912,0.0034226791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903727,0.0004131407,0.000034241635,0.00009166386,0.00019130606,0.00023237633],"domain_scores_gemma":[0.9988128,0.0006831145,0.000079905534,0.00011795699,0.00014710928,0.00015904228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161503,0.0010833564,0.0018276201,0.0018094315,0.001360014,0.0011777197,0.0024599745,0.0017144849,0.006017327],"category_scores_gemma":[0.0037965055,0.0011121252,0.001207854,0.0018474928,0.0013840247,0.0020136635,0.0033902714,0.0021132564,0.00072369486],"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.0012942557,0.00076974893,0.002542857,0.00033678132,0.00013083116,0.0002941946,0.00039490394,0.47015443,0.005682565,0.061175797,0.012779423,0.44444427],"study_design_scores_gemma":[0.00023286718,0.00031494792,0.00036290596,0.00004670598,0.00005041709,0.00008674045,0.00011837791,0.96788603,0.0020977303,0.02495303,0.0038085503,0.000041676794],"about_ca_topic_score_codex":0.005582447,"about_ca_topic_score_gemma":0.012070923,"teacher_disagreement_score":0.006017327,"about_ca_system_score_codex":0.001016216,"about_ca_system_score_gemma":0.00238339,"threshold_uncertainty_score":0.020129979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011599107,0.00012863008,0.99550086,0.000065619286,0.000024598812,0.000022564764,0.00003039402,0.00035710988,0.0027103866],"genre_scores_gemma":[0.036657073,0.00044518325,0.9595508,0.000058338388,0.000037770482,0.00028902866,0.00012230169,0.0002155214,0.0026240337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.00013432116,0.00001999335,0.00005050189,0.0001595511,0.000023077413],"domain_scores_gemma":[0.9992385,0.0004910559,0.00003257196,0.000102102036,0.000119478485,0.000016354077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379404,0.000689533,0.0006716771,0.00071676605,0.00065819384,0.00069853757,0.0008868851,0.00066252914,0.0077527924],"category_scores_gemma":[0.0024717117,0.00036341886,0.0007594429,0.0012839908,0.00067350786,0.0008814382,0.0009078143,0.0023623023,0.002374216],"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.00011075933,0.00013677361,0.0005344213,0.00072766247,0.000119560376,0.0002468048,0.00030877927,0.30753928,0.020330796,0.26194566,0.012231873,0.39576766],"study_design_scores_gemma":[0.000051424635,0.000052881136,0.000217484,0.00006497751,0.00002027109,0.00015405125,0.000030527564,0.89264387,0.0055431905,0.07410954,0.027090205,0.000021604286],"about_ca_topic_score_codex":0.0022801787,"about_ca_topic_score_gemma":0.0020680388,"teacher_disagreement_score":0.0077527924,"about_ca_system_score_codex":0.00033823634,"about_ca_system_score_gemma":0.0010023606,"threshold_uncertainty_score":0.02593571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07204594,0.0010583325,0.902495,0.00087008387,0.00013531394,0.000050339015,0.0001243716,0.000092436225,0.023128184],"genre_scores_gemma":[0.8558984,0.0010397988,0.11571394,0.0003880991,0.00014243812,0.00013316637,0.00019611858,0.000089172565,0.026398856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997062,0.00008814183,0.000008247243,0.000062848594,0.00008794074,0.000046551962],"domain_scores_gemma":[0.999845,0.000048264108,0.000028770852,0.000016023641,0.000040415955,0.000021572017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005115299,0.00094971055,0.00064295385,0.0003852825,0.00045627152,0.00096245465,0.0007775575,0.0010513945,0.0024791828],"category_scores_gemma":[0.00072130945,0.00022957282,0.0004769137,0.0005313658,0.0015662541,0.0011236159,0.0012438697,0.00083114835,0.00018844925],"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.000045751724,0.000038910686,0.00036515822,0.000162793,0.000034807006,0.00025953472,0.00012305018,0.3598388,0.008510519,0.6086944,0.0023349407,0.01959128],"study_design_scores_gemma":[0.000007527377,0.000029987548,0.00017807381,0.000013559776,0.000007782337,0.000048867758,0.00003732772,0.8673364,0.0013855428,0.1269012,0.0040420364,0.000011694085],"about_ca_topic_score_codex":0.00314711,"about_ca_topic_score_gemma":0.003161469,"teacher_disagreement_score":0.00314711,"about_ca_system_score_codex":0.0013514613,"about_ca_system_score_gemma":0.00085367996,"threshold_uncertainty_score":0.00980556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18620911,0.0005598135,0.77896285,0.0008278104,0.00005000827,0.000072533185,0.00016762379,0.00016760269,0.032982744],"genre_scores_gemma":[0.94411135,0.0004314859,0.048395548,0.00010099742,0.00008317128,0.00012745445,0.00029348332,0.00009711021,0.0063593094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864966,0.0003234125,0.00008044556,0.00028257165,0.00043760086,0.00022627214],"domain_scores_gemma":[0.9969036,0.0014430311,0.00041357792,0.00031884422,0.0006918568,0.0002290772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021259382,0.00082809693,0.00074844476,0.00171023,0.0006591741,0.0031431003,0.000914849,0.00097072264,0.0057476405],"category_scores_gemma":[0.0076295557,0.0004245595,0.0007871088,0.0009608068,0.0035337834,0.00386412,0.0021433074,0.0023419345,0.0005159004],"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.00003201646,0.000023473118,0.0006821166,0.00005863019,0.000014317678,0.00012288624,0.00018411624,0.02330136,0.004975462,0.95667416,0.0006857862,0.013245584],"study_design_scores_gemma":[0.000015157758,0.00007068329,0.0011732518,0.00005508354,0.000015362093,0.00018652123,0.00017592542,0.28061703,0.007226292,0.70506847,0.0053697373,0.000026496604],"about_ca_topic_score_codex":0.00066433806,"about_ca_topic_score_gemma":0.00036487362,"teacher_disagreement_score":0.0057476405,"about_ca_system_score_codex":0.0017955047,"about_ca_system_score_gemma":0.00080250483,"threshold_uncertainty_score":0.019227803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004391516,0.0001815313,0.9903234,0.00033037577,0.00008759873,0.00007242409,0.000096852054,0.00010172976,0.0044146576],"genre_scores_gemma":[0.1710847,0.0005834759,0.81128734,0.0005336495,0.00020630824,0.00063200947,0.0005444027,0.00059023243,0.014537916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945325,0.00022722739,0.000027361963,0.00007540326,0.0001438182,0.00007289352],"domain_scores_gemma":[0.9986363,0.00087297603,0.0000808697,0.00014881366,0.00017904482,0.00008207078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020689308,0.0013317309,0.0014834314,0.00061890477,0.0005959941,0.0018381701,0.0020003116,0.0023086842,0.007549774],"category_scores_gemma":[0.004837272,0.00087312015,0.001595353,0.0005506751,0.0014552133,0.0013129709,0.0028109497,0.0044715544,0.0011546881],"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.00010405094,0.00008560499,0.00031671688,0.00026006473,0.00005395148,0.00015079696,0.0001486112,0.87740606,0.0034055714,0.08327355,0.0025763002,0.032218754],"study_design_scores_gemma":[0.000007969652,0.000012105803,0.00001894973,0.0000090723715,0.0000037241462,0.000011742089,0.000014048804,0.9915997,0.000321567,0.0065066726,0.0014892579,0.0000052781584],"about_ca_topic_score_codex":0.004895751,"about_ca_topic_score_gemma":0.0062107323,"teacher_disagreement_score":0.007549774,"about_ca_system_score_codex":0.000951731,"about_ca_system_score_gemma":0.001871049,"threshold_uncertainty_score":0.025256455},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006960681,0.0000588121,0.998689,0.000041189036,0.000008694928,0.0000051248,0.0000047388153,0.000053735956,0.00044266283],"genre_scores_gemma":[0.22206748,0.0007696751,0.77351457,0.00018578453,0.000101607235,0.00021011046,0.00010085471,0.00014625821,0.0029035714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992506,0.00029881622,0.000037473605,0.00011978889,0.00025647474,0.00003679025],"domain_scores_gemma":[0.9983026,0.0012084962,0.0001695438,0.0000933698,0.0001941932,0.00003177011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014781817,0.0008751241,0.00094688794,0.0003759961,0.00025396116,0.0008276969,0.0007455788,0.0008994875,0.0018580261],"category_scores_gemma":[0.0023932653,0.00037696082,0.00069985655,0.00048842945,0.0010216133,0.00077935384,0.00069477677,0.0018224716,0.00032866886],"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.000045852386,0.000057398192,0.0001135832,0.00014783938,0.000037048703,0.0000691217,0.000061539125,0.8847735,0.0048152027,0.05174956,0.00081920956,0.05731012],"study_design_scores_gemma":[0.000005624626,0.000019898003,0.000012180435,0.000003719722,0.0000027838075,0.000010912558,0.0000025722893,0.9928256,0.00067105546,0.005919472,0.00052186096,0.000004323727],"about_ca_topic_score_codex":0.0010468469,"about_ca_topic_score_gemma":0.0008187548,"teacher_disagreement_score":0.0018580261,"about_ca_system_score_codex":0.00046588734,"about_ca_system_score_gemma":0.0007128606,"threshold_uncertainty_score":0.007817447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037906352,0.00023059282,0.9443552,0.0009273692,0.00010731071,0.00022013228,0.00041204013,0.00036197805,0.01547907],"genre_scores_gemma":[0.36691612,0.00040279687,0.6132897,0.00025836332,0.00013691449,0.00076235895,0.0004336231,0.00027534465,0.017524807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992735,0.00022354575,0.000028269356,0.00016318563,0.00017021684,0.00014135649],"domain_scores_gemma":[0.99813926,0.0014018927,0.0001427482,0.00005977351,0.00018531537,0.00007097739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015161198,0.0013875036,0.0013791156,0.000814641,0.00074212695,0.0020462645,0.0017032924,0.0026393447,0.008579983],"category_scores_gemma":[0.0058270767,0.0009131007,0.0008089704,0.0013476997,0.001080129,0.0017990479,0.0013789042,0.0020416705,0.0007299947],"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.0000646568,0.000071167735,0.00025715373,0.0001173943,0.0000143047855,0.00007612623,0.000057537833,0.9696423,0.00062853243,0.011437081,0.0013167075,0.016317172],"study_design_scores_gemma":[0.0000161139,0.000020443227,0.000049686878,0.000006982661,0.000005932248,0.000011053376,0.000026895728,0.9954835,0.00024453725,0.0035994067,0.00053144776,0.000004003569],"about_ca_topic_score_codex":0.013097046,"about_ca_topic_score_gemma":0.01223724,"teacher_disagreement_score":0.013097046,"about_ca_system_score_codex":0.001699748,"about_ca_system_score_gemma":0.0026005036,"threshold_uncertainty_score":0.028702855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13186938,0.0046009407,0.8334602,0.0026826162,0.0002986925,0.00014847067,0.0001740989,0.00009032313,0.026675267],"genre_scores_gemma":[0.7744511,0.004019496,0.201023,0.0006957119,0.0005822177,0.00033273874,0.00039239498,0.0002930769,0.018210394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928385,0.0004321327,0.000027318581,0.0000842595,0.000108198044,0.000064365755],"domain_scores_gemma":[0.99685633,0.0023817269,0.00017773187,0.00007593394,0.0003569239,0.00015125365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036250888,0.0018958037,0.0022501787,0.0015430584,0.0009284065,0.0022033313,0.0009789757,0.0026293758,0.0021429064],"category_scores_gemma":[0.010382836,0.0005669811,0.0009608663,0.0014949079,0.0020774798,0.0026103884,0.0016066381,0.0020360898,0.0001715987],"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.00039210814,0.00024670834,0.0012738795,0.0009720942,0.00022096263,0.00031714328,0.00044604787,0.3878448,0.011360082,0.5174227,0.005619103,0.0738844],"study_design_scores_gemma":[0.000029539735,0.00020247635,0.0010202952,0.000105231455,0.0000570475,0.00011079309,0.00012265536,0.78182,0.0014892598,0.21302056,0.0019747652,0.000047475427],"about_ca_topic_score_codex":0.0016326444,"about_ca_topic_score_gemma":0.0013817187,"teacher_disagreement_score":0.0036250888,"about_ca_system_score_codex":0.0016547558,"about_ca_system_score_gemma":0.0013130883,"threshold_uncertainty_score":0.019171536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028467832,0.00037325147,0.9651379,0.00020007789,0.000070650785,0.000054898926,0.00003214275,0.00019099505,0.0054722987],"genre_scores_gemma":[0.4783587,0.0003287519,0.51541203,0.00017636958,0.000058827372,0.00034640913,0.00015541133,0.00024564762,0.004917835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00034415946,0.000024817626,0.00006225036,0.00019807796,0.00003618973],"domain_scores_gemma":[0.99785334,0.0014517888,0.00011169629,0.00013157826,0.0003784019,0.00007316578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028246283,0.00085343764,0.0010212293,0.0009520756,0.00062095915,0.00079200644,0.0010554242,0.0015248858,0.0021046265],"category_scores_gemma":[0.007045488,0.0005899969,0.0005129368,0.0009006878,0.0012409898,0.0011968417,0.0013077472,0.0010029753,0.0003095507],"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.00016279654,0.00006302403,0.0006060046,0.000176593,0.00006280185,0.000072269606,0.00011416412,0.91152495,0.0022737572,0.034793735,0.0018406153,0.048309222],"study_design_scores_gemma":[0.000008846948,0.0000141295095,0.000050822233,0.000005531792,0.000002210946,0.000008407557,0.0000041663475,0.99579453,0.00014379686,0.0037694525,0.00019537823,0.0000026917103],"about_ca_topic_score_codex":0.0040575583,"about_ca_topic_score_gemma":0.0029928146,"teacher_disagreement_score":0.0040575583,"about_ca_system_score_codex":0.0006429474,"about_ca_system_score_gemma":0.0012290681,"threshold_uncertainty_score":0.014938295},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04240591,0.0004360541,0.94780385,0.00040963377,0.00012404926,0.00007052707,0.00010438654,0.0004934053,0.008152175],"genre_scores_gemma":[0.4313684,0.00033208154,0.554927,0.00036855252,0.000108815526,0.0002214483,0.0002850873,0.00039543572,0.011993247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00028281898,0.000039440398,0.0001152153,0.00021942564,0.00006336554],"domain_scores_gemma":[0.9982224,0.00085886277,0.00011291379,0.00053101935,0.00020055039,0.000074296266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012742486,0.0006014835,0.0017189786,0.0012237652,0.00055671623,0.0013513865,0.0018067884,0.0017636134,0.008337486],"category_scores_gemma":[0.0078072743,0.0007206959,0.0007577546,0.002142467,0.001009183,0.0034711228,0.0023642709,0.0012550983,0.001151953],"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.00073023903,0.00019548845,0.0017717424,0.00047699647,0.00022111366,0.00032198863,0.00015779618,0.22032891,0.007434571,0.37285405,0.010225863,0.38528123],"study_design_scores_gemma":[0.00009066155,0.00007070668,0.00021057621,0.000020591518,0.000030174164,0.00013412409,0.000023559014,0.76534814,0.0017404179,0.23012516,0.0021904223,0.000015463691],"about_ca_topic_score_codex":0.0005658096,"about_ca_topic_score_gemma":0.001035546,"teacher_disagreement_score":0.008337486,"about_ca_system_score_codex":0.000391501,"about_ca_system_score_gemma":0.0007611818,"threshold_uncertainty_score":0.027891695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017249112,0.000103509476,0.99214196,0.00006410326,0.000039657767,0.000045181445,0.00006580391,0.0026899215,0.0031249523],"genre_scores_gemma":[0.03719992,0.00019470887,0.9574704,0.00009690079,0.00003585244,0.0002442336,0.00035810086,0.0012180374,0.0031818866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986431,0.0004304662,0.000100154044,0.00026382747,0.00042052293,0.000142067],"domain_scores_gemma":[0.99793327,0.0009731013,0.00017562827,0.00035648956,0.0005033435,0.00005819604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017833114,0.0012284747,0.0010589407,0.00066853315,0.0007085432,0.0013294859,0.0019159429,0.0014029625,0.013195258],"category_scores_gemma":[0.0057521686,0.000640353,0.0011215295,0.0010353117,0.0007112097,0.0018387238,0.0015523718,0.0025441502,0.0050747786],"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.00036211996,0.00018109304,0.0011859107,0.00083255896,0.0001753377,0.000554086,0.0004838095,0.34710148,0.024382524,0.10028173,0.028655522,0.49580383],"study_design_scores_gemma":[0.00013262159,0.00011919408,0.00019723186,0.000083591236,0.000035844336,0.0005718737,0.00006619583,0.8925133,0.023263844,0.024221132,0.058758345,0.000036964382],"about_ca_topic_score_codex":0.002644808,"about_ca_topic_score_gemma":0.0023044837,"teacher_disagreement_score":0.013195258,"about_ca_system_score_codex":0.00032941764,"about_ca_system_score_gemma":0.002609353,"threshold_uncertainty_score":0.044142485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03184215,0.0029652335,0.9460729,0.0013989224,0.00016567034,0.000039169874,0.00005942903,0.00014156257,0.017315002],"genre_scores_gemma":[0.60853493,0.005148396,0.35554567,0.0003809456,0.0008327233,0.00025250742,0.00023574336,0.00040071667,0.028668387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993806,0.00033360778,0.000013681649,0.00006118185,0.0001622795,0.000048680737],"domain_scores_gemma":[0.9983311,0.0011721706,0.00019275493,0.000054127577,0.00015675976,0.00009304944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014351262,0.001002949,0.00075055246,0.0015311511,0.0007940336,0.0013884975,0.00073518493,0.0009398789,0.0028585396],"category_scores_gemma":[0.0059578065,0.0004994672,0.0006318676,0.0009839437,0.003096092,0.0025725486,0.0017093006,0.002377886,0.0005789944],"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.000040761588,0.000036923495,0.0003638863,0.00012524039,0.000020550704,0.00007189378,0.00021993434,0.082793474,0.00088797667,0.8907551,0.0019612482,0.02272299],"study_design_scores_gemma":[0.000019221561,0.00005717789,0.00017381547,0.0000485908,0.000007402097,0.00005345539,0.000041014486,0.36228126,0.0005202193,0.6323352,0.0044496567,0.000012943249],"about_ca_topic_score_codex":0.0014125576,"about_ca_topic_score_gemma":0.0007647338,"teacher_disagreement_score":0.0028585396,"about_ca_system_score_codex":0.0010755407,"about_ca_system_score_gemma":0.00076264417,"threshold_uncertainty_score":0.00956279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039729454,0.00053301465,0.9552655,0.00024363936,0.000024917708,0.000056332447,0.00007216493,0.00013827608,0.0039365934],"genre_scores_gemma":[0.92662936,0.00044478962,0.069754116,0.000109835695,0.00004333673,0.00016756922,0.00013609037,0.00015226826,0.0025627518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963883,0.0023583292,0.00008098183,0.0002930562,0.0006320043,0.00024723998],"domain_scores_gemma":[0.9895957,0.008980568,0.00035451082,0.000457494,0.0004907588,0.000120945675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005993505,0.0012026728,0.0022316151,0.0018324291,0.0006561352,0.0022243974,0.0015011394,0.0013511986,0.0021948228],"category_scores_gemma":[0.020930298,0.0012141527,0.001495931,0.0017803761,0.002219622,0.0028595265,0.0033201817,0.0019925172,0.00017218431],"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.00009416151,0.000029617451,0.00026311437,0.00007145846,0.000056844816,0.000024362138,0.000043769087,0.9705913,0.0007519039,0.018235972,0.00019709137,0.009640515],"study_design_scores_gemma":[0.000002744041,0.000018623688,0.00012530552,0.0000062977447,0.000010017088,0.000008471382,0.000008399696,0.9887975,0.0003139324,0.010618586,0.00008284615,0.000007290388],"about_ca_topic_score_codex":0.0025467156,"about_ca_topic_score_gemma":0.0012368131,"teacher_disagreement_score":0.005993505,"about_ca_system_score_codex":0.0014779241,"about_ca_system_score_gemma":0.0010059193,"threshold_uncertainty_score":0.031697035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029851508,0.00010112175,0.9949698,0.000079340265,0.000037064274,0.000031162563,0.000020791293,0.00006317931,0.001712438],"genre_scores_gemma":[0.26778996,0.00043689937,0.7226077,0.0001989842,0.00017785445,0.00058072835,0.00025783863,0.00034576503,0.007604344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987697,0.0005015884,0.00006371748,0.0001645388,0.0004182807,0.0000821896],"domain_scores_gemma":[0.9939162,0.004231421,0.00029131412,0.0003855191,0.0009985977,0.00017689023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032700577,0.001346013,0.0016884732,0.0012647604,0.0009395123,0.0013553777,0.0024224077,0.0019623898,0.005680502],"category_scores_gemma":[0.013080163,0.000883045,0.0009470612,0.0015421235,0.0014107615,0.0025404512,0.00287988,0.0030393777,0.00068821345],"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.00011416982,0.000065950706,0.0001849501,0.0001578809,0.00005617725,0.0000602698,0.0001100658,0.8681129,0.0019040877,0.07398104,0.0023445797,0.052907962],"study_design_scores_gemma":[0.000009319045,0.000010403534,0.0000153388,0.0000040433415,0.0000029538392,0.0000032938538,0.0000041816293,0.99214315,0.00016877773,0.007359521,0.0002750263,0.0000040063014],"about_ca_topic_score_codex":0.0045698886,"about_ca_topic_score_gemma":0.00485371,"teacher_disagreement_score":0.005680502,"about_ca_system_score_codex":0.00095154333,"about_ca_system_score_gemma":0.0014673978,"threshold_uncertainty_score":0.019003153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032887075,0.00020240029,0.9950069,0.00010387463,0.00010792912,0.000029400397,0.00002166363,0.00022609401,0.0010129223],"genre_scores_gemma":[0.11076563,0.00031102556,0.88112575,0.0001701478,0.00012638947,0.00014251281,0.00012767276,0.00033472935,0.0068962295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00015243496,0.000019075216,0.00008684688,0.00022972979,0.000030486352],"domain_scores_gemma":[0.99956244,0.000143835,0.000054746008,0.000061534156,0.00014290294,0.00003466182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005745274,0.00068406446,0.0009288454,0.00048199555,0.00035321005,0.0004917165,0.0010876501,0.001191133,0.0024474254],"category_scores_gemma":[0.0018439972,0.00041012286,0.00069153094,0.00044879792,0.00067365036,0.00073706324,0.0008886416,0.0013004463,0.00079168356],"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.00018980792,0.000088903,0.00069057534,0.00046590195,0.0001609824,0.00038612456,0.00016357613,0.70045745,0.035593886,0.057975583,0.0070741726,0.19675295],"study_design_scores_gemma":[0.000013330176,0.00003516136,0.000080772035,0.0000114673,0.000008410052,0.000060851842,0.000003482917,0.9899665,0.0020136079,0.0025257552,0.005264533,0.000016127255],"about_ca_topic_score_codex":0.0030495932,"about_ca_topic_score_gemma":0.0030261541,"teacher_disagreement_score":0.0030495932,"about_ca_system_score_codex":0.00041597034,"about_ca_system_score_gemma":0.0012139828,"threshold_uncertainty_score":0.008187473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029094566,0.0003051676,0.9951178,0.00019849173,0.0000785594,0.000016110624,0.000011692203,0.000040468163,0.001322235],"genre_scores_gemma":[0.2572363,0.0012123872,0.7298312,0.00031208654,0.00023565034,0.0002974465,0.00017131669,0.00030628702,0.0103972815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991048,0.00052630313,0.000038131275,0.00010263074,0.00018195108,0.000046163794],"domain_scores_gemma":[0.9966233,0.002582193,0.00018551521,0.00021616156,0.00031063447,0.00008222851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023683773,0.00087637664,0.00088268414,0.00062699115,0.00050047465,0.0011694985,0.0014045334,0.0013698518,0.0026327907],"category_scores_gemma":[0.009657412,0.0007552333,0.00083536207,0.0009444255,0.0022304177,0.0022685532,0.0018574346,0.0027916818,0.0004887571],"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.00018657438,0.00008885543,0.00045752665,0.00037098944,0.000057540547,0.00009845496,0.0002828755,0.62993526,0.0055098217,0.2882291,0.0035151937,0.07126786],"study_design_scores_gemma":[0.000009323694,0.000021410524,0.000036634978,0.000013038482,0.0000043503305,0.000013325208,0.0000140523225,0.9734379,0.0005487284,0.024749191,0.0011450495,0.0000069647817],"about_ca_topic_score_codex":0.003189601,"about_ca_topic_score_gemma":0.0034279355,"teacher_disagreement_score":0.003189601,"about_ca_system_score_codex":0.000781604,"about_ca_system_score_gemma":0.0011279548,"threshold_uncertainty_score":0.01252532},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004728652,0.000051418072,0.9913799,0.000076963915,0.000046982626,0.00003660281,0.000013503976,0.00036390687,0.0033020268],"genre_scores_gemma":[0.08223605,0.00010197407,0.9137229,0.00009546362,0.000030809875,0.0001351567,0.000073474526,0.00024204188,0.0033620826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.00025758293,0.000025626314,0.0000585743,0.0002734227,0.000059786908],"domain_scores_gemma":[0.99916327,0.0003726352,0.00003918948,0.00013886896,0.00024484505,0.00004114973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647343,0.00091960886,0.0011296232,0.0006030529,0.0009454465,0.001004325,0.0014697174,0.0011416723,0.005782886],"category_scores_gemma":[0.00397144,0.0005163309,0.0005911663,0.0009830217,0.0009133318,0.0013338005,0.0016791847,0.002169607,0.001601113],"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.0003927441,0.0002574052,0.00054779806,0.00019399304,0.000048468,0.00010667308,0.00019644268,0.55821085,0.008008554,0.10440538,0.005999732,0.32163203],"study_design_scores_gemma":[0.000023678189,0.000027548896,0.000032441316,0.0000087247445,0.0000044962644,0.00001725532,0.000011582618,0.9873077,0.0013831164,0.009405501,0.0017726924,0.000005165731],"about_ca_topic_score_codex":0.003599539,"about_ca_topic_score_gemma":0.004360995,"teacher_disagreement_score":0.005782886,"about_ca_system_score_codex":0.00045100035,"about_ca_system_score_gemma":0.0010294729,"threshold_uncertainty_score":0.019345641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030656199,0.00008644442,0.99560153,0.00009093627,0.000026584266,0.00003586897,0.0000109670145,0.0002751398,0.00080695754],"genre_scores_gemma":[0.14505464,0.00012482012,0.8505851,0.00027206182,0.00009803252,0.00042869162,0.000103110884,0.00023398304,0.0030995174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993426,0.000209533,0.000033683074,0.00014859361,0.00021399723,0.000051557843],"domain_scores_gemma":[0.99889463,0.00052925176,0.000115381416,0.0001684671,0.00020244779,0.000089898225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530505,0.0007460762,0.0011368234,0.000566167,0.00048113393,0.0008468977,0.0026524514,0.0016720082,0.0031881507],"category_scores_gemma":[0.0049320916,0.00051891146,0.0008047267,0.00046810915,0.00092499616,0.0015141021,0.0026999202,0.0022861832,0.0009542084],"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.0002350956,0.00020055378,0.0010871161,0.0002559198,0.00006456281,0.00012980847,0.00023750823,0.73049253,0.008941568,0.04314598,0.004935096,0.21027431],"study_design_scores_gemma":[0.000011501876,0.000027105521,0.000026706191,0.000005059317,0.000003125313,0.000014251154,0.0000044881112,0.99630827,0.00060155673,0.002305597,0.00068779517,0.000004488269],"about_ca_topic_score_codex":0.0012044425,"about_ca_topic_score_gemma":0.0013130883,"teacher_disagreement_score":0.0031881507,"about_ca_system_score_codex":0.00059934956,"about_ca_system_score_gemma":0.0011308764,"threshold_uncertainty_score":0.010665476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006378684,0.0009213163,0.98450583,0.0003660974,0.00013977723,0.00003912196,0.000051241357,0.0002654087,0.0073325313],"genre_scores_gemma":[0.40311012,0.0030912696,0.5594813,0.00069576025,0.00091520435,0.0005607523,0.00064862095,0.0014066007,0.030090364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998195,0.0006380053,0.000065778244,0.000115116134,0.00087447715,0.00011155629],"domain_scores_gemma":[0.9947767,0.002942602,0.00029506738,0.0004273964,0.0013502634,0.00020805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031211057,0.0010878262,0.0009527617,0.0013983512,0.00061021623,0.0012574651,0.0014986928,0.001132358,0.0057740235],"category_scores_gemma":[0.016259817,0.000332642,0.0013402138,0.0007433111,0.0018660635,0.0018201483,0.0031548669,0.0035535423,0.001438956],"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.00030121714,0.0000951639,0.002295114,0.00072428957,0.00011287045,0.00045616052,0.00036794753,0.41092154,0.010525096,0.4582889,0.0074313246,0.10848037],"study_design_scores_gemma":[0.0000058404034,0.000029889736,0.00012583291,0.000032669886,0.000008529304,0.0000432016,0.000011740091,0.9680121,0.0008061771,0.02861131,0.0023056986,0.000006903678],"about_ca_topic_score_codex":0.002793646,"about_ca_topic_score_gemma":0.0020740072,"teacher_disagreement_score":0.0057740235,"about_ca_system_score_codex":0.0011331824,"about_ca_system_score_gemma":0.0012699878,"threshold_uncertainty_score":0.019316018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032338167,0.00016779572,0.99150014,0.00027206494,0.00007989996,0.00003749435,0.000045634337,0.000044905984,0.0046181954],"genre_scores_gemma":[0.32686418,0.0009412055,0.65195256,0.0004748631,0.00047890455,0.00063125975,0.00033820138,0.00037722578,0.017941564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888235,0.0005863136,0.000039430503,0.00014357055,0.00029362112,0.000054714186],"domain_scores_gemma":[0.99815315,0.0010646726,0.00011768319,0.00021081905,0.0003529767,0.00010070652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034158814,0.001577169,0.0013224777,0.0010399702,0.0010842264,0.0023367817,0.0019674872,0.0017194157,0.006447724],"category_scores_gemma":[0.007605305,0.0010245963,0.0011327417,0.001102264,0.0019663216,0.0024906003,0.003795146,0.0038850375,0.0014654937],"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.00017785878,0.00011224165,0.00023387525,0.00016495843,0.00007899333,0.00014008454,0.00015230488,0.13729727,0.003151686,0.81264305,0.004578123,0.041269433],"study_design_scores_gemma":[0.000029828549,0.000040804596,0.000040695624,0.000019258776,0.000012681486,0.00003618284,0.00001714292,0.71247405,0.0006116622,0.2847018,0.0020047124,0.000011223115],"about_ca_topic_score_codex":0.0008933767,"about_ca_topic_score_gemma":0.0010822528,"teacher_disagreement_score":0.006447724,"about_ca_system_score_codex":0.0009086061,"about_ca_system_score_gemma":0.0014078578,"threshold_uncertainty_score":0.021569788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041140676,0.000044110777,0.98919684,0.00015314374,0.00006629546,0.00006979914,0.00013681398,0.00042851726,0.005790381],"genre_scores_gemma":[0.25024202,0.0001707677,0.7356813,0.00021066294,0.00008975616,0.00023936185,0.0005642291,0.00036137048,0.0124406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933165,0.0001613123,0.000039702845,0.00011834839,0.00026039564,0.00008862524],"domain_scores_gemma":[0.99912053,0.0002741071,0.000056968784,0.00031682831,0.00017212666,0.000059520622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009629205,0.0005614533,0.00062848954,0.0007345673,0.00091400906,0.001366075,0.0020072116,0.0008017,0.013910449],"category_scores_gemma":[0.003057949,0.00036885362,0.00069972355,0.0011085533,0.00080583134,0.0018196114,0.002973066,0.0024816522,0.0024277535],"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.00031235605,0.0001593809,0.00022892002,0.00010940047,0.000021995706,0.00011207645,0.00014290545,0.11087312,0.01000382,0.61944115,0.011585878,0.247009],"study_design_scores_gemma":[0.00005799548,0.000066040164,0.00007496517,0.000025509798,0.0000108765325,0.000064627835,0.000020663372,0.84245765,0.0038441876,0.14305629,0.010299935,0.000021281026],"about_ca_topic_score_codex":0.001373195,"about_ca_topic_score_gemma":0.0018999885,"teacher_disagreement_score":0.013910449,"about_ca_system_score_codex":0.00090437225,"about_ca_system_score_gemma":0.00094676524,"threshold_uncertainty_score":0.046535075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055204332,0.0059302314,0.79325086,0.008550355,0.00071153376,0.00008796904,0.00075325795,0.00030312367,0.13520825],"genre_scores_gemma":[0.81227636,0.01021389,0.10229936,0.0018787301,0.0021183954,0.00041023878,0.0010916136,0.0010452631,0.0686662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807894,0.0009169867,0.00007090687,0.00034376507,0.00039340722,0.00019608153],"domain_scores_gemma":[0.989603,0.007462491,0.00044511384,0.00062541093,0.0012295275,0.0006345162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040292693,0.0015359693,0.0025861175,0.0029490609,0.0017374719,0.005563189,0.002028661,0.0020887584,0.011377745],"category_scores_gemma":[0.021507403,0.0011032583,0.0019039325,0.0021745304,0.0048108413,0.0060967645,0.0037376513,0.005528583,0.0018529634],"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.00006381697,0.000024400111,0.0002630208,0.00009480866,0.00003225278,0.000059147216,0.00008103609,0.021983866,0.0006241391,0.9638256,0.0046301447,0.008317753],"study_design_scores_gemma":[0.000014222639,0.000023802724,0.00032063198,0.00003456802,0.000021881971,0.00009762365,0.00004251631,0.08215628,0.00040094924,0.91242754,0.0044432255,0.00001661999],"about_ca_topic_score_codex":0.0024413909,"about_ca_topic_score_gemma":0.0016031829,"teacher_disagreement_score":0.011377745,"about_ca_system_score_codex":0.002909394,"about_ca_system_score_gemma":0.0027344327,"threshold_uncertainty_score":0.038062394},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051441306,0.016112054,0.004247647,0.03633302,0.89608145,0.000062004896,0.00051619223,0.00021547964,0.045917813],"genre_scores_gemma":[0.0054916623,0.013621199,0.0019790689,0.010407677,0.7468601,0.00011037327,0.0010514132,0.00063674996,0.21984173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991523,0.0001122107,0.00009120107,0.00018113646,0.00039264225,0.00007037345],"domain_scores_gemma":[0.99598324,0.0012294136,0.00025436663,0.00024189409,0.0017229087,0.00056827796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400415,0.0026022112,0.0026528765,0.002944509,0.0015148715,0.0045175124,0.001440936,0.003907404,0.08964048],"category_scores_gemma":[0.00486155,0.0004979935,0.001239077,0.0018926375,0.00078809995,0.0046606455,0.0011843798,0.004053681,0.050808746],"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.000027709517,0.000016547338,0.000033650278,0.00018777463,0.000010632537,0.00004816058,0.000006141141,0.00009212129,0.00020112986,0.0024995555,0.9804598,0.016416736],"study_design_scores_gemma":[0.000022356608,0.00006506122,0.0005968108,0.00020577056,0.000034250803,0.00023766019,0.000024140798,0.001061423,0.00047999705,0.010508499,0.9867437,0.000020282481],"about_ca_topic_score_codex":0.0004596679,"about_ca_topic_score_gemma":0.0012328001,"teacher_disagreement_score":0.08964048,"about_ca_system_score_codex":0.0014477775,"about_ca_system_score_gemma":0.0010487784,"threshold_uncertainty_score":0.2998773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032969758,0.00066702504,0.9178627,0.0008402406,0.00034942597,0.0001126162,0.00042271067,0.00011616465,0.04665942],"genre_scores_gemma":[0.5814992,0.0018930879,0.31613767,0.0010031534,0.0008128046,0.00081132463,0.001693851,0.0007866756,0.09536225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995536,0.0001631948,0.000019601153,0.000083798404,0.000130358,0.000049462607],"domain_scores_gemma":[0.9989772,0.00054984045,0.00007316845,0.00014253515,0.00013293444,0.00012440985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009047264,0.0012838502,0.00089180545,0.00069689646,0.00050841883,0.0015897411,0.0015431774,0.0011299422,0.017283605],"category_scores_gemma":[0.0036146066,0.00049769145,0.0009934192,0.0007071236,0.0014285218,0.0026973088,0.0027692216,0.0032274583,0.0010912794],"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.000060014325,0.000057517293,0.00015409183,0.00019678127,0.000025247693,0.000105567866,0.00010841498,0.13360141,0.0017674797,0.83730775,0.0073925974,0.019223096],"study_design_scores_gemma":[0.000022138533,0.00006244166,0.00011280873,0.000041401898,0.000014166998,0.00005911863,0.000071913375,0.52701694,0.00049385737,0.46013483,0.011956814,0.000013556898],"about_ca_topic_score_codex":0.0010943209,"about_ca_topic_score_gemma":0.0020008704,"teacher_disagreement_score":0.017283605,"about_ca_system_score_codex":0.0009336206,"about_ca_system_score_gemma":0.0006345729,"threshold_uncertainty_score":0.057819486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058551915,0.00035512872,0.992054,0.00015516813,0.000106207954,0.000019705436,0.000014929285,0.00015872974,0.0012809585],"genre_scores_gemma":[0.31689724,0.0005975981,0.6732193,0.00016467583,0.00017619773,0.00036697974,0.00014460689,0.00030905698,0.00812437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993874,0.00030226924,0.00002802277,0.0000600013,0.00019937607,0.000022891225],"domain_scores_gemma":[0.9976342,0.0015542713,0.00014181943,0.00018618732,0.0004112441,0.00007235143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001737653,0.0008649523,0.0016839122,0.00059027394,0.0006020648,0.00078800303,0.001945253,0.0017957636,0.0020846268],"category_scores_gemma":[0.0072146636,0.0006790053,0.00066022534,0.0006923929,0.0015080378,0.0012723288,0.0014635428,0.0019335902,0.00059587],"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.0002777096,0.00012883265,0.0006688995,0.00023117673,0.000108564775,0.00007546752,0.00010863975,0.8615072,0.00335072,0.045327693,0.0039740475,0.08424111],"study_design_scores_gemma":[0.0000072589305,0.000004824725,0.000018307117,0.0000024896026,0.0000021758628,0.0000031794923,0.0000017947076,0.99680245,0.00017487918,0.0027645745,0.00021598712,0.0000020689943],"about_ca_topic_score_codex":0.0029156334,"about_ca_topic_score_gemma":0.0031367915,"teacher_disagreement_score":0.0029156334,"about_ca_system_score_codex":0.000538377,"about_ca_system_score_gemma":0.00090963824,"threshold_uncertainty_score":0.009189725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004532277,0.0003683998,0.981357,0.00019002883,0.00040052662,0.000080258105,0.00024020174,0.00038634118,0.012444983],"genre_scores_gemma":[0.105935276,0.00065435644,0.8736336,0.0003144167,0.00047860848,0.00038650725,0.000661435,0.0010609501,0.016874822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980038,0.00071934354,0.00009850914,0.00024707467,0.0008197575,0.000111624846],"domain_scores_gemma":[0.9982584,0.00039480787,0.000096088115,0.00050029386,0.00061302364,0.0001374924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022989297,0.0013430185,0.0019629858,0.0015521315,0.0009376992,0.00308412,0.0024455506,0.0017065996,0.015607249],"category_scores_gemma":[0.006921436,0.0008547193,0.0015120266,0.0019639856,0.0012163434,0.0033570186,0.003603579,0.0042923717,0.003916224],"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.00032522553,0.00020081106,0.00056218216,0.00043816434,0.00012907347,0.0001425599,0.00021619759,0.23576005,0.005913206,0.4949731,0.021664107,0.23967536],"study_design_scores_gemma":[0.000045853718,0.000096941134,0.00019493676,0.000066583096,0.000033206583,0.00014808567,0.000029213381,0.8462974,0.0017823251,0.12928045,0.021982035,0.000043019583],"about_ca_topic_score_codex":0.00095191505,"about_ca_topic_score_gemma":0.0013386002,"teacher_disagreement_score":0.015607249,"about_ca_system_score_codex":0.0008945078,"about_ca_system_score_gemma":0.0012373067,"threshold_uncertainty_score":0.052211404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3060715,0.0021953706,0.6684067,0.0018852816,0.0006598811,0.000051496412,0.00028325827,0.0005764748,0.019870032],"genre_scores_gemma":[0.8730214,0.001332555,0.11473504,0.0003528657,0.00085366436,0.00014702178,0.00042283858,0.00068503054,0.0084494045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709463,0.0010031735,0.00015314136,0.0006768648,0.00071760785,0.0003546961],"domain_scores_gemma":[0.96565396,0.024305295,0.0025687045,0.0024255104,0.0027683033,0.002278217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072846585,0.0008269992,0.0015767494,0.002515971,0.0013608283,0.0045972117,0.0026320093,0.0019850093,0.004876961],"category_scores_gemma":[0.047498282,0.0007455557,0.0009149174,0.0016786635,0.0050274883,0.008311242,0.0025055334,0.0029760539,0.0007804099],"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.0005625453,0.00009465201,0.0037404478,0.00021514947,0.00008238313,0.00018715288,0.00035921377,0.037953857,0.0078228945,0.92181545,0.0026137833,0.02455251],"study_design_scores_gemma":[0.000027049506,0.000125398,0.0017528884,0.00009349945,0.000051178293,0.00032486988,0.00015196388,0.34976688,0.0049854536,0.6400077,0.0026407565,0.00007239493],"about_ca_topic_score_codex":0.00056555297,"about_ca_topic_score_gemma":0.00057504454,"teacher_disagreement_score":0.0072846585,"about_ca_system_score_codex":0.0023492095,"about_ca_system_score_gemma":0.0015596524,"threshold_uncertainty_score":0.038525403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013669442,0.0007933593,0.98164845,0.00051827845,0.000094978706,0.00002327853,0.00008163257,0.00010375829,0.0030668143],"genre_scores_gemma":[0.50786036,0.004324637,0.46806425,0.0004869587,0.00064758694,0.00025948527,0.0008131896,0.00043675888,0.017106734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980751,0.0010240346,0.000084189924,0.00024366275,0.00043176932,0.00014113501],"domain_scores_gemma":[0.98933035,0.008411513,0.00038348205,0.0005111198,0.0010174369,0.00034609117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005224245,0.0016254311,0.0017794305,0.0014739655,0.0005154415,0.002960673,0.0019398282,0.0015097923,0.002567459],"category_scores_gemma":[0.022356395,0.0006470097,0.0011077757,0.0019708092,0.0024825803,0.0040745162,0.0028334444,0.004246401,0.0005835309],"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.00038272358,0.00020090034,0.0020008553,0.0005274627,0.00012037105,0.00022705171,0.00029965368,0.37231198,0.0032691688,0.5233897,0.0071981554,0.09007197],"study_design_scores_gemma":[0.0000071529203,0.000030668347,0.00013231067,0.000020901354,0.000010984093,0.00005015562,0.000027726075,0.90806603,0.0003931295,0.090411685,0.0008421535,0.0000071740233],"about_ca_topic_score_codex":0.0030460462,"about_ca_topic_score_gemma":0.0019305338,"teacher_disagreement_score":0.005224245,"about_ca_system_score_codex":0.0015851612,"about_ca_system_score_gemma":0.0014391883,"threshold_uncertainty_score":0.02762878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08895199,0.00087504665,0.89552075,0.0014306536,0.000086568165,0.000084700674,0.00012483924,0.00024788282,0.0126775615],"genre_scores_gemma":[0.92825633,0.0011357727,0.04903021,0.00027988944,0.000075472955,0.00030353677,0.00033420871,0.00025496475,0.020329624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993832,0.0002541136,0.000022600827,0.00009303998,0.00013501976,0.00011204905],"domain_scores_gemma":[0.9919898,0.005488044,0.0007308626,0.00019528264,0.001153822,0.00044223873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031402553,0.0011640703,0.0010134735,0.0012342164,0.0006484468,0.0018611222,0.0014133811,0.0016949058,0.0053995093],"category_scores_gemma":[0.026603706,0.00042947143,0.0007148372,0.0006286753,0.002469372,0.0028085313,0.002115781,0.0024614283,0.0004983437],"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.0002780632,0.00008737574,0.0021005715,0.0003388849,0.00006389845,0.0003356412,0.00034813918,0.52162653,0.005358301,0.4539098,0.001961048,0.013591714],"study_design_scores_gemma":[0.000013076384,0.00004618325,0.00016970267,0.000028714174,0.000007763374,0.00003069534,0.000046575977,0.9725246,0.00049944484,0.026167197,0.00045528973,0.000010779559],"about_ca_topic_score_codex":0.0042608096,"about_ca_topic_score_gemma":0.0014883853,"teacher_disagreement_score":0.0053995093,"about_ca_system_score_codex":0.0018122713,"about_ca_system_score_gemma":0.002073494,"threshold_uncertainty_score":0.018063128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021584884,0.00011503953,0.99616563,0.00010953349,0.000037448663,0.000024490106,0.000021670356,0.00006079155,0.0013070187],"genre_scores_gemma":[0.13829528,0.00040809312,0.8544054,0.00015134696,0.00017515782,0.0002466635,0.00015752774,0.00025481716,0.005905649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931824,0.00022170162,0.000026940537,0.0000835535,0.00029682068,0.000052738058],"domain_scores_gemma":[0.9988305,0.000777155,0.000058117304,0.00006243073,0.00019790688,0.000073962496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312269,0.0011139648,0.0016191178,0.00096500263,0.0005513771,0.0015894595,0.0019271582,0.0020248187,0.0041317777],"category_scores_gemma":[0.003430189,0.0010679984,0.0010209165,0.0008439469,0.0010620974,0.0015629549,0.0020121683,0.0029502711,0.00054862536],"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.00016860316,0.00021802001,0.0003743285,0.000389136,0.000099110264,0.00012609526,0.00008932901,0.77014226,0.0056453235,0.08802256,0.0040916298,0.13063362],"study_design_scores_gemma":[0.00002084236,0.000020677286,0.000044915676,0.00000839692,0.000009600117,0.00002186522,0.000004670373,0.99010766,0.00038924735,0.008822982,0.0005434121,0.000005714915],"about_ca_topic_score_codex":0.0029498795,"about_ca_topic_score_gemma":0.0031445946,"teacher_disagreement_score":0.0041317777,"about_ca_system_score_codex":0.0006445475,"about_ca_system_score_gemma":0.001578053,"threshold_uncertainty_score":0.013822138},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09329771,0.00011939411,0.9023368,0.00024026263,0.00006220706,0.000025322192,0.000073573276,0.00026746085,0.0035774023],"genre_scores_gemma":[0.7852034,0.00021126981,0.20885406,0.00007918931,0.0000528683,0.000045638997,0.00025008837,0.0003129241,0.0049905796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936515,0.00023552062,0.000025715992,0.00008970594,0.00019778994,0.00008620011],"domain_scores_gemma":[0.99754757,0.0014027435,0.00018634008,0.0002584102,0.00038934583,0.0002155956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890358,0.00072719576,0.00096283696,0.001100676,0.00043353104,0.0025203847,0.0010751709,0.001079704,0.005505748],"category_scores_gemma":[0.01216727,0.00054535747,0.00053881516,0.0010182322,0.0013278162,0.0026133745,0.002093467,0.0017956977,0.00096336973],"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.0006430328,0.000179938,0.0032888604,0.00023336327,0.000069659676,0.00023463528,0.00027169412,0.56914306,0.009598839,0.26582232,0.0035310052,0.14698367],"study_design_scores_gemma":[0.000012701599,0.00006968321,0.00037367232,0.000017023222,0.000011163686,0.00006139869,0.00006913849,0.94465446,0.0041818204,0.04966881,0.0008665246,0.000013562624],"about_ca_topic_score_codex":0.0010545026,"about_ca_topic_score_gemma":0.001021932,"teacher_disagreement_score":0.005505748,"about_ca_system_score_codex":0.001095964,"about_ca_system_score_gemma":0.0011250012,"threshold_uncertainty_score":0.01841855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014966874,0.000107583735,0.997366,0.00004608038,0.000015528674,0.000010379824,0.00002199887,0.00007545403,0.00086028833],"genre_scores_gemma":[0.06498206,0.0007308493,0.9295546,0.000082005514,0.00007806007,0.000112613685,0.00025877432,0.00018361768,0.0040174485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00019039116,0.00003235753,0.00012399307,0.0002501821,0.000041525036],"domain_scores_gemma":[0.9977575,0.0010843538,0.00018555991,0.00038297698,0.000486872,0.00010286954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271152,0.0011625299,0.0010820982,0.0013930717,0.00066863955,0.0017018198,0.0016450085,0.0011708875,0.0047250334],"category_scores_gemma":[0.0067256014,0.0008516038,0.00060478057,0.0018065243,0.0010070758,0.0023969326,0.0022418397,0.0021003305,0.002224048],"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.00014597815,0.00013650733,0.00096245983,0.00041586513,0.00007741699,0.0001223408,0.00041058467,0.22353862,0.014597645,0.25370967,0.009384444,0.49649855],"study_design_scores_gemma":[0.000018793633,0.00003258171,0.00020539985,0.000026931293,0.000013060111,0.000117488904,0.00007421325,0.9125141,0.0033287678,0.07802306,0.005618635,0.00002699074],"about_ca_topic_score_codex":0.00231362,"about_ca_topic_score_gemma":0.0036008337,"teacher_disagreement_score":0.0047250334,"about_ca_system_score_codex":0.0003427689,"about_ca_system_score_gemma":0.0009980648,"threshold_uncertainty_score":0.015806854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009915563,0.00007902614,0.99713194,0.00007138232,0.000047079073,0.00002579061,0.000026040923,0.000077043915,0.0015501945],"genre_scores_gemma":[0.04929928,0.00027262737,0.9439216,0.00017652778,0.00013546308,0.00027666902,0.00020272448,0.00029923415,0.0054157544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993395,0.0001764838,0.000018084214,0.000085596956,0.0003325944,0.000047711448],"domain_scores_gemma":[0.998858,0.0005946925,0.000059651233,0.00006518538,0.0003451445,0.000077292105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014333888,0.001001386,0.0013395757,0.0012822095,0.00061801885,0.0014874416,0.0018097502,0.0014838956,0.008246558],"category_scores_gemma":[0.004184294,0.0006264338,0.00083925243,0.0010961796,0.00087108754,0.001530431,0.0019327125,0.0031956912,0.0014575877],"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.00031960494,0.00026880423,0.0003599074,0.0004132124,0.000097874734,0.00012560678,0.00016762088,0.27374256,0.013141371,0.3421292,0.0194257,0.34980854],"study_design_scores_gemma":[0.00003373943,0.00004469582,0.000065537715,0.00002063231,0.000015030363,0.00004777036,0.0000141287055,0.95569587,0.0010755433,0.03762836,0.0053466964,0.000012019728],"about_ca_topic_score_codex":0.0018133076,"about_ca_topic_score_gemma":0.0019600545,"teacher_disagreement_score":0.008246558,"about_ca_system_score_codex":0.0008722068,"about_ca_system_score_gemma":0.0015313982,"threshold_uncertainty_score":0.027587533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030054994,0.00061501336,0.94519365,0.0021245722,0.00027987402,0.00009540441,0.00052276533,0.0010382311,0.0200754],"genre_scores_gemma":[0.65956324,0.0005528873,0.3200865,0.00045774525,0.0005110066,0.00030161196,0.00094315613,0.0008933217,0.01669051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998154,0.00068063725,0.000076805874,0.00033757655,0.0004605668,0.00029043763],"domain_scores_gemma":[0.9885753,0.00879021,0.00033089015,0.0009736373,0.0009506471,0.00037927335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003221766,0.0012722858,0.0022299795,0.0017512109,0.0012757076,0.0035756005,0.003103201,0.0017559639,0.016677454],"category_scores_gemma":[0.025838064,0.001075531,0.0011670681,0.0023838151,0.002514527,0.00665826,0.003543145,0.0037997188,0.0016847734],"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.00027272114,0.00016236895,0.000858926,0.00029714193,0.00008654963,0.00008856763,0.0001338343,0.4897135,0.001325002,0.4276352,0.013728253,0.06569792],"study_design_scores_gemma":[0.000017459095,0.000013631928,0.000090236936,0.000017166842,0.000007927385,0.000014285157,0.000012730029,0.80127937,0.00048193563,0.19725336,0.00080266275,0.000009322765],"about_ca_topic_score_codex":0.005166172,"about_ca_topic_score_gemma":0.0050425804,"teacher_disagreement_score":0.016677454,"about_ca_system_score_codex":0.002486299,"about_ca_system_score_gemma":0.002683487,"threshold_uncertainty_score":0.055791676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062476215,0.00026049174,0.99090064,0.00012146673,0.000021447226,0.00001410272,0.000030640742,0.00008629091,0.0023173634],"genre_scores_gemma":[0.63272387,0.00076572906,0.35584697,0.00017747494,0.00010522395,0.00018379389,0.00030292667,0.00030002173,0.009594063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848,0.00067345635,0.0000539987,0.00029311152,0.00038533006,0.00011412995],"domain_scores_gemma":[0.9980793,0.0011901319,0.00015365162,0.00024396605,0.00026203183,0.000071029186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018723159,0.0012328811,0.0012489127,0.0004668062,0.00042075483,0.0014931657,0.0012195109,0.0011736657,0.0025860674],"category_scores_gemma":[0.006823057,0.00044621326,0.0007641303,0.00097139843,0.0014626426,0.0015421933,0.0020555826,0.0016852298,0.00092892855],"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.00009085941,0.000033519507,0.00032157268,0.00013943425,0.000048575777,0.00011911416,0.000056862482,0.91653997,0.003537239,0.043264188,0.0009943121,0.03485442],"study_design_scores_gemma":[0.0000028060574,0.000022275091,0.00006905904,0.000003653902,0.0000037807408,0.000030372748,0.000008213795,0.98876023,0.0006547314,0.009766374,0.00067324674,0.0000052851146],"about_ca_topic_score_codex":0.0015677821,"about_ca_topic_score_gemma":0.001075964,"teacher_disagreement_score":0.0025860674,"about_ca_system_score_codex":0.0006195649,"about_ca_system_score_gemma":0.00069346663,"threshold_uncertainty_score":0.009901881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018089806,0.0003703206,0.9938684,0.0001433029,0.0000597963,0.000029790752,0.000060462746,0.00024775567,0.003411241],"genre_scores_gemma":[0.08452104,0.000802592,0.9062349,0.000092356415,0.00006399191,0.00035587559,0.0001685798,0.00041492961,0.0073458245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939907,0.00020331428,0.000021256525,0.000059423313,0.00025336532,0.000063521235],"domain_scores_gemma":[0.9979513,0.0013064729,0.00010226861,0.0001598473,0.00042759452,0.00005253935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017727755,0.0008893552,0.0019322186,0.0009774482,0.0011232691,0.0011231155,0.0015874079,0.0014516223,0.0077836365],"category_scores_gemma":[0.0067997794,0.0007252704,0.0009291751,0.00329579,0.0010757738,0.0013932362,0.0015355415,0.002662705,0.0009145313],"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.00009384001,0.000043412063,0.00011364901,0.00018813116,0.000026747359,0.00002942956,0.000070511116,0.8339956,0.000832132,0.06688236,0.006841678,0.09088248],"study_design_scores_gemma":[0.000016675207,0.00001182492,0.000034333105,0.000006472154,0.000005102698,0.000008627395,0.0000063713505,0.9861187,0.00024632787,0.01154428,0.0019934964,0.000007789231],"about_ca_topic_score_codex":0.023545923,"about_ca_topic_score_gemma":0.027289549,"teacher_disagreement_score":0.023545923,"about_ca_system_score_codex":0.001434497,"about_ca_system_score_gemma":0.0040607336,"threshold_uncertainty_score":0.04681772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37660956,0.017500626,0.53954965,0.0020196105,0.00052528235,0.00032870483,0.00071369344,0.0029695285,0.059783425],"genre_scores_gemma":[0.76835537,0.003917061,0.2219804,0.0002173429,0.00020832685,0.0002595465,0.0010469506,0.0009124953,0.0031025268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9853829,0.0070492015,0.0006465056,0.0006378692,0.005956616,0.00032684198],"domain_scores_gemma":[0.90431523,0.072239585,0.0021720498,0.008812008,0.011769918,0.000691217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016021343,0.00095699244,0.001103043,0.0066929273,0.0006682248,0.003526507,0.0014374864,0.0018503201,0.0036404897],"category_scores_gemma":[0.06745527,0.00032827083,0.0012757253,0.00519406,0.0015390539,0.0041379924,0.002008556,0.0011675934,0.00058668625],"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.0019996744,0.00053347414,0.010082525,0.0010944988,0.00050266704,0.000059153317,0.00040526962,0.24663907,0.0057395953,0.116636,0.0054116584,0.6108964],"study_design_scores_gemma":[0.00029719993,0.0028214816,0.016624337,0.00046395397,0.0005128611,0.00022941842,0.0006404253,0.8611844,0.0117131,0.08491189,0.020475112,0.0001258515],"about_ca_topic_score_codex":0.0019156055,"about_ca_topic_score_gemma":0.002148025,"teacher_disagreement_score":0.016021343,"about_ca_system_score_codex":0.0018493878,"about_ca_system_score_gemma":0.0017717209,"threshold_uncertainty_score":0.08472997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20765567,0.00084283407,0.72097176,0.00141318,0.00015317462,0.00010328111,0.00056550466,0.0001385452,0.06815595],"genre_scores_gemma":[0.9164286,0.000652362,0.05378134,0.00026021805,0.00009080029,0.00018892364,0.00047871514,0.000042740594,0.028076367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997465,0.000074079464,0.000007376938,0.000054132302,0.000044254622,0.00007365441],"domain_scores_gemma":[0.9998361,0.00006963437,0.000026627768,0.000013847491,0.000029697265,0.000024182738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028256644,0.00042244286,0.00040522558,0.00025737105,0.000368655,0.0009456898,0.00043172386,0.0007784758,0.0062589846],"category_scores_gemma":[0.0007507549,0.00017409341,0.00028172045,0.0003772405,0.0008093012,0.00079297536,0.0013574907,0.00062437,0.00030108675],"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.00014552746,0.00003595519,0.0008979468,0.00021489502,0.000054568067,0.00041737343,0.00015602117,0.3028248,0.0051970687,0.63276535,0.0057889586,0.051501475],"study_design_scores_gemma":[0.000042631556,0.00007412625,0.000651295,0.000037872156,0.000017709588,0.000121145706,0.00026239431,0.69734603,0.0018413892,0.2916559,0.007925527,0.000024050405],"about_ca_topic_score_codex":0.0059118504,"about_ca_topic_score_gemma":0.0037765615,"teacher_disagreement_score":0.0062589846,"about_ca_system_score_codex":0.0006732861,"about_ca_system_score_gemma":0.0012270468,"threshold_uncertainty_score":0.020938396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046418108,0.0053387927,0.93386513,0.005557261,0.0003858839,0.000033094355,0.0003255663,0.00029608424,0.0077800257],"genre_scores_gemma":[0.8899277,0.007947128,0.078891166,0.0012041724,0.0043400982,0.0003111833,0.0007516584,0.00060227024,0.0160246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942193,0.0034041633,0.00019456733,0.0006591796,0.0011412097,0.00038154973],"domain_scores_gemma":[0.9497765,0.04353204,0.002112119,0.002101699,0.0016467989,0.00083087065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007007119,0.0012484875,0.0032018302,0.0031924937,0.0011189737,0.004849325,0.0027706535,0.0023493571,0.0027777164],"category_scores_gemma":[0.037177823,0.0011137001,0.0015007728,0.002635336,0.007524452,0.0077776406,0.0033912447,0.0033119284,0.00053943903],"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.000044457036,0.000020390906,0.00072962296,0.000082598846,0.000044974477,0.000057199057,0.00012838871,0.046163112,0.00029065396,0.9434436,0.0013058484,0.0076891463],"study_design_scores_gemma":[0.0000049368464,0.000010970476,0.00019946568,0.000012089445,0.000010120567,0.00004476652,0.0000141796,0.10019335,0.000081011385,0.89861244,0.0008018102,0.000014913133],"about_ca_topic_score_codex":0.002814321,"about_ca_topic_score_gemma":0.0017085017,"teacher_disagreement_score":0.007007119,"about_ca_system_score_codex":0.0020282392,"about_ca_system_score_gemma":0.0018080962,"threshold_uncertainty_score":0.03705764},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002012378,0.11575327,0.8696635,0.00097016426,0.0006434052,0.000047644073,0.00014931524,0.00023451302,0.010525833],"genre_scores_gemma":[0.05151573,0.21784015,0.70793486,0.0011207074,0.0027288187,0.0002994347,0.00084201596,0.00059672096,0.01712161],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902236,0.00027761864,0.00010383808,0.00014046587,0.00042557495,0.000030167008],"domain_scores_gemma":[0.99858606,0.0008762045,0.000058969013,0.00012121554,0.0003201557,0.000037504797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014611656,0.0012096582,0.0021628086,0.0019231444,0.0005600789,0.0017061497,0.0016146547,0.0014445309,0.003911307],"category_scores_gemma":[0.0034892191,0.00080604025,0.0011398656,0.0040865247,0.00086352427,0.00214608,0.0012703188,0.0020125427,0.0029078783],"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.00007747016,0.00018869495,0.0010058937,0.004053141,0.00016016257,0.000081862505,0.00009995894,0.06476736,0.0028849628,0.16821025,0.019621713,0.73884857],"study_design_scores_gemma":[0.0000491794,0.00017719711,0.0015380111,0.0008408771,0.000103924714,0.0003991653,0.00006873079,0.514043,0.0024334847,0.25397214,0.22629741,0.000076874625],"about_ca_topic_score_codex":0.0014182053,"about_ca_topic_score_gemma":0.001999807,"teacher_disagreement_score":0.003911307,"about_ca_system_score_codex":0.00052972836,"about_ca_system_score_gemma":0.0011339054,"threshold_uncertainty_score":0.01308465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15483083,0.0012661283,0.73547477,0.003065569,0.0004913516,0.00007747637,0.00044281466,0.0011138285,0.10323719],"genre_scores_gemma":[0.8500853,0.001044748,0.08208533,0.0011889915,0.00069776515,0.0001473011,0.0005933411,0.00074705476,0.06341009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935216,0.00019286467,0.000028632732,0.00011983363,0.00020485414,0.00010168723],"domain_scores_gemma":[0.99773127,0.0010479566,0.0002320396,0.00042806813,0.00028943524,0.0002712704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753332,0.000659608,0.0009646004,0.0012287361,0.0011946469,0.0017950482,0.0012453011,0.0010693963,0.011752435],"category_scores_gemma":[0.008354628,0.00040270263,0.00072521094,0.0009860285,0.0018709726,0.0035507118,0.0035176673,0.0026123729,0.0014058481],"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.000048744827,0.000023230705,0.000277196,0.00005544856,0.000013377498,0.000058715395,0.00008177356,0.010994837,0.00046105232,0.9707381,0.0050713825,0.012176229],"study_design_scores_gemma":[0.000008945642,0.000016819147,0.00012488021,0.000011732591,0.0000064070723,0.00006242502,0.000029162577,0.05681073,0.00028014087,0.9398485,0.0027950096,0.0000053416156],"about_ca_topic_score_codex":0.0005617373,"about_ca_topic_score_gemma":0.000543608,"teacher_disagreement_score":0.011752435,"about_ca_system_score_codex":0.0007954627,"about_ca_system_score_gemma":0.000502346,"threshold_uncertainty_score":0.03931576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012001366,0.000083908766,0.9981744,0.000051081275,0.000016720647,0.00004260099,0.000011801832,0.000114045746,0.0003053411],"genre_scores_gemma":[0.045591507,0.00018438454,0.9525255,0.000105600775,0.000055592478,0.00059713254,0.00009987579,0.00011773599,0.00072267134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936599,0.0043100603,0.00025940093,0.0006496441,0.0009394498,0.000181582],"domain_scores_gemma":[0.9754666,0.020710567,0.0011804231,0.0010795314,0.0012443579,0.00031853144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013878631,0.0025180373,0.0041881264,0.0028470857,0.0007925327,0.0017526537,0.002287515,0.0024593347,0.005190166],"category_scores_gemma":[0.038881633,0.0020120295,0.0017975867,0.001612087,0.0028183884,0.002139518,0.0026063728,0.004097241,0.0009932441],"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.00030218295,0.00018020383,0.00079812255,0.00064180844,0.00019680096,0.00014952579,0.00012004667,0.8068198,0.0035474617,0.091936566,0.0014734722,0.09383403],"study_design_scores_gemma":[0.00011066121,0.00015774154,0.00009796964,0.00003861014,0.000025417947,0.000029805515,0.000018815266,0.9434625,0.0015602071,0.05308606,0.0013964789,0.000015765363],"about_ca_topic_score_codex":0.0014230311,"about_ca_topic_score_gemma":0.0011260927,"teacher_disagreement_score":0.013878631,"about_ca_system_score_codex":0.0015396754,"about_ca_system_score_gemma":0.004223366,"threshold_uncertainty_score":0.07339805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005078146,0.00007616133,0.99800855,0.000048387723,0.000033877506,0.000021336138,0.000016377124,0.00012068223,0.0011667466],"genre_scores_gemma":[0.040906344,0.00030309768,0.9517169,0.0001101907,0.00010461658,0.00022489193,0.00015996973,0.00024834814,0.0062255817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993938,0.00016003396,0.000022079787,0.00007663852,0.00031767387,0.000029778204],"domain_scores_gemma":[0.99961144,0.00015972248,0.00003078997,0.000043583408,0.00011967295,0.000034853227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092356413,0.0008771059,0.00086231396,0.0004543902,0.00046031555,0.0005793858,0.0010953357,0.0006857889,0.006374431],"category_scores_gemma":[0.0014250823,0.000409328,0.00078635383,0.00072517985,0.00064076297,0.0007699497,0.0011841649,0.001519266,0.0023163126],"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.00014049624,0.0001392813,0.00039979003,0.0005016678,0.00009873048,0.00019350558,0.00012393761,0.4868859,0.018401366,0.09194363,0.014495173,0.38667652],"study_design_scores_gemma":[0.000021708658,0.0000671344,0.000055794222,0.000010478137,0.000008680659,0.00006400654,0.0000049637306,0.9792595,0.0013469106,0.009056599,0.010094853,0.000009370175],"about_ca_topic_score_codex":0.002326051,"about_ca_topic_score_gemma":0.0029956389,"teacher_disagreement_score":0.006374431,"about_ca_system_score_codex":0.0004022424,"about_ca_system_score_gemma":0.0014347627,"threshold_uncertainty_score":0.021324575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037853925,0.0013304304,0.97611165,0.0011279726,0.00035622978,0.00005077714,0.000018037588,0.000106437976,0.017113108],"genre_scores_gemma":[0.13633077,0.0026834272,0.84840375,0.0006401107,0.0007761973,0.00032393832,0.000057582085,0.00022860391,0.010555704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986131,0.0006730819,0.000057248686,0.0001350447,0.0004646161,0.000056852707],"domain_scores_gemma":[0.9982091,0.0011808153,0.000059379512,0.00014101833,0.00034952967,0.000060137125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002880077,0.0007950667,0.0009974963,0.00089803216,0.0005782637,0.0015416573,0.0012755152,0.0014133777,0.005635428],"category_scores_gemma":[0.006177587,0.00031677107,0.00095128175,0.0009885832,0.0024752202,0.0021414775,0.0013815989,0.0024373992,0.0012148578],"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.00005564648,0.00011921645,0.00023877228,0.00022220415,0.000027721493,0.00011325184,0.0002466458,0.12006096,0.00289645,0.75972813,0.0043320023,0.11195907],"study_design_scores_gemma":[0.000037625738,0.00006804744,0.00011227894,0.00006962588,0.000008405996,0.00006611778,0.000024175226,0.77342147,0.001246124,0.1979094,0.027010733,0.000026095839],"about_ca_topic_score_codex":0.002895635,"about_ca_topic_score_gemma":0.0018673696,"teacher_disagreement_score":0.005635428,"about_ca_system_score_codex":0.0008189185,"about_ca_system_score_gemma":0.0009950608,"threshold_uncertainty_score":0.018852413},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021831721,0.0057720714,0.89902973,0.011925931,0.0033011404,0.00006602743,0.0006210389,0.0004993401,0.056952972],"genre_scores_gemma":[0.67989,0.009061348,0.26315913,0.0048333774,0.008046013,0.00032015587,0.0006823533,0.0012102184,0.032797445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638903,0.001501354,0.0002164769,0.000786075,0.0009677204,0.00013928644],"domain_scores_gemma":[0.988415,0.007496869,0.0009555349,0.001242756,0.0016072446,0.00028242733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041692345,0.0010707185,0.0011086959,0.0019669011,0.00093219575,0.0022183731,0.0023889327,0.001814203,0.009267401],"category_scores_gemma":[0.028007358,0.00042492713,0.0009813518,0.0009608169,0.005902241,0.003982904,0.002240271,0.0036652316,0.002344447],"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.00007694894,0.000023103667,0.0011071537,0.00032575696,0.000050029295,0.0010161408,0.0006949663,0.007755087,0.004024014,0.94320035,0.0098717,0.03185489],"study_design_scores_gemma":[0.000028155708,0.00019887672,0.0035730796,0.00021088486,0.00004677523,0.001763375,0.00039297948,0.017362814,0.004806167,0.8714904,0.099959224,0.00016724995],"about_ca_topic_score_codex":0.00082299433,"about_ca_topic_score_gemma":0.00038633696,"teacher_disagreement_score":0.009267401,"about_ca_system_score_codex":0.0005359432,"about_ca_system_score_gemma":0.00040905885,"threshold_uncertainty_score":0.031002522},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002218593,0.0000721528,0.9933547,0.00009617808,0.000038245616,0.00003347442,0.000019058676,0.0006220657,0.0035455967],"genre_scores_gemma":[0.045862827,0.00013350269,0.94993454,0.00013678233,0.00007067369,0.00019135875,0.00011940678,0.00020758568,0.0033433514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992729,0.00020609274,0.000028010265,0.00009266861,0.00031077466,0.00008961618],"domain_scores_gemma":[0.99925846,0.00038545422,0.000024720075,0.0001518763,0.00015408332,0.000025247624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879703,0.00086708943,0.0007285727,0.00067938596,0.00067697937,0.000879062,0.001749289,0.0011675177,0.010415409],"category_scores_gemma":[0.004229504,0.00034395207,0.0006917116,0.0008915785,0.00070509774,0.0016826054,0.0016027014,0.002398388,0.0035892972],"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.00027533984,0.00023334751,0.00061791827,0.00011679817,0.000041445193,0.00019053825,0.00016267507,0.1671673,0.008118736,0.25688997,0.012172561,0.5540134],"study_design_scores_gemma":[0.000045684326,0.000071528884,0.00007925051,0.000016588805,0.000007360206,0.00008252962,0.000019409912,0.93727356,0.0029013206,0.05101336,0.008475267,0.000014190253],"about_ca_topic_score_codex":0.002608997,"about_ca_topic_score_gemma":0.0031203097,"teacher_disagreement_score":0.010415409,"about_ca_system_score_codex":0.00056985655,"about_ca_system_score_gemma":0.0010943881,"threshold_uncertainty_score":0.034843028},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041557446,0.017146992,0.821028,0.0102129225,0.001337662,0.00014840701,0.0012926144,0.0009989693,0.106276944],"genre_scores_gemma":[0.6624931,0.0175326,0.2661268,0.003714998,0.0039427667,0.0010143714,0.0028570937,0.0025473705,0.03977093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583685,0.0012407938,0.00014928293,0.0008296435,0.001181666,0.0007616806],"domain_scores_gemma":[0.96103674,0.031661697,0.0013152754,0.0027311211,0.002031365,0.0012237555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006999485,0.004715911,0.003173601,0.0040120343,0.0018672176,0.0049893144,0.004366004,0.0037670615,0.016847907],"category_scores_gemma":[0.047617327,0.0012884266,0.0020744978,0.0042074467,0.0047382126,0.0097508365,0.0074972245,0.012930814,0.003882855],"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.0014244568,0.00030732897,0.0017240341,0.0018878051,0.0002860151,0.00027215946,0.0006617924,0.21527177,0.008277164,0.6330923,0.03771308,0.09908209],"study_design_scores_gemma":[0.0001092193,0.0002127288,0.0010392178,0.00045723756,0.00018115391,0.00027246962,0.00015435756,0.34705144,0.0037862246,0.6340952,0.012581638,0.00005917827],"about_ca_topic_score_codex":0.0011243696,"about_ca_topic_score_gemma":0.0023578173,"teacher_disagreement_score":0.016847907,"about_ca_system_score_codex":0.0028665548,"about_ca_system_score_gemma":0.0020770906,"threshold_uncertainty_score":0.056361854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013188559,0.00028522068,0.9974107,0.00012065008,0.00003675113,0.00001870076,0.000023712953,0.000098344746,0.000687105],"genre_scores_gemma":[0.13136612,0.0012686679,0.8558362,0.0001898107,0.00021965154,0.0002979572,0.00044387745,0.0007846687,0.009593012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982167,0.0008268457,0.00010092503,0.00022494598,0.00051573256,0.000114845476],"domain_scores_gemma":[0.99191684,0.005911299,0.00030164185,0.00065243675,0.0009370531,0.00028072493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045125275,0.0016456626,0.00248084,0.0018534493,0.0010105348,0.0026534998,0.003279284,0.0017792993,0.0051881867],"category_scores_gemma":[0.014694641,0.0013925497,0.0015842174,0.0026292084,0.0025583678,0.0046467506,0.0045715547,0.0072645037,0.0012170572],"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.00021094047,0.000109324115,0.0003881832,0.0004491017,0.00010931087,0.00005865157,0.00029033262,0.5094052,0.0020228329,0.2966286,0.0076396232,0.18268792],"study_design_scores_gemma":[0.000010150696,0.000016506181,0.000050574075,0.000018795217,0.000008467678,0.000008243254,0.0000177127,0.9330563,0.0005322819,0.064937696,0.0013358275,0.000007514643],"about_ca_topic_score_codex":0.0063243504,"about_ca_topic_score_gemma":0.004911028,"teacher_disagreement_score":0.0063243504,"about_ca_system_score_codex":0.002459338,"about_ca_system_score_gemma":0.0017979069,"threshold_uncertainty_score":0.023864865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001741496,0.003420454,0.98812765,0.00072854705,0.0005780935,0.000028526896,0.000040787632,0.00010562561,0.0052288766],"genre_scores_gemma":[0.20256484,0.020838125,0.7420939,0.0022196777,0.0059355386,0.0009578286,0.00042897515,0.0015388262,0.023422342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906138,0.0046479367,0.0006062396,0.00082784303,0.0029103302,0.00039381103],"domain_scores_gemma":[0.9179041,0.0638807,0.0037091943,0.0038869202,0.009406069,0.0012130339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021896672,0.0037591513,0.002517999,0.0070001255,0.0013027635,0.005449771,0.004305236,0.0045571043,0.0064412844],"category_scores_gemma":[0.11663951,0.0015408832,0.002782097,0.004852992,0.0068003237,0.011551157,0.008134025,0.012267901,0.0022474665],"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.000112862006,0.000066440596,0.00048046221,0.00041063628,0.00011621654,0.00010459075,0.00039106587,0.09850123,0.0017436146,0.8349971,0.005562107,0.05751371],"study_design_scores_gemma":[0.00001822495,0.000046015095,0.00022933637,0.00021668099,0.000056273588,0.00010663159,0.000066236775,0.49181056,0.00153741,0.49745274,0.008384845,0.00007509642],"about_ca_topic_score_codex":0.0013589892,"about_ca_topic_score_gemma":0.0011392925,"teacher_disagreement_score":0.021896672,"about_ca_system_score_codex":0.0021913063,"about_ca_system_score_gemma":0.0015344804,"threshold_uncertainty_score":0.11580205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03306725,0.00037725482,0.95901054,0.00014611759,0.000024857416,0.000055161057,0.0000798869,0.00019861152,0.0070403325],"genre_scores_gemma":[0.7083273,0.0006297652,0.28360698,0.00007089638,0.000018704259,0.0003125739,0.000247096,0.00012321935,0.006663418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977165,0.00007281779,0.0000060607026,0.000053964697,0.00005901375,0.00003647919],"domain_scores_gemma":[0.99974686,0.00014183405,0.000043507993,0.000011787844,0.00004483338,0.00001121843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005320982,0.0009275506,0.0008266561,0.00046938704,0.00033514845,0.00081513525,0.0005290368,0.00066886964,0.0020189611],"category_scores_gemma":[0.00081907696,0.00037432733,0.00055638206,0.00048528766,0.00047954175,0.0007940983,0.0006954094,0.0006100284,0.00022080522],"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.000014908989,0.000008926359,0.000119570585,0.000029818162,0.000007705489,0.000014090678,0.000010779513,0.9863941,0.0011062085,0.0038580764,0.00020763486,0.008228259],"study_design_scores_gemma":[0.0000038564153,0.00002455928,0.00004958997,0.000003887655,0.00000438308,0.0000057337966,0.0000065564373,0.9966889,0.0006680889,0.0020039189,0.0005381193,0.0000023592238],"about_ca_topic_score_codex":0.0028295533,"about_ca_topic_score_gemma":0.003573374,"teacher_disagreement_score":0.0028295533,"about_ca_system_score_codex":0.00090057624,"about_ca_system_score_gemma":0.0009794015,"threshold_uncertainty_score":0.0067541003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047984137,0.0007091467,0.9909112,0.0002494019,0.00013127575,0.00004170445,0.0000322016,0.00013900528,0.0029876612],"genre_scores_gemma":[0.23830739,0.0015975845,0.74904144,0.0002773698,0.00048349358,0.0006829175,0.00023617838,0.00038476515,0.008988898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854004,0.00058803294,0.0000855293,0.00020127786,0.00046581967,0.00011930789],"domain_scores_gemma":[0.9940743,0.0048817364,0.0002310507,0.0002692622,0.00040014947,0.00014349219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002813069,0.0019721603,0.0023096972,0.0013183069,0.0010341662,0.0017615283,0.0022866968,0.0022964878,0.006230674],"category_scores_gemma":[0.009424152,0.0021609582,0.001815496,0.0020115653,0.0014858476,0.0030954415,0.005210354,0.003398784,0.00074540684],"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.00022600807,0.00014080683,0.000603082,0.00078361697,0.00042973342,0.0003290302,0.00022100707,0.7379022,0.0041372,0.12386959,0.006320854,0.12503679],"study_design_scores_gemma":[0.000038061586,0.000044348828,0.00006818254,0.0000134655875,0.00003880155,0.000035413414,0.00002154382,0.9532234,0.00042936445,0.044183906,0.0018947121,0.000008970238],"about_ca_topic_score_codex":0.0025342072,"about_ca_topic_score_gemma":0.003787535,"teacher_disagreement_score":0.006230674,"about_ca_system_score_codex":0.00067206996,"about_ca_system_score_gemma":0.001482791,"threshold_uncertainty_score":0.020843685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015789468,0.057226293,0.55511737,0.019427342,0.005066528,0.000093809474,0.0009930907,0.0009562162,0.34532994],"genre_scores_gemma":[0.50349236,0.06731003,0.22907764,0.0022776045,0.007688441,0.00041103052,0.0022377882,0.00083337975,0.18667169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909186,0.00040110515,0.000042775446,0.00014766434,0.00024776856,0.00006887079],"domain_scores_gemma":[0.9979849,0.0012826358,0.00010812254,0.0003002548,0.00021127315,0.00011273587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014394542,0.0009151781,0.0014391306,0.0012590789,0.000688763,0.002402133,0.0007897098,0.00082095823,0.03727266],"category_scores_gemma":[0.0045056073,0.00031327162,0.0008570502,0.0038089713,0.0024778116,0.0031589412,0.0015657627,0.0028288364,0.0072794813],"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.00006996534,0.000029843877,0.00025608786,0.00034915726,0.00004287489,0.0000566374,0.00012531212,0.0042571556,0.00043551734,0.8988717,0.030877158,0.06462842],"study_design_scores_gemma":[0.00002145298,0.000037362566,0.00030121364,0.00012538624,0.000017729497,0.00008180986,0.00006315811,0.010990275,0.00041677736,0.91855186,0.06938087,0.000012139026],"about_ca_topic_score_codex":0.0014542234,"about_ca_topic_score_gemma":0.0019126685,"teacher_disagreement_score":0.03727266,"about_ca_system_score_codex":0.0015705947,"about_ca_system_score_gemma":0.0011490881,"threshold_uncertainty_score":0.12468946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001359322,0.00014480061,0.99657637,0.000097664,0.000045787212,0.000043598266,0.000021770118,0.00009286896,0.0016177663],"genre_scores_gemma":[0.060739163,0.00033989703,0.9350094,0.00016765704,0.00007484455,0.00028468255,0.000113431386,0.000116299416,0.003154617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925953,0.00035444542,0.00002690586,0.00008634963,0.00024367358,0.000028979191],"domain_scores_gemma":[0.9991522,0.0003921256,0.00006686286,0.0000845945,0.00025322882,0.00005102595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018334491,0.0012480541,0.0009630627,0.0006201164,0.00042756644,0.0009736027,0.0008752708,0.0009998684,0.004313725],"category_scores_gemma":[0.002895211,0.00050938176,0.0006532603,0.00074745825,0.0010117592,0.0011007352,0.0012775073,0.0021353564,0.0016744838],"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.0002641741,0.000235728,0.000481808,0.0004398149,0.0000804617,0.00017425219,0.0001445748,0.52054334,0.009506673,0.22210391,0.012113527,0.2339117],"study_design_scores_gemma":[0.000038197126,0.00007540755,0.000040365874,0.000017673521,0.00000748224,0.000052894575,0.000010705903,0.9751692,0.0017694973,0.018021977,0.0047867373,0.000010040953],"about_ca_topic_score_codex":0.00064843043,"about_ca_topic_score_gemma":0.0011325759,"teacher_disagreement_score":0.004313725,"about_ca_system_score_codex":0.00058541045,"about_ca_system_score_gemma":0.0010715675,"threshold_uncertainty_score":0.014430881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07789946,0.0018809653,0.7013887,0.01116444,0.0009059023,0.0002190758,0.0009924163,0.00024309983,0.20530593],"genre_scores_gemma":[0.754137,0.00277277,0.1512245,0.0019888263,0.0012227916,0.0005198797,0.0015991287,0.0003881977,0.086146906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979559,0.0008906035,0.00007548332,0.000419814,0.0004020289,0.0002562692],"domain_scores_gemma":[0.9933903,0.0047765877,0.00036180232,0.00050515047,0.00054278394,0.00042346964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002906362,0.0012390333,0.0013516864,0.0012379363,0.00143446,0.0050463425,0.002047474,0.0032813405,0.020702269],"category_scores_gemma":[0.015583318,0.0011702807,0.0013947996,0.00166927,0.0045487797,0.008037733,0.003391522,0.0073792534,0.0018662091],"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.000080893544,0.000022454351,0.00006971883,0.00008106499,0.000013339424,0.00004902386,0.00006310325,0.004424918,0.00046389792,0.9859454,0.003880308,0.0049059503],"study_design_scores_gemma":[0.000025332072,0.0000112415855,0.00004961964,0.000015144598,0.0000065010136,0.000036488516,0.000025731704,0.0126341395,0.00020430067,0.98391414,0.0030698383,0.000007491189],"about_ca_topic_score_codex":0.0013353748,"about_ca_topic_score_gemma":0.00090996973,"teacher_disagreement_score":0.020702269,"about_ca_system_score_codex":0.0015302291,"about_ca_system_score_gemma":0.0017206413,"threshold_uncertainty_score":0.06925601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004569724,0.00041878954,0.987497,0.0003118582,0.0003015703,0.000029484088,0.00005709979,0.0004386665,0.0063758376],"genre_scores_gemma":[0.12864564,0.0006569354,0.8402333,0.0002658927,0.00028021957,0.00014688387,0.00033357303,0.00064562523,0.02879201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992113,0.00026949565,0.000041101233,0.00007591838,0.00033848878,0.00006358942],"domain_scores_gemma":[0.99736065,0.0012587586,0.00014719383,0.0005109693,0.0005605962,0.0001618692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014791702,0.0010716093,0.0010871715,0.0007574564,0.0008830426,0.0014471711,0.0017800465,0.0016239972,0.0091053],"category_scores_gemma":[0.007982729,0.0005761014,0.0005651235,0.0012050249,0.001051148,0.0019528507,0.0018636049,0.0029073446,0.0034395158],"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.0004004984,0.00022704215,0.0013652826,0.0004669101,0.00012487885,0.00018686027,0.00017994519,0.3707106,0.0052690255,0.25039527,0.027230583,0.34344319],"study_design_scores_gemma":[0.000030867537,0.000020724001,0.00014935603,0.0000130426215,0.000009850797,0.00004865306,0.00001120074,0.95326966,0.0014022875,0.03723521,0.0077955406,0.000013626536],"about_ca_topic_score_codex":0.0027068148,"about_ca_topic_score_gemma":0.006336216,"teacher_disagreement_score":0.0091053,"about_ca_system_score_codex":0.0006438988,"about_ca_system_score_gemma":0.0015694624,"threshold_uncertainty_score":0.030460238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008262965,0.001133217,0.97969097,0.0006531468,0.00021138185,0.00005231938,0.00012983201,0.0002431376,0.009622911],"genre_scores_gemma":[0.27377182,0.0019492678,0.70619667,0.00044684333,0.0006312078,0.00026794447,0.0006787984,0.00092872005,0.015128709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360526,0.0029314384,0.0002824547,0.0010854721,0.0016806453,0.00041462405],"domain_scores_gemma":[0.9920471,0.0048129577,0.0003958719,0.0008509369,0.0016412347,0.00025199796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075957333,0.00089223,0.0019245525,0.0017882966,0.001456685,0.0025904977,0.0018189879,0.0023904536,0.008152847],"category_scores_gemma":[0.044077925,0.0007547688,0.0008655479,0.0016494658,0.0030184258,0.0029716203,0.003004453,0.0022340287,0.0036488217],"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.00043097694,0.00006373774,0.0020077883,0.00038904493,0.0001563966,0.00013885231,0.0003792275,0.11435328,0.0056412965,0.5706015,0.019820318,0.28601763],"study_design_scores_gemma":[0.000114202536,0.00018440119,0.0028447749,0.00015372512,0.00005805247,0.00023857233,0.000118559925,0.6736287,0.0047487332,0.29527402,0.022542138,0.00009411458],"about_ca_topic_score_codex":0.006567783,"about_ca_topic_score_gemma":0.0041527716,"teacher_disagreement_score":0.008152847,"about_ca_system_score_codex":0.0015415399,"about_ca_system_score_gemma":0.0029157794,"threshold_uncertainty_score":0.04017055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09263527,0.00011949647,0.9034584,0.000211273,0.000054423883,0.000023495764,0.00008219886,0.00026243497,0.003153032],"genre_scores_gemma":[0.7865429,0.00018747001,0.20799235,0.000071911796,0.000047586174,0.00004491632,0.0002923572,0.00028399387,0.004536533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994344,0.00021859001,0.000024156296,0.000072592535,0.00018071527,0.00006945872],"domain_scores_gemma":[0.997741,0.0013411014,0.00014466321,0.00024935184,0.00033071137,0.0001932447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017199371,0.00070428546,0.0010176154,0.0008989169,0.00039306862,0.00213303,0.000985241,0.0010252778,0.0050183493],"category_scores_gemma":[0.010376727,0.0005268024,0.00052599405,0.0009504039,0.0012425457,0.0021114713,0.0017632053,0.0015850458,0.00078357913],"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.00042076578,0.00011668859,0.0022325465,0.00019012293,0.000060670292,0.0001887544,0.00017646022,0.71413225,0.0068562175,0.1639729,0.0027572645,0.1088954],"study_design_scores_gemma":[0.000008030519,0.00004176042,0.00020962673,0.000009653631,0.0000067809287,0.000036036552,0.000034812067,0.9723833,0.0025481505,0.024175642,0.00053732755,0.000008915922],"about_ca_topic_score_codex":0.0011912896,"about_ca_topic_score_gemma":0.0013705003,"teacher_disagreement_score":0.0050183493,"about_ca_system_score_codex":0.0008514471,"about_ca_system_score_gemma":0.0011814411,"threshold_uncertainty_score":0.016788065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047415514,0.000052896605,0.992971,0.000053108244,0.000020206237,0.00005837658,0.00002647451,0.00007309707,0.0020032772],"genre_scores_gemma":[0.085153624,0.000109699315,0.9115521,0.00009097402,0.000028308825,0.00033521184,0.00015219976,0.00016148425,0.0024163732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909747,0.0003585163,0.000033990822,0.00008673174,0.0003555469,0.000067801746],"domain_scores_gemma":[0.99919623,0.00053802104,0.000040829604,0.0000476192,0.00014214989,0.00003519987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015079532,0.0009363314,0.0012987698,0.0008152984,0.00067029556,0.0011661052,0.0021047224,0.0014407426,0.0057643885],"category_scores_gemma":[0.0034281244,0.00087063864,0.00092342077,0.001300955,0.00085929065,0.001166304,0.0017229699,0.0021897752,0.00094319595],"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.0002509986,0.00023812841,0.0005263281,0.00022706906,0.000055114255,0.0001433987,0.0002098108,0.73351496,0.006388599,0.065062165,0.00393045,0.18945289],"study_design_scores_gemma":[0.000026123582,0.00003999125,0.000047208556,0.000011289423,0.0000076133074,0.00001500433,0.000013752448,0.9921416,0.0007268657,0.005925104,0.0010379571,0.0000074967184],"about_ca_topic_score_codex":0.0033110897,"about_ca_topic_score_gemma":0.0039217523,"teacher_disagreement_score":0.0057643885,"about_ca_system_score_codex":0.00047748757,"about_ca_system_score_gemma":0.0014496007,"threshold_uncertainty_score":0.019283831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051064417,0.00010809852,0.9450181,0.00022577416,0.000055001106,0.00003375325,0.000058950765,0.00036397675,0.0030720164],"genre_scores_gemma":[0.45899132,0.00012906539,0.5351656,0.000112819485,0.000055572247,0.00006941001,0.00019807651,0.0002030745,0.005075006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970454,0.000075549055,0.000011258574,0.00004448226,0.00012831097,0.000035832265],"domain_scores_gemma":[0.9993806,0.00031675785,0.00005532741,0.00008963105,0.00010803271,0.000049614282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431432,0.00048676692,0.00065093435,0.0006793717,0.0004432256,0.00055345026,0.0009003197,0.0006032783,0.00280207],"category_scores_gemma":[0.0026511839,0.00031977074,0.00030570282,0.0006041799,0.0009252513,0.0009610737,0.0008165466,0.00076860015,0.0005806045],"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.00020154772,0.00012406283,0.0016769932,0.00018194709,0.0000487196,0.0005196495,0.00020428009,0.59568655,0.019399934,0.18980438,0.005624393,0.18652749],"study_design_scores_gemma":[0.000011403981,0.000026102429,0.00008539456,0.000002989177,0.000002803448,0.00003589012,0.000014003398,0.9695383,0.0025727176,0.026732653,0.000971095,0.0000066000925],"about_ca_topic_score_codex":0.0031003614,"about_ca_topic_score_gemma":0.004422059,"teacher_disagreement_score":0.0031003614,"about_ca_system_score_codex":0.00042147143,"about_ca_system_score_gemma":0.0009874245,"threshold_uncertainty_score":0.009373844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016759476,0.0002804288,0.9916967,0.00020099568,0.00012111751,0.000038958475,0.00002903083,0.00006985899,0.005886898],"genre_scores_gemma":[0.15595464,0.0019950524,0.8241858,0.00040695557,0.0005704257,0.00039248142,0.0003037643,0.00054864236,0.015642237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902666,0.00047125795,0.000052737254,0.00012780912,0.00026699918,0.000054517895],"domain_scores_gemma":[0.9987619,0.0005152098,0.00008342181,0.00025808453,0.00029482387,0.00008654912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025417893,0.0015152416,0.0017305162,0.001300278,0.00080528826,0.0016189811,0.0017608233,0.0010484947,0.00526614],"category_scores_gemma":[0.0061017713,0.0007634083,0.001451791,0.001570141,0.0017549386,0.0020407166,0.0033992152,0.0052575893,0.0015274814],"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.000085822554,0.00015502916,0.00036731866,0.00029238733,0.00007955954,0.00012510923,0.00019302542,0.1854661,0.002530218,0.6541227,0.00842423,0.14815849],"study_design_scores_gemma":[0.000023248484,0.00003723255,0.00008346478,0.000034541175,0.000016504016,0.00006558897,0.000021394479,0.7887757,0.0007152761,0.20027766,0.009938589,0.000010796917],"about_ca_topic_score_codex":0.0016548786,"about_ca_topic_score_gemma":0.0018193638,"teacher_disagreement_score":0.00526614,"about_ca_system_score_codex":0.00066704553,"about_ca_system_score_gemma":0.0013097766,"threshold_uncertainty_score":0.017616987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049149124,0.0026078406,0.9782734,0.0017043417,0.00031235794,0.000051744406,0.00025254852,0.00011624818,0.011766627],"genre_scores_gemma":[0.33844423,0.01337525,0.5957439,0.0015221377,0.0023068136,0.0012561398,0.0015615628,0.00054553116,0.04524441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983051,0.0008724264,0.000074348354,0.0002395734,0.00042406254,0.0000844506],"domain_scores_gemma":[0.99378973,0.0045326566,0.00045812776,0.00035445287,0.0006372891,0.00022774443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031169637,0.0022677018,0.0019884943,0.0009917713,0.0007707132,0.0030502903,0.0016822562,0.0017974311,0.0063690515],"category_scores_gemma":[0.010197699,0.00087851606,0.0010567347,0.0026892321,0.0031382723,0.0041965987,0.001838561,0.0071824566,0.0012720713],"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.00007782064,0.00016663565,0.00013706787,0.00040804857,0.000055690845,0.00007959897,0.00015364977,0.08748937,0.0011324802,0.86138296,0.011348153,0.03756862],"study_design_scores_gemma":[0.000027264294,0.000041091487,0.00008364647,0.000031604613,0.000011598536,0.000041320865,0.000038342117,0.3336725,0.00022318427,0.6606433,0.00516699,0.000019115094],"about_ca_topic_score_codex":0.0023549462,"about_ca_topic_score_gemma":0.0029313231,"teacher_disagreement_score":0.0063690515,"about_ca_system_score_codex":0.0016694728,"about_ca_system_score_gemma":0.0017778202,"threshold_uncertainty_score":0.021306634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3517093,0.00095258537,0.60923654,0.0034543287,0.00014563203,0.00017701586,0.0014446421,0.00054805557,0.0323319],"genre_scores_gemma":[0.925869,0.00044606344,0.06571388,0.00019649847,0.00013045243,0.000181881,0.0008821312,0.0002235202,0.0063565467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733907,0.0008810488,0.0001521587,0.00040601377,0.0009327538,0.0002889798],"domain_scores_gemma":[0.96365786,0.030183202,0.0022961572,0.0019650883,0.0011954163,0.0007023035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029032074,0.00061596156,0.0017849513,0.0011793155,0.0010005364,0.0032478014,0.0020320283,0.0023960639,0.012035945],"category_scores_gemma":[0.042622544,0.00089327374,0.000977471,0.0017541653,0.0018457095,0.0056818915,0.0036103723,0.0022876302,0.00069715554],"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.0004001393,0.00011882206,0.0023635884,0.00036593433,0.000065435175,0.00033029367,0.0002443289,0.6822825,0.0008937793,0.27626017,0.005726,0.030949045],"study_design_scores_gemma":[0.0000336431,0.000039500046,0.0004439018,0.000018967898,0.0000135273485,0.0001426195,0.00008628895,0.78467864,0.00044636716,0.21336406,0.0007159663,0.000016514932],"about_ca_topic_score_codex":0.0012648092,"about_ca_topic_score_gemma":0.0011544323,"teacher_disagreement_score":0.012035945,"about_ca_system_score_codex":0.0014068573,"about_ca_system_score_gemma":0.0012997097,"threshold_uncertainty_score":0.04026419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035173602,0.00022401563,0.92231184,0.00078425807,0.00013667851,0.00027309527,0.0003262879,0.0022401535,0.038530033],"genre_scores_gemma":[0.23347645,0.00020877221,0.7563783,0.00038359774,0.0000714494,0.00026671245,0.00078599097,0.0007572424,0.0076714903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859744,0.00045274486,0.00006667767,0.00020058326,0.00049544853,0.00018705173],"domain_scores_gemma":[0.99592125,0.003070735,0.0001362364,0.00032870553,0.000447405,0.00009559866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017096585,0.0015274502,0.0009799186,0.0010225859,0.001047705,0.0021238208,0.0010009573,0.0010300449,0.025077619],"category_scores_gemma":[0.009909968,0.0011019381,0.0010765191,0.0010413602,0.0010332213,0.0037421319,0.003157183,0.004220054,0.0035550857],"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.001122092,0.0005648543,0.0013250634,0.0010340298,0.00012274674,0.0008799887,0.00041170907,0.35785717,0.024057474,0.1495488,0.030813878,0.43226218],"study_design_scores_gemma":[0.00011403639,0.00014962237,0.00022289541,0.00009731815,0.000039037877,0.00016613558,0.00020913425,0.8416493,0.010708979,0.13561736,0.011002061,0.000024074658],"about_ca_topic_score_codex":0.0011266528,"about_ca_topic_score_gemma":0.003058398,"teacher_disagreement_score":0.025077619,"about_ca_system_score_codex":0.00054676924,"about_ca_system_score_gemma":0.001161899,"threshold_uncertainty_score":0.08389294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2457168,0.008186309,0.4257844,0.018043414,0.0026916636,0.000060788592,0.00020235115,0.00019384357,0.29912043],"genre_scores_gemma":[0.91809624,0.0041487576,0.045304168,0.001406247,0.0021153528,0.000054791024,0.00009035219,0.00009173513,0.028692205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942183,0.00016856405,0.000025165924,0.000087794666,0.00014966255,0.00014710103],"domain_scores_gemma":[0.9991098,0.00040749423,0.00012176819,0.00016518531,0.00009267134,0.00010313459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011258284,0.0006940065,0.00086883415,0.0011920637,0.0016179756,0.0024254345,0.000889634,0.0012356697,0.009390048],"category_scores_gemma":[0.0038870622,0.00039176794,0.00092271715,0.0015796474,0.004474306,0.0052758306,0.0023572282,0.0038775546,0.0006355492],"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.000011860637,0.000005882353,0.000070609014,0.000013858331,0.0000019331035,0.000029897394,0.000064450265,0.0008038342,0.00021010512,0.9915631,0.0005376612,0.0066868644],"study_design_scores_gemma":[0.0000037230059,0.0000070994024,0.000092631424,0.000010664948,0.000002160909,0.000037142057,0.0000563817,0.0036446534,0.00008854467,0.9941818,0.0018714981,0.0000037071122],"about_ca_topic_score_codex":0.0017051136,"about_ca_topic_score_gemma":0.0010000112,"teacher_disagreement_score":0.009390048,"about_ca_system_score_codex":0.0010320619,"about_ca_system_score_gemma":0.0007305009,"threshold_uncertainty_score":0.03141284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069424674,0.0018774718,0.85821134,0.0015494803,0.00019383147,0.00012836917,0.00066632906,0.0002582073,0.06769031],"genre_scores_gemma":[0.80516875,0.0030814167,0.124570355,0.00065298914,0.0006701626,0.00036225695,0.0010611479,0.00026405044,0.064168826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999524,0.00009782898,0.00001588861,0.0001110016,0.00018494966,0.000066427434],"domain_scores_gemma":[0.9992974,0.00037109456,0.00009258847,0.000044508357,0.000115150535,0.0000792254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006784914,0.0010155767,0.000970007,0.0010042967,0.000855851,0.002162823,0.0011220467,0.0012451487,0.006778288],"category_scores_gemma":[0.0024527048,0.0004346763,0.00082723727,0.0012197027,0.0010400712,0.001987044,0.0014153395,0.0018477222,0.0005857356],"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.00004186432,0.00009599266,0.00030459336,0.000167227,0.000035543613,0.00015251347,0.00009658698,0.034216136,0.0016719279,0.924014,0.0066984477,0.032505184],"study_design_scores_gemma":[0.00003622348,0.000054062875,0.00036808112,0.000030816143,0.000018690436,0.00024321207,0.000057857582,0.31799632,0.000451318,0.6679429,0.012783848,0.000016685372],"about_ca_topic_score_codex":0.0013936782,"about_ca_topic_score_gemma":0.0010155874,"teacher_disagreement_score":0.006778288,"about_ca_system_score_codex":0.0007553973,"about_ca_system_score_gemma":0.0007389819,"threshold_uncertainty_score":0.022675693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030416086,0.00018842518,0.9619928,0.00028367608,0.000026590447,0.00002713453,0.000057767273,0.00014717819,0.0068602925],"genre_scores_gemma":[0.795422,0.00033607718,0.19637316,0.00011267272,0.000072611816,0.00007759503,0.00015080441,0.00011049923,0.0073445854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934727,0.00026853912,0.00001844721,0.00010366246,0.00019275304,0.00006929487],"domain_scores_gemma":[0.99911624,0.0005693237,0.000053246007,0.000101522346,0.00011319589,0.000046564528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014502318,0.00057987473,0.0011196694,0.00035849406,0.0002627719,0.0007208274,0.00076253037,0.0006481422,0.0021589613],"category_scores_gemma":[0.003409216,0.00021112166,0.0004256277,0.0005342527,0.0011900805,0.0010488194,0.0009504759,0.0014427224,0.00034870213],"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.0001373904,0.00010569387,0.00025607832,0.0001223706,0.000025789052,0.000041185962,0.00007337452,0.5872785,0.0043641822,0.3489224,0.0022262107,0.056446772],"study_design_scores_gemma":[0.0000087756725,0.000026635866,0.00003801628,0.000004567336,0.0000017730684,0.000007156295,0.000005182201,0.9433497,0.0007267456,0.05509107,0.00073745236,0.0000029715773],"about_ca_topic_score_codex":0.0010767842,"about_ca_topic_score_gemma":0.00091485464,"teacher_disagreement_score":0.0021589613,"about_ca_system_score_codex":0.0008229563,"about_ca_system_score_gemma":0.00062134303,"threshold_uncertainty_score":0.0076696277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013084054,0.0005383121,0.9645839,0.0009231263,0.00015101432,0.00006439843,0.00015624639,0.00008240779,0.0204165],"genre_scores_gemma":[0.54629874,0.002509532,0.3713719,0.0007909655,0.0006375197,0.0005425844,0.00073519454,0.0009254797,0.076188035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991197,0.0004114792,0.00003954193,0.00010698113,0.00021606125,0.00010626163],"domain_scores_gemma":[0.99731296,0.0018316662,0.00025284634,0.00015860987,0.00025613318,0.0001877377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023778873,0.0015306044,0.0014893472,0.0009854584,0.00063693314,0.002305634,0.0014908172,0.0017781969,0.005370693],"category_scores_gemma":[0.009745372,0.0011894992,0.0019473425,0.0008468324,0.002020747,0.0025497007,0.0031258573,0.003743999,0.00073440035],"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.000054689808,0.000075712065,0.00025120488,0.00015940273,0.00003439087,0.00013215063,0.00017788884,0.55602896,0.0015620776,0.42182297,0.0041308305,0.015569681],"study_design_scores_gemma":[0.000006474412,0.000015034348,0.000043644202,0.0000135819355,0.0000063985435,0.00001832419,0.000026167087,0.9358043,0.00023965794,0.062419496,0.0013978077,0.000009088797],"about_ca_topic_score_codex":0.004938489,"about_ca_topic_score_gemma":0.004666456,"teacher_disagreement_score":0.005370693,"about_ca_system_score_codex":0.0015465328,"about_ca_system_score_gemma":0.0016423991,"threshold_uncertainty_score":0.017966807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1192847,0.00102832,0.8588762,0.00071022456,0.00013546867,0.00008521061,0.00010480144,0.0009252114,0.018849779],"genre_scores_gemma":[0.775928,0.0003557249,0.21962263,0.00013331632,0.00007999013,0.000107328735,0.00013367712,0.00022974903,0.003409534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.00040268,0.000061313185,0.00012397362,0.00033916347,0.000119727876],"domain_scores_gemma":[0.99794656,0.00095181266,0.000115023184,0.000690126,0.00022957528,0.000066879504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083182,0.0006567727,0.00070704916,0.00065849157,0.0008030821,0.0009967487,0.0012266149,0.0005877889,0.002373333],"category_scores_gemma":[0.0057468317,0.00045134913,0.0005026655,0.0012734449,0.00080625265,0.001844594,0.0018573896,0.0011358248,0.00070629857],"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.0007826369,0.00031336898,0.0024713601,0.00019282184,0.000101481935,0.00033251903,0.000257657,0.49298343,0.027970124,0.123772055,0.0059421435,0.34488046],"study_design_scores_gemma":[0.000048576432,0.00007570852,0.00024480716,0.00001174689,0.000016198823,0.000067022105,0.00002631486,0.88662124,0.007053346,0.102754235,0.0030694942,0.000011400068],"about_ca_topic_score_codex":0.0009756795,"about_ca_topic_score_gemma":0.0021978824,"teacher_disagreement_score":0.002373333,"about_ca_system_score_codex":0.00043595562,"about_ca_system_score_gemma":0.0011378559,"threshold_uncertainty_score":0.007939577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020834932,0.00045156264,0.9933177,0.000277886,0.0001844012,0.000040465635,0.00004715705,0.000063376916,0.0035339685],"genre_scores_gemma":[0.14676191,0.0020300809,0.82702315,0.000639618,0.00062641787,0.00035464697,0.0003038213,0.0005903169,0.021670045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886763,0.0006273575,0.00004397207,0.00010909483,0.00028669182,0.0000652207],"domain_scores_gemma":[0.9974509,0.0014416048,0.00011159333,0.00022374639,0.0005994383,0.00017269826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037256288,0.0009296439,0.0010747542,0.0012127345,0.00080360944,0.0015518966,0.0017912604,0.0010629785,0.006603852],"category_scores_gemma":[0.0078055193,0.00067264476,0.0013344618,0.0011946094,0.001923851,0.0021577135,0.0023008392,0.0035933496,0.001117945],"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.00011390694,0.00014184199,0.00047541596,0.00028446974,0.00007645134,0.000081818755,0.00008354061,0.07669334,0.0018893915,0.7603458,0.013445272,0.14636873],"study_design_scores_gemma":[0.00004438084,0.00006274551,0.0001846634,0.000045362773,0.000018868026,0.000062287385,0.00002700105,0.62159103,0.00056331535,0.36878428,0.008595171,0.000020851487],"about_ca_topic_score_codex":0.0036115854,"about_ca_topic_score_gemma":0.0032191789,"teacher_disagreement_score":0.006603852,"about_ca_system_score_codex":0.00094755087,"about_ca_system_score_gemma":0.0028449327,"threshold_uncertainty_score":0.022092164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012617654,0.000072085175,0.99720156,0.000074535514,0.00006470824,0.000031932344,0.000017701708,0.000077597935,0.0011981096],"genre_scores_gemma":[0.059996333,0.00017340294,0.93437076,0.00012795202,0.00013118645,0.00028544085,0.00013275626,0.00026013717,0.004521925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923503,0.00035359134,0.000027083113,0.00008982849,0.00025225745,0.00004218697],"domain_scores_gemma":[0.99911326,0.0004305991,0.00004902866,0.00008597284,0.00024785352,0.00007317828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020456822,0.0010762105,0.0018059004,0.0007545344,0.0005982835,0.0011529675,0.001953959,0.0019365601,0.0068759327],"category_scores_gemma":[0.0038528773,0.0008132763,0.0011592866,0.00079581485,0.0011200395,0.0011292277,0.0023198659,0.0030718923,0.0017026642],"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.0002554488,0.00031543477,0.0003170259,0.0004454388,0.00010490378,0.00014976187,0.00015714408,0.69745713,0.0076101567,0.11230791,0.0084981555,0.17238145],"study_design_scores_gemma":[0.000017693541,0.000021937278,0.000018763698,0.000009360253,0.0000051319657,0.000013863987,0.0000044691587,0.9916319,0.0003665757,0.00648827,0.0014167785,0.000005179922],"about_ca_topic_score_codex":0.0017288374,"about_ca_topic_score_gemma":0.0017030931,"teacher_disagreement_score":0.0068759327,"about_ca_system_score_codex":0.00058197766,"about_ca_system_score_gemma":0.0016348478,"threshold_uncertainty_score":0.023002267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008453281,0.00003577815,0.99842715,0.000017034838,0.000013748424,0.000008112731,0.0000072603134,0.00015302039,0.0004924944],"genre_scores_gemma":[0.05384226,0.00012740254,0.9425799,0.000055910907,0.000044836903,0.00017494294,0.00007617913,0.00030703412,0.0027914254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995347,0.00012720647,0.000017795524,0.00007512745,0.00021616419,0.000029052293],"domain_scores_gemma":[0.999373,0.00033349937,0.000042055326,0.00007903548,0.00014565077,0.000026773478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011070695,0.0010483479,0.0010594714,0.0007898502,0.00042264946,0.0005523644,0.0010615956,0.00079680135,0.0037441128],"category_scores_gemma":[0.0019844188,0.00046652177,0.00091078086,0.00061135343,0.0006423303,0.0010886634,0.0010835645,0.0011771113,0.00085956627],"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.00011744919,0.00006714754,0.0005025233,0.00022791757,0.000098890814,0.000094676325,0.00010336307,0.6032107,0.022277858,0.05298323,0.0038797162,0.31643653],"study_design_scores_gemma":[0.000010236165,0.00003167312,0.00006292828,0.00000654334,0.000007976337,0.000026750587,0.0000035856528,0.99099284,0.0019474095,0.004556152,0.0023448612,0.0000088771485],"about_ca_topic_score_codex":0.0011725118,"about_ca_topic_score_gemma":0.0015707623,"teacher_disagreement_score":0.0037441128,"about_ca_system_score_codex":0.00035030948,"about_ca_system_score_gemma":0.0009820439,"threshold_uncertainty_score":0.01252532},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001965372,0.000058021065,0.99542445,0.00024887256,0.000047985373,0.000023935447,0.0000199938,0.00006476323,0.0021466876],"genre_scores_gemma":[0.11481071,0.00029449497,0.874501,0.00029646032,0.00022044574,0.0003539976,0.00014482852,0.00022671685,0.009151367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904543,0.00031177158,0.000042965166,0.0001811779,0.00032170967,0.00009688085],"domain_scores_gemma":[0.997442,0.0018333442,0.000120233235,0.0003191345,0.00020575026,0.00007961063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019769901,0.0008127852,0.0011871967,0.00070160016,0.000933558,0.0012046294,0.0014888338,0.0021228055,0.014955872],"category_scores_gemma":[0.01196599,0.0006393864,0.0011834567,0.0008562653,0.0015044571,0.0022875324,0.0031404959,0.0031363457,0.0015032558],"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.00018175479,0.00011009948,0.0005093488,0.00043444432,0.00007304053,0.00018789826,0.00028124405,0.19475743,0.008374637,0.61817145,0.01271551,0.16420317],"study_design_scores_gemma":[0.00007342321,0.000120064135,0.00022931091,0.0000647905,0.000022011674,0.00017029926,0.00007334657,0.5885745,0.003023976,0.39857808,0.009048252,0.000021842669],"about_ca_topic_score_codex":0.00046721956,"about_ca_topic_score_gemma":0.0007614825,"teacher_disagreement_score":0.014955872,"about_ca_system_score_codex":0.00059328135,"about_ca_system_score_gemma":0.0008388186,"threshold_uncertainty_score":0.050032377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44488028,0.00015916437,0.5476717,0.0008754659,0.00007515117,0.0002441213,0.0008669101,0.0011733058,0.0040539587],"genre_scores_gemma":[0.8195826,0.000079274316,0.17652859,0.000098439785,0.000052224266,0.00019976162,0.0019966078,0.00021773126,0.0012446739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957231,0.0015243542,0.00020962181,0.0009895125,0.0012680003,0.0002854379],"domain_scores_gemma":[0.96920335,0.02337923,0.0018970532,0.002906739,0.0017831892,0.0008304332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037846535,0.0010965649,0.0011663747,0.0011124457,0.0005434979,0.0023558617,0.002573802,0.0020873742,0.0021377027],"category_scores_gemma":[0.038036644,0.0007895138,0.0009387987,0.0011912091,0.0015678894,0.0029859163,0.0022228993,0.0029185629,0.0002648924],"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.0005325561,0.0006896193,0.009952879,0.00029262973,0.00012007501,0.00026895554,0.00033196723,0.78391516,0.006441112,0.114045784,0.005606894,0.07780234],"study_design_scores_gemma":[0.000027852473,0.00007631487,0.0005976451,0.0000096657195,0.0000072939115,0.000045986355,0.00004778123,0.95566165,0.002703473,0.04050936,0.00030317725,0.000009684995],"about_ca_topic_score_codex":0.00088962424,"about_ca_topic_score_gemma":0.0012494557,"teacher_disagreement_score":0.0037846535,"about_ca_system_score_codex":0.0014744358,"about_ca_system_score_gemma":0.0010474524,"threshold_uncertainty_score":0.020015419},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014504413,0.00055720424,0.9808686,0.0006473982,0.0002673197,0.00002703654,0.00017704004,0.00007163434,0.015933301],"genre_scores_gemma":[0.20630252,0.0036041932,0.7047983,0.0018115031,0.0019781508,0.0006474142,0.0016287388,0.000846847,0.0783824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993986,0.00027159156,0.00003460739,0.000080454774,0.00018415964,0.000030591345],"domain_scores_gemma":[0.9991892,0.00034210706,0.000060989914,0.000083116756,0.00025986513,0.00006473769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164708,0.0012304954,0.00088297145,0.0007604608,0.00048172683,0.0021120661,0.0011148056,0.0013972684,0.010949798],"category_scores_gemma":[0.0027441697,0.00037164646,0.00043310088,0.0013345432,0.0009403178,0.0018170824,0.0014962344,0.0031065766,0.002463948],"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.000059236485,0.0000621639,0.00012248463,0.00022014166,0.000026682997,0.00010030635,0.000054729015,0.09945044,0.0014403556,0.8094476,0.023056803,0.06595911],"study_design_scores_gemma":[0.000016745727,0.00005248581,0.00005836773,0.00003945048,0.000011034292,0.00008787524,0.000037033726,0.6395061,0.00073253014,0.33280367,0.02664346,0.000011257902],"about_ca_topic_score_codex":0.0012994751,"about_ca_topic_score_gemma":0.0020875132,"teacher_disagreement_score":0.010949798,"about_ca_system_score_codex":0.0007054164,"about_ca_system_score_gemma":0.00083380856,"threshold_uncertainty_score":0.03663069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028338032,0.008830141,0.98138523,0.00089343684,0.00032150312,0.000029002882,0.00006229573,0.00018982889,0.0054548644],"genre_scores_gemma":[0.1925546,0.017417572,0.76511616,0.000552806,0.0012784702,0.00034562653,0.00037947268,0.0007618573,0.021593463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00020607999,0.000023219334,0.00006391553,0.00014512942,0.000021818454],"domain_scores_gemma":[0.99926966,0.0004583129,0.000048227732,0.000066469016,0.000117986856,0.00003942879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013011241,0.0014121184,0.0015403104,0.0008554653,0.00046294302,0.00097053713,0.0013772013,0.0021123528,0.0025195982],"category_scores_gemma":[0.0036859645,0.0006075783,0.00091040693,0.0018197385,0.0019449206,0.0016142136,0.001745482,0.003041267,0.0007175277],"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.00010178042,0.000034593493,0.00023338576,0.0005444384,0.00007921415,0.000052729465,0.0001499269,0.4737055,0.0015369001,0.30674267,0.009350004,0.20746882],"study_design_scores_gemma":[0.000015782178,0.0000238244,0.00015533504,0.00003612549,0.000009989708,0.000027145572,0.000014547545,0.8710783,0.0003354226,0.12031092,0.007974587,0.000018002476],"about_ca_topic_score_codex":0.0051303618,"about_ca_topic_score_gemma":0.0030542605,"teacher_disagreement_score":0.0051303618,"about_ca_system_score_codex":0.0010948302,"about_ca_system_score_gemma":0.0010409916,"threshold_uncertainty_score":0.010200977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004126217,0.0022529422,0.9605366,0.003528871,0.0009490874,0.0000597832,0.00010928487,0.00020520679,0.028232068],"genre_scores_gemma":[0.29493663,0.008508335,0.6524557,0.0035300287,0.0055638654,0.0007292532,0.0002963578,0.0007397504,0.033240087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791485,0.0010787073,0.00012654877,0.00037063292,0.00042001557,0.00008920331],"domain_scores_gemma":[0.9964592,0.0018639462,0.0002605707,0.0008953398,0.00039142524,0.00012952818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003655792,0.001126715,0.0018021016,0.0025570467,0.0016896832,0.0023503252,0.002480157,0.0014858787,0.006341932],"category_scores_gemma":[0.009436357,0.0005253214,0.0031741625,0.0024480831,0.005947829,0.00619562,0.005024136,0.005122905,0.0012841938],"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.0000054607212,0.0000070315655,0.000089679226,0.000057298723,0.000015542088,0.000022058774,0.00012867291,0.0009439825,0.00015869674,0.9879367,0.0018984288,0.008736446],"study_design_scores_gemma":[0.000007459374,0.000016810216,0.0000979145,0.00003470601,0.000023643526,0.00010086178,0.000044626464,0.008399082,0.00020689986,0.97131604,0.019742096,0.000009838826],"about_ca_topic_score_codex":0.0010390368,"about_ca_topic_score_gemma":0.00077722006,"teacher_disagreement_score":0.006341932,"about_ca_system_score_codex":0.0011539772,"about_ca_system_score_gemma":0.0014092798,"threshold_uncertainty_score":0.021215856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009650841,0.000046925095,0.9982994,0.000030044093,0.000010878137,0.000023084778,0.000011559877,0.00005671346,0.000556409],"genre_scores_gemma":[0.045282498,0.00017454378,0.95274425,0.000045951987,0.0000501021,0.000213881,0.00009725225,0.0000942105,0.0012973746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999228,0.00023460422,0.000024299303,0.00009580418,0.00034284266,0.00007451083],"domain_scores_gemma":[0.99922264,0.00045214177,0.00007709127,0.00006541846,0.00014853921,0.000034189867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015380688,0.0013207091,0.0013127058,0.0010689186,0.0005643823,0.0010604217,0.0015011679,0.0011535117,0.003922391],"category_scores_gemma":[0.0026069244,0.00065161,0.0012148716,0.0012184097,0.0009071062,0.0011847403,0.0013145587,0.0033110594,0.0008476752],"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.0001595391,0.00018270937,0.0004244293,0.00027636465,0.00006668514,0.00018311686,0.00016935669,0.5610737,0.008509182,0.15512002,0.0064583183,0.26737657],"study_design_scores_gemma":[0.00002625534,0.000039862793,0.000048794824,0.00001254446,0.0000081218195,0.00004613386,0.000011242916,0.9821845,0.0010389052,0.014154323,0.002422747,0.0000065022978],"about_ca_topic_score_codex":0.0029508083,"about_ca_topic_score_gemma":0.00187553,"teacher_disagreement_score":0.003922391,"about_ca_system_score_codex":0.00079977757,"about_ca_system_score_gemma":0.0017359285,"threshold_uncertainty_score":0.013121724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041448146,0.0010949093,0.94733703,0.0013410395,0.000244236,0.00007899362,0.00018398787,0.00036330477,0.007908347],"genre_scores_gemma":[0.4887652,0.0013505816,0.49270535,0.00059034396,0.00041654476,0.00050940237,0.0006392875,0.0012453009,0.013777928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.0013982148,0.00012863668,0.00022910874,0.0010408215,0.00026694717],"domain_scores_gemma":[0.95575815,0.038226448,0.000742569,0.0021598288,0.002474432,0.00063859543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062923343,0.001578005,0.0012700157,0.0010880687,0.001016795,0.0020010076,0.0020908497,0.0018817612,0.0074234344],"category_scores_gemma":[0.03445799,0.0006374983,0.00096554746,0.0011573773,0.0028091324,0.0040914277,0.0032572066,0.0047156936,0.0010623741],"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.0010362671,0.00032433588,0.0030280063,0.0005643591,0.00013483119,0.00026918997,0.00050017814,0.6638027,0.009054478,0.21199568,0.008359724,0.10093028],"study_design_scores_gemma":[0.000017032673,0.000029218569,0.00023207231,0.000018501123,0.000008597563,0.000027432736,0.00003287169,0.9695422,0.0010491019,0.028467707,0.0005638121,0.000011418763],"about_ca_topic_score_codex":0.0046475204,"about_ca_topic_score_gemma":0.0073279412,"teacher_disagreement_score":0.0074234344,"about_ca_system_score_codex":0.0018691595,"about_ca_system_score_gemma":0.0025091697,"threshold_uncertainty_score":0.033277392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019822996,0.00008755153,0.99544877,0.000042429354,0.00007598184,0.000034754492,0.000021828182,0.0001583288,0.0021480506],"genre_scores_gemma":[0.037927315,0.00012896681,0.95825857,0.00007734013,0.000060014216,0.0001870205,0.00011390642,0.00018735915,0.0030595784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933225,0.00016250179,0.000025577689,0.00007247277,0.00036522024,0.000041942185],"domain_scores_gemma":[0.9994469,0.00024538985,0.000027135527,0.0000597319,0.00018637574,0.000034473447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011626331,0.0011526182,0.002042686,0.001027826,0.0005388352,0.00093799847,0.0022233592,0.0016217799,0.008897497],"category_scores_gemma":[0.0021383627,0.00071286544,0.001154406,0.0011956181,0.00068409444,0.00093001826,0.0015922793,0.0026545008,0.00194442],"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.00028088744,0.00032345555,0.00038765738,0.0003986258,0.000078942314,0.00011598935,0.00013583736,0.49209854,0.012500179,0.051436882,0.008333485,0.43390957],"study_design_scores_gemma":[0.0000342911,0.000042972297,0.000062859435,0.000010740145,0.0000090910125,0.000026774687,0.0000053267854,0.99261993,0.000604022,0.0042091114,0.002366473,0.000008441718],"about_ca_topic_score_codex":0.0024892502,"about_ca_topic_score_gemma":0.0024201458,"teacher_disagreement_score":0.008897497,"about_ca_system_score_codex":0.00044943776,"about_ca_system_score_gemma":0.0010659385,"threshold_uncertainty_score":0.02976507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012902516,0.0005856396,0.97747654,0.00030160465,0.000075105265,0.00003636019,0.00007415569,0.00017634469,0.008371693],"genre_scores_gemma":[0.52529013,0.0024415425,0.4374537,0.0006025987,0.00022373624,0.00057948707,0.00055111194,0.0012319327,0.031625684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907,0.0003646068,0.000034447006,0.00015376366,0.0003262729,0.000050977585],"domain_scores_gemma":[0.9957194,0.002434318,0.0003835837,0.0005211834,0.0007191666,0.00022226198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021958526,0.0008898871,0.000945279,0.0009194568,0.0010478817,0.0013628082,0.0016261224,0.0012890041,0.0064296196],"category_scores_gemma":[0.012048096,0.0006085621,0.00096071576,0.0010378981,0.0024580902,0.0035566909,0.0035383957,0.004238557,0.0010217323],"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.00027763005,0.00008797601,0.0010064231,0.00054310844,0.00007282445,0.00020075821,0.000523304,0.16558026,0.008056705,0.722277,0.0055481256,0.0958258],"study_design_scores_gemma":[0.000043394637,0.0002120018,0.0003913638,0.00010143816,0.000039409057,0.00021943223,0.0000869789,0.6525861,0.0053708656,0.33138713,0.009526171,0.000035608075],"about_ca_topic_score_codex":0.0010483834,"about_ca_topic_score_gemma":0.0012494398,"teacher_disagreement_score":0.0064296196,"about_ca_system_score_codex":0.0005334764,"about_ca_system_score_gemma":0.0014257744,"threshold_uncertainty_score":0.02150917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023993368,0.00029290805,0.9829596,0.00030862674,0.00015093353,0.00003390964,0.00004982612,0.0003556051,0.013449205],"genre_scores_gemma":[0.22931427,0.00066060055,0.7477399,0.00039789325,0.00040468096,0.00034241402,0.00023023637,0.0008888895,0.020021114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731475,0.0011988216,0.000110353394,0.00026147702,0.00089551485,0.00021916754],"domain_scores_gemma":[0.9962547,0.002117086,0.00021263647,0.00077002094,0.00053087174,0.00011470493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030038017,0.0011758746,0.0012700822,0.0013261662,0.00085366005,0.002939641,0.0016552678,0.0010812706,0.011690778],"category_scores_gemma":[0.016957777,0.00063706434,0.0012368213,0.0015325368,0.0023304871,0.00335547,0.003609237,0.0028901747,0.0023214642],"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.0001600786,0.000081799066,0.00035458273,0.00023360105,0.000058827605,0.000042626583,0.00007382133,0.21838616,0.00072324387,0.62887394,0.007558132,0.14345318],"study_design_scores_gemma":[0.000026025886,0.000039195773,0.00006446428,0.000035196535,0.00001842884,0.000027372454,0.000016933236,0.7615733,0.0010906229,0.22644281,0.010657107,0.000008485011],"about_ca_topic_score_codex":0.0018449717,"about_ca_topic_score_gemma":0.0025596838,"teacher_disagreement_score":0.011690778,"about_ca_system_score_codex":0.0015467935,"about_ca_system_score_gemma":0.0019866875,"threshold_uncertainty_score":0.039109528},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013383184,0.0000916038,0.9847141,0.0000694072,0.000016496699,0.000022475917,0.000036607937,0.00013672077,0.0015293867],"genre_scores_gemma":[0.40635115,0.00041845668,0.58961654,0.00008809085,0.000045120105,0.00013153354,0.00037865064,0.00019836138,0.0027720607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808216,0.0005550198,0.000093777395,0.000204187,0.0009280732,0.00013688127],"domain_scores_gemma":[0.9952519,0.0023912764,0.0003758583,0.0009230853,0.00083954143,0.00021830994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024830538,0.0009221833,0.0010284524,0.0012702268,0.0005440742,0.002170991,0.0017561393,0.00086879067,0.0019192648],"category_scores_gemma":[0.014711415,0.0005611281,0.0008681907,0.0012094617,0.0017005629,0.003803157,0.0027099214,0.0032232255,0.00050671416],"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.000098824996,0.00006745798,0.0013439928,0.00008398325,0.000028070755,0.000109580986,0.00017956093,0.7371037,0.0030849457,0.20117612,0.001109051,0.055614714],"study_design_scores_gemma":[0.0000021747778,0.000013502391,0.00005271342,0.0000076053225,0.0000014924469,0.000018053674,0.000012162917,0.97469556,0.00076679984,0.023981152,0.00044371164,0.000005009845],"about_ca_topic_score_codex":0.005125382,"about_ca_topic_score_gemma":0.004541421,"teacher_disagreement_score":0.005125382,"about_ca_system_score_codex":0.0015528277,"about_ca_system_score_gemma":0.0013741808,"threshold_uncertainty_score":0.013131797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011840592,0.00042412398,0.9899624,0.00017277172,0.00009001063,0.00008301204,0.000098897515,0.0004739879,0.007510643],"genre_scores_gemma":[0.048353724,0.001047712,0.9376999,0.00017021588,0.00011235711,0.0005939591,0.00028778537,0.00049973006,0.01123447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992305,0.00027131295,0.000025740841,0.00007772868,0.00035181697,0.00004284806],"domain_scores_gemma":[0.9990226,0.00038044667,0.000077717326,0.00019520496,0.00028402667,0.000039916806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689396,0.0011567131,0.0012721804,0.0007626183,0.00080089364,0.0010481182,0.0018748188,0.0011242663,0.0116669955],"category_scores_gemma":[0.0030287174,0.0006624436,0.00092707877,0.00092077453,0.0008571416,0.001035151,0.0016132663,0.0014760358,0.004732118],"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.00006829517,0.00006548725,0.0004072116,0.0004965072,0.00008805526,0.00010356564,0.000117967924,0.61218125,0.0030228023,0.21199313,0.012637432,0.15881833],"study_design_scores_gemma":[0.000033402677,0.000026339934,0.00012848382,0.000024761453,0.000007764271,0.00007179814,0.000015205356,0.9313204,0.0008017954,0.04844325,0.019111944,0.000014912395],"about_ca_topic_score_codex":0.0025985923,"about_ca_topic_score_gemma":0.0036021427,"teacher_disagreement_score":0.0116669955,"about_ca_system_score_codex":0.00074075547,"about_ca_system_score_gemma":0.0015055786,"threshold_uncertainty_score":0.039029956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002645331,0.00007278578,0.99627566,0.00006098712,0.00004420204,0.000016498154,0.000007692298,0.00012096427,0.0007558504],"genre_scores_gemma":[0.117136054,0.00023242763,0.8785647,0.00015402724,0.00010440497,0.00022879231,0.000074608826,0.000117802185,0.0033872216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992393,0.00026130138,0.00003769807,0.00013251927,0.0002551021,0.00007408583],"domain_scores_gemma":[0.99825424,0.0011472944,0.00008245282,0.00015991704,0.0002929075,0.00006320816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015568199,0.00083600427,0.0010570538,0.00075422594,0.00047951317,0.0010352293,0.0019354977,0.0016581182,0.0042044674],"category_scores_gemma":[0.008596743,0.0006117072,0.00076491135,0.0009882913,0.0010800528,0.0014969946,0.0017317209,0.0023488733,0.0008630998],"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.00038177057,0.00015246207,0.0007970324,0.00015853821,0.00007345109,0.00008677647,0.00016707176,0.48262104,0.008533249,0.1085789,0.005333425,0.39311635],"study_design_scores_gemma":[0.000025370828,0.000021905524,0.000041813146,0.0000062337276,0.000006224472,0.000018651499,0.000005215741,0.9916821,0.0004558499,0.0069680046,0.00076328916,0.000005362838],"about_ca_topic_score_codex":0.0031289598,"about_ca_topic_score_gemma":0.0030898727,"teacher_disagreement_score":0.0042044674,"about_ca_system_score_codex":0.0008971872,"about_ca_system_score_gemma":0.0014209258,"threshold_uncertainty_score":0.014065385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025636913,0.00023832575,0.96552646,0.00037519852,0.000033650063,0.000031678544,0.00004714322,0.00003451556,0.008076085],"genre_scores_gemma":[0.6226605,0.0006950039,0.35921037,0.00015193077,0.0000926777,0.00022723552,0.00021704647,0.000104918094,0.016640253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972373,0.000101532554,0.000012480518,0.00002789026,0.000104201245,0.000030124713],"domain_scores_gemma":[0.99947315,0.00021428356,0.000089946436,0.000035212208,0.00013867617,0.000048755086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010680595,0.0005436831,0.0005512712,0.00045816047,0.00039083275,0.0009740656,0.0005200241,0.00070280104,0.0014781196],"category_scores_gemma":[0.0022738413,0.00023669867,0.00036451413,0.0003713389,0.0011762466,0.0011402555,0.0010805803,0.0011140428,0.00025963978],"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.00003273861,0.000027525693,0.0003318072,0.00010451058,0.000011327019,0.00015416245,0.00011674296,0.28876394,0.003963073,0.68639743,0.0014541082,0.018642668],"study_design_scores_gemma":[0.000011493439,0.000031346597,0.00006924744,0.000015398853,0.0000026670382,0.000045540484,0.000024372275,0.8905484,0.0008060282,0.10581904,0.002617145,0.00000929261],"about_ca_topic_score_codex":0.0009822119,"about_ca_topic_score_gemma":0.0012975964,"teacher_disagreement_score":0.0014781196,"about_ca_system_score_codex":0.00067134463,"about_ca_system_score_gemma":0.001424435,"threshold_uncertainty_score":0.0056484938},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007545208,0.0006410623,0.97523654,0.00041209464,0.00015005945,0.00008366001,0.00011598427,0.00008988909,0.015725413],"genre_scores_gemma":[0.42394733,0.0013226878,0.5489055,0.00037039758,0.00035478495,0.0008217488,0.0003267798,0.00054648315,0.023404274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933296,0.00033495857,0.000022459088,0.00009085969,0.0001685526,0.00005012038],"domain_scores_gemma":[0.99905175,0.0006872588,0.00008049323,0.000036114543,0.00010348653,0.00004085813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031149106,0.0019180439,0.0014766396,0.0010715903,0.00083371083,0.0021619506,0.0016374197,0.0015889406,0.0076202615],"category_scores_gemma":[0.0057074195,0.00086535455,0.0006765437,0.0011558618,0.0013696979,0.0032616633,0.0014080663,0.0019010793,0.00079309667],"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.00016769125,0.000059631053,0.0002846391,0.00037195382,0.000043809505,0.00006953901,0.00009946072,0.7380644,0.002077938,0.1996735,0.0043714913,0.054715965],"study_design_scores_gemma":[0.000020657983,0.00006458104,0.00013488733,0.000042252104,0.000015015006,0.000032643573,0.000027327555,0.88493776,0.00085452106,0.11048495,0.0033726257,0.000012866553],"about_ca_topic_score_codex":0.0013815719,"about_ca_topic_score_gemma":0.00190881,"teacher_disagreement_score":0.0076202615,"about_ca_system_score_codex":0.0013470325,"about_ca_system_score_gemma":0.001032747,"threshold_uncertainty_score":0.02549237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21138735,0.0034832847,0.7547267,0.0038316099,0.000646418,0.00007553335,0.00018293086,0.00062000373,0.025046142],"genre_scores_gemma":[0.92197937,0.0011483297,0.067064,0.00034416543,0.0002832887,0.00010192074,0.000109418535,0.00035662012,0.008613011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950016,0.00018249184,0.000028151593,0.000056493132,0.00018612384,0.00004663167],"domain_scores_gemma":[0.99652535,0.0019310951,0.0002946626,0.00068530324,0.00043804623,0.00012568747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013067282,0.0003009008,0.0006218635,0.0006209654,0.00081525836,0.001227943,0.00065270485,0.0009512419,0.0032494364],"category_scores_gemma":[0.013187958,0.0005180612,0.0003888951,0.00049136457,0.0012362725,0.0024427036,0.0010056961,0.0012469402,0.00049923564],"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.00037005925,0.00005199558,0.0048815645,0.0003325782,0.00016284896,0.00029726262,0.00057049905,0.38503388,0.010773923,0.5137032,0.009439424,0.07438276],"study_design_scores_gemma":[0.00005388743,0.000048411002,0.0017336789,0.000034231187,0.000019882998,0.0001440519,0.00005471213,0.8268483,0.0018940296,0.1631966,0.00594283,0.000029356543],"about_ca_topic_score_codex":0.0012037324,"about_ca_topic_score_gemma":0.0012853661,"teacher_disagreement_score":0.0032494364,"about_ca_system_score_codex":0.0006263022,"about_ca_system_score_gemma":0.0006075803,"threshold_uncertainty_score":0.010870457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05954456,0.0017518935,0.9099048,0.002530553,0.00029739458,0.00013732744,0.0002691786,0.00034665153,0.025217596],"genre_scores_gemma":[0.9087021,0.0026405633,0.0726324,0.0015848919,0.00064250437,0.00035477607,0.00039760326,0.00064914353,0.012395987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929617,0.0045880917,0.00018071356,0.0008152221,0.0009926003,0.00046157162],"domain_scores_gemma":[0.90682644,0.081878684,0.0037059,0.0022934151,0.0034136884,0.0018819423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012647139,0.0028104673,0.0028046572,0.0027902883,0.0012694575,0.0037223366,0.0020840366,0.0025283212,0.0059536085],"category_scores_gemma":[0.08095013,0.0018769455,0.0021742296,0.0019035971,0.0064924606,0.006581623,0.006237312,0.0067117587,0.00042834214],"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.00032094284,0.00017101549,0.0009906149,0.00048018634,0.00017625035,0.00031877006,0.00056975323,0.32950604,0.0065963482,0.63934493,0.0043990896,0.017125998],"study_design_scores_gemma":[0.00002149242,0.00007894238,0.0004515888,0.00008597862,0.00003776119,0.00011241952,0.00007618606,0.60513496,0.001514103,0.39157918,0.0008523172,0.000055022276],"about_ca_topic_score_codex":0.0018375489,"about_ca_topic_score_gemma":0.0009371039,"teacher_disagreement_score":0.012647139,"about_ca_system_score_codex":0.002579655,"about_ca_system_score_gemma":0.0017113327,"threshold_uncertainty_score":0.06688523},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07094704,0.0039172424,0.8992126,0.0060215937,0.00019344165,0.0001591877,0.0004224459,0.0002990314,0.0188274],"genre_scores_gemma":[0.81773484,0.0033217403,0.16600165,0.0013272746,0.0019283197,0.0010711589,0.0009437394,0.00042380227,0.007247454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9808157,0.006412455,0.0009442162,0.003087336,0.006410963,0.002329269],"domain_scores_gemma":[0.82897717,0.1388993,0.01171258,0.008500021,0.006260491,0.005650545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016931556,0.0028376372,0.0033813335,0.008380854,0.0027169422,0.012955,0.0061772387,0.0052848593,0.005746134],"category_scores_gemma":[0.1110765,0.0020702041,0.0039348262,0.0069190213,0.009549895,0.025454452,0.008651962,0.014020308,0.00056949357],"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.00008807953,0.00009192774,0.0009787931,0.00014020207,0.00004704878,0.0000327333,0.00026779494,0.018484322,0.00055474933,0.96752506,0.0012453472,0.010543931],"study_design_scores_gemma":[0.00002001689,0.0000651165,0.0010998183,0.00007297107,0.000039630424,0.0001064313,0.000100236524,0.16848491,0.00057531963,0.827561,0.0018166943,0.00005778066],"about_ca_topic_score_codex":0.0011801663,"about_ca_topic_score_gemma":0.0007854765,"teacher_disagreement_score":0.016931556,"about_ca_system_score_codex":0.008318814,"about_ca_system_score_gemma":0.0027682763,"threshold_uncertainty_score":0.08954364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019549593,0.0013963634,0.93945974,0.0010800338,0.00042686868,0.00003497068,0.000052891035,0.000060092156,0.037939433],"genre_scores_gemma":[0.68078965,0.002590475,0.2886542,0.00094290625,0.0011033666,0.00024508339,0.0001224406,0.00026700317,0.025284812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991437,0.00045939477,0.000045448778,0.0000969291,0.00019740712,0.000057079797],"domain_scores_gemma":[0.9987105,0.00079335645,0.00010152701,0.000119851065,0.00019175062,0.000082935556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025508944,0.0008306678,0.001174708,0.0015757678,0.00096797507,0.0026779529,0.0013496341,0.0009818255,0.003900647],"category_scores_gemma":[0.0050034807,0.0005807896,0.0013171003,0.0013978081,0.003965601,0.0058719814,0.0030935116,0.0038541516,0.0003897153],"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.000008709053,0.000009408347,0.000026438478,0.000018443588,0.0000058186292,0.000014055076,0.000040476745,0.002620378,0.00015674451,0.99404633,0.00029581794,0.0027574538],"study_design_scores_gemma":[0.0000043099863,0.0000072145726,0.000016919965,0.0000072881103,0.0000039117326,0.000015388225,0.000014384649,0.02641431,0.00008383106,0.9724501,0.0009778778,0.0000044092753],"about_ca_topic_score_codex":0.00078685686,"about_ca_topic_score_gemma":0.00075379485,"teacher_disagreement_score":0.003900647,"about_ca_system_score_codex":0.0010266887,"about_ca_system_score_gemma":0.0007942497,"threshold_uncertainty_score":0.013490617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025639404,0.00018044123,0.96440405,0.00015406925,0.00007807091,0.000060942406,0.000102861646,0.0005272745,0.008852881],"genre_scores_gemma":[0.4860172,0.00021994057,0.49220687,0.00012403661,0.00005649958,0.0003240753,0.0002697455,0.0003664135,0.020415204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976903,0.00005210341,0.000012137945,0.00004446155,0.00009849308,0.000023846285],"domain_scores_gemma":[0.999826,0.00006891384,0.000022203174,0.000034276378,0.000042013202,0.0000066771127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694282,0.0005377265,0.0011535266,0.00051456725,0.0005675258,0.0008561409,0.00085808424,0.00079316506,0.005492079],"category_scores_gemma":[0.00084475067,0.0003861589,0.00079961447,0.0007294467,0.00035175352,0.00087430264,0.0006048797,0.0008450622,0.0005654818],"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.00017411052,0.000074383504,0.0003299377,0.00011773798,0.00004711696,0.0000430456,0.000037864593,0.89766014,0.009984197,0.022536838,0.0012846699,0.06771001],"study_design_scores_gemma":[0.000009523197,0.000026808728,0.00007594955,0.0000033130464,0.0000067997385,0.0000067048218,0.0000046280857,0.99371606,0.002862136,0.0018144831,0.0014702396,0.000003456637],"about_ca_topic_score_codex":0.0022827673,"about_ca_topic_score_gemma":0.002934695,"teacher_disagreement_score":0.005492079,"about_ca_system_score_codex":0.0008370222,"about_ca_system_score_gemma":0.0010683119,"threshold_uncertainty_score":0.018372893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014976983,0.0002795044,0.9788193,0.0005447523,0.0001059606,0.00006956612,0.00004632574,0.0010355732,0.0041220677],"genre_scores_gemma":[0.3314008,0.0002551657,0.65737545,0.0003261973,0.00008836171,0.00020388837,0.00013355167,0.00025953545,0.009957027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817,0.0005845002,0.00012361704,0.00022132718,0.0006807326,0.00021980656],"domain_scores_gemma":[0.99689555,0.0014337309,0.00018570469,0.0006729041,0.00064368267,0.0001683915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026053775,0.0008880135,0.001401756,0.00068027555,0.0010369227,0.00150597,0.0025751046,0.001475643,0.0063350215],"category_scores_gemma":[0.008908638,0.0005017469,0.0006204294,0.0012062157,0.001783668,0.0017015857,0.0019481734,0.0034705934,0.0015427036],"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.0013126314,0.00021366401,0.0024762,0.00032610242,0.00013033093,0.00044454983,0.0004957494,0.5088878,0.006712336,0.24546736,0.00730878,0.22622448],"study_design_scores_gemma":[0.0000617898,0.000050441173,0.00009257515,0.000018365376,0.000009490432,0.00003853215,0.000017889148,0.97651947,0.0024734924,0.018676996,0.0020281968,0.000012757382],"about_ca_topic_score_codex":0.0075908,"about_ca_topic_score_gemma":0.006454371,"teacher_disagreement_score":0.0075908,"about_ca_system_score_codex":0.0012794075,"about_ca_system_score_gemma":0.0037501794,"threshold_uncertainty_score":0.02119273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045872163,0.001185137,0.7473002,0.059786305,0.003972611,0.0001751022,0.00075982016,0.00042011062,0.14052853],"genre_scores_gemma":[0.6879573,0.0021482944,0.19174373,0.01452581,0.004389179,0.0006362682,0.0015999305,0.0010375374,0.09596199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984366,0.0007222876,0.00006940625,0.00020557002,0.0004312347,0.00013486626],"domain_scores_gemma":[0.98621225,0.010516451,0.00055876793,0.00053231686,0.0014639657,0.00071630516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047496674,0.0014550706,0.0013441318,0.0016778606,0.0016067029,0.0022535631,0.00279523,0.0041407244,0.022613881],"category_scores_gemma":[0.035002686,0.00046647576,0.0017789927,0.0011213485,0.0045264675,0.0045853285,0.0036623704,0.0052045933,0.0013247138],"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.00016500999,0.000032498065,0.00025152118,0.00018702805,0.000029626079,0.0003724907,0.00018342322,0.01721684,0.0012809994,0.9549018,0.01697747,0.008401412],"study_design_scores_gemma":[0.000062994855,0.000076096825,0.00028565677,0.000069549904,0.000011979002,0.00013197056,0.00014812259,0.07083602,0.0006877349,0.9180808,0.009580785,0.00002827217],"about_ca_topic_score_codex":0.0018078439,"about_ca_topic_score_gemma":0.0010814097,"teacher_disagreement_score":0.022613881,"about_ca_system_score_codex":0.0008256642,"about_ca_system_score_gemma":0.00061615446,"threshold_uncertainty_score":0.07565099},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119395,0.0046690255,0.9565749,0.009296448,0.00061118306,0.000051730953,0.00012420124,0.0004597851,0.016273212],"genre_scores_gemma":[0.30770397,0.004700687,0.66717154,0.0031747161,0.001263522,0.00048505317,0.00037377948,0.0021849333,0.0129417665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870249,0.0065704486,0.00035736454,0.0010696088,0.004261747,0.0007160417],"domain_scores_gemma":[0.9120801,0.0705162,0.0023058287,0.00934185,0.004157024,0.0015990176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014459569,0.0023042941,0.0035508673,0.0020660935,0.0016894693,0.00487206,0.0032831938,0.004379797,0.009565938],"category_scores_gemma":[0.12220429,0.0016075546,0.0025339373,0.001972255,0.0080166375,0.018234428,0.007462808,0.012763548,0.0023915193],"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.00035378672,0.000095508425,0.0012031221,0.0002827461,0.00014146711,0.000058699963,0.00023942198,0.11492417,0.0010202528,0.7754178,0.012282547,0.09398043],"study_design_scores_gemma":[0.000038166334,0.000051971492,0.00021888559,0.000114230636,0.0000261669,0.00004640315,0.000046122463,0.23331036,0.001028418,0.7597757,0.0053153224,0.00002829737],"about_ca_topic_score_codex":0.0019524149,"about_ca_topic_score_gemma":0.0021738415,"teacher_disagreement_score":0.014459569,"about_ca_system_score_codex":0.0018869163,"about_ca_system_score_gemma":0.00222596,"threshold_uncertainty_score":0.076470375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009772979,0.0001696806,0.99743253,0.000080052436,0.000026744181,0.000011371371,0.000008787492,0.000124578,0.0011689056],"genre_scores_gemma":[0.17696348,0.0013278299,0.80969393,0.00032005904,0.00016708394,0.00040393134,0.00024788658,0.0006099667,0.010265852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991763,0.00031571698,0.00002887821,0.00008734255,0.00032049956,0.00007118787],"domain_scores_gemma":[0.9993605,0.00033461722,0.000046250578,0.000041782165,0.00017546245,0.00004145021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012314398,0.00096450624,0.001201077,0.00067488226,0.0005105265,0.0008199559,0.0012197475,0.0009215324,0.0038734404],"category_scores_gemma":[0.0028086088,0.00029299382,0.0006540412,0.000761126,0.0007795328,0.0016223135,0.0011603953,0.0021758396,0.0015227782],"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.00030679337,0.00017223347,0.0006261232,0.0008246556,0.000092965245,0.00024776254,0.00021344944,0.51033926,0.013315283,0.20444633,0.011884356,0.25753072],"study_design_scores_gemma":[0.000027079897,0.000046295052,0.00006479882,0.000021069744,0.00000943702,0.000056057153,0.000010065073,0.9739032,0.002001743,0.01934501,0.004504701,0.0000105397],"about_ca_topic_score_codex":0.0012866436,"about_ca_topic_score_gemma":0.0006912437,"teacher_disagreement_score":0.0038734404,"about_ca_system_score_codex":0.000555355,"about_ca_system_score_gemma":0.0012047975,"threshold_uncertainty_score":0.012957931},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034134177,0.003264297,0.0042274036,0.06320069,0.9098348,0.000043720836,0.0008843576,0.0002810099,0.017922398],"genre_scores_gemma":[0.02256154,0.01969385,0.028300956,0.08668833,0.2815802,0.00036285483,0.0038011686,0.0024870022,0.554524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656916,0.00048014746,0.00058749673,0.00051411986,0.0016386032,0.00021045539],"domain_scores_gemma":[0.9844996,0.0036927003,0.00057478895,0.0010558678,0.009695551,0.00048140332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758774,0.001886481,0.0019772311,0.0035446282,0.003393026,0.003935138,0.0029000607,0.0056249015,0.056231134],"category_scores_gemma":[0.042685628,0.000812703,0.0014083983,0.0037841343,0.002864541,0.0044710063,0.0016508916,0.008508145,0.031914487],"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.000035169207,0.000008045703,0.000040439456,0.00008900725,0.0000066993516,0.00008723244,0.000016964812,0.00014685316,0.00003728987,0.006527675,0.983227,0.009777605],"study_design_scores_gemma":[0.000039480845,0.000047880105,0.00045815227,0.0003669504,0.000049104634,0.00051408535,0.00011667483,0.0013676381,0.00042776857,0.01784332,0.9787143,0.00005467287],"about_ca_topic_score_codex":0.013668409,"about_ca_topic_score_gemma":0.016823977,"teacher_disagreement_score":0.056231134,"about_ca_system_score_codex":0.0054101013,"about_ca_system_score_gemma":0.005788358,"threshold_uncertainty_score":0.1881119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019985775,0.00040974352,0.9756704,0.00014976384,0.00007140743,0.000054620275,0.00002882283,0.00020365842,0.0034258019],"genre_scores_gemma":[0.3923158,0.00072637,0.5934109,0.00015647538,0.00010207149,0.00025857062,0.00017268192,0.00040613572,0.012450927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940944,0.00024262253,0.00002636702,0.000058144447,0.00021495964,0.000048601152],"domain_scores_gemma":[0.99879813,0.0005261667,0.00013930134,0.00014646584,0.0003294228,0.000060455604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012164465,0.00074816524,0.00082042057,0.00049950485,0.00038066597,0.00057813775,0.00115298,0.000888088,0.0024992763],"category_scores_gemma":[0.0026530079,0.0002957808,0.00057358464,0.0003000869,0.0008380976,0.0010177783,0.0008827956,0.0009895298,0.0007109867],"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.0003324779,0.00012636045,0.0020287456,0.00070160965,0.00014032521,0.00028998463,0.0002859878,0.6935548,0.027944766,0.1511924,0.0038579889,0.1195445],"study_design_scores_gemma":[0.0000089613,0.000028256089,0.000095434996,0.0000049740393,0.0000037603068,0.000029163546,0.000004987591,0.99429023,0.0015477,0.0034882233,0.0004902097,0.0000080123455],"about_ca_topic_score_codex":0.0028232115,"about_ca_topic_score_gemma":0.002538445,"teacher_disagreement_score":0.0028232115,"about_ca_system_score_codex":0.00048110873,"about_ca_system_score_gemma":0.0012326597,"threshold_uncertainty_score":0.008360922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003434235,0.00040470427,0.99433523,0.00019886995,0.00006873817,0.000010580447,0.000018699971,0.0000482931,0.0014805401],"genre_scores_gemma":[0.36032513,0.0016630826,0.62306255,0.00016390931,0.0003180101,0.0002218974,0.00015591625,0.00026235287,0.013827167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953544,0.00019922655,0.000018159784,0.000050253173,0.0001683252,0.0000286019],"domain_scores_gemma":[0.9984831,0.0010294343,0.0001367503,0.000089654975,0.00019581178,0.00006524535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013439371,0.0008692013,0.0010771834,0.0004917083,0.0005356664,0.0010774169,0.0009158232,0.0015089106,0.0027854962],"category_scores_gemma":[0.0056541897,0.0005212476,0.0005382839,0.0006350587,0.0011890993,0.0013557147,0.0013700514,0.0023002285,0.0004432271],"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.000111862675,0.000036571982,0.00022835551,0.00023547266,0.000030589756,0.00007741551,0.00012770477,0.8702717,0.0012729301,0.06879257,0.0022228798,0.056591954],"study_design_scores_gemma":[0.0000068828795,0.000012330448,0.000068861664,0.00001128431,0.0000036214028,0.000012962943,0.000008596071,0.9853994,0.0001947993,0.013419514,0.0008567517,0.0000048914562],"about_ca_topic_score_codex":0.0042528175,"about_ca_topic_score_gemma":0.004396826,"teacher_disagreement_score":0.0042528175,"about_ca_system_score_codex":0.00064033014,"about_ca_system_score_gemma":0.0013425569,"threshold_uncertainty_score":0.009318411},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009736371,0.00027758608,0.9808624,0.0002267206,0.00016287657,0.00014173666,0.00021410499,0.00093107246,0.00744707],"genre_scores_gemma":[0.11031975,0.00024111418,0.8843786,0.000190822,0.000107422886,0.0002659439,0.000612238,0.00062912615,0.0032549766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783593,0.0010476388,0.0001228312,0.00017028624,0.000566888,0.00025631834],"domain_scores_gemma":[0.99258703,0.0048818206,0.0003168339,0.000912926,0.0010849291,0.00021645216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033359446,0.001839431,0.0014620278,0.0018236614,0.001067649,0.0023191508,0.001771274,0.0008499766,0.01817049],"category_scores_gemma":[0.011293205,0.00095903483,0.0010034111,0.0026493664,0.0009168049,0.0038767902,0.0016945233,0.004581421,0.0025276705],"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.0013462098,0.0005433627,0.0006827036,0.0006531673,0.00007207945,0.00018553446,0.0002584045,0.19421178,0.013314338,0.24938111,0.016730977,0.5226204],"study_design_scores_gemma":[0.00020047186,0.0001456629,0.00015811782,0.00008712922,0.000033313943,0.000052120948,0.000060133927,0.86032313,0.00897588,0.11961225,0.010320356,0.000031521944],"about_ca_topic_score_codex":0.0030475901,"about_ca_topic_score_gemma":0.006433477,"teacher_disagreement_score":0.01817049,"about_ca_system_score_codex":0.00082590966,"about_ca_system_score_gemma":0.0023700881,"threshold_uncertainty_score":0.060786426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010892992,0.00008139182,0.99586415,0.000075419055,0.00004250174,0.000031483716,0.00005242787,0.00021445463,0.0025487468],"genre_scores_gemma":[0.09317889,0.0003063093,0.8963793,0.00028364174,0.000115945324,0.0005403737,0.00044084646,0.0006538008,0.0081009185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981256,0.00077050156,0.00007103844,0.0002125832,0.0006781365,0.00014219312],"domain_scores_gemma":[0.99572337,0.0025743423,0.00016932008,0.0005620272,0.0008259808,0.00014501343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722232,0.002163315,0.0017694354,0.0013665798,0.0008913675,0.0020076002,0.002434095,0.0017977554,0.011244174],"category_scores_gemma":[0.009795479,0.0009685825,0.0013923715,0.0016698138,0.0013257754,0.0021995197,0.0025206173,0.005889762,0.002520187],"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.00030427316,0.00036631207,0.0003168531,0.00047696682,0.000103869264,0.00019936042,0.00025812176,0.54179776,0.010926009,0.24816185,0.020432191,0.1766565],"study_design_scores_gemma":[0.00001724258,0.000022840462,0.00005444592,0.000025213827,0.000009603112,0.000029330899,0.000008559466,0.95947516,0.0014818112,0.036771398,0.0020936993,0.0000106721545],"about_ca_topic_score_codex":0.002664533,"about_ca_topic_score_gemma":0.0034329446,"teacher_disagreement_score":0.011244174,"about_ca_system_score_codex":0.0011721607,"about_ca_system_score_gemma":0.0020609882,"threshold_uncertainty_score":0.037615538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020429315,0.00016924112,0.9871071,0.0002097426,0.0000746174,0.000054515822,0.0003469588,0.005240131,0.004754601],"genre_scores_gemma":[0.043022037,0.00017973034,0.9507288,0.0002220218,0.000065618886,0.00027490756,0.00062225055,0.0015183287,0.00336643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914587,0.00035910172,0.000058517013,0.00010811472,0.00025697614,0.000071386654],"domain_scores_gemma":[0.9983481,0.001046887,0.000085737505,0.00026357832,0.00020236617,0.000053395328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562597,0.0015441807,0.0010426557,0.0011649439,0.00057825376,0.0018402227,0.002164981,0.0016467426,0.015421149],"category_scores_gemma":[0.0062794136,0.00097338273,0.0015633875,0.0011786344,0.00054148876,0.001936491,0.0021676095,0.0027942064,0.003552315],"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.00038095095,0.00021596228,0.0010797521,0.00073654053,0.00027749783,0.0001952162,0.00012891006,0.5115927,0.0044902316,0.08159921,0.03775558,0.36154756],"study_design_scores_gemma":[0.000082566075,0.000027531121,0.000055646015,0.00003301105,0.00003432115,0.000037788708,0.000021273874,0.960284,0.0015588773,0.026000153,0.011855028,0.000009773497],"about_ca_topic_score_codex":0.0016179534,"about_ca_topic_score_gemma":0.0040967376,"teacher_disagreement_score":0.015421149,"about_ca_system_score_codex":0.0006298534,"about_ca_system_score_gemma":0.0018182686,"threshold_uncertainty_score":0.051588893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010854382,0.0021796795,0.9647374,0.0015219009,0.00042633884,0.00014465416,0.00023112229,0.0005931906,0.019311212],"genre_scores_gemma":[0.4591739,0.008337473,0.47285646,0.0052585267,0.0014038914,0.002252852,0.0018911152,0.00393573,0.044890035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368864,0.0023982562,0.00034678043,0.0013127457,0.0016010432,0.0006526492],"domain_scores_gemma":[0.9589997,0.027937576,0.0015864463,0.00487879,0.005592323,0.0010052688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011474984,0.004311215,0.0041155443,0.0036495952,0.0021193104,0.0038938147,0.0048651174,0.0044889236,0.016581558],"category_scores_gemma":[0.093004815,0.0019335165,0.0029835282,0.004660276,0.0055086077,0.011778753,0.008526991,0.009889324,0.0049862377],"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.0004900065,0.00017703611,0.0011706266,0.0012956809,0.0003216106,0.00020340114,0.00052899454,0.27057716,0.0031564883,0.60740966,0.020335155,0.094334155],"study_design_scores_gemma":[0.00006715931,0.00011987534,0.00035997652,0.00016897412,0.00007634251,0.00015740599,0.00011322164,0.4315772,0.001465055,0.5602399,0.0056140097,0.00004087575],"about_ca_topic_score_codex":0.0023560894,"about_ca_topic_score_gemma":0.00254243,"teacher_disagreement_score":0.016581558,"about_ca_system_score_codex":0.0019043512,"about_ca_system_score_gemma":0.0028175884,"threshold_uncertainty_score":0.06068623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08826692,0.00071091455,0.8198039,0.0023276024,0.00070089137,0.0003228976,0.0010570535,0.0004055118,0.0864044],"genre_scores_gemma":[0.87112164,0.001253323,0.09735839,0.0010038683,0.0011311703,0.000379295,0.0017802215,0.00049889303,0.025473159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973683,0.0007178442,0.00018195297,0.0004584735,0.0009215921,0.00035194782],"domain_scores_gemma":[0.9846875,0.008042584,0.0011015862,0.00088411407,0.0042062956,0.0010779155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038417608,0.0014654631,0.0017298853,0.0022107058,0.0012499201,0.004140111,0.0019455038,0.0020214587,0.019079221],"category_scores_gemma":[0.023881547,0.00089811307,0.0014203739,0.0012814496,0.003319877,0.0075672795,0.0026187594,0.006219742,0.0016310409],"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.00011929955,0.0001680166,0.00040020392,0.00018565067,0.000034094854,0.00041430723,0.00031226702,0.017632423,0.002484271,0.9589373,0.0056989747,0.013613183],"study_design_scores_gemma":[0.000049714065,0.000091143884,0.00048005,0.00004682857,0.000019316158,0.00016666352,0.000207217,0.16002053,0.0012259716,0.83535755,0.0022854952,0.00004940326],"about_ca_topic_score_codex":0.0021371434,"about_ca_topic_score_gemma":0.002489956,"teacher_disagreement_score":0.019079221,"about_ca_system_score_codex":0.0012234936,"about_ca_system_score_gemma":0.0024099238,"threshold_uncertainty_score":0.06382632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011440626,0.0014805766,0.9596521,0.0004515232,0.00023244285,0.000011859803,0.00007073479,0.00021530091,0.036741342],"genre_scores_gemma":[0.18164782,0.009167679,0.6758328,0.00091058,0.0011471775,0.00037350514,0.00059694715,0.0009814613,0.12934205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995234,0.00014074447,0.000020261783,0.000061862724,0.00022892562,0.000024866056],"domain_scores_gemma":[0.9990507,0.00058197486,0.000055489832,0.0001028413,0.00017797027,0.000031069503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315847,0.0016299016,0.00085501664,0.00058290333,0.00036764194,0.0019164891,0.0013750232,0.00091510225,0.009312428],"category_scores_gemma":[0.0026044634,0.0006138886,0.0007362713,0.0010965252,0.0010846143,0.0024143113,0.0011966531,0.0040091295,0.002561045],"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.000028360026,0.000038885857,0.00009897243,0.00013874895,0.000027985872,0.00006085658,0.00007147083,0.124568015,0.0014496313,0.76937205,0.021887362,0.08225763],"study_design_scores_gemma":[0.000009425465,0.000018685056,0.00009016948,0.000053592863,0.000011928331,0.000068933485,0.000023911387,0.5363035,0.0010231172,0.433465,0.028914127,0.000017586932],"about_ca_topic_score_codex":0.0009723943,"about_ca_topic_score_gemma":0.0014654819,"teacher_disagreement_score":0.009312428,"about_ca_system_score_codex":0.00087347924,"about_ca_system_score_gemma":0.0006891612,"threshold_uncertainty_score":0.031153142},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29308897,0.0023267402,0.445978,0.0074480795,0.0006987464,0.00035218892,0.002964152,0.0008495548,0.24629351],"genre_scores_gemma":[0.89616376,0.00068980764,0.06653365,0.0004737415,0.000614258,0.00019104031,0.0013581655,0.0003082536,0.033667378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981925,0.0005574254,0.00006791854,0.00032466836,0.00038382414,0.0004735746],"domain_scores_gemma":[0.994521,0.004180003,0.00048964936,0.00026802454,0.00029708692,0.00024421886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031249,0.0013909665,0.0014961852,0.0008847522,0.0010559361,0.004066969,0.0018871417,0.002780897,0.0190943],"category_scores_gemma":[0.011146195,0.0006151332,0.00080532045,0.0014574892,0.0019911134,0.002892352,0.0018368887,0.003348424,0.0012219615],"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.0010151708,0.0005030878,0.0011255643,0.0009448744,0.00010543002,0.0013903888,0.0003051257,0.21057855,0.0022996399,0.6872329,0.036660116,0.057839137],"study_design_scores_gemma":[0.00021716462,0.00011663649,0.0005246623,0.000051684132,0.000029812802,0.00038876978,0.0002110365,0.3706619,0.0013519049,0.621667,0.0047263894,0.000052978954],"about_ca_topic_score_codex":0.0030743596,"about_ca_topic_score_gemma":0.0042933966,"teacher_disagreement_score":0.0190943,"about_ca_system_score_codex":0.0012879721,"about_ca_system_score_gemma":0.0015713134,"threshold_uncertainty_score":0.06387675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017559612,0.0005717372,0.9708439,0.00038326875,0.00042042506,0.00006290101,0.00011182753,0.00038121696,0.009665084],"genre_scores_gemma":[0.34459507,0.0009568559,0.62244904,0.00040092066,0.0005478943,0.00036550395,0.00055528025,0.0011945379,0.028934946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711955,0.0012481037,0.00015897524,0.00023637619,0.0010034424,0.00023361496],"domain_scores_gemma":[0.9857497,0.007311524,0.00065468735,0.0023611241,0.003218924,0.0007039868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00486415,0.0016898174,0.0015092359,0.0016096124,0.0008740145,0.002500375,0.0021891252,0.0017278016,0.010477279],"category_scores_gemma":[0.02257493,0.00074190734,0.0009622698,0.0012699649,0.0019850035,0.0042868867,0.0030972166,0.004603555,0.0024776622],"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.0009046212,0.00021785616,0.0011689927,0.00045029697,0.00009022213,0.00017771705,0.00025837586,0.34344393,0.010048354,0.49746063,0.012832748,0.13294624],"study_design_scores_gemma":[0.000026633212,0.00008049708,0.00015583975,0.000026236961,0.000011799158,0.000044447755,0.00001472448,0.9420151,0.0018749343,0.05287188,0.0028603529,0.000017402075],"about_ca_topic_score_codex":0.0020538766,"about_ca_topic_score_gemma":0.002539288,"teacher_disagreement_score":0.010477279,"about_ca_system_score_codex":0.0012239564,"about_ca_system_score_gemma":0.0021135472,"threshold_uncertainty_score":0.035049975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022719991,0.00018005125,0.99364,0.00014661856,0.00004083236,0.000026654436,0.00003284504,0.00029639126,0.0033647004],"genre_scores_gemma":[0.25809884,0.0004568825,0.73359615,0.00012111296,0.00010809366,0.00043906443,0.00019766256,0.00036805772,0.0066141332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990864,0.00031913823,0.000048745744,0.000083069695,0.00040203548,0.000060565573],"domain_scores_gemma":[0.9981462,0.0011741685,0.00010441682,0.00024805297,0.00027131438,0.000055909917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015486245,0.00097284146,0.0009291999,0.0011333999,0.0006531921,0.0020122123,0.0012898729,0.00092423277,0.0073024975],"category_scores_gemma":[0.005498771,0.00044226335,0.0007538487,0.0011624559,0.0017457962,0.0013439993,0.0024899596,0.0018243957,0.0016088837],"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.00008959819,0.00002955869,0.00022495637,0.00011711557,0.000033553883,0.00005590344,0.00009611593,0.53819174,0.0014690039,0.37260237,0.0024268783,0.084663235],"study_design_scores_gemma":[0.000010014544,0.000006094541,0.000019146195,0.000009849321,0.000002437822,0.000008715569,0.0000063267644,0.937359,0.00038974124,0.060374796,0.001810482,0.0000034749598],"about_ca_topic_score_codex":0.0028879507,"about_ca_topic_score_gemma":0.0022721512,"teacher_disagreement_score":0.0073024975,"about_ca_system_score_codex":0.0015825672,"about_ca_system_score_gemma":0.0010587837,"threshold_uncertainty_score":0.024429262},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009857042,0.0003275872,0.9870184,0.0004272984,0.00006647123,0.000049739796,0.00019864012,0.00013668489,0.0019181834],"genre_scores_gemma":[0.3749588,0.001261363,0.61128926,0.0003610254,0.0004198663,0.00040401798,0.0014048674,0.00043100247,0.009469747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588484,0.0016644744,0.00019002559,0.00080098846,0.0011898662,0.00026966466],"domain_scores_gemma":[0.9859638,0.009049001,0.000969444,0.0019353327,0.0014856858,0.0005967442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050510517,0.0017598941,0.0028405911,0.0012156941,0.0009445053,0.004093579,0.0035813642,0.0027036965,0.0066103963],"category_scores_gemma":[0.027232192,0.0012546321,0.0012591118,0.0024450575,0.0038620222,0.01005806,0.0038959864,0.0058259335,0.0010561751],"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.00030501458,0.0003161046,0.00045860434,0.000458715,0.00008734547,0.00009588176,0.00024187847,0.51999134,0.0012537318,0.38614088,0.00825537,0.08239514],"study_design_scores_gemma":[0.000027216365,0.000044805834,0.00008138015,0.00001765734,0.000006996063,0.00003869218,0.000053786483,0.7496986,0.00045672755,0.24862665,0.0009263483,0.000021202595],"about_ca_topic_score_codex":0.0032210997,"about_ca_topic_score_gemma":0.0033901443,"teacher_disagreement_score":0.0066103963,"about_ca_system_score_codex":0.0018422112,"about_ca_system_score_gemma":0.002551598,"threshold_uncertainty_score":0.026712835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010465249,0.0019629973,0.9719651,0.0013443665,0.0003959047,0.000045878187,0.00013839961,0.00022224491,0.013459944],"genre_scores_gemma":[0.73134696,0.005026627,0.23079517,0.001270139,0.0014421002,0.000531318,0.00080742844,0.00090095465,0.027879283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956741,0.001377376,0.00020895521,0.0005786518,0.0016983945,0.0004625448],"domain_scores_gemma":[0.96008706,0.029917374,0.001967963,0.0017117888,0.00547557,0.0008401989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008653405,0.0027087398,0.0020484214,0.0022974757,0.0011087101,0.004495878,0.0025297033,0.0026039938,0.008232406],"category_scores_gemma":[0.039132692,0.0008957483,0.00083663943,0.0018270079,0.0038470384,0.0060078767,0.0047680307,0.0065714614,0.0013949688],"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.00030287952,0.00012911635,0.0006189419,0.0005271538,0.00009088542,0.00010809794,0.00044933642,0.3929849,0.0034025724,0.5426935,0.0073527703,0.05133976],"study_design_scores_gemma":[0.000009920398,0.00003611555,0.00014933861,0.00007695765,0.000014482368,0.000032642867,0.000052173105,0.8471635,0.0009865245,0.1499247,0.0015291193,0.000024575687],"about_ca_topic_score_codex":0.0026724036,"about_ca_topic_score_gemma":0.0021751598,"teacher_disagreement_score":0.008653405,"about_ca_system_score_codex":0.0024560401,"about_ca_system_score_gemma":0.0019215543,"threshold_uncertainty_score":0.04576409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010136144,0.0009684163,0.9891088,0.00039244362,0.00015912385,0.000026503145,0.000043640997,0.00015577402,0.008131787],"genre_scores_gemma":[0.073528916,0.0043445984,0.9078173,0.0005757923,0.00039399756,0.00032218124,0.00023783618,0.0003421829,0.012437167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987866,0.00046871166,0.000042395503,0.00013870452,0.000520686,0.000042877295],"domain_scores_gemma":[0.9990583,0.0004923209,0.00008801912,0.000101960344,0.00021096313,0.000048491496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016698884,0.00090405945,0.0006872257,0.00064755033,0.0005233338,0.0014551661,0.00074898096,0.00085705833,0.0034978113],"category_scores_gemma":[0.0033375002,0.0006782086,0.0005711717,0.0010704681,0.0026399235,0.001501376,0.001412041,0.0037569162,0.0026053838],"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.00005783299,0.0000528465,0.00019528763,0.00037828519,0.000037588816,0.000087762106,0.00018812556,0.07346599,0.0026429237,0.74822915,0.01620098,0.15846325],"study_design_scores_gemma":[0.000050751132,0.000060078397,0.00012654666,0.0001309068,0.000014283621,0.00014539715,0.0000370973,0.34553942,0.003316837,0.5922668,0.058271047,0.000040876323],"about_ca_topic_score_codex":0.0010960444,"about_ca_topic_score_gemma":0.00149937,"teacher_disagreement_score":0.0034978113,"about_ca_system_score_codex":0.00050309044,"about_ca_system_score_gemma":0.0012073341,"threshold_uncertainty_score":0.011701345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027401822,0.00009181552,0.99562126,0.00008478074,0.00002726176,0.000027045196,0.00001102818,0.000081395796,0.0013151465],"genre_scores_gemma":[0.27350423,0.0003167446,0.7200912,0.00016446337,0.000115989096,0.00044321976,0.00011861023,0.0001647802,0.0050806943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965143,0.00014142129,0.000013625283,0.0000675842,0.00010226177,0.000023760513],"domain_scores_gemma":[0.99963164,0.00019376975,0.000041601546,0.00004086181,0.00006163451,0.000030513911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087484234,0.0006897072,0.0009213116,0.00038001168,0.00038761727,0.00072372245,0.0013338539,0.0009620489,0.0023820978],"category_scores_gemma":[0.0021469113,0.0004373013,0.00068334345,0.00042345806,0.00072658446,0.0010346782,0.0016905369,0.0017674698,0.00048524557],"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.000085538995,0.000089605215,0.00040367362,0.0001417,0.000038268503,0.000100820915,0.00011174372,0.84917796,0.003961597,0.0774078,0.0028391033,0.065642215],"study_design_scores_gemma":[0.000006010862,0.000014714798,0.000014583949,0.0000028561437,0.0000019075399,0.0000087749095,0.0000026308915,0.9963415,0.00023960482,0.0027476684,0.00061716244,0.0000024788187],"about_ca_topic_score_codex":0.0011108489,"about_ca_topic_score_gemma":0.00087706157,"teacher_disagreement_score":0.0023820978,"about_ca_system_score_codex":0.00051707576,"about_ca_system_score_gemma":0.00090689445,"threshold_uncertainty_score":0.007968903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012848208,0.00068427186,0.96599054,0.00064053165,0.00019527893,0.00012690318,0.00049967144,0.0028418163,0.01617276],"genre_scores_gemma":[0.17907447,0.0008457954,0.8014065,0.00050602836,0.00026154495,0.0004100208,0.003178764,0.0014309479,0.012885978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999223,0.00020382102,0.000056942798,0.0001279528,0.0002508694,0.00013740781],"domain_scores_gemma":[0.99815613,0.0009775606,0.0000909289,0.0004346133,0.00030042004,0.000040332838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006110424,0.001327789,0.0010431285,0.0010985647,0.00072383665,0.0016399745,0.001453204,0.00092199165,0.020210443],"category_scores_gemma":[0.0045596748,0.0007060307,0.0010693973,0.0020491818,0.00059204263,0.0017781139,0.0013691143,0.0021485884,0.005730934],"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.0006440109,0.00024334437,0.00057727715,0.00067590474,0.000079113706,0.0003280536,0.00011510054,0.15713233,0.022069113,0.08932726,0.044783,0.68402547],"study_design_scores_gemma":[0.00019033467,0.00017950422,0.0005716412,0.00008251018,0.000057583264,0.00022553858,0.000092687165,0.73788214,0.026147744,0.20362626,0.030912092,0.000031933825],"about_ca_topic_score_codex":0.0015087331,"about_ca_topic_score_gemma":0.0035725725,"teacher_disagreement_score":0.020210443,"about_ca_system_score_codex":0.00065073156,"about_ca_system_score_gemma":0.0017223164,"threshold_uncertainty_score":0.06761068},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009404512,0.0008786396,0.97758,0.0005663809,0.00019806916,0.000049996026,0.000060879138,0.000038354818,0.011223197],"genre_scores_gemma":[0.4690076,0.004075466,0.48918426,0.00064248254,0.00068629545,0.00067762483,0.00036148334,0.0004268069,0.03493799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932694,0.00033479236,0.000020105444,0.00007100155,0.00019150448,0.000055556127],"domain_scores_gemma":[0.9985683,0.0010194384,0.00008106356,0.00009046062,0.0001524817,0.0000881852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074002,0.001331429,0.0016358241,0.0015999341,0.0010355283,0.0015855061,0.0013606444,0.0015755832,0.0058977525],"category_scores_gemma":[0.0063919625,0.00061718596,0.0012888476,0.001438501,0.002893964,0.0019164017,0.003582227,0.00279242,0.0005235266],"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.00008880922,0.00006244541,0.0003007384,0.00021453926,0.000050843875,0.00005282184,0.00011120617,0.44875756,0.0009996317,0.5066649,0.002822977,0.039873447],"study_design_scores_gemma":[0.000011559643,0.000025762727,0.00006076653,0.000029619678,0.000008510023,0.000013092047,0.00002652947,0.84751135,0.00018858457,0.1499861,0.002127151,0.000010863651],"about_ca_topic_score_codex":0.003953837,"about_ca_topic_score_gemma":0.0034822526,"teacher_disagreement_score":0.0058977525,"about_ca_system_score_codex":0.0011430068,"about_ca_system_score_gemma":0.0011893733,"threshold_uncertainty_score":0.019729972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009731409,0.000619463,0.9860752,0.00045566325,0.00020396379,0.00003569999,0.00003253405,0.00019674544,0.0026492209],"genre_scores_gemma":[0.51688737,0.0009868646,0.47218826,0.00035810872,0.00023088043,0.0003961032,0.00015767201,0.000792466,0.008002249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.00047734726,0.000033968267,0.000073163865,0.00017228741,0.000054380987],"domain_scores_gemma":[0.9961488,0.0026237238,0.00023799614,0.00032200938,0.0005085947,0.00015890531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003082763,0.001170806,0.0013516647,0.0006989441,0.00063440984,0.0021342663,0.0018893542,0.0020372672,0.0041186432],"category_scores_gemma":[0.019996474,0.0010754808,0.00038207258,0.0007321551,0.0016504697,0.0032900309,0.002450853,0.004217129,0.0009232677],"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.00047336362,0.00020165746,0.00055420643,0.00034132876,0.000070494694,0.00011733501,0.00020609477,0.62620413,0.0042462666,0.27380157,0.0058820923,0.08790141],"study_design_scores_gemma":[0.000032153017,0.000021237951,0.000038827726,0.000020469186,0.000005864968,0.000017310782,0.000010948532,0.974192,0.00059540337,0.023818899,0.0012373324,0.000009536693],"about_ca_topic_score_codex":0.0013692445,"about_ca_topic_score_gemma":0.0016165029,"teacher_disagreement_score":0.0041186432,"about_ca_system_score_codex":0.000823932,"about_ca_system_score_gemma":0.0013223088,"threshold_uncertainty_score":0.01630342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00994729,0.00021811674,0.9846372,0.00017850092,0.000031265314,0.00002021139,0.000030002824,0.00020702837,0.00473035],"genre_scores_gemma":[0.3819895,0.0005126511,0.6078106,0.00019629607,0.000056292196,0.0002115271,0.00023794269,0.0007081727,0.008276958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.00027229544,0.000025958625,0.0000725956,0.0003025463,0.000063336585],"domain_scores_gemma":[0.99748755,0.0015533775,0.00019109019,0.00025834466,0.00040202652,0.00010765494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024248462,0.000806949,0.00078312453,0.0007331787,0.0004631487,0.0010623661,0.0009318548,0.000972638,0.003272542],"category_scores_gemma":[0.007957853,0.00040288235,0.000694845,0.00048476728,0.0015017621,0.0015991179,0.0014596366,0.0019633193,0.00083381054],"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.00009157015,0.000045771085,0.0009394022,0.00014223583,0.00002991456,0.000052873056,0.00011750006,0.76742715,0.0033032885,0.19597048,0.002104953,0.029774956],"study_design_scores_gemma":[0.0000020359232,0.0000055416863,0.00004594331,0.000006989012,0.0000014472837,0.000005110267,0.000003894607,0.98995775,0.00051805284,0.00898258,0.0004683222,0.000002284856],"about_ca_topic_score_codex":0.0038807457,"about_ca_topic_score_gemma":0.004159403,"teacher_disagreement_score":0.0038807457,"about_ca_system_score_codex":0.001304134,"about_ca_system_score_gemma":0.0014583055,"threshold_uncertainty_score":0.012823999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.384191,0.0021748128,0.53592676,0.0072234073,0.0003355847,0.0001914235,0.00076504884,0.00062771514,0.06856429],"genre_scores_gemma":[0.93567,0.0014967534,0.043267958,0.0007430107,0.00047386356,0.00028160898,0.0009016056,0.00017577657,0.016989417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969367,0.0012772158,0.00013496283,0.00044885938,0.0008137709,0.00038847153],"domain_scores_gemma":[0.99194133,0.0058312826,0.00066177384,0.000417208,0.0005373751,0.0006110575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005147275,0.0018342974,0.0016592558,0.0026342985,0.0019173666,0.006557881,0.0020175683,0.0018259342,0.0106020495],"category_scores_gemma":[0.011386041,0.0014240905,0.002064402,0.0018279942,0.007957962,0.0100128995,0.0056368657,0.008653908,0.0013646673],"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.000044997312,0.000034904322,0.000118993084,0.000040899624,0.000014659693,0.00003057654,0.00017300023,0.0020133269,0.00038654343,0.9948649,0.00050148583,0.0017757188],"study_design_scores_gemma":[0.000030681473,0.000014554454,0.000058104055,0.000008471502,0.0000052174046,0.00002607369,0.000039199407,0.0076139406,0.00019088722,0.9915141,0.00048977585,0.000008958927],"about_ca_topic_score_codex":0.0011401393,"about_ca_topic_score_gemma":0.00088269805,"teacher_disagreement_score":0.0106020495,"about_ca_system_score_codex":0.0029256884,"about_ca_system_score_gemma":0.0014528816,"threshold_uncertainty_score":0.035467386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16963208,0.00080213323,0.7982449,0.0013252932,0.00009443731,0.00006880427,0.00030085634,0.00036654915,0.02916485],"genre_scores_gemma":[0.9308661,0.00087944756,0.05834596,0.00025209668,0.00020188537,0.00013358923,0.0004740695,0.0005362841,0.008310651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961559,0.0018469105,0.00020952501,0.00051464705,0.00083810714,0.0004348897],"domain_scores_gemma":[0.9791626,0.013085246,0.0011931729,0.0050765593,0.0010342528,0.0004481498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050800587,0.00083367707,0.0014323668,0.0016409984,0.00059107254,0.0041925893,0.0019448485,0.0010700846,0.0070512146],"category_scores_gemma":[0.03777514,0.00069600774,0.0011130929,0.0019488327,0.0035853107,0.009247099,0.0036318863,0.0029990675,0.0014688141],"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.0001886282,0.000067497254,0.00077563204,0.00005893215,0.000033666318,0.00004872962,0.00017053672,0.022317847,0.002328096,0.93607074,0.001456631,0.036483012],"study_design_scores_gemma":[0.000025360958,0.00007021986,0.00059479417,0.000014787867,0.000018011693,0.00006156865,0.000060280567,0.09973019,0.0021618092,0.8959538,0.001296584,0.000012724399],"about_ca_topic_score_codex":0.00062668946,"about_ca_topic_score_gemma":0.00032650208,"teacher_disagreement_score":0.0070512146,"about_ca_system_score_codex":0.0011267462,"about_ca_system_score_gemma":0.0008187988,"threshold_uncertainty_score":0.026866257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064437673,0.0020888282,0.8864332,0.0026847841,0.0007481202,0.000029605462,0.00017025608,0.00015202301,0.10124943],"genre_scores_gemma":[0.46351,0.0061005782,0.32689637,0.0035002418,0.0029108631,0.00031843677,0.0006034529,0.00094630674,0.19521363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988212,0.0003424022,0.000039737024,0.00022345458,0.00048528952,0.00008781179],"domain_scores_gemma":[0.9990823,0.0003129944,0.00006351697,0.00024422636,0.00021217318,0.00008478938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015222033,0.0010472578,0.0010099054,0.001012753,0.0007607515,0.0017499252,0.0012607168,0.0015233591,0.008376222],"category_scores_gemma":[0.0044362196,0.00056571607,0.0006890407,0.00077739265,0.002657914,0.0033741517,0.0035139418,0.004190404,0.002493361],"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.00001687414,0.00000883483,0.000052557705,0.000047469293,0.00001264274,0.000024773217,0.000024421286,0.005226279,0.0009326432,0.9699728,0.0041285194,0.019552365],"study_design_scores_gemma":[0.0000070117308,0.000012067491,0.000108445136,0.000017513044,0.0000067108463,0.00008607867,0.000009068827,0.039098274,0.0005173786,0.94416046,0.015966542,0.000010440097],"about_ca_topic_score_codex":0.0005694515,"about_ca_topic_score_gemma":0.0005106216,"teacher_disagreement_score":0.008376222,"about_ca_system_score_codex":0.000653943,"about_ca_system_score_gemma":0.000919668,"threshold_uncertainty_score":0.028021216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006680702,0.00061887736,0.8823811,0.0009035416,0.0006526979,0.0006981609,0.0044257287,0.013945392,0.089693874],"genre_scores_gemma":[0.09019469,0.00063309295,0.7772565,0.0009673074,0.00023208173,0.0016876153,0.014405638,0.005739038,0.10888416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989937,0.00018119997,0.000069483795,0.00035091303,0.00027306,0.00013172487],"domain_scores_gemma":[0.99912244,0.00029141392,0.000039512488,0.00022531505,0.00027495035,0.000046392477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080581254,0.0015642673,0.0010259516,0.0016185845,0.0012242339,0.0027278105,0.0019698536,0.0016293763,0.14047995],"category_scores_gemma":[0.0047935904,0.0004772514,0.0010205504,0.0013507252,0.00064911303,0.0017826493,0.0022535308,0.0014369587,0.059020367],"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.00051763566,0.00021746864,0.0013098174,0.000535977,0.00011301788,0.00016356168,0.000110163804,0.069834754,0.0027657554,0.11163059,0.17606892,0.63673234],"study_design_scores_gemma":[0.00048016355,0.00016494803,0.00054327806,0.0002041013,0.000069016816,0.00051901175,0.00015252965,0.46426344,0.008370041,0.20621377,0.3189529,0.000066798915],"about_ca_topic_score_codex":0.002198145,"about_ca_topic_score_gemma":0.0031589798,"teacher_disagreement_score":0.14047995,"about_ca_system_score_codex":0.001066888,"about_ca_system_score_gemma":0.0023876217,"threshold_uncertainty_score":0.4699523},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34358984,0.001209322,0.5348756,0.0011312909,0.00013253327,0.000105185056,0.0006626389,0.00037389304,0.1179198],"genre_scores_gemma":[0.95149076,0.000394902,0.038737696,0.00014085634,0.000101828984,0.0000674518,0.00027624267,0.000098464385,0.008691707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998487,0.00042333323,0.00009558279,0.00027890835,0.00047742177,0.00023769386],"domain_scores_gemma":[0.99629056,0.0013167479,0.0009112304,0.00052752986,0.00058691006,0.0003670025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173089,0.0005101555,0.00045867913,0.0014927975,0.0011296656,0.0037725235,0.0007302608,0.000649315,0.008794483],"category_scores_gemma":[0.005199466,0.00023678578,0.0007905489,0.0011303013,0.0035468168,0.0047798427,0.0022415698,0.0014627312,0.0014851763],"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.000036691847,0.000010226788,0.0005862091,0.00003441241,0.000005072254,0.0001361259,0.00019317525,0.00506298,0.0013374486,0.9866071,0.00051046995,0.005480102],"study_design_scores_gemma":[0.000015219939,0.000069096226,0.00083073106,0.000027950806,0.000010504308,0.0005386008,0.00028550526,0.025758157,0.0035584706,0.96020883,0.008661201,0.000035753925],"about_ca_topic_score_codex":0.0005447327,"about_ca_topic_score_gemma":0.0004060761,"teacher_disagreement_score":0.008794483,"about_ca_system_score_codex":0.000797091,"about_ca_system_score_gemma":0.00036266493,"threshold_uncertainty_score":0.029420495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15515128,0.00079385075,0.8235326,0.0008485845,0.00013583853,0.00015708827,0.0005065472,0.00066438055,0.018209865],"genre_scores_gemma":[0.6574605,0.0005506077,0.33042562,0.00017161849,0.00016448827,0.00029186413,0.0012524736,0.0003710061,0.009311797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987018,0.00037339955,0.00006111104,0.00018556982,0.00040600687,0.00027216063],"domain_scores_gemma":[0.9966204,0.002130421,0.00029848336,0.00029448365,0.00031901154,0.0003372304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022801494,0.0011721675,0.0017060457,0.0021568276,0.0010483774,0.002052832,0.0011815547,0.0012426985,0.0093499655],"category_scores_gemma":[0.010805944,0.000626256,0.0013213828,0.0009731695,0.0019147459,0.0028454224,0.0018409779,0.0035306248,0.0011246058],"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.00029915114,0.0002720348,0.0024754186,0.00062519836,0.00014070627,0.00026946503,0.00048523623,0.4435313,0.005223556,0.43194887,0.0100769345,0.10465208],"study_design_scores_gemma":[0.000043997174,0.00012910442,0.0010022448,0.00005111365,0.000016280772,0.00008868293,0.00014840822,0.7813021,0.0025630172,0.21103142,0.0035614662,0.0000621892],"about_ca_topic_score_codex":0.0016353203,"about_ca_topic_score_gemma":0.00295683,"teacher_disagreement_score":0.0093499655,"about_ca_system_score_codex":0.00093238987,"about_ca_system_score_gemma":0.0009575493,"threshold_uncertainty_score":0.03127879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030657812,0.00014308763,0.99356383,0.00007714318,0.00003917622,0.000067091,0.000039357463,0.00039219638,0.0026123424],"genre_scores_gemma":[0.06784378,0.00021453568,0.92759633,0.00009656021,0.000060921364,0.0003156994,0.00021992842,0.0003128888,0.003339343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852645,0.00060318445,0.00006865304,0.00018538372,0.00047388533,0.00014238826],"domain_scores_gemma":[0.99873227,0.0005765576,0.00009056206,0.00017269269,0.00033560494,0.00009220515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020620076,0.0012816179,0.0019483143,0.0012843589,0.00092799927,0.0014693486,0.0018984373,0.0017352757,0.0074590514],"category_scores_gemma":[0.005127673,0.00093497644,0.0011970788,0.0014534309,0.0010846778,0.001665281,0.0026597374,0.0032165681,0.0021354407],"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.00028256926,0.00017597708,0.0005436665,0.00022180278,0.00006821665,0.00017543939,0.00018401779,0.7099596,0.004136184,0.097860254,0.0065827547,0.17980953],"study_design_scores_gemma":[0.00003400828,0.00003110243,0.000033887878,0.000012205362,0.0000053229064,0.000041058847,0.000009070627,0.9818287,0.00067364407,0.014440632,0.0028811225,0.000009215032],"about_ca_topic_score_codex":0.0023910392,"about_ca_topic_score_gemma":0.002175996,"teacher_disagreement_score":0.0074590514,"about_ca_system_score_codex":0.000908025,"about_ca_system_score_gemma":0.0022661693,"threshold_uncertainty_score":0.024953008},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019100169,0.0013470722,0.9380608,0.0013570768,0.00047700564,0.000048814363,0.000108688335,0.00027686488,0.039223503],"genre_scores_gemma":[0.7285581,0.0019542961,0.17506813,0.0009734425,0.00088897196,0.00034182682,0.00028219642,0.0009035673,0.091029465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.0009260058,0.0000566424,0.00026301687,0.00036792047,0.00013801505],"domain_scores_gemma":[0.99658525,0.0024978768,0.0001859818,0.0003328937,0.00023530266,0.00016267509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027683778,0.0011211529,0.0016851624,0.00083360076,0.00076471927,0.0030640503,0.0016869892,0.0014886992,0.018115694],"category_scores_gemma":[0.014234123,0.0005937645,0.00069062016,0.0014141168,0.0025818974,0.00527923,0.0031839968,0.0027127413,0.001737036],"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.00007089346,0.00004804519,0.00010431353,0.000103755745,0.000029840756,0.000037101316,0.00005437322,0.0838751,0.00036573465,0.88185453,0.00513362,0.028322635],"study_design_scores_gemma":[0.000014667541,0.00001680364,0.000036932546,0.000018816492,0.000009667776,0.000016355381,0.0000122181145,0.34015763,0.00039115234,0.6570961,0.0022232323,0.0000064168858],"about_ca_topic_score_codex":0.0010058796,"about_ca_topic_score_gemma":0.000869986,"teacher_disagreement_score":0.018115694,"about_ca_system_score_codex":0.0011866778,"about_ca_system_score_gemma":0.0008107839,"threshold_uncertainty_score":0.060603023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3447755,0.004944579,0.48615605,0.019054798,0.00086169754,0.00013098476,0.0007826647,0.00064333837,0.14265026],"genre_scores_gemma":[0.91683537,0.002500457,0.05197705,0.0010862268,0.00073390367,0.00013425984,0.00034911942,0.00037314254,0.026010407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847215,0.00068732793,0.000055099747,0.00022698725,0.00039176625,0.00016672087],"domain_scores_gemma":[0.9883868,0.0073670307,0.00095146586,0.00062195316,0.0013926241,0.0012801894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026460472,0.0009583827,0.0011974125,0.0028884548,0.0018706457,0.0031962332,0.0013033113,0.0018847155,0.009143954],"category_scores_gemma":[0.019205617,0.00069207227,0.0009278785,0.0017848441,0.006199312,0.008597028,0.0045559276,0.0063195843,0.0011445131],"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.000034547837,0.000010259547,0.00019848852,0.000024324598,0.000005379421,0.000030388355,0.00015270326,0.0021803535,0.00025034818,0.9932708,0.0009391975,0.0029031567],"study_design_scores_gemma":[0.0000084995445,0.00001715034,0.0002367276,0.000013209071,0.000004687631,0.00003286996,0.000042202486,0.010292382,0.00011563453,0.9874556,0.0017699332,0.000011085199],"about_ca_topic_score_codex":0.0020578122,"about_ca_topic_score_gemma":0.0011808472,"teacher_disagreement_score":0.009143954,"about_ca_system_score_codex":0.0027194887,"about_ca_system_score_gemma":0.001538177,"threshold_uncertainty_score":0.03058958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11510095,0.00029927102,0.88341486,0.00016042941,0.000037243386,0.00004699908,0.000039855433,0.00019832051,0.00070204795],"genre_scores_gemma":[0.80241394,0.00039299406,0.19502284,0.00009639081,0.000048171347,0.00009517919,0.00022121744,0.000117932905,0.0015913118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00035362397,0.000042724096,0.000113053575,0.00018850827,0.00006780631],"domain_scores_gemma":[0.99498016,0.003214004,0.00050399936,0.00061625335,0.0005088594,0.00017672614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035984362,0.0007843247,0.0009869152,0.0011108763,0.00030891979,0.0010231243,0.0012812628,0.001041371,0.0008510643],"category_scores_gemma":[0.017053852,0.0008030185,0.00069953647,0.00069149205,0.0015520199,0.0021093646,0.001175653,0.0012810609,0.00020692537],"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.00024279865,0.000054856984,0.0042365785,0.00009122299,0.0000624038,0.00016281063,0.00012084113,0.8979159,0.0042253532,0.07286747,0.00061694335,0.019402819],"study_design_scores_gemma":[0.000008450054,0.000016922697,0.00018236363,0.0000046766054,0.000002889483,0.000015282683,0.00000594682,0.9922935,0.00071176357,0.0066170176,0.00013686818,0.0000043176033],"about_ca_topic_score_codex":0.0031604953,"about_ca_topic_score_gemma":0.0030415547,"teacher_disagreement_score":0.0035984362,"about_ca_system_score_codex":0.0010674584,"about_ca_system_score_gemma":0.00063455745,"threshold_uncertainty_score":0.019030571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013111863,0.0039863344,0.962044,0.0022582205,0.0003175682,0.00009738994,0.00015606164,0.00021781518,0.017810768],"genre_scores_gemma":[0.47555906,0.0072651994,0.4847843,0.0025581268,0.001743084,0.0008209859,0.00080963824,0.0008602973,0.025599172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916875,0.003938606,0.00027997457,0.0007557851,0.0026215224,0.0007167397],"domain_scores_gemma":[0.9692486,0.021554003,0.0012510493,0.0018866212,0.0043915734,0.0016681732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021087892,0.0026317853,0.0030112453,0.005039422,0.0017764551,0.0038686208,0.004306432,0.0031964732,0.006923088],"category_scores_gemma":[0.05818595,0.0011726521,0.003079772,0.003115983,0.0048878565,0.0074225278,0.0076728095,0.011209307,0.0014659467],"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.00016774616,0.00014555009,0.0007632508,0.00041816494,0.00012776969,0.00007424407,0.00039076037,0.06564546,0.0016713218,0.8926623,0.0072688805,0.030664602],"study_design_scores_gemma":[0.000023258364,0.00010045999,0.00040069688,0.000116572075,0.000044331424,0.000062331295,0.000059376565,0.7240184,0.0006763015,0.27122506,0.0032348572,0.00003831227],"about_ca_topic_score_codex":0.0039612935,"about_ca_topic_score_gemma":0.0030657419,"teacher_disagreement_score":0.021087892,"about_ca_system_score_codex":0.0051874905,"about_ca_system_score_gemma":0.0030691875,"threshold_uncertainty_score":0.11152482},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036575936,0.00038087709,0.9374395,0.0004085159,0.00015115016,0.000033396656,0.0001735191,0.0011048437,0.023732295],"genre_scores_gemma":[0.6264515,0.0008430484,0.3560142,0.00023478051,0.00013638102,0.0001379681,0.0004382686,0.00090239104,0.014841424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.00017603507,0.000044327036,0.00010526743,0.0002862486,0.00007484209],"domain_scores_gemma":[0.9988758,0.00059115,0.00007617256,0.00021964106,0.00019203164,0.000045070537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132616,0.00065360684,0.0010692863,0.0014235203,0.0008503182,0.0024641566,0.0010079623,0.00084638223,0.010373883],"category_scores_gemma":[0.0068702395,0.00032694347,0.0006944153,0.0011741846,0.0020609607,0.0033457233,0.0022211908,0.001265064,0.002261525],"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.000058547357,0.000015344618,0.000402545,0.00009674246,0.000017538832,0.00020332164,0.00027607344,0.058733653,0.0020462826,0.8693966,0.003090748,0.06566253],"study_design_scores_gemma":[0.000014323157,0.000022345297,0.000113774295,0.000036724534,0.000009700159,0.0001257847,0.000089435336,0.31779376,0.0067764064,0.6584702,0.01652373,0.000023734463],"about_ca_topic_score_codex":0.00073839404,"about_ca_topic_score_gemma":0.0010241298,"teacher_disagreement_score":0.010373883,"about_ca_system_score_codex":0.0009644483,"about_ca_system_score_gemma":0.0009208118,"threshold_uncertainty_score":0.03470415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049985647,0.021003807,0.7804593,0.019349037,0.0027955594,0.0002591435,0.0029476532,0.0020670774,0.12113284],"genre_scores_gemma":[0.649587,0.019877367,0.24382107,0.004523181,0.006903295,0.0015682569,0.0047415732,0.0030415752,0.06593685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920081,0.0018453052,0.00036550759,0.0011622438,0.002938296,0.0016805477],"domain_scores_gemma":[0.9555637,0.03408368,0.0014649055,0.0044487766,0.0028363585,0.0016025464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077919895,0.0059210383,0.002866751,0.0071348436,0.0021370263,0.007588268,0.0054932404,0.0035681687,0.021681776],"category_scores_gemma":[0.04086274,0.0014076339,0.0025705905,0.0067889835,0.00407458,0.014447906,0.009541281,0.01360374,0.00785793],"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.002082421,0.0005802218,0.0021428152,0.0018745355,0.00036925453,0.00030681107,0.0006737023,0.08100638,0.0151975565,0.7011917,0.043321747,0.15125294],"study_design_scores_gemma":[0.00014616604,0.00020270495,0.0015914014,0.0005810694,0.00038396564,0.0004986327,0.00015943986,0.25813434,0.010336099,0.69619864,0.031643253,0.00012430365],"about_ca_topic_score_codex":0.0012286812,"about_ca_topic_score_gemma":0.002529738,"teacher_disagreement_score":0.021681776,"about_ca_system_score_codex":0.0047298525,"about_ca_system_score_gemma":0.0026934622,"threshold_uncertainty_score":0.07253277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015325826,0.0000636155,0.99752134,0.000052016174,0.0000490295,0.000016675067,0.000012147601,0.00027630126,0.00047627484],"genre_scores_gemma":[0.055033572,0.00012218967,0.9415275,0.000104600025,0.00008553888,0.0001421432,0.00011295257,0.00032485265,0.0025467258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926764,0.00019540949,0.00005113522,0.000130686,0.00029534643,0.000059819457],"domain_scores_gemma":[0.99802667,0.0011645567,0.00011991815,0.00019521559,0.00038478247,0.000108854634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017850703,0.0010615749,0.0021443295,0.0011725142,0.0008607522,0.0014008192,0.002075728,0.0021125667,0.0048035504],"category_scores_gemma":[0.005544354,0.0011428386,0.0012490787,0.00141482,0.0009058663,0.0019667493,0.0020644767,0.002705241,0.0016175483],"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.000499736,0.0002008943,0.00055263407,0.00018329955,0.00018186295,0.00011250169,0.000089631576,0.46544716,0.011119796,0.07835912,0.007859651,0.43539366],"study_design_scores_gemma":[0.000025094634,0.000025180481,0.00005596618,0.000006000513,0.000012184604,0.000031064697,0.000002436858,0.9909791,0.0010239792,0.00701607,0.00081006356,0.000012928382],"about_ca_topic_score_codex":0.0025651972,"about_ca_topic_score_gemma":0.0028455807,"teacher_disagreement_score":0.0048035504,"about_ca_system_score_codex":0.0007966673,"about_ca_system_score_gemma":0.0020331067,"threshold_uncertainty_score":0.016069412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120955575,0.00023714948,0.9801917,0.0003505701,0.00006541276,0.00004819271,0.0000638516,0.00016043658,0.0067872284],"genre_scores_gemma":[0.43459108,0.00086636754,0.54477096,0.00035665173,0.00027622867,0.00036748807,0.00053821696,0.00049197994,0.017740956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985392,0.0003998539,0.000079000885,0.00044160266,0.00039421485,0.00014601568],"domain_scores_gemma":[0.9963188,0.0015882895,0.00043737088,0.00081375765,0.00062897615,0.00021277227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002370811,0.0013570356,0.0013725184,0.002108684,0.0015175237,0.003255515,0.002246687,0.0030414215,0.007411312],"category_scores_gemma":[0.010442189,0.0008440281,0.0011097441,0.0008963255,0.0037380366,0.00734776,0.0062547363,0.0030383607,0.0025310344],"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.00008928235,0.000050742758,0.0011470789,0.00019077733,0.000038804068,0.00017653964,0.00044735082,0.05881163,0.0070959376,0.85701996,0.0043089637,0.070622936],"study_design_scores_gemma":[0.0000135811215,0.000046682548,0.00035772155,0.00005876937,0.0000126826335,0.00014188814,0.00017056431,0.30728763,0.006324913,0.6755553,0.009991102,0.00003907025],"about_ca_topic_score_codex":0.00060718815,"about_ca_topic_score_gemma":0.00055950665,"teacher_disagreement_score":0.007411312,"about_ca_system_score_codex":0.00087708124,"about_ca_system_score_gemma":0.0007874116,"threshold_uncertainty_score":0.024793267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10512706,0.00055563037,0.87971926,0.0003834504,0.00004895291,0.000036554335,0.0001285724,0.00019602894,0.013804524],"genre_scores_gemma":[0.90631455,0.0005995868,0.07912294,0.00016889136,0.00014606173,0.00010089996,0.00049008045,0.00024109127,0.012815929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988361,0.0001825756,0.000056599103,0.00028539685,0.00048530556,0.0001540069],"domain_scores_gemma":[0.99679476,0.0015388788,0.00042777034,0.00034639784,0.00060412625,0.0002880252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014446368,0.0009476849,0.0009311621,0.0013561771,0.00062986184,0.0017157757,0.0009065666,0.0008471532,0.0037964461],"category_scores_gemma":[0.005498962,0.00033719782,0.0013010243,0.00075068587,0.0019824,0.0027311565,0.002328889,0.0031417978,0.0007878217],"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.0005010959,0.00012335695,0.0037664163,0.0003616387,0.00011825057,0.0007930243,0.00070663757,0.05816189,0.04462626,0.82023996,0.0034565611,0.06714491],"study_design_scores_gemma":[0.000054374803,0.00040238662,0.0032487265,0.000067333785,0.000072678646,0.0012650529,0.00017009857,0.51444083,0.022642242,0.44789553,0.009679893,0.00006085503],"about_ca_topic_score_codex":0.0006511966,"about_ca_topic_score_gemma":0.0003034958,"teacher_disagreement_score":0.0037964461,"about_ca_system_score_codex":0.0009479126,"about_ca_system_score_gemma":0.0005514593,"threshold_uncertainty_score":0.0127004385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004222866,0.00008464193,0.9928637,0.00011606488,0.0000109940165,0.00006163865,0.000121029785,0.000065348475,0.0024536469],"genre_scores_gemma":[0.23743406,0.0005150685,0.7563653,0.00014050162,0.00014203043,0.00086786726,0.00080829737,0.000206617,0.0035201984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906183,0.0037540235,0.00043604325,0.0010289649,0.0035040702,0.0006586396],"domain_scores_gemma":[0.9716579,0.022799877,0.0017431915,0.0012430222,0.00224119,0.00031484323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057260646,0.0013697526,0.0012636537,0.0024858816,0.00108782,0.0028097925,0.0021952353,0.0011909901,0.0074999323],"category_scores_gemma":[0.037470173,0.0010278157,0.0022337555,0.0038261297,0.0025062677,0.0034748176,0.0027904597,0.0029859545,0.0009786801],"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.00015580053,0.00008722564,0.0009959609,0.00038793636,0.00011602895,0.00022883095,0.0002930152,0.46669924,0.003146885,0.4590147,0.0023414986,0.066532955],"study_design_scores_gemma":[0.00001760013,0.000054054763,0.0002107317,0.000055791552,0.000018527304,0.000060252834,0.00003795119,0.82573885,0.0019329098,0.16953556,0.0023126358,0.000025231495],"about_ca_topic_score_codex":0.0038708062,"about_ca_topic_score_gemma":0.0021336451,"teacher_disagreement_score":0.0074999323,"about_ca_system_score_codex":0.0015912956,"about_ca_system_score_gemma":0.0018404839,"threshold_uncertainty_score":0.030282736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055021853,0.00018527659,0.988602,0.00016009569,0.00009793978,0.000033865843,0.000051023468,0.00036150723,0.0050062006],"genre_scores_gemma":[0.3271456,0.0007927475,0.65677196,0.00027039094,0.00020071589,0.00025318962,0.00033732917,0.00040002447,0.013827971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959284,0.00015363314,0.000020155723,0.00005848956,0.00014631062,0.00002860518],"domain_scores_gemma":[0.9995766,0.000119244985,0.000050670755,0.00008752433,0.00013967235,0.000026292806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125419,0.00065678364,0.0006110484,0.00029874893,0.00032583415,0.0004881751,0.0005110652,0.00058120524,0.0040660035],"category_scores_gemma":[0.0016351786,0.00021948412,0.0005301946,0.0003006261,0.0006848635,0.00043460482,0.0009099633,0.0009818934,0.0015854962],"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.00016751472,0.000051116498,0.0007878319,0.00053466967,0.000060980678,0.0003504806,0.00019179174,0.6468144,0.046342686,0.12123012,0.01295063,0.17051777],"study_design_scores_gemma":[0.000009293209,0.00003373562,0.00013090804,0.000017345847,0.0000044277126,0.000042564196,0.000009816736,0.9742708,0.0054551107,0.011769871,0.008243883,0.000012269481],"about_ca_topic_score_codex":0.0018235536,"about_ca_topic_score_gemma":0.0019928757,"teacher_disagreement_score":0.0040660035,"about_ca_system_score_codex":0.00036543183,"about_ca_system_score_gemma":0.0010207716,"threshold_uncertainty_score":0.013602078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024011494,0.00017545192,0.9951284,0.00017874493,0.00005829078,0.000024122142,0.000029696166,0.00007467558,0.001929455],"genre_scores_gemma":[0.3341577,0.000738156,0.6420344,0.00037597335,0.00023234464,0.00053543923,0.0003999135,0.0006443351,0.020881733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957937,0.0001774584,0.000020357613,0.000059534104,0.00013296332,0.000030316818],"domain_scores_gemma":[0.9980648,0.0011497145,0.00013696573,0.00014552727,0.00035737737,0.00014562764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439228,0.0009794543,0.0011743457,0.00072270207,0.0008379571,0.0010089292,0.001873134,0.0016309036,0.004785594],"category_scores_gemma":[0.006265415,0.000633161,0.00088110275,0.0008251113,0.0014568648,0.0018591707,0.0028804443,0.0026283094,0.0007389318],"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.000082309096,0.0000624132,0.00036972485,0.0001790326,0.000050084414,0.00007617808,0.00013624018,0.78161967,0.0013536811,0.17020665,0.003759856,0.042104214],"study_design_scores_gemma":[0.0000034750092,0.0000057049174,0.000016528,0.0000046228038,0.0000015198647,0.000004562119,0.000005003923,0.9836758,0.000066632994,0.015739806,0.00047336018,0.0000029696128],"about_ca_topic_score_codex":0.006755725,"about_ca_topic_score_gemma":0.0066091004,"teacher_disagreement_score":0.006755725,"about_ca_system_score_codex":0.0011388492,"about_ca_system_score_gemma":0.0016813682,"threshold_uncertainty_score":0.01600939},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01326203,0.0014571276,0.97508574,0.000948915,0.000258536,0.000032679156,0.000056412955,0.00012402292,0.0087745525],"genre_scores_gemma":[0.27247542,0.0038937328,0.6922397,0.0010478406,0.0009300672,0.00038373072,0.0003707681,0.00051416364,0.028144512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951065,0.00025979927,0.000025323596,0.00006303257,0.00011746377,0.000023718547],"domain_scores_gemma":[0.99825627,0.00090198213,0.00016130428,0.00015748598,0.00038695298,0.00013597052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022414823,0.0011835605,0.00096431276,0.0012217951,0.00058038067,0.0013919438,0.0012157289,0.0015459049,0.003254542],"category_scores_gemma":[0.0059897765,0.0007603865,0.0008562706,0.0007592816,0.00182569,0.002956893,0.0014378369,0.00282768,0.00074273004],"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.00012764146,0.00011508417,0.00026048836,0.00022468054,0.000044182187,0.00006717757,0.00015833191,0.09089096,0.0027313037,0.83427835,0.0074975453,0.0636043],"study_design_scores_gemma":[0.000038576225,0.00006829792,0.00009260232,0.000044914537,0.000015444939,0.000053745825,0.000038830945,0.5026067,0.00068790617,0.48943743,0.006889701,0.00002581228],"about_ca_topic_score_codex":0.0005278587,"about_ca_topic_score_gemma":0.001023022,"teacher_disagreement_score":0.003254542,"about_ca_system_score_codex":0.00057880185,"about_ca_system_score_gemma":0.000657821,"threshold_uncertainty_score":0.011854231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015432352,0.00004026059,0.9975719,0.000049554303,0.000009891692,0.000028955339,0.000013458551,0.00016213248,0.0005806267],"genre_scores_gemma":[0.08161401,0.000087043576,0.91639966,0.00009838763,0.000021174435,0.00031367442,0.00014746931,0.0001411226,0.001177398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.00039883447,0.0000407115,0.00010527683,0.00025690836,0.00005870473],"domain_scores_gemma":[0.9974247,0.0017485631,0.00018213723,0.00015171997,0.00040709105,0.00008569798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018125364,0.0009795135,0.0010243581,0.00066105736,0.0004767283,0.0008501521,0.001488279,0.0012308136,0.0043217223],"category_scores_gemma":[0.0054796073,0.0006685373,0.00086747296,0.0008697971,0.0010110134,0.0008868441,0.0016421659,0.002057298,0.0008585598],"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.000074046045,0.00005401899,0.000283893,0.00008794938,0.00002243339,0.000076431505,0.00007103771,0.91401815,0.0012318667,0.015576162,0.0019542181,0.066549785],"study_design_scores_gemma":[0.000012185969,0.000011301414,0.00001572148,0.0000045400525,0.0000017816291,0.000010705362,0.0000031991917,0.9964419,0.00028240605,0.002754765,0.0004582008,0.0000033025838],"about_ca_topic_score_codex":0.004178121,"about_ca_topic_score_gemma":0.0029793635,"teacher_disagreement_score":0.0043217223,"about_ca_system_score_codex":0.00080633024,"about_ca_system_score_gemma":0.0017783544,"threshold_uncertainty_score":0.014457583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067299525,0.00025719,0.97634625,0.0005108336,0.00022574064,0.000072553325,0.00018757941,0.00032349458,0.01534631],"genre_scores_gemma":[0.23511139,0.0009587191,0.71095186,0.00053380657,0.00048330054,0.0004558319,0.000623218,0.0009657037,0.049916234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992085,0.00025390787,0.000031097534,0.00016441544,0.00027591054,0.000066212146],"domain_scores_gemma":[0.99942136,0.00024507372,0.000039483923,0.000107853164,0.00011487744,0.00007150358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084691873,0.0011805457,0.0011039332,0.0007235842,0.00058921723,0.0013817422,0.0017262782,0.0014195031,0.014626882],"category_scores_gemma":[0.0036781523,0.0004182822,0.0013396267,0.0011755605,0.0010501647,0.0017039281,0.0024780214,0.003177544,0.0032065285],"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.00027437112,0.0001540028,0.00039401936,0.00041526073,0.00009989532,0.0001401126,0.00015713056,0.15041777,0.0072092987,0.63114095,0.024751168,0.18484607],"study_design_scores_gemma":[0.000056351557,0.00013867526,0.00014984793,0.00005702005,0.00003347471,0.0001353403,0.000058347752,0.643398,0.0017349989,0.3388901,0.015323041,0.000024823468],"about_ca_topic_score_codex":0.0016220124,"about_ca_topic_score_gemma":0.0022065141,"teacher_disagreement_score":0.014626882,"about_ca_system_score_codex":0.0008996444,"about_ca_system_score_gemma":0.0011391145,"threshold_uncertainty_score":0.048931837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064314884,0.0005589916,0.9939043,0.00007822214,0.00014255726,0.000022181228,0.000018866265,0.00015720906,0.004474548],"genre_scores_gemma":[0.038191885,0.0011931226,0.9412881,0.00019930411,0.0002449332,0.00028007757,0.00014629411,0.00062398467,0.01783231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919134,0.00037473047,0.00003249187,0.00009957694,0.0002595791,0.000042260912],"domain_scores_gemma":[0.99918395,0.00049591396,0.00003887986,0.0000914986,0.00014596496,0.000043827884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016840853,0.001992232,0.0015506565,0.00089147664,0.0008355054,0.0015833873,0.00229514,0.0013469087,0.009737511],"category_scores_gemma":[0.003887958,0.0012357262,0.001339838,0.0015015432,0.001800536,0.0017689933,0.0027802174,0.0065102684,0.0035368237],"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.00020661019,0.00020468363,0.00023646456,0.000579763,0.00009705985,0.00014241373,0.00028809355,0.28501287,0.0070009776,0.40942276,0.025995096,0.2708132],"study_design_scores_gemma":[0.000035540634,0.00007058089,0.00008998467,0.000097469274,0.000026666625,0.00007742618,0.000023506476,0.81090593,0.0021005392,0.16818888,0.018356817,0.000026667945],"about_ca_topic_score_codex":0.0007540121,"about_ca_topic_score_gemma":0.0011292424,"teacher_disagreement_score":0.009737511,"about_ca_system_score_codex":0.00080942106,"about_ca_system_score_gemma":0.00084289286,"threshold_uncertainty_score":0.03257525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004745371,0.000065169465,0.99866474,0.000046468664,0.000012436852,0.000020788317,0.000014094451,0.00004722939,0.00065456517],"genre_scores_gemma":[0.037563685,0.00024137535,0.9596171,0.000100898986,0.00005226998,0.0002367729,0.00013112555,0.00018967249,0.0018670554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988109,0.000476002,0.000042492666,0.00012919582,0.000443784,0.0000976079],"domain_scores_gemma":[0.99840266,0.00089999277,0.00009811161,0.00012456678,0.00039590296,0.00007889265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029158653,0.0014334789,0.0013461328,0.0014987671,0.0006024678,0.0016092622,0.002696801,0.0017691255,0.0047499584],"category_scores_gemma":[0.0055975635,0.00095488597,0.0012107175,0.0013961603,0.0012804557,0.0015534075,0.0023492498,0.0037466395,0.0010834726],"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.000098526536,0.00010679249,0.00039219434,0.00027734807,0.0000640023,0.00010836131,0.00014762697,0.52542937,0.004381167,0.2980447,0.0051826714,0.16576721],"study_design_scores_gemma":[0.0000191335,0.000037690057,0.000047681064,0.00001979157,0.0000074178347,0.000029270328,0.000012439595,0.9497329,0.0008376711,0.04484123,0.0044039716,0.000010786979],"about_ca_topic_score_codex":0.002440297,"about_ca_topic_score_gemma":0.0018766142,"teacher_disagreement_score":0.0047499584,"about_ca_system_score_codex":0.0014510294,"about_ca_system_score_gemma":0.0018031825,"threshold_uncertainty_score":0.015890181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010834903,0.000035181016,0.9977938,0.00005269332,0.000019874109,0.00004292013,0.000012682074,0.0001759143,0.00078338257],"genre_scores_gemma":[0.03528968,0.00008995488,0.96200424,0.000078764046,0.000023838034,0.00026130088,0.00009831104,0.00012911914,0.0020247013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.00015911463,0.000027001868,0.00008759976,0.00017758731,0.000050971652],"domain_scores_gemma":[0.999255,0.00036526844,0.00006730949,0.00009772052,0.00016648251,0.00004815198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736116,0.00094171334,0.001030949,0.0005149912,0.00058869325,0.00074560824,0.001368366,0.001321028,0.0056219236],"category_scores_gemma":[0.0024713366,0.00053088914,0.0007915772,0.00055766554,0.0007646009,0.001091003,0.0016102386,0.0029285636,0.0017149256],"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.00020333081,0.0001527924,0.00066225237,0.00026551983,0.00007067181,0.00019729389,0.0002232143,0.6247709,0.009780877,0.08242561,0.008382579,0.272865],"study_design_scores_gemma":[0.000024626732,0.000030866755,0.000033883658,0.000008843685,0.0000040429372,0.000031541473,0.000006195284,0.9918349,0.0011347365,0.0044782665,0.0024037038,0.000008433128],"about_ca_topic_score_codex":0.0029764927,"about_ca_topic_score_gemma":0.0034099354,"teacher_disagreement_score":0.0056219236,"about_ca_system_score_codex":0.000627432,"about_ca_system_score_gemma":0.0021261699,"threshold_uncertainty_score":0.018807173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5851717,0.0022910328,0.19230705,0.0027889793,0.00064782874,0.00012405982,0.0009673751,0.0006122492,0.21508971],"genre_scores_gemma":[0.9432236,0.0007877654,0.013785728,0.0003895254,0.00079841545,0.00008698493,0.00075735326,0.00020553009,0.03996502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987878,0.0002475857,0.00006439666,0.00027467278,0.00041412498,0.00021142722],"domain_scores_gemma":[0.9980159,0.00068650005,0.00027139694,0.00012529889,0.0003210531,0.00057983556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791538,0.0010052162,0.0011480302,0.0026480162,0.0017311835,0.0031747585,0.0011511293,0.0006678718,0.011868461],"category_scores_gemma":[0.0031923887,0.00077448087,0.0009315667,0.0012421191,0.0030536505,0.0060262345,0.0037677342,0.0027970618,0.0011467427],"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.00006504926,0.000039910465,0.00029870032,0.000038338134,0.0000134332795,0.000070369846,0.0003277488,0.0003866992,0.00078667747,0.99225205,0.0009292315,0.0047918395],"study_design_scores_gemma":[0.000047921385,0.00004400383,0.00061955623,0.000013113915,0.000014414553,0.00014967131,0.00013258374,0.0024766843,0.0005971462,0.99153215,0.004357271,0.00001559474],"about_ca_topic_score_codex":0.000700098,"about_ca_topic_score_gemma":0.00052763807,"teacher_disagreement_score":0.011868461,"about_ca_system_score_codex":0.0012215176,"about_ca_system_score_gemma":0.00050398393,"threshold_uncertainty_score":0.039703906},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08159271,0.0018339821,0.889198,0.0014423013,0.00016697218,0.00005340509,0.000119583565,0.000057892226,0.025535164],"genre_scores_gemma":[0.8871419,0.002097895,0.10427683,0.00046932074,0.0005311127,0.00014817124,0.00014752123,0.00007176582,0.0051154606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888057,0.0005361764,0.00004191571,0.00020563984,0.0002184666,0.00011714548],"domain_scores_gemma":[0.99700445,0.0021672177,0.00020318993,0.00015513464,0.00033775953,0.00013224193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031211388,0.00087400083,0.0011747696,0.0014017272,0.00075680594,0.0016283836,0.0008950842,0.0010687765,0.0040564565],"category_scores_gemma":[0.008651389,0.00043198717,0.0013021834,0.0015965907,0.002077407,0.0042972043,0.0017145633,0.0028270802,0.00016132815],"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.000035519075,0.000049249906,0.00043498343,0.00011437172,0.000034210134,0.00009769763,0.000111642854,0.052670475,0.0007924183,0.9345867,0.0009285387,0.0101441685],"study_design_scores_gemma":[0.000021730457,0.000094324496,0.00030472316,0.000040960604,0.000027090324,0.0001666066,0.000083705265,0.36713472,0.0007998062,0.6281504,0.0031593652,0.000016594653],"about_ca_topic_score_codex":0.0008635938,"about_ca_topic_score_gemma":0.00036307934,"teacher_disagreement_score":0.0040564565,"about_ca_system_score_codex":0.0013002575,"about_ca_system_score_gemma":0.001021676,"threshold_uncertainty_score":0.016506374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024030565,0.00041957098,0.9915338,0.00021823613,0.00006482537,0.00003775811,0.000026843618,0.00016150283,0.0051344275],"genre_scores_gemma":[0.11539611,0.0008626632,0.86871487,0.00024233959,0.00011842957,0.0006304079,0.00012561446,0.0005317545,0.013377764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990393,0.00051417714,0.000037560774,0.00006385586,0.00028586847,0.000059412854],"domain_scores_gemma":[0.9983865,0.0010362444,0.000094669835,0.0001641452,0.00026870705,0.00004981153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511263,0.0011075389,0.001250204,0.0010117693,0.00057746476,0.0011766069,0.0021823177,0.0014733949,0.005035177],"category_scores_gemma":[0.0062743574,0.00059361395,0.0009552535,0.0010727415,0.001544994,0.0011270666,0.0028859742,0.0026307052,0.0015907063],"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.000056668854,0.00007420174,0.0003973697,0.00026059197,0.000053345284,0.00009882941,0.00021804609,0.5072053,0.0020908872,0.4187028,0.0025571538,0.06828475],"study_design_scores_gemma":[0.0000071131426,0.000013238653,0.00002687843,0.00001767808,0.0000030855986,0.000010491911,0.000008927267,0.9592905,0.00027094912,0.036519926,0.0038253139,0.0000059031067],"about_ca_topic_score_codex":0.0028031894,"about_ca_topic_score_gemma":0.0032798904,"teacher_disagreement_score":0.005035177,"about_ca_system_score_codex":0.0008986407,"about_ca_system_score_gemma":0.0014401068,"threshold_uncertainty_score":0.016844392},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012312565,0.000064637,0.99771607,0.000035357647,0.000010625113,0.000023713836,0.0000100158495,0.00011343315,0.00079487177],"genre_scores_gemma":[0.137868,0.00035202943,0.85816085,0.00007437592,0.000048827882,0.000354993,0.00013046672,0.00015529475,0.0028552415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990876,0.00027661427,0.000031530457,0.0001463759,0.00040961447,0.000048332062],"domain_scores_gemma":[0.9985013,0.0009088011,0.00014048342,0.00014806933,0.00024888443,0.00005250007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012163932,0.0011182831,0.0011725086,0.0008262419,0.00083359797,0.0007555276,0.0013154447,0.0012250609,0.0032516117],"category_scores_gemma":[0.0049664285,0.0005645068,0.0006518249,0.0011101924,0.0011899082,0.001762748,0.0014729461,0.0021289638,0.0008261065],"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.000090480775,0.000037554215,0.00023708664,0.00015538886,0.00004871143,0.00008156308,0.000099973106,0.8208858,0.0038810687,0.045476172,0.0021872055,0.126819],"study_design_scores_gemma":[0.000018436902,0.000039605664,0.000045863348,0.000010045626,0.000005625866,0.000029663186,0.000009194652,0.9856793,0.0013211379,0.01088851,0.0019400662,0.000012493628],"about_ca_topic_score_codex":0.0050927536,"about_ca_topic_score_gemma":0.0034369589,"teacher_disagreement_score":0.0050927536,"about_ca_system_score_codex":0.00064593944,"about_ca_system_score_gemma":0.0017832919,"threshold_uncertainty_score":0.010877728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2879336,0.0015938652,0.66188306,0.0027245346,0.00042702374,0.0003850292,0.0005245784,0.009794757,0.034733593],"genre_scores_gemma":[0.6007466,0.0004466238,0.39102975,0.0004987393,0.00015266807,0.00017920375,0.00085530593,0.0016976066,0.0043934346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99179333,0.0037817229,0.0004854983,0.00090406893,0.0020035787,0.0010318501],"domain_scores_gemma":[0.91387874,0.06746987,0.0024266683,0.0077823494,0.0072924187,0.0011498847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009820592,0.0022956128,0.001963264,0.002438291,0.0014295038,0.0035609081,0.0029925685,0.0037452888,0.011863855],"category_scores_gemma":[0.099026926,0.0013244541,0.0018301131,0.0023376567,0.0014240063,0.0053620394,0.0041180192,0.0048186462,0.0029895864],"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.0026392683,0.0010661463,0.011183133,0.00090122165,0.00043504365,0.0003948434,0.00075169775,0.47994784,0.012536557,0.023431012,0.016320845,0.45039243],"study_design_scores_gemma":[0.0001998396,0.00025737405,0.00074107933,0.00004405898,0.00014059023,0.000098881465,0.00014079109,0.9776145,0.008861961,0.010145242,0.0017343425,0.00002135032],"about_ca_topic_score_codex":0.003885853,"about_ca_topic_score_gemma":0.0047727935,"teacher_disagreement_score":0.011863855,"about_ca_system_score_codex":0.0010738652,"about_ca_system_score_gemma":0.0036585564,"threshold_uncertainty_score":0.051936865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013143452,0.003083705,0.9588292,0.002696834,0.00065941946,0.00002759732,0.00008926127,0.00019685173,0.02127368],"genre_scores_gemma":[0.40028012,0.006781306,0.47087383,0.0013189286,0.0019442819,0.0003292209,0.0005285269,0.00095546653,0.11698837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988133,0.0006168783,0.000051918552,0.000122057536,0.0003234661,0.00007234746],"domain_scores_gemma":[0.99618906,0.0022477633,0.00029452442,0.0004119813,0.00054580736,0.00031089588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002887893,0.0012549297,0.001212392,0.0014718435,0.00082595734,0.0026060704,0.0015873233,0.0019031932,0.00616737],"category_scores_gemma":[0.010694858,0.0006609597,0.0007426685,0.0020678127,0.0027030676,0.0053342213,0.00329149,0.005326351,0.001361588],"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.000031128893,0.000019041127,0.000107463784,0.000066126064,0.000019058658,0.000019921843,0.00003950349,0.01377648,0.00045473812,0.9668132,0.0031499693,0.015503382],"study_design_scores_gemma":[0.000018418667,0.000018265295,0.00013695731,0.000021086937,0.00000960301,0.00003307512,0.000016660808,0.17981975,0.000396223,0.8130249,0.0064907395,0.000014389439],"about_ca_topic_score_codex":0.0012211105,"about_ca_topic_score_gemma":0.0012216304,"teacher_disagreement_score":0.00616737,"about_ca_system_score_codex":0.001355946,"about_ca_system_score_gemma":0.000986658,"threshold_uncertainty_score":0.020631969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022278009,0.003576931,0.91186446,0.0040808055,0.00076105713,0.00031295363,0.00050623826,0.0024982472,0.054121226],"genre_scores_gemma":[0.25703433,0.0027413808,0.70412254,0.0020923058,0.0011318296,0.0012889468,0.0013290175,0.0029455007,0.027314175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99380773,0.002814298,0.00026613884,0.0006937425,0.001785587,0.00063255336],"domain_scores_gemma":[0.969749,0.023866149,0.0008938103,0.0032175072,0.0015950098,0.0006785917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059657414,0.0039421814,0.001865173,0.00130621,0.0012876783,0.0022827436,0.0034506104,0.0021729565,0.019972166],"category_scores_gemma":[0.033106927,0.0008912121,0.0021325336,0.0013445542,0.0037879273,0.007380294,0.0054997336,0.007936106,0.005221235],"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.00324501,0.0007123397,0.0044269217,0.0019550747,0.00037946858,0.0007794533,0.0010125577,0.2015085,0.014262026,0.4083744,0.058823485,0.3045208],"study_design_scores_gemma":[0.00018959213,0.00037929096,0.0008814479,0.00020539307,0.00008149257,0.0002320124,0.00016829082,0.7331421,0.0051202457,0.24436837,0.015174132,0.000057656922],"about_ca_topic_score_codex":0.0025140066,"about_ca_topic_score_gemma":0.004725233,"teacher_disagreement_score":0.019972166,"about_ca_system_score_codex":0.0019243631,"about_ca_system_score_gemma":0.0018716297,"threshold_uncertainty_score":0.06681359},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57517165,0.002679752,0.3132027,0.014871384,0.0006082866,0.0001728231,0.0035686078,0.00029714077,0.089427635],"genre_scores_gemma":[0.9445992,0.0027353077,0.03762277,0.0010809199,0.0017349174,0.00049389456,0.002282007,0.00030220998,0.009148809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99188143,0.0039404677,0.00035732475,0.0008802263,0.0019945167,0.00094601436],"domain_scores_gemma":[0.8482083,0.13208108,0.0064612576,0.0045537017,0.0044843256,0.004211315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0093678655,0.0017581233,0.0028169507,0.0031937414,0.0026125943,0.005850199,0.004273257,0.0021283117,0.008167682],"category_scores_gemma":[0.06310712,0.0016687417,0.0015728942,0.0030214738,0.008754755,0.011121028,0.0066561946,0.0076731467,0.00082264113],"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.0010590651,0.0001526011,0.0046845693,0.0003166268,0.00014174615,0.0002566838,0.00058988563,0.034064166,0.002064991,0.9389548,0.0066097267,0.011105185],"study_design_scores_gemma":[0.00009895243,0.0000728435,0.0018925247,0.00015175084,0.000048387257,0.00024525527,0.00025409847,0.09354014,0.0012106325,0.90068877,0.0017398014,0.000056964935],"about_ca_topic_score_codex":0.00087919144,"about_ca_topic_score_gemma":0.00058175134,"teacher_disagreement_score":0.0093678655,"about_ca_system_score_codex":0.0024045648,"about_ca_system_score_gemma":0.0016603644,"threshold_uncertainty_score":0.049542606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027737021,0.0077739744,0.94833755,0.00096587435,0.00016897898,0.000033101027,0.000034441393,0.00010585604,0.014843253],"genre_scores_gemma":[0.58189094,0.0088622095,0.39890274,0.00029404587,0.00042793909,0.00016156114,0.00009346643,0.000114426635,0.009252732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996456,0.00017132303,0.000009810077,0.000043563286,0.000113577546,0.000016237293],"domain_scores_gemma":[0.9995271,0.00034766053,0.00004114411,0.00003254801,0.00003933805,0.000012297023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008185363,0.00064532686,0.00059792976,0.00032552768,0.00040300642,0.0008185613,0.0003594682,0.00084767677,0.0011214222],"category_scores_gemma":[0.0017073138,0.0003593493,0.00043827487,0.00085191376,0.0013620575,0.0010288537,0.0010310295,0.0013976138,0.00028503462],"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.0000435289,0.000042910156,0.00035720953,0.00016487969,0.000020981459,0.00007232258,0.000046645477,0.84444094,0.003454402,0.10705582,0.0010127155,0.043287516],"study_design_scores_gemma":[0.000008539174,0.000024864628,0.00011138315,0.000013139001,0.0000048290303,0.000022716364,0.000007857014,0.94245225,0.0007606701,0.05374981,0.0028331757,0.0000107375445],"about_ca_topic_score_codex":0.0014927129,"about_ca_topic_score_gemma":0.0013959038,"teacher_disagreement_score":0.0014927129,"about_ca_system_score_codex":0.00043317064,"about_ca_system_score_gemma":0.0005595397,"threshold_uncertainty_score":0.0043289065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004608226,0.0004552847,0.9964431,0.00010349417,0.00015849632,0.000029076898,0.000025628333,0.000109944995,0.0022142404],"genre_scores_gemma":[0.029986301,0.0013282073,0.9523559,0.0003791692,0.00037588063,0.00044071837,0.0001623216,0.0003603997,0.01461116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00020769506,0.000031688858,0.00012517298,0.00030207293,0.000035682937],"domain_scores_gemma":[0.9996624,0.0001513364,0.00002712743,0.000038917733,0.00009180409,0.000028398194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008602799,0.0009343022,0.00095033686,0.001001375,0.00050341425,0.00088611007,0.0014545843,0.0013040862,0.0054881163],"category_scores_gemma":[0.0018389331,0.00039226588,0.00096294214,0.00071463257,0.0007987657,0.0016058091,0.0017650889,0.0016346477,0.0019348752],"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.00013267518,0.00010154231,0.00046754206,0.0009756254,0.00017838455,0.00034477777,0.0001664207,0.17215763,0.019833587,0.29966375,0.022199238,0.48377877],"study_design_scores_gemma":[0.00006753179,0.00009409469,0.0001729211,0.00008781571,0.000044014825,0.00040578592,0.000020614936,0.8619971,0.0041682753,0.059278037,0.07360374,0.000059943282],"about_ca_topic_score_codex":0.0012770966,"about_ca_topic_score_gemma":0.0013548532,"teacher_disagreement_score":0.0054881163,"about_ca_system_score_codex":0.00040500468,"about_ca_system_score_gemma":0.0009686411,"threshold_uncertainty_score":0.018359601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008000761,0.00021451594,0.9971554,0.00008156632,0.00015563011,0.00001551909,0.000038090715,0.00013282508,0.0014063317],"genre_scores_gemma":[0.021254895,0.00072230835,0.966345,0.00020600713,0.0001780354,0.00011268575,0.0001902433,0.0005055917,0.0104852235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992593,0.00036223588,0.0000441257,0.000071021605,0.00024369932,0.000019685212],"domain_scores_gemma":[0.99860966,0.0006147401,0.00006787303,0.00025661642,0.00039386086,0.000057197354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016711234,0.0013642268,0.0007075004,0.0007097783,0.00045495643,0.0008939008,0.0008297137,0.0012950129,0.006327087],"category_scores_gemma":[0.0039042616,0.00052070385,0.00093101297,0.00085468026,0.00088618265,0.0012367683,0.0011825062,0.0021037154,0.0045653465],"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.00031390224,0.00009810844,0.0007460448,0.0005864564,0.00014676602,0.0005367702,0.00030573236,0.11547561,0.052882817,0.4257918,0.029034557,0.3740813],"study_design_scores_gemma":[0.000023341609,0.00013773565,0.0002602759,0.000050714785,0.000037875972,0.0005727113,0.000027113458,0.8761762,0.013765989,0.04923519,0.059666142,0.000046761437],"about_ca_topic_score_codex":0.00053105544,"about_ca_topic_score_gemma":0.00085795304,"teacher_disagreement_score":0.006327087,"about_ca_system_score_codex":0.00020963508,"about_ca_system_score_gemma":0.00063326576,"threshold_uncertainty_score":0.021166205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008037454,0.00010272479,0.99833953,0.000029742707,0.00003387365,0.00001553374,0.000019921252,0.00008343339,0.0005715152],"genre_scores_gemma":[0.08734763,0.00047084893,0.9051334,0.00008856976,0.00014818419,0.00023620203,0.00021817841,0.00047734755,0.0058796257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890614,0.0004911211,0.000056274424,0.00013845283,0.0003565619,0.000051471277],"domain_scores_gemma":[0.9954397,0.002747104,0.00030494307,0.0004755897,0.00086389127,0.00016874526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032523044,0.0011921898,0.0016410814,0.00069599744,0.00048264515,0.0014787933,0.0023892736,0.0016325924,0.0056086536],"category_scores_gemma":[0.012634516,0.0010385405,0.0012269433,0.00082441146,0.0011749995,0.00209156,0.002254936,0.002448357,0.0019545793],"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.0004706171,0.00009997346,0.0006316547,0.0005042065,0.00012792484,0.00019451852,0.00017489804,0.757632,0.0073919967,0.10512229,0.0058713304,0.12177853],"study_design_scores_gemma":[0.0000112289135,0.00004009821,0.000033203956,0.000013804189,0.000010855066,0.000031962925,0.0000043732007,0.9926231,0.0007484191,0.0045415238,0.0019309531,0.000010588915],"about_ca_topic_score_codex":0.003016618,"about_ca_topic_score_gemma":0.0019581069,"teacher_disagreement_score":0.0056086536,"about_ca_system_score_codex":0.0005738261,"about_ca_system_score_gemma":0.0014722092,"threshold_uncertainty_score":0.018762767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13607994,0.00042745913,0.8539032,0.000534275,0.00003502386,0.0000780305,0.00009215141,0.00017908314,0.008670936],"genre_scores_gemma":[0.820922,0.0006365758,0.1663052,0.00025189848,0.000045291057,0.00040915346,0.00027469563,0.00034692974,0.010808225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.000601703,0.000034778743,0.00016456579,0.00023111222,0.00012284056],"domain_scores_gemma":[0.9876987,0.008814594,0.001285804,0.0005433764,0.0010118643,0.00064570666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038745534,0.0012730277,0.0008562355,0.001221634,0.001032803,0.0017713998,0.0015193657,0.0013244591,0.0041698324],"category_scores_gemma":[0.027175574,0.000667582,0.00090910925,0.0006159607,0.0034368099,0.0036764422,0.002332539,0.0026391854,0.00037835698],"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.00020795307,0.0001006621,0.001764869,0.00020980323,0.00006524957,0.00039012515,0.00039973547,0.35058478,0.0039685396,0.62754464,0.0016247225,0.013138923],"study_design_scores_gemma":[0.00001385025,0.000038272337,0.00014194737,0.000027695756,0.0000072144317,0.000076727425,0.00004833419,0.871021,0.0010266965,0.12701955,0.00056224596,0.00001641204],"about_ca_topic_score_codex":0.0019121807,"about_ca_topic_score_gemma":0.0016292988,"teacher_disagreement_score":0.0041698324,"about_ca_system_score_codex":0.001436458,"about_ca_system_score_gemma":0.0010345175,"threshold_uncertainty_score":0.020490825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068382174,0.012538256,0.87534153,0.0024052705,0.00077691965,0.00013139303,0.00047030053,0.0003939737,0.101104185],"genre_scores_gemma":[0.21065831,0.024767049,0.65753704,0.001345608,0.003057097,0.0013608126,0.0026046422,0.0013667445,0.09730264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991768,0.00027185105,0.00004697476,0.000100939,0.00034686158,0.00005666384],"domain_scores_gemma":[0.99870384,0.00084168965,0.00008938893,0.00017444082,0.00012977862,0.000060878017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013105772,0.0016973392,0.0012577329,0.0010360196,0.000685138,0.0022228654,0.0015122037,0.0009854927,0.015700283],"category_scores_gemma":[0.004832007,0.0010176261,0.0010166813,0.0025715516,0.0013699979,0.0043520783,0.0020421448,0.0072798566,0.003469426],"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.00009031154,0.00010585661,0.000060486193,0.00055506756,0.000028827892,0.00005318223,0.00022571934,0.029211769,0.0015226419,0.79455614,0.025857938,0.14773206],"study_design_scores_gemma":[0.000046975245,0.000047459813,0.00010945951,0.00018874744,0.000017105374,0.000094955074,0.00007496786,0.069484204,0.0005420373,0.86657935,0.062798545,0.000016249327],"about_ca_topic_score_codex":0.00077398063,"about_ca_topic_score_gemma":0.0010100015,"teacher_disagreement_score":0.015700283,"about_ca_system_score_codex":0.001181871,"about_ca_system_score_gemma":0.00060959626,"threshold_uncertainty_score":0.05252266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095495506,0.00041106885,0.9970216,0.00030190765,0.000045551293,0.00001006832,0.0000613826,0.00008045447,0.0011130845],"genre_scores_gemma":[0.3407569,0.0037206486,0.62857735,0.00066923955,0.0006029693,0.0005309352,0.0009795203,0.0006899927,0.023472425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.0006093797,0.00004377138,0.00014388098,0.00028637573,0.00006300086],"domain_scores_gemma":[0.99699676,0.0019659118,0.00015775386,0.00038607686,0.00034767267,0.0001458819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991612,0.0011835801,0.0013850268,0.0006307548,0.00041960808,0.0014628996,0.0022851077,0.0013709951,0.0056218384],"category_scores_gemma":[0.010224422,0.00072601554,0.0008676978,0.0017440767,0.0013746846,0.0024963168,0.0021932349,0.0042701643,0.0017109319],"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.00006280158,0.000033125903,0.00024095965,0.00023071187,0.000054495405,0.000058747228,0.00004808941,0.5408897,0.0009033153,0.41068798,0.007463351,0.039326716],"study_design_scores_gemma":[0.00000407617,0.000009424977,0.000030937485,0.0000061948235,0.000004928217,0.000010678186,0.0000038995818,0.910771,0.0000909357,0.087531194,0.0015325408,0.000004071089],"about_ca_topic_score_codex":0.0032783225,"about_ca_topic_score_gemma":0.002860356,"teacher_disagreement_score":0.0056218384,"about_ca_system_score_codex":0.0011238691,"about_ca_system_score_gemma":0.0010881004,"threshold_uncertainty_score":0.018806934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5764634,0.0028723541,0.3694616,0.0025717886,0.00021798561,0.00018347136,0.00065019174,0.00033794114,0.047241315],"genre_scores_gemma":[0.9478266,0.0009388754,0.04761529,0.00028492435,0.00016734382,0.00018120189,0.00044565226,0.0001542226,0.0023858133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944174,0.0023620855,0.0002271421,0.00067665946,0.001774722,0.0005419699],"domain_scores_gemma":[0.8798634,0.10417184,0.0071291085,0.002278289,0.0038068858,0.0027504459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010792338,0.001173427,0.0017340158,0.005064252,0.0024909782,0.0068472433,0.0030570305,0.0036378303,0.00870368],"category_scores_gemma":[0.08119086,0.0019353125,0.0013804146,0.0040367967,0.0048463205,0.010203553,0.0036193545,0.005702205,0.00046490695],"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.00080113544,0.00018335698,0.007909185,0.00034636818,0.00016832602,0.0005058508,0.0007409776,0.07776169,0.002919412,0.8675242,0.0023492323,0.038790233],"study_design_scores_gemma":[0.000068277295,0.00014145211,0.0022407866,0.0001924121,0.00012165639,0.00047326132,0.0006044584,0.24811344,0.0020650881,0.7440666,0.0018515778,0.000060958944],"about_ca_topic_score_codex":0.00091349805,"about_ca_topic_score_gemma":0.000939008,"teacher_disagreement_score":0.010792338,"about_ca_system_score_codex":0.0018966655,"about_ca_system_score_gemma":0.0009674886,"threshold_uncertainty_score":0.057076037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036100973,0.000086398504,0.9943954,0.000032985852,0.000020835008,0.000055231798,0.000031512172,0.00019550473,0.0015721131],"genre_scores_gemma":[0.059934877,0.0001557045,0.93742085,0.00003223896,0.000014312446,0.00019349631,0.00019318672,0.0001179142,0.0019373156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920434,0.00026316586,0.00005226453,0.000107199055,0.00031435644,0.00005866343],"domain_scores_gemma":[0.99917465,0.0004036196,0.000045032884,0.000082211016,0.00026211885,0.000032254527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794772,0.0008167338,0.0008475561,0.0009381572,0.0005302737,0.000833604,0.0012569424,0.00083530555,0.0050842636],"category_scores_gemma":[0.0023191848,0.0004696442,0.0008210013,0.0011448949,0.00044539946,0.0010755172,0.000941931,0.0013567958,0.0012621261],"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.00027263988,0.00014164769,0.0007418948,0.0003724687,0.00011325137,0.00022409749,0.00027454668,0.4962482,0.0178804,0.045553524,0.004594088,0.4335832],"study_design_scores_gemma":[0.000039391933,0.00006585762,0.00010123581,0.000020968437,0.000013881553,0.00008167805,0.000029270388,0.9770123,0.00475795,0.013704497,0.0041567907,0.000016138889],"about_ca_topic_score_codex":0.0026974652,"about_ca_topic_score_gemma":0.0022217752,"teacher_disagreement_score":0.0050842636,"about_ca_system_score_codex":0.0003795423,"about_ca_system_score_gemma":0.0012237704,"threshold_uncertainty_score":0.017008603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016495489,0.001054736,0.97332215,0.00030010493,0.00006485924,0.000046153516,0.000043856,0.0001785926,0.008494025],"genre_scores_gemma":[0.64014655,0.0022765277,0.33452025,0.00060174486,0.00034111427,0.00043806416,0.00034008038,0.0010208504,0.020314869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761426,0.0011659636,0.00008435772,0.0002980977,0.0006444653,0.00019297117],"domain_scores_gemma":[0.9912038,0.0050551407,0.0005026758,0.0009586743,0.0018928425,0.0003869909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074794344,0.0011815323,0.0012199251,0.0014732855,0.0006693422,0.0014322305,0.0014533028,0.0011487555,0.005592762],"category_scores_gemma":[0.020345688,0.0004399157,0.0011323682,0.0009959072,0.0029397642,0.0035557817,0.0041906903,0.0034204181,0.0013113924],"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.0004581943,0.0000837619,0.0013318297,0.00045212885,0.00008465491,0.00017114304,0.00048339128,0.2896514,0.008103437,0.59408104,0.0037833075,0.101315655],"study_design_scores_gemma":[0.000031656127,0.00015969406,0.00034032637,0.000055286404,0.000014497987,0.00009411559,0.00006686275,0.87046695,0.0030279865,0.12291889,0.0028009638,0.000022712637],"about_ca_topic_score_codex":0.0007552343,"about_ca_topic_score_gemma":0.0005402564,"teacher_disagreement_score":0.0074794344,"about_ca_system_score_codex":0.0007569686,"about_ca_system_score_gemma":0.0008272664,"threshold_uncertainty_score":0.03955549},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088492714,0.0018212325,0.86158216,0.0026918843,0.0004107239,0.000051497187,0.0002917851,0.00028930433,0.044368654],"genre_scores_gemma":[0.8269614,0.0010152148,0.15048675,0.0008980848,0.0005974267,0.000090599344,0.0003722101,0.0002926706,0.019285727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00042686364,0.00005346296,0.00024829022,0.000387311,0.00011472828],"domain_scores_gemma":[0.99837226,0.00065373763,0.00027101245,0.00023164194,0.00039557842,0.00007575365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030038517,0.00055075204,0.00090503035,0.0009081851,0.00052758475,0.0014952809,0.0012405431,0.0009541457,0.005064934],"category_scores_gemma":[0.005005361,0.00031958666,0.00088839437,0.0009054517,0.002593498,0.0031890448,0.0016091511,0.001824428,0.0008155524],"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.00002553796,0.000007833519,0.00016457432,0.000030853316,0.000013842372,0.000062822626,0.00006504117,0.0050781663,0.0018202878,0.9831646,0.0016693478,0.007897086],"study_design_scores_gemma":[0.000025669136,0.00007073627,0.00041483,0.000013152114,0.000012590665,0.00014852565,0.000037914026,0.04211394,0.0023837183,0.94865894,0.0060958005,0.00002426493],"about_ca_topic_score_codex":0.0009867967,"about_ca_topic_score_gemma":0.00060439244,"teacher_disagreement_score":0.005064934,"about_ca_system_score_codex":0.0006289851,"about_ca_system_score_gemma":0.0007043499,"threshold_uncertainty_score":0.016943872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038503315,0.0020508901,0.95191205,0.001168217,0.0001857475,0.00022185824,0.000282426,0.000621062,0.005054445],"genre_scores_gemma":[0.72694033,0.001759056,0.26502797,0.00042923496,0.00021063519,0.0005735082,0.00052078447,0.0007960585,0.0037424152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98006976,0.012552621,0.00080516475,0.0020505674,0.0035391862,0.0009826156],"domain_scores_gemma":[0.6236502,0.33663726,0.010368586,0.013719269,0.012834818,0.0027898352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027475994,0.002295046,0.0028086181,0.0027494493,0.0013914302,0.004559305,0.003027193,0.004749334,0.004005685],"category_scores_gemma":[0.3209106,0.0017395117,0.0014789568,0.0019442627,0.005080184,0.0084874295,0.0062475293,0.0056816386,0.0009846434],"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.000786257,0.00011670268,0.0017778765,0.0004396696,0.00017879407,0.00009371386,0.00027206374,0.8782306,0.0022115125,0.07477852,0.002750772,0.038363483],"study_design_scores_gemma":[0.00004810029,0.00013045582,0.00044144256,0.00008036767,0.00003746015,0.00010036958,0.00005530885,0.95975864,0.0024616653,0.03599607,0.00085598935,0.00003415629],"about_ca_topic_score_codex":0.0037054725,"about_ca_topic_score_gemma":0.0015839331,"teacher_disagreement_score":0.027475994,"about_ca_system_score_codex":0.0037058513,"about_ca_system_score_gemma":0.0029120871,"threshold_uncertainty_score":0.14530867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082291365,0.00012714165,0.9862824,0.00013854438,0.000029093675,0.00005604659,0.000079285,0.0001712971,0.004887091],"genre_scores_gemma":[0.423145,0.0005930783,0.56529504,0.00011981694,0.00007881338,0.0005419862,0.00041194126,0.00021131065,0.009603032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.00031793676,0.000028600067,0.00012722061,0.00018396434,0.0000616298],"domain_scores_gemma":[0.9977791,0.0015814119,0.00022881091,0.0001284163,0.00020827174,0.00007399083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166473,0.0011427184,0.0010541737,0.0003792766,0.0004893731,0.0018268261,0.0009627958,0.00097301614,0.0041198344],"category_scores_gemma":[0.002517496,0.00054501556,0.0007963683,0.00085285265,0.0013168744,0.0012578538,0.0010239541,0.0016240212,0.0006442346],"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.000069181304,0.000058504313,0.00017832441,0.00010670102,0.000020680736,0.00006421699,0.000045198973,0.94841164,0.0014711589,0.024871463,0.0012150113,0.023487948],"study_design_scores_gemma":[0.00001678527,0.00004249414,0.000025633393,0.000006359205,0.0000044535404,0.000014300369,0.000019145627,0.9904327,0.00072656904,0.0076283333,0.001078198,0.0000050374056],"about_ca_topic_score_codex":0.0033080978,"about_ca_topic_score_gemma":0.0038681652,"teacher_disagreement_score":0.0041198344,"about_ca_system_score_codex":0.000837131,"about_ca_system_score_gemma":0.0014251046,"threshold_uncertainty_score":0.013782263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003256794,0.00023505381,0.9885153,0.00039236734,0.00007804123,0.00003900627,0.000057025118,0.00013097521,0.0072954255],"genre_scores_gemma":[0.2298435,0.0006461963,0.74585974,0.00035085154,0.00017605275,0.00035170763,0.00032363506,0.00074861676,0.021699695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994431,0.000246437,0.000016539325,0.000091396214,0.00014475254,0.00005767773],"domain_scores_gemma":[0.998604,0.00090743817,0.00008649815,0.00014354957,0.00017317793,0.00008523674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017058118,0.0014017406,0.0017150105,0.00071531563,0.0009398149,0.001643375,0.0028396,0.0018622626,0.008302035],"category_scores_gemma":[0.0062959073,0.001032805,0.0013575422,0.0009167726,0.0017800404,0.0029919469,0.003008366,0.004818966,0.0013099854],"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.00018651092,0.00016990818,0.00026792285,0.0003254372,0.0000480122,0.00007203272,0.00014061488,0.44511434,0.001157222,0.45625168,0.011191907,0.085074306],"study_design_scores_gemma":[0.000023960265,0.000020118194,0.000038089398,0.000022676904,0.000009855118,0.000018277357,0.000016152124,0.8535443,0.0003517089,0.1440507,0.0018959173,0.000008212004],"about_ca_topic_score_codex":0.0034723585,"about_ca_topic_score_gemma":0.003586294,"teacher_disagreement_score":0.008302035,"about_ca_system_score_codex":0.0012291097,"about_ca_system_score_gemma":0.0017389702,"threshold_uncertainty_score":0.027773082},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025607855,0.00012330708,0.9959921,0.00007161051,0.00006257487,0.000044410663,0.000020714775,0.00020939748,0.0009151393],"genre_scores_gemma":[0.07945072,0.00016161447,0.91540897,0.00014696793,0.00009458398,0.00030374556,0.00016307103,0.0002318719,0.0040385053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992199,0.0002298524,0.000041837644,0.00008939922,0.0003740856,0.000044857465],"domain_scores_gemma":[0.9983052,0.0009194949,0.00006389487,0.00019423389,0.00039995887,0.00011720088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215558,0.00088605727,0.0017503494,0.0008910381,0.0006018718,0.0011705941,0.0022230812,0.0019794747,0.004699744],"category_scores_gemma":[0.007198816,0.00074320834,0.00072837,0.0010205139,0.0009025404,0.0013856159,0.0019392413,0.0024348986,0.0013958552],"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.00051217584,0.00027544296,0.0006836821,0.00027442968,0.00012473928,0.00013665299,0.00015095713,0.51564366,0.009262834,0.070000544,0.0076849572,0.39524996],"study_design_scores_gemma":[0.00003319477,0.000033304517,0.000048480575,0.000008470792,0.0000070127217,0.000027602438,0.000004468871,0.9916881,0.0006261623,0.006404208,0.0011117691,0.000007224394],"about_ca_topic_score_codex":0.0032664353,"about_ca_topic_score_gemma":0.0047736815,"teacher_disagreement_score":0.004699744,"about_ca_system_score_codex":0.0007585536,"about_ca_system_score_gemma":0.0017954286,"threshold_uncertainty_score":0.015722215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000431065,0.011320015,0.97679895,0.0006746503,0.00064604613,0.000057958743,0.000088262066,0.000380147,0.009602835],"genre_scores_gemma":[0.056526724,0.025839703,0.89099514,0.00063980074,0.0016238942,0.0012098807,0.00052227033,0.0008741012,0.021768397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985291,0.00056493527,0.0000915347,0.000100234334,0.0006662391,0.000048011752],"domain_scores_gemma":[0.9977043,0.00130914,0.00018827658,0.00024655505,0.00046231452,0.00008939073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00182394,0.0013615212,0.0016619302,0.0011957769,0.00085003785,0.0015954716,0.0017103432,0.0020094125,0.008678374],"category_scores_gemma":[0.006886676,0.0005063733,0.0010387127,0.0019484144,0.0015770904,0.0016365602,0.002362943,0.003984915,0.0047055464],"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.00003877268,0.000047813715,0.00031138997,0.0013803755,0.00012013812,0.0001319698,0.00012066401,0.3070225,0.0036279177,0.5034757,0.026318535,0.15740418],"study_design_scores_gemma":[0.000037318543,0.000022840839,0.00016536338,0.0002194253,0.000025378116,0.00012640192,0.000024647048,0.6448018,0.0009098006,0.26574162,0.08789113,0.000034231576],"about_ca_topic_score_codex":0.0019094205,"about_ca_topic_score_gemma":0.001931837,"teacher_disagreement_score":0.008678374,"about_ca_system_score_codex":0.00089338823,"about_ca_system_score_gemma":0.0017834973,"threshold_uncertainty_score":0.029032052},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03748724,0.00032039295,0.9574556,0.00042856066,0.000027691536,0.000069044916,0.00018429827,0.00027849473,0.0037486306],"genre_scores_gemma":[0.4391779,0.00046789568,0.5560163,0.00015705705,0.00006797558,0.0002537359,0.0006232044,0.00035979497,0.002876063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.00073198235,0.000071137816,0.0002451818,0.00036389494,0.00011758704],"domain_scores_gemma":[0.9848016,0.011317939,0.0011148907,0.0012610019,0.0010998739,0.00040463125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018302,0.0009982636,0.0009955377,0.0035811686,0.0012845253,0.002585301,0.0012787532,0.0013162331,0.003620051],"category_scores_gemma":[0.019487588,0.0006470343,0.0012001627,0.0029424476,0.002520247,0.0039475737,0.0018811302,0.0020593295,0.000620514],"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.00017606687,0.00013089384,0.007659807,0.0002506254,0.00008726704,0.00040850506,0.00074874563,0.26311785,0.003586691,0.5958985,0.0061122123,0.12182281],"study_design_scores_gemma":[0.00001089034,0.000022472042,0.0006634734,0.00005008219,0.000019077705,0.000106870546,0.00009618564,0.7132318,0.0015193712,0.28199905,0.002259587,0.0000211955],"about_ca_topic_score_codex":0.002760921,"about_ca_topic_score_gemma":0.0036224166,"teacher_disagreement_score":0.003620051,"about_ca_system_score_codex":0.0012506442,"about_ca_system_score_gemma":0.00091745594,"threshold_uncertainty_score":0.012110293},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023134858,0.005001263,0.9145763,0.002320784,0.0004599363,0.00004686239,0.0005754849,0.0003285011,0.074377425],"genre_scores_gemma":[0.30574223,0.025380764,0.5166329,0.002052547,0.0034738882,0.0006226598,0.0032940635,0.0016495554,0.14115137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984428,0.00048219206,0.000083577805,0.0002710797,0.00063400576,0.00008631807],"domain_scores_gemma":[0.9981633,0.0009338287,0.00014303917,0.0002894667,0.00040188397,0.0000686282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012875961,0.0014748801,0.0011467941,0.0015132199,0.000729383,0.0034304564,0.0008984926,0.0009166608,0.015216241],"category_scores_gemma":[0.0057557863,0.00040206758,0.0012568532,0.0019246149,0.0025240963,0.002082487,0.0023813534,0.0032363383,0.0065490087],"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.000010105586,0.00000741876,0.00013482856,0.00014439576,0.000030996936,0.00005815075,0.000102137,0.020868313,0.0007567908,0.906857,0.022161568,0.04886821],"study_design_scores_gemma":[0.0000075465637,0.000012273627,0.00017217522,0.00007644959,0.000011588884,0.00009341475,0.000042008738,0.077185355,0.0008101035,0.83719045,0.08438396,0.000014754727],"about_ca_topic_score_codex":0.0016505733,"about_ca_topic_score_gemma":0.0012998291,"teacher_disagreement_score":0.015216241,"about_ca_system_score_codex":0.0018368248,"about_ca_system_score_gemma":0.0013077877,"threshold_uncertainty_score":0.05090338},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07053979,0.0038173187,0.87989837,0.0023745054,0.00032416,0.000037819056,0.00015806842,0.00016225158,0.042687632],"genre_scores_gemma":[0.9068617,0.0028181707,0.07860877,0.00031535447,0.0005361667,0.000072424,0.00015672017,0.00011606637,0.010514557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988463,0.00044120842,0.000053873224,0.00015305149,0.0003597844,0.00014572567],"domain_scores_gemma":[0.99580586,0.0024627736,0.0005986766,0.0003689761,0.00044039765,0.00032336244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327128,0.00094577007,0.00077642873,0.0016702239,0.0007158857,0.0022980508,0.0008594507,0.00087471725,0.0048375935],"category_scores_gemma":[0.013747375,0.00032431926,0.0006555286,0.0018146657,0.00364899,0.004164982,0.0025255375,0.003215512,0.0006347207],"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.000022937757,0.000008880903,0.00012458162,0.000040560146,0.0000037640848,0.000033782977,0.00009012713,0.0105953785,0.00052375096,0.98003536,0.00067697046,0.007843878],"study_design_scores_gemma":[0.0000073943693,0.000020499876,0.00012581407,0.000022640237,0.0000043168957,0.000069106565,0.000049840197,0.058494072,0.00033726136,0.9383637,0.0024929382,0.000012466098],"about_ca_topic_score_codex":0.0008767471,"about_ca_topic_score_gemma":0.0008615338,"teacher_disagreement_score":0.0048375935,"about_ca_system_score_codex":0.0014160223,"about_ca_system_score_gemma":0.0005463741,"threshold_uncertainty_score":0.016183376},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017758105,0.0003790722,0.9194877,0.0007668212,0.0002905264,0.000042269025,0.00025317215,0.00024243182,0.060779873],"genre_scores_gemma":[0.70902735,0.0012845107,0.25376737,0.0007804355,0.00053482805,0.0003325615,0.00069591537,0.00044168514,0.0331353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998769,0.000419473,0.000060569433,0.00023967079,0.0004137366,0.000097508535],"domain_scores_gemma":[0.99761355,0.001034575,0.00023683523,0.00037545068,0.0005797842,0.00015993485],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012727021,0.0008818018,0.000529317,0.00072841963,0.0007870402,0.0025453363,0.00094448816,0.0007206138,0.008133202],"category_scores_gemma":[0.007941908,0.00028998053,0.0006527895,0.0007275735,0.0035200182,0.0035682349,0.0018646786,0.002379941,0.0018965147],"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.000009258077,0.000009326987,0.00003841837,0.00002100188,0.000003248397,0.0000183032,0.000039212624,0.0026775443,0.00038935884,0.9890939,0.0012539546,0.006446507],"study_design_scores_gemma":[0.000002845868,0.000011115352,0.000038611983,0.000011776978,0.0000021317799,0.000046761605,0.000025284859,0.037124537,0.00048542296,0.95990336,0.002340213,0.000007980285],"about_ca_topic_score_codex":0.00091556145,"about_ca_topic_score_gemma":0.0011607065,"teacher_disagreement_score":0.9918668,"about_ca_system_score_codex":0.0007861861,"about_ca_system_score_gemma":0.0010027445,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002152139,0.00023672222,0.9951767,0.00011383137,0.000029831188,0.000030598665,0.000021329393,0.000023899844,0.0022149447],"genre_scores_gemma":[0.20525214,0.0020194198,0.7754691,0.00025837382,0.00040064074,0.00063689955,0.0003192098,0.00019412431,0.01545002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.00027743322,0.000031745098,0.00015210787,0.00026953703,0.000042562235],"domain_scores_gemma":[0.9989569,0.00063196337,0.000115383,0.00008479782,0.00016067125,0.000050251012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016088064,0.0011716288,0.00072173576,0.0006333258,0.0004088951,0.0008186451,0.0010130048,0.00089354394,0.004036724],"category_scores_gemma":[0.0028883694,0.0004414753,0.00088931364,0.0006912954,0.0012438874,0.0014342347,0.0015148557,0.002156451,0.000657611],"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.00006444288,0.000086424785,0.00045362013,0.00044751386,0.000075468575,0.00012918065,0.00014758777,0.47512227,0.006355798,0.4460666,0.0029717546,0.068079345],"study_design_scores_gemma":[0.00001161805,0.000056436107,0.000071244904,0.00002132298,0.0000069237603,0.000041756768,0.000015560347,0.9001316,0.0008456718,0.094730996,0.0040597455,0.0000071623026],"about_ca_topic_score_codex":0.00087823026,"about_ca_topic_score_gemma":0.0011746533,"teacher_disagreement_score":0.004036724,"about_ca_system_score_codex":0.0006469477,"about_ca_system_score_gemma":0.0011442722,"threshold_uncertainty_score":0.013504207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005867183,0.0006301253,0.9805432,0.00054460583,0.00011246442,0.000019551793,0.000107351756,0.000051039104,0.012124447],"genre_scores_gemma":[0.5203259,0.0036818646,0.45323777,0.001274427,0.00094162737,0.00037782427,0.00043192363,0.00020710626,0.019521516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991689,0.0003017605,0.000028894661,0.00013795117,0.00023475416,0.00012769912],"domain_scores_gemma":[0.9980774,0.001153836,0.00019358806,0.00019297113,0.00028217174,0.000100031844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015313107,0.0011616921,0.0009477468,0.0012775061,0.00066525704,0.0018409692,0.0016569147,0.001273457,0.0057053794],"category_scores_gemma":[0.0054281326,0.0003861076,0.0006293611,0.002459862,0.0021464077,0.0024725008,0.0013316954,0.003997209,0.000561112],"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.000015426642,0.000013695588,0.00008729659,0.000049443086,0.000009853447,0.00004323708,0.00003192487,0.11093892,0.0005709878,0.87632924,0.0017086561,0.010201373],"study_design_scores_gemma":[0.0000057560446,0.000021996051,0.00006893411,0.000020553083,0.0000054290313,0.000045804725,0.000018913306,0.60749394,0.000593426,0.38706818,0.004645254,0.000011825526],"about_ca_topic_score_codex":0.0026797366,"about_ca_topic_score_gemma":0.0023594417,"teacher_disagreement_score":0.0057053794,"about_ca_system_score_codex":0.0018434584,"about_ca_system_score_gemma":0.001159205,"threshold_uncertainty_score":0.01908642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003847922,0.00015571085,0.9907823,0.00035689407,0.000050396437,0.000058056186,0.00012864245,0.00013663147,0.004483555],"genre_scores_gemma":[0.20675965,0.0007820115,0.7825029,0.0005565302,0.00028199598,0.00069445506,0.0010902018,0.0004302448,0.0069019417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787474,0.00087781437,0.0000923163,0.00039677776,0.00061512075,0.00014325647],"domain_scores_gemma":[0.99329716,0.0045829588,0.0005405197,0.0005954078,0.00072019896,0.00026371243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038353936,0.0015075231,0.0011460056,0.0008608851,0.0005499054,0.0018742462,0.0015159798,0.0014317884,0.006187938],"category_scores_gemma":[0.013041649,0.0006633454,0.0010117654,0.0012544134,0.0015987463,0.0026807946,0.0021955674,0.0059172534,0.0016597236],"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.00019059259,0.0003896736,0.00041145706,0.0004496236,0.00006229508,0.00014902215,0.00018171321,0.6666509,0.006182275,0.22064424,0.015461622,0.08922665],"study_design_scores_gemma":[0.000026725049,0.00009404499,0.00008535076,0.000030734678,0.0000074034638,0.000056269295,0.00003008442,0.94489384,0.0011035685,0.050255258,0.0034007414,0.000015955775],"about_ca_topic_score_codex":0.0010905509,"about_ca_topic_score_gemma":0.0014302104,"teacher_disagreement_score":0.006187938,"about_ca_system_score_codex":0.0012618183,"about_ca_system_score_gemma":0.0018578582,"threshold_uncertainty_score":0.020700753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036314975,0.0003528818,0.9925195,0.0000924068,0.0000524617,0.000038201146,0.000014777349,0.00011273359,0.0031856142],"genre_scores_gemma":[0.15915114,0.001253927,0.83278495,0.00014284962,0.00011408717,0.00045866566,0.00010691648,0.00018046847,0.005806987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986211,0.00065383106,0.000054257376,0.00011751513,0.0005004852,0.00005274823],"domain_scores_gemma":[0.99818254,0.0012479553,0.00012695444,0.00014124392,0.00025144848,0.00004988506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025696529,0.0009332889,0.0007293647,0.0006952875,0.00038207675,0.00070675503,0.00080427097,0.0005668768,0.0044277115],"category_scores_gemma":[0.0049044793,0.0005441393,0.0005657279,0.0010289865,0.0008857433,0.0011504425,0.0012582318,0.00112916,0.0006991153],"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.00018668492,0.00008705416,0.00058560306,0.00032195746,0.00008613535,0.000062125626,0.00012107639,0.76440483,0.0023465396,0.08771744,0.001851086,0.14222941],"study_design_scores_gemma":[0.00008042162,0.000105073785,0.00014921825,0.00003266746,0.000015698371,0.00003672022,0.000026199721,0.9317515,0.0014379132,0.059518825,0.0068355384,0.000010160812],"about_ca_topic_score_codex":0.0028057324,"about_ca_topic_score_gemma":0.002539324,"teacher_disagreement_score":0.0044277115,"about_ca_system_score_codex":0.000517027,"about_ca_system_score_gemma":0.0011085701,"threshold_uncertainty_score":0.014812112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025253303,0.0007227792,0.958538,0.00060171547,0.00017173651,0.00004989036,0.00005769616,0.00020787612,0.014396962],"genre_scores_gemma":[0.7752602,0.0009747666,0.21529002,0.00052242493,0.00018003964,0.00014099487,0.00009430385,0.00023597591,0.0073013026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.00045258334,0.00003791874,0.000081848644,0.00017424181,0.00006931522],"domain_scores_gemma":[0.9955243,0.0034173399,0.00019617572,0.00044791386,0.00030612788,0.00010810713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018571765,0.00077441556,0.0005489154,0.00045632463,0.0006591487,0.0012308916,0.00075087085,0.0012537566,0.0033757524],"category_scores_gemma":[0.011516478,0.00039931567,0.00026670078,0.0006048679,0.0014251256,0.0019416118,0.00145315,0.0018113479,0.00057652546],"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.00038174636,0.000105457286,0.00035520794,0.00022484384,0.000028957114,0.00010042509,0.0001275594,0.18068925,0.012728872,0.7199139,0.0038112996,0.08153253],"study_design_scores_gemma":[0.00005064886,0.00008781929,0.000107698026,0.000073292256,0.00002011004,0.000058004385,0.000028784332,0.69223315,0.0064469553,0.2985352,0.0023308923,0.000027362095],"about_ca_topic_score_codex":0.00040510565,"about_ca_topic_score_gemma":0.0011077963,"teacher_disagreement_score":0.0033757524,"about_ca_system_score_codex":0.00040652117,"about_ca_system_score_gemma":0.00052686763,"threshold_uncertainty_score":0.011292994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018160393,0.0013564588,0.9767562,0.00029319245,0.00005458431,0.00003888514,0.00007903534,0.00020097314,0.0030601742],"genre_scores_gemma":[0.54879016,0.004464999,0.4349144,0.0003856942,0.00051826483,0.00049617817,0.0011952244,0.00074913586,0.008486018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937265,0.0027862648,0.00028523908,0.0011535768,0.0015825601,0.0004658841],"domain_scores_gemma":[0.9616593,0.029520616,0.0022677272,0.002930309,0.0027986306,0.000823286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011483219,0.0030793913,0.0025853098,0.003826757,0.00085312006,0.0050185374,0.0021103444,0.002403203,0.003183004],"category_scores_gemma":[0.07261175,0.0017093779,0.0013967887,0.0018737832,0.0057229567,0.009770133,0.005515456,0.0065986365,0.0012197532],"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.00036798796,0.00007682261,0.0025067907,0.0006174528,0.00022512542,0.00024043256,0.00054728176,0.43625894,0.008370605,0.4619411,0.002443232,0.0864044],"study_design_scores_gemma":[0.000013030435,0.00011388018,0.0010814646,0.00014061252,0.000039679555,0.000092002665,0.00009518621,0.8018566,0.006716561,0.18600336,0.003786983,0.000060611746],"about_ca_topic_score_codex":0.0019200589,"about_ca_topic_score_gemma":0.0009842142,"teacher_disagreement_score":0.011483219,"about_ca_system_score_codex":0.0021298595,"about_ca_system_score_gemma":0.0010678926,"threshold_uncertainty_score":0.0607298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009499181,0.00038352518,0.9852158,0.00032403326,0.00004017671,0.00005353077,0.00014341666,0.000111139205,0.00422918],"genre_scores_gemma":[0.42341518,0.0017333099,0.5637295,0.0002738244,0.0002890138,0.0006874799,0.000985209,0.00032816213,0.008558245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988159,0.0006157755,0.000043806394,0.00015729739,0.00026908267,0.00009817319],"domain_scores_gemma":[0.99532086,0.0038173867,0.0003223111,0.00014876555,0.00028746008,0.00010321634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018803495,0.0017983998,0.0011589449,0.0005734209,0.000370211,0.0011514188,0.0008847834,0.0010882543,0.0031516952],"category_scores_gemma":[0.006836253,0.0006157194,0.0009632789,0.001306131,0.0011608956,0.0012560723,0.0013589348,0.0028664635,0.0006281416],"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.00008178137,0.000078648525,0.0002192107,0.00020327012,0.000036883484,0.00008681497,0.00006732659,0.9149042,0.0010536589,0.053951845,0.0022766704,0.02703978],"study_design_scores_gemma":[0.000011737848,0.000027822103,0.000034757668,0.000008785886,0.0000038010776,0.000014112187,0.000018156785,0.98103863,0.00026056374,0.018036408,0.00054120016,0.000004056093],"about_ca_topic_score_codex":0.0020241549,"about_ca_topic_score_gemma":0.0026546852,"teacher_disagreement_score":0.0031516952,"about_ca_system_score_codex":0.0006542478,"about_ca_system_score_gemma":0.0012805174,"threshold_uncertainty_score":0.010543466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051908926,0.00045230368,0.9900345,0.0004756744,0.00006388449,0.00004114027,0.000034687317,0.00006411478,0.0036427444],"genre_scores_gemma":[0.66865283,0.0026535934,0.30995375,0.00075147714,0.00024898205,0.00086167885,0.00039244178,0.00051821914,0.015967043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989907,0.0004768563,0.000036321675,0.000095777774,0.00030281214,0.00009742188],"domain_scores_gemma":[0.99346304,0.004978013,0.00027975405,0.00018099319,0.00091078464,0.00018749479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004847047,0.0012151373,0.0011692357,0.0008368858,0.00064674055,0.0012151963,0.0011312228,0.0012538292,0.0040120534],"category_scores_gemma":[0.012848371,0.00042078734,0.001194412,0.0005520744,0.00204064,0.0015792985,0.0023186775,0.002891072,0.00045445282],"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.00009759155,0.00005397299,0.0013279691,0.0004266308,0.000075846816,0.0001791597,0.00022278633,0.7138154,0.0022906614,0.26301038,0.0029145817,0.015585064],"study_design_scores_gemma":[0.0000049357614,0.00001354976,0.000050187387,0.000012165925,0.000004137085,0.000010825915,0.000011206396,0.9864552,0.00020967107,0.012888752,0.0003354081,0.0000039843635],"about_ca_topic_score_codex":0.005597198,"about_ca_topic_score_gemma":0.0035965624,"teacher_disagreement_score":0.005597198,"about_ca_system_score_codex":0.001247943,"about_ca_system_score_gemma":0.0022694266,"threshold_uncertainty_score":0.025633931},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0833828,0.0006976461,0.90588087,0.0005459108,0.000034635385,0.00007589212,0.0001229304,0.000111488785,0.009147893],"genre_scores_gemma":[0.9663123,0.00047458045,0.030692954,0.00013902425,0.00004249412,0.00017677859,0.00013097252,0.00008017735,0.0019508235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967619,0.0019628762,0.00008117182,0.0003062966,0.00061130896,0.00027634855],"domain_scores_gemma":[0.9825335,0.015221759,0.0009342121,0.0004232333,0.0005895931,0.00029762776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053145564,0.0014522232,0.0013699359,0.0015076151,0.00062511105,0.0025467156,0.00085439644,0.0010161027,0.00215457],"category_scores_gemma":[0.021841018,0.0008848268,0.0012162941,0.00076465553,0.0034548119,0.0031103683,0.0025997174,0.0019943176,0.00014660145],"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.00009700023,0.000018342369,0.00052645773,0.00008666533,0.00007297535,0.0001302293,0.00011498922,0.83311796,0.0019705486,0.15895778,0.00030972523,0.00459735],"study_design_scores_gemma":[0.000011009706,0.00004179194,0.00023912972,0.000030647363,0.000014979069,0.000035927984,0.00004051278,0.86726993,0.0008057831,0.1311306,0.0003581907,0.000021509835],"about_ca_topic_score_codex":0.0014671471,"about_ca_topic_score_gemma":0.00066347123,"teacher_disagreement_score":0.0053145564,"about_ca_system_score_codex":0.0018684115,"about_ca_system_score_gemma":0.0008205488,"threshold_uncertainty_score":0.028106391},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04377506,0.000997311,0.505238,0.0032258593,0.001987182,0.00007601805,0.0003091232,0.0006934832,0.44369808],"genre_scores_gemma":[0.6013859,0.0014637421,0.106174506,0.0014544933,0.0010878869,0.00017659385,0.0004941765,0.0013113739,0.28645125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947864,0.00012620646,0.00002621457,0.000113100534,0.00018691656,0.00006895404],"domain_scores_gemma":[0.99970275,0.00006140421,0.000029245666,0.00008579261,0.000086534375,0.000034322722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004127818,0.00094912713,0.0009016164,0.0016454997,0.0017631425,0.00286725,0.0007836893,0.0011242684,0.026553836],"category_scores_gemma":[0.0016691533,0.00034671853,0.0007564361,0.0012542349,0.0028435776,0.004317803,0.0027446905,0.0027416472,0.006398747],"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.0000056664903,0.0000046468544,0.00001935006,0.000010128584,0.0000024281676,0.000024654026,0.00004221004,0.00052742026,0.0003562894,0.98980576,0.0015742948,0.007627166],"study_design_scores_gemma":[0.0000043822806,0.000010881619,0.000047092395,0.000011361677,0.0000040575374,0.000116812516,0.000040673764,0.0042287474,0.0013049623,0.9741529,0.020068597,0.000009495653],"about_ca_topic_score_codex":0.00039208776,"about_ca_topic_score_gemma":0.00040071973,"teacher_disagreement_score":0.026553836,"about_ca_system_score_codex":0.0011787001,"about_ca_system_score_gemma":0.0006781714,"threshold_uncertainty_score":0.088831425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012897604,0.0033917155,0.9763085,0.00034160994,0.000111798814,0.000038776427,0.0000477253,0.00040454275,0.0064577446],"genre_scores_gemma":[0.41282272,0.0038130989,0.5773953,0.0003729855,0.00016073852,0.0002692775,0.0003529077,0.0005112119,0.004301803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991358,0.0003182258,0.000039678787,0.000086506574,0.0003747886,0.000045002882],"domain_scores_gemma":[0.9986492,0.00074520777,0.000091848364,0.00020722208,0.0002575541,0.000048955157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017304181,0.0010325257,0.0013143859,0.0007638304,0.00032433475,0.0013314836,0.0021435146,0.0018089734,0.0017673454],"category_scores_gemma":[0.0032194485,0.00037712813,0.00081363367,0.0009829885,0.0007615791,0.0018413942,0.0012932424,0.0011464233,0.0004860513],"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.00014567217,0.000094918054,0.0005551058,0.00032476464,0.00012292496,0.00005966976,0.000082370185,0.8540024,0.001975987,0.026925271,0.0020358393,0.113675065],"study_design_scores_gemma":[0.000020360536,0.000055595734,0.00014889006,0.000029709252,0.000017266517,0.000024882595,0.00001592111,0.9922977,0.00051156787,0.0050090114,0.0018608196,0.000008265515],"about_ca_topic_score_codex":0.0012538813,"about_ca_topic_score_gemma":0.001824724,"teacher_disagreement_score":0.0021435146,"about_ca_system_score_codex":0.0004743537,"about_ca_system_score_gemma":0.0009807751,"threshold_uncertainty_score":0.009151399},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026541727,0.00014004199,0.9926669,0.00015905547,0.00009482956,0.000036777634,0.000023262752,0.00015760501,0.0040673628],"genre_scores_gemma":[0.11255118,0.0007628477,0.87565976,0.00039696187,0.00025619424,0.0002137042,0.00013544978,0.00019811321,0.009825716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877733,0.0004985976,0.00006720627,0.00018062179,0.0004144592,0.00006188681],"domain_scores_gemma":[0.997471,0.0014871771,0.00016087243,0.0003725586,0.00039891605,0.000109497785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024827314,0.00088531594,0.0011135043,0.0005779925,0.0005845318,0.00086042215,0.0012976453,0.00095868803,0.0052680713],"category_scores_gemma":[0.006585412,0.00037230286,0.0007581305,0.00081526814,0.0013019659,0.0018278629,0.0016233866,0.0028299745,0.0012673362],"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.0003273452,0.00021612622,0.0004105453,0.00024448868,0.000061419356,0.00017854918,0.00017428832,0.31061605,0.0061340304,0.37242213,0.0058527254,0.3033624],"study_design_scores_gemma":[0.000035956753,0.00008470037,0.00008182585,0.000026931446,0.000008856867,0.00007511283,0.000009636325,0.92459303,0.0018253132,0.06678782,0.0064496035,0.000021088013],"about_ca_topic_score_codex":0.0014078465,"about_ca_topic_score_gemma":0.0020215837,"teacher_disagreement_score":0.0052680713,"about_ca_system_score_codex":0.00053561054,"about_ca_system_score_gemma":0.0014216785,"threshold_uncertainty_score":0.017623425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019713309,0.0005120345,0.9679806,0.00042528514,0.00011018855,0.00014614912,0.0002091827,0.00060141284,0.0103018135],"genre_scores_gemma":[0.20928876,0.0005914625,0.78504986,0.00023629995,0.00012759006,0.00052252086,0.00062230875,0.0005707876,0.002990351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937589,0.0029124569,0.00024479997,0.0009612918,0.001808526,0.00031414573],"domain_scores_gemma":[0.9891349,0.005439186,0.0005754589,0.0034702264,0.001186909,0.00019332861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008408146,0.0015664032,0.0020758703,0.001570475,0.0010156464,0.0038122078,0.003089031,0.0019198514,0.010478525],"category_scores_gemma":[0.030117285,0.00067338784,0.0015002618,0.002505413,0.0033547366,0.0056503466,0.0036092815,0.00540244,0.0012808272],"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.00045104657,0.0002692887,0.0015496665,0.0006587125,0.00013050028,0.00014265941,0.00023436529,0.42359096,0.005594223,0.45983863,0.0041350317,0.10340509],"study_design_scores_gemma":[0.00006643296,0.0002825743,0.00046291403,0.00006339882,0.00002941668,0.00012114014,0.000087479515,0.8282988,0.00457536,0.15929176,0.0066869096,0.00003376797],"about_ca_topic_score_codex":0.0013045912,"about_ca_topic_score_gemma":0.00096043065,"teacher_disagreement_score":0.010478525,"about_ca_system_score_codex":0.0014279846,"about_ca_system_score_gemma":0.0020242138,"threshold_uncertainty_score":0.044467032},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008288935,0.00019616295,0.9900591,0.00012986157,0.000023250459,0.000047073405,0.000020105981,0.00008417246,0.0011514517],"genre_scores_gemma":[0.5606595,0.00045968217,0.43136215,0.00018481683,0.00011661967,0.00091382884,0.00024780072,0.00038221,0.005673408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998887,0.0006381524,0.000049791848,0.00013502648,0.00022189673,0.00006823936],"domain_scores_gemma":[0.9913202,0.0070024966,0.00047630645,0.0003275875,0.00059651607,0.0002768502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039687436,0.0017052239,0.0022988687,0.00090759073,0.0006004511,0.0016450016,0.0022308063,0.0026623176,0.0028385902],"category_scores_gemma":[0.021906577,0.0009332479,0.0009914486,0.00078463345,0.0022893145,0.0021492701,0.003336198,0.002608095,0.0005847051],"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.0001078904,0.00004452156,0.0002482252,0.00013319319,0.00004171515,0.0000627499,0.00009281647,0.9685329,0.0007294826,0.019015532,0.00072677375,0.010264275],"study_design_scores_gemma":[0.00000600324,0.000013103255,0.00001369529,0.0000049993514,0.0000024296073,0.000004202291,0.000005035766,0.996342,0.00009110055,0.0034348364,0.00008020389,0.0000024113713],"about_ca_topic_score_codex":0.0027795052,"about_ca_topic_score_gemma":0.0024750554,"teacher_disagreement_score":0.0039687436,"about_ca_system_score_codex":0.00094513583,"about_ca_system_score_gemma":0.00122693,"threshold_uncertainty_score":0.020989},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049334536,0.00027869377,0.98326564,0.00040443402,0.00016947908,0.000013755595,0.00014920064,0.0004601301,0.010325231],"genre_scores_gemma":[0.23106642,0.00056933257,0.7477355,0.00066842244,0.0002679475,0.00008035451,0.0007176415,0.00056218414,0.018332276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990165,0.00025968472,0.00004726856,0.00016289864,0.0003963788,0.00011731896],"domain_scores_gemma":[0.9994229,0.00014919187,0.000038714756,0.0002170021,0.00013504134,0.000037215857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009752598,0.0010945664,0.0009999493,0.0006409764,0.00051503733,0.002389883,0.0010199536,0.0016543139,0.011315119],"category_scores_gemma":[0.0028644009,0.0005272444,0.0005366062,0.0011078417,0.0008073162,0.003671534,0.0033272284,0.0022299064,0.003783403],"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.001023123,0.00014505726,0.00062782783,0.00026648326,0.00015878273,0.00021397996,0.0001436788,0.1842022,0.021566771,0.27573663,0.030300325,0.48561513],"study_design_scores_gemma":[0.000086047185,0.000062520296,0.0002452119,0.000028793076,0.000025871015,0.0002873195,0.00006646707,0.753341,0.0134690795,0.214604,0.017744878,0.00003886704],"about_ca_topic_score_codex":0.0007999357,"about_ca_topic_score_gemma":0.0011395812,"teacher_disagreement_score":0.011315119,"about_ca_system_score_codex":0.00049622793,"about_ca_system_score_gemma":0.0009482535,"threshold_uncertainty_score":0.037852824},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018375426,0.09838958,0.29743853,0.008231227,0.009931764,0.00008956894,0.0025957767,0.0016722952,0.5798138],"genre_scores_gemma":[0.051968664,0.13755606,0.2610447,0.0075134328,0.017298268,0.000472155,0.0038370357,0.0020444514,0.51826525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996848,0.0000433442,0.000021428059,0.00006205514,0.00016683264,0.000021551474],"domain_scores_gemma":[0.99933976,0.0003874768,0.000024695035,0.000057494173,0.00015347856,0.0000372035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351474,0.0013420454,0.00081531785,0.0010045029,0.00050654105,0.0018010795,0.0007936138,0.00083980756,0.043085415],"category_scores_gemma":[0.0015694593,0.00068344444,0.0006861041,0.0025150185,0.0011182815,0.0023267728,0.00064168114,0.004456166,0.014422834],"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.00002292974,0.00010122036,0.000100940415,0.00060882646,0.00001563249,0.000071738956,0.00013026211,0.00469782,0.001133371,0.4185998,0.41802275,0.15649462],"study_design_scores_gemma":[0.000011381903,0.00003148731,0.0002581793,0.00017950506,0.000007572783,0.00024480713,0.00003088754,0.004656491,0.0003195876,0.26742554,0.7268109,0.000023739416],"about_ca_topic_score_codex":0.0009536308,"about_ca_topic_score_gemma":0.001968138,"teacher_disagreement_score":0.043085415,"about_ca_system_score_codex":0.0007935835,"about_ca_system_score_gemma":0.0012868005,"threshold_uncertainty_score":0.14413512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07996948,0.0063684625,0.87829244,0.0032257289,0.0005926723,0.0002097407,0.0004054756,0.00090147683,0.030034428],"genre_scores_gemma":[0.7627598,0.0036002067,0.2201892,0.00097050896,0.00034004904,0.00056504324,0.00070006977,0.0015876201,0.009287437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934742,0.0040369704,0.00022211725,0.00047630753,0.0011733507,0.00061720336],"domain_scores_gemma":[0.9004463,0.08822175,0.0016311272,0.004375123,0.0041965386,0.0011291078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016855309,0.0014433785,0.0021417416,0.002167169,0.0012176005,0.0022388177,0.0026371442,0.002054859,0.0067807278],"category_scores_gemma":[0.11247627,0.0007346019,0.0013084935,0.002309583,0.004321899,0.0045766504,0.004388747,0.0052036257,0.0011896741],"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.0018973029,0.00016735266,0.0054616253,0.00068691775,0.00018422282,0.00018585511,0.00045014813,0.6186938,0.002998773,0.28449336,0.010557287,0.07422327],"study_design_scores_gemma":[0.000055842036,0.00007871408,0.00038227256,0.00008977308,0.000023756482,0.00004999398,0.000060680388,0.948267,0.0008135525,0.049160793,0.0010013182,0.000016404789],"about_ca_topic_score_codex":0.006687081,"about_ca_topic_score_gemma":0.0040552486,"teacher_disagreement_score":0.016855309,"about_ca_system_score_codex":0.0017663663,"about_ca_system_score_gemma":0.002545691,"threshold_uncertainty_score":0.089140475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006882857,0.00073233957,0.98120624,0.00083314354,0.00030145294,0.00005699554,0.00009123457,0.000069817346,0.009825934],"genre_scores_gemma":[0.3552231,0.0023930636,0.6157827,0.0009551777,0.0013242278,0.00074418116,0.0006478328,0.0007010537,0.022228686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.00050892815,0.00005250605,0.00011937023,0.000521128,0.00006881146],"domain_scores_gemma":[0.9960477,0.0024752591,0.0002782697,0.00028416293,0.00066165894,0.00025291528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032797796,0.0015266248,0.0016804985,0.0015137374,0.0008714907,0.002260575,0.0017074959,0.0015538054,0.0064524724],"category_scores_gemma":[0.010005863,0.0006659311,0.0014276766,0.0010310943,0.0020338828,0.004379714,0.0026813948,0.005138587,0.0008771979],"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.00013149573,0.000110038236,0.0004229037,0.00027955318,0.000066153385,0.00012188048,0.00010036502,0.10607263,0.0026349684,0.8526924,0.008033973,0.02933365],"study_design_scores_gemma":[0.000014341644,0.00002556996,0.00012252027,0.000018500601,0.000010042116,0.00004453951,0.00001044956,0.8271367,0.0004416284,0.16987869,0.0022766255,0.000020333066],"about_ca_topic_score_codex":0.0011535491,"about_ca_topic_score_gemma":0.0017048524,"teacher_disagreement_score":0.0064524724,"about_ca_system_score_codex":0.0015333862,"about_ca_system_score_gemma":0.0016275002,"threshold_uncertainty_score":0.021585643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016597586,0.0028453553,0.8530875,0.04285798,0.003635794,0.0001944131,0.00060851895,0.00045838632,0.07971446],"genre_scores_gemma":[0.4155512,0.005295553,0.48554963,0.023029866,0.008034024,0.0014450379,0.0022791838,0.0013478108,0.05746772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953181,0.0025081683,0.00017958025,0.000614892,0.0011242176,0.00025488593],"domain_scores_gemma":[0.9686792,0.026301203,0.0009873079,0.001220189,0.0022503878,0.00056172686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007474773,0.0016987328,0.0014083788,0.0019291479,0.001943774,0.0023601556,0.003343787,0.0043008314,0.019364884],"category_scores_gemma":[0.056818593,0.00060232944,0.0024579018,0.0020257805,0.0044048238,0.0053750025,0.0032642737,0.008448695,0.0024388037],"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.00034528848,0.00006525088,0.00044493825,0.00049234065,0.00005843125,0.00047559376,0.00029834133,0.043277822,0.0012203959,0.8819291,0.042517956,0.02887443],"study_design_scores_gemma":[0.00013605448,0.00029206218,0.00046651464,0.00029546194,0.000025521154,0.0002775628,0.00026032075,0.1118924,0.0021011236,0.8351133,0.049070284,0.000069405585],"about_ca_topic_score_codex":0.0017411363,"about_ca_topic_score_gemma":0.000990607,"teacher_disagreement_score":0.019364884,"about_ca_system_score_codex":0.0013149243,"about_ca_system_score_gemma":0.0007317387,"threshold_uncertainty_score":0.06478202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051659746,0.0007409641,0.98807526,0.00015863411,0.00009785699,0.000049053822,0.00003973595,0.00038197785,0.005290576],"genre_scores_gemma":[0.17832753,0.00084624393,0.81480855,0.0002823767,0.00017963699,0.00023590714,0.00026507085,0.00035796702,0.0046967217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984818,0.00055590546,0.000067051384,0.00016393542,0.0006409951,0.00009038493],"domain_scores_gemma":[0.9980028,0.0013934443,0.00007738223,0.00018306098,0.0002593067,0.00008401877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024861866,0.0013321901,0.0024416477,0.001634086,0.00050353975,0.0016225498,0.0024573174,0.0016314177,0.005801487],"category_scores_gemma":[0.006357438,0.00093999674,0.0009984329,0.0034095047,0.00082372746,0.0025492543,0.0024903244,0.0029458702,0.0011126397],"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.00022677788,0.00029322004,0.00026124637,0.0003028354,0.000082836676,0.00003466655,0.00007023509,0.63528603,0.0022696643,0.04594747,0.008243669,0.3069814],"study_design_scores_gemma":[0.000018945348,0.00002397016,0.000033765617,0.000011481645,0.0000067736346,0.000008979797,0.0000037387515,0.98737437,0.00019595797,0.011658913,0.000658661,0.000004374088],"about_ca_topic_score_codex":0.002874997,"about_ca_topic_score_gemma":0.0035548883,"teacher_disagreement_score":0.005801487,"about_ca_system_score_codex":0.0009678403,"about_ca_system_score_gemma":0.0012264217,"threshold_uncertainty_score":0.019407928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08812095,0.0013302536,0.86499906,0.00083269115,0.0004420045,0.00006659417,0.00022123834,0.00035496044,0.043632198],"genre_scores_gemma":[0.72892725,0.0011611903,0.25850132,0.0002845953,0.00013540346,0.00013616022,0.00035119714,0.0020841316,0.008418746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802065,0.0009139204,0.00008524407,0.0002611458,0.0005267157,0.00019243255],"domain_scores_gemma":[0.99085134,0.0057803886,0.0003385747,0.0012665417,0.0013908348,0.00037231532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488913,0.0009897669,0.0015877034,0.001124496,0.0010155172,0.0037228563,0.0013704781,0.0009992046,0.006788389],"category_scores_gemma":[0.030864995,0.00063948665,0.0007194778,0.0014800634,0.0018962917,0.0032290984,0.0028218117,0.0021572064,0.0010390838],"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.00080168055,0.00013495532,0.0019630408,0.00044106646,0.000105842926,0.00026424282,0.00031622194,0.36569577,0.013417676,0.5069854,0.0071937433,0.10268032],"study_design_scores_gemma":[0.000026804695,0.000040690924,0.000558216,0.00010617479,0.00003264351,0.00010852476,0.000096689386,0.92124164,0.004253881,0.07034915,0.0031566983,0.000028897504],"about_ca_topic_score_codex":0.0049366667,"about_ca_topic_score_gemma":0.0049412264,"teacher_disagreement_score":0.006788389,"about_ca_system_score_codex":0.0013128058,"about_ca_system_score_gemma":0.0021813866,"threshold_uncertainty_score":0.023739934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10275166,0.00033835604,0.8850072,0.0003463971,0.000071232105,0.0007287962,0.00043619482,0.0038213497,0.0064987913],"genre_scores_gemma":[0.14956203,0.0001787954,0.84631294,0.00011646682,0.000025561074,0.00026281996,0.001285426,0.00041803508,0.0018379972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815,0.00053428,0.00018596496,0.0004930884,0.00037071513,0.00026590534],"domain_scores_gemma":[0.9930298,0.0038779755,0.0005116211,0.0016244563,0.00064729084,0.00030882686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002121921,0.0014096355,0.001077303,0.0020047866,0.00082422333,0.001500247,0.0023524605,0.0012956711,0.005796945],"category_scores_gemma":[0.007722428,0.00076994457,0.0014389039,0.001993199,0.0010118845,0.0029838118,0.0023892715,0.001042985,0.001580794],"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.00068582705,0.00083322905,0.006773074,0.0012505935,0.0002122408,0.0007227189,0.0011137403,0.35417175,0.04631714,0.061537396,0.012205621,0.51417667],"study_design_scores_gemma":[0.00023147442,0.0005393417,0.0010933228,0.00010799263,0.00015484034,0.0005954744,0.0007874664,0.8543411,0.037208036,0.08908843,0.015785916,0.000066696804],"about_ca_topic_score_codex":0.0010805731,"about_ca_topic_score_gemma":0.0028019808,"teacher_disagreement_score":0.005796945,"about_ca_system_score_codex":0.00094210514,"about_ca_system_score_gemma":0.0015313188,"threshold_uncertainty_score":0.01939267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004271909,0.00017044912,0.99433494,0.000091151,0.000019147476,0.000020706044,0.0000072948446,0.00005750955,0.0010268557],"genre_scores_gemma":[0.255268,0.0008010163,0.734596,0.00013773503,0.00010771889,0.0003109352,0.00010029634,0.00012958012,0.008548783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995571,0.00016183426,0.000015336773,0.000065610075,0.00014856797,0.000051506293],"domain_scores_gemma":[0.99944514,0.00030027918,0.000046155044,0.00003397244,0.00014128414,0.000033127602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013870853,0.0007469612,0.0013586275,0.0007022096,0.00057884626,0.00078295777,0.0013365096,0.001670165,0.0025781046],"category_scores_gemma":[0.0022195892,0.00036935118,0.0007974751,0.0008551967,0.0010776022,0.0012766283,0.001254693,0.0017321374,0.00048566086],"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.00010743261,0.00004245131,0.00038779058,0.0001866905,0.000060174007,0.0000995357,0.00014476918,0.74272335,0.004336656,0.1647148,0.0019332384,0.085263036],"study_design_scores_gemma":[0.000015664096,0.00005632681,0.00008218828,0.000009868656,0.000008608802,0.00003221315,0.000008979055,0.9780171,0.0007855364,0.019612664,0.0013598668,0.000010970931],"about_ca_topic_score_codex":0.0028477232,"about_ca_topic_score_gemma":0.0022252272,"teacher_disagreement_score":0.0028477232,"about_ca_system_score_codex":0.00093563716,"about_ca_system_score_gemma":0.0021067946,"threshold_uncertainty_score":0.008624613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098770194,0.00082606723,0.88301694,0.001008532,0.00011349779,0.00027888422,0.00014613626,0.00046374957,0.015376027],"genre_scores_gemma":[0.5704796,0.0007411599,0.42483467,0.00018873488,0.00008076791,0.00051737897,0.00035807132,0.0003086578,0.0024910048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997818,0.0007687194,0.00016582524,0.00029644856,0.0007002935,0.00025079108],"domain_scores_gemma":[0.9853895,0.009909896,0.00082192325,0.0018784347,0.0014535373,0.00054672913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00660788,0.00087776146,0.0015794421,0.0013972132,0.0013885286,0.00193072,0.0016932776,0.001573829,0.0048639583],"category_scores_gemma":[0.025590431,0.0005488989,0.001329636,0.001219669,0.0022294596,0.0036078964,0.004240991,0.0027314448,0.00044219632],"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.000136459,0.00011325922,0.0015080592,0.0001669477,0.000054476397,0.00004949864,0.00012670527,0.8676015,0.0007541558,0.08075406,0.0006383454,0.048096567],"study_design_scores_gemma":[0.00003430008,0.00008963148,0.00046202095,0.000035099758,0.000016616234,0.000021832107,0.00006068258,0.96812135,0.00076199987,0.029214354,0.00116904,0.000013085337],"about_ca_topic_score_codex":0.005013932,"about_ca_topic_score_gemma":0.0049070283,"teacher_disagreement_score":0.00660788,"about_ca_system_score_codex":0.001515961,"about_ca_system_score_gemma":0.0031950301,"threshold_uncertainty_score":0.034946203},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031459708,0.0017690395,0.9031034,0.0016548117,0.00026401188,0.000087379885,0.00039287235,0.00011339849,0.061155353],"genre_scores_gemma":[0.72157854,0.004083761,0.24414483,0.0013879511,0.0007243574,0.00035939613,0.0006183968,0.00043101824,0.02667176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00042125644,0.000058241927,0.00009286456,0.00028778182,0.00012448132],"domain_scores_gemma":[0.9985983,0.0006496509,0.00013550607,0.000104088016,0.000384546,0.00012799383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465146,0.0012223677,0.0005411864,0.002067181,0.0010734177,0.0016771468,0.0010768449,0.00077595835,0.005521323],"category_scores_gemma":[0.004170345,0.000303701,0.0010743606,0.0012446933,0.002416005,0.003866995,0.0016700744,0.0033665984,0.0006682083],"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.000009000758,0.000012439789,0.00009841129,0.000043115597,0.000007277499,0.00005008953,0.00007484545,0.0059841764,0.000932254,0.9863992,0.001186816,0.0052023786],"study_design_scores_gemma":[0.000009030972,0.000031140768,0.00024641058,0.000041505325,0.000011519558,0.00006962258,0.00007852065,0.12824737,0.0014439631,0.8647782,0.005021455,0.000021276135],"about_ca_topic_score_codex":0.0027284266,"about_ca_topic_score_gemma":0.0029528039,"teacher_disagreement_score":0.005521323,"about_ca_system_score_codex":0.0018644806,"about_ca_system_score_gemma":0.0012176359,"threshold_uncertainty_score":0.018470705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08192108,0.0014860358,0.89248896,0.0028620893,0.00019896889,0.00009873892,0.00036304365,0.0003785741,0.020202508],"genre_scores_gemma":[0.7947925,0.00124947,0.19291703,0.00083014375,0.0009262743,0.00046916946,0.0008054417,0.00045940813,0.0075505697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98954517,0.0041456656,0.0005255341,0.00159898,0.0033895634,0.0007951073],"domain_scores_gemma":[0.94128686,0.044320144,0.0037867043,0.006162627,0.0029948268,0.0014489164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013394166,0.0013292719,0.0034882394,0.004450488,0.002444454,0.00690545,0.0048754984,0.0028929573,0.005137805],"category_scores_gemma":[0.057700325,0.0013498032,0.0033188076,0.0053445515,0.006879847,0.019836878,0.0059683006,0.009982939,0.00051138975],"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.00008318902,0.0000386963,0.00026242837,0.00006676971,0.000024155188,0.000024521401,0.00015807562,0.009096394,0.00025416663,0.9782471,0.0013471385,0.010397359],"study_design_scores_gemma":[0.000017657418,0.000027285821,0.00022645229,0.00001891404,0.000016261658,0.00003413712,0.000033526627,0.06305967,0.00045793268,0.93526405,0.00082383875,0.000020157464],"about_ca_topic_score_codex":0.0008290827,"about_ca_topic_score_gemma":0.0005919972,"teacher_disagreement_score":0.013394166,"about_ca_system_score_codex":0.0039147753,"about_ca_system_score_gemma":0.002387658,"threshold_uncertainty_score":0.07083595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050320933,0.00006081451,0.99268603,0.000084404004,0.000026974514,0.00003505012,0.00003645846,0.00016972094,0.0018684159],"genre_scores_gemma":[0.12494369,0.00015480722,0.86991763,0.00014641444,0.000031281,0.0002417417,0.00016115021,0.00026425344,0.004139019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995921,0.00018793072,0.000013863428,0.000035179983,0.0001479629,0.00002300263],"domain_scores_gemma":[0.9991185,0.00044183127,0.00006179257,0.00009646906,0.00023437278,0.000046961497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009768547,0.00073608407,0.00067395606,0.00037789706,0.00028475892,0.00051986077,0.0010374503,0.0011089859,0.0028525207],"category_scores_gemma":[0.0025217265,0.00034960237,0.00049391866,0.00046053674,0.000692253,0.0005883028,0.0010040968,0.0011321154,0.00083498965],"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.00011406951,0.00006212282,0.0004913207,0.00014093351,0.00003287916,0.0001462864,0.00009372138,0.89953923,0.008739073,0.037048426,0.0029824146,0.050609536],"study_design_scores_gemma":[0.000004931933,0.000008901971,0.00002012264,0.0000029379196,0.000001052418,0.000007364442,0.0000025813608,0.9978694,0.00041064105,0.0012548981,0.00041530072,0.0000019763802],"about_ca_topic_score_codex":0.0025888334,"about_ca_topic_score_gemma":0.002706062,"teacher_disagreement_score":0.0028525207,"about_ca_system_score_codex":0.00029822133,"about_ca_system_score_gemma":0.00114116,"threshold_uncertainty_score":0.009542644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017686859,0.00014854966,0.9773366,0.00017167025,0.000048766888,0.000049132264,0.000028626366,0.000096397605,0.0044332794],"genre_scores_gemma":[0.8187025,0.0004896758,0.17306495,0.00015448744,0.00010867984,0.00035401265,0.000090826274,0.00005903064,0.0069758003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.00013134656,0.000011554105,0.000053100397,0.000066484594,0.000026874373],"domain_scores_gemma":[0.9998091,0.00006919374,0.000027819693,0.000027660195,0.00003701753,0.000029216828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186647,0.00067296915,0.00067285023,0.00035729172,0.0004857708,0.000741123,0.00070835487,0.000705164,0.0030059416],"category_scores_gemma":[0.0012141978,0.00034893412,0.0006915607,0.00033816634,0.0012500932,0.0010773117,0.0013976317,0.0009219271,0.0003624413],"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.000047848018,0.000043946144,0.00078563375,0.00012260569,0.00006315457,0.00017252586,0.00017688976,0.6101779,0.009489027,0.35710984,0.0015063676,0.020304307],"study_design_scores_gemma":[0.0000089826135,0.000067265035,0.000076625984,0.000004213336,0.000005343148,0.000032980068,0.000010349935,0.9839677,0.0004175681,0.014077039,0.0013229705,0.000009055398],"about_ca_topic_score_codex":0.0021071557,"about_ca_topic_score_gemma":0.0014721929,"teacher_disagreement_score":0.0030059416,"about_ca_system_score_codex":0.0005141765,"about_ca_system_score_gemma":0.00071370456,"threshold_uncertainty_score":0.0100559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009635935,0.00009748279,0.99705887,0.00004069085,0.000036946065,0.00003206781,0.000028322558,0.00021862247,0.0015233669],"genre_scores_gemma":[0.029772121,0.00017477552,0.96624947,0.000056458728,0.000036239875,0.00021460537,0.00011987496,0.00024300723,0.003133415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992823,0.0002611395,0.00003066355,0.0000771581,0.00030102755,0.00004783459],"domain_scores_gemma":[0.9992046,0.00033684113,0.0000433223,0.00011550983,0.0002473727,0.000052387906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012137186,0.00085392885,0.0012768358,0.0011225609,0.00047298474,0.001170486,0.002145537,0.0012523624,0.005646549],"category_scores_gemma":[0.003054311,0.00055789045,0.00075025717,0.0010852572,0.00083309255,0.0011863823,0.00203938,0.0016898538,0.002685877],"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.00020809377,0.000100641584,0.00064585084,0.00030735883,0.0001099503,0.0001017784,0.0001482755,0.5184392,0.0078862505,0.13629673,0.011126236,0.3246297],"study_design_scores_gemma":[0.000032298023,0.000024569843,0.000052379786,0.000015564001,0.000006636791,0.000037954123,0.000010159835,0.97596735,0.0011187171,0.014291181,0.00842871,0.000014442269],"about_ca_topic_score_codex":0.002321564,"about_ca_topic_score_gemma":0.0024344898,"teacher_disagreement_score":0.005646549,"about_ca_system_score_codex":0.00056387467,"about_ca_system_score_gemma":0.0013895088,"threshold_uncertainty_score":0.018889606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024206918,0.0006041678,0.9510168,0.0005497588,0.00015977403,0.00007485124,0.00017088857,0.0000707889,0.023146171],"genre_scores_gemma":[0.74438107,0.0029315448,0.23619804,0.0008252966,0.00038277908,0.00044728626,0.0005937046,0.00028439675,0.013955843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988943,0.00031038624,0.000051856845,0.00017035114,0.00042248366,0.00015072596],"domain_scores_gemma":[0.99741733,0.0012440801,0.00015430893,0.00013855875,0.0008747872,0.00017096022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025351474,0.0015522299,0.00085906754,0.0021178548,0.0011295677,0.0019191945,0.0010087135,0.0007027555,0.0036157486],"category_scores_gemma":[0.005552344,0.00029555472,0.001495179,0.0014674789,0.0029219547,0.0037954687,0.0019559807,0.0043539754,0.0003079074],"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.00004708618,0.000046788868,0.0006231261,0.0001778969,0.000037802347,0.00020551537,0.00016412027,0.039452884,0.004687909,0.93097746,0.0018392954,0.021740053],"study_design_scores_gemma":[0.0000105657455,0.00009101846,0.00062023493,0.00006269524,0.000026138005,0.0001997317,0.00012899288,0.49563304,0.00549979,0.49170938,0.0059718904,0.000046611538],"about_ca_topic_score_codex":0.004921138,"about_ca_topic_score_gemma":0.0032507111,"teacher_disagreement_score":0.004921138,"about_ca_system_score_codex":0.0018243497,"about_ca_system_score_gemma":0.0023263155,"threshold_uncertainty_score":0.01340729},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018388893,0.007265021,0.63833016,0.0037026424,0.002511947,0.000096540425,0.0005034332,0.0028223179,0.34292907],"genre_scores_gemma":[0.04324459,0.010957489,0.53958184,0.0026188123,0.0016444579,0.00031882143,0.0013583518,0.0027748337,0.39750078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992661,0.00012929982,0.00005900185,0.00016836396,0.00032760075,0.000049694212],"domain_scores_gemma":[0.9994735,0.0002842427,0.00002135487,0.000099024466,0.000098558296,0.000023415205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059283595,0.0010712786,0.0008131833,0.0006083385,0.0007142292,0.0027524095,0.0012293339,0.0011621879,0.05289547],"category_scores_gemma":[0.002625074,0.0005743264,0.0014544768,0.0010835619,0.0015590065,0.004026278,0.0020764521,0.0042624767,0.02307269],"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.000041370975,0.000037206704,0.00014585,0.00044493476,0.000028221137,0.00009764398,0.00022070592,0.0072782855,0.0020126256,0.6156527,0.11570042,0.25834012],"study_design_scores_gemma":[0.000023340419,0.00003212943,0.00015114031,0.00024706306,0.000025750503,0.00031781,0.00006413308,0.027125405,0.0027556925,0.35451126,0.61471605,0.000030277857],"about_ca_topic_score_codex":0.0012714214,"about_ca_topic_score_gemma":0.0014878666,"teacher_disagreement_score":0.05289547,"about_ca_system_score_codex":0.0008020695,"about_ca_system_score_gemma":0.0010298594,"threshold_uncertainty_score":0.17695296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025212115,0.00067253923,0.99097717,0.0005279334,0.00024253632,0.000052593212,0.0000630636,0.000100780926,0.0048421524],"genre_scores_gemma":[0.11016374,0.00226229,0.87648946,0.00086395745,0.00081455987,0.00043717123,0.0004549546,0.0006632346,0.007850639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99331397,0.0041894363,0.00030831274,0.00048712475,0.0012990384,0.00040209302],"domain_scores_gemma":[0.97349733,0.022222219,0.0012094075,0.0012042014,0.0012987112,0.00056816766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011017462,0.0029877082,0.002725654,0.0020696062,0.0014724097,0.0043484,0.003856807,0.002598825,0.0072225877],"category_scores_gemma":[0.052268546,0.0015817168,0.0020296818,0.00464651,0.0034955367,0.010595263,0.005860972,0.010603975,0.0014312691],"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.00026578395,0.00022458847,0.00082293607,0.0006635601,0.00009609291,0.00021896303,0.00033034838,0.22086674,0.0015469479,0.65655416,0.011194251,0.107215576],"study_design_scores_gemma":[0.0000303038,0.000049194437,0.00010002405,0.00012326786,0.000027043465,0.00004042316,0.00004053546,0.63782555,0.0005442211,0.35623783,0.004955631,0.000025967694],"about_ca_topic_score_codex":0.001984281,"about_ca_topic_score_gemma":0.002093635,"teacher_disagreement_score":0.011017462,"about_ca_system_score_codex":0.0012455288,"about_ca_system_score_gemma":0.0019781836,"threshold_uncertainty_score":0.05826658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01671601,0.0011920118,0.9759911,0.00050884957,0.000054701988,0.000042398606,0.00009160929,0.00008154647,0.0053219316],"genre_scores_gemma":[0.89152503,0.0022770583,0.10223275,0.0002953923,0.00033011552,0.0002385851,0.00024931572,0.00011896472,0.002732852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604404,0.001986859,0.00013426096,0.00048535594,0.0011390673,0.00021039807],"domain_scores_gemma":[0.9812114,0.015953993,0.0011049538,0.00058108545,0.00091893337,0.00022952004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061338115,0.0012258715,0.001274696,0.001956692,0.00050353474,0.002559148,0.001434273,0.001148156,0.0022576055],"category_scores_gemma":[0.02125088,0.0005108246,0.0013455778,0.002086693,0.0027282021,0.0029351863,0.0020093091,0.0022210365,0.0002271001],"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.00011850026,0.000061903425,0.0014626266,0.00021059181,0.00014466421,0.00019838967,0.00015895242,0.7726773,0.0017968529,0.18729228,0.001339511,0.03453839],"study_design_scores_gemma":[0.000004609312,0.000026782684,0.0002789662,0.000018194612,0.000012979921,0.00002585448,0.000022691116,0.9242808,0.0005325509,0.07431516,0.00046741022,0.000014015314],"about_ca_topic_score_codex":0.0024005258,"about_ca_topic_score_gemma":0.00076790137,"teacher_disagreement_score":0.0061338115,"about_ca_system_score_codex":0.0016244064,"about_ca_system_score_gemma":0.0008374091,"threshold_uncertainty_score":0.032439053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05457731,0.0010828781,0.6999237,0.0023418034,0.0007514324,0.00011811869,0.0012631112,0.0014579808,0.2384837],"genre_scores_gemma":[0.80966324,0.0015923353,0.09798167,0.0011794945,0.0006962437,0.0002510343,0.0013977381,0.0012459705,0.08599217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994388,0.00017895525,0.000022407037,0.000104016,0.00017474925,0.00008103386],"domain_scores_gemma":[0.9990281,0.0003993631,0.0000919679,0.0002820847,0.00013023916,0.00006820917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004732052,0.0005913264,0.00044858854,0.00075766066,0.0005398978,0.0014634522,0.0005284648,0.0004183759,0.013346417],"category_scores_gemma":[0.0035643664,0.00021569386,0.00052708265,0.00086400006,0.0014094086,0.0017546294,0.0014654931,0.0027462621,0.0037396993],"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.00013703863,0.00009192007,0.00027799315,0.00011644523,0.00002635534,0.00013389222,0.00011400039,0.011552121,0.0055821533,0.87158924,0.023928009,0.08645077],"study_design_scores_gemma":[0.000036862206,0.000072398536,0.00048192398,0.000033796125,0.000020052263,0.00030862493,0.00008642217,0.044498306,0.005490123,0.92102426,0.027927333,0.000019908495],"about_ca_topic_score_codex":0.0008414212,"about_ca_topic_score_gemma":0.0011677998,"teacher_disagreement_score":0.013346417,"about_ca_system_score_codex":0.0006219898,"about_ca_system_score_gemma":0.00070271135,"threshold_uncertainty_score":0.04464817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020020945,0.027396213,0.6602948,0.03384736,0.010140883,0.00047957513,0.004972714,0.0016254698,0.24122213],"genre_scores_gemma":[0.465564,0.03378404,0.3884764,0.019517556,0.02420591,0.002828943,0.0049486337,0.001793428,0.058880996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976544,0.00047975668,0.00014659714,0.0005115155,0.0009106027,0.00029714574],"domain_scores_gemma":[0.9877357,0.008650357,0.00057938887,0.00090350024,0.0014751353,0.00065594347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00406716,0.003146519,0.0017897444,0.003257626,0.00233761,0.0035184862,0.0019682476,0.0017331452,0.025201874],"category_scores_gemma":[0.016877543,0.0013073438,0.0029277394,0.0036808688,0.0052107424,0.00800338,0.006857001,0.012132649,0.0052005267],"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.00017566085,0.00016652168,0.0010496448,0.0011264676,0.000095226125,0.00064705574,0.0004503542,0.0043367883,0.0068984833,0.8729213,0.059225693,0.052906733],"study_design_scores_gemma":[0.000045891607,0.00010789698,0.001549424,0.00029549666,0.000066770044,0.00064642995,0.00011362345,0.00668635,0.0021114186,0.92526084,0.063035935,0.00007997825],"about_ca_topic_score_codex":0.0011625738,"about_ca_topic_score_gemma":0.00128723,"teacher_disagreement_score":0.025201874,"about_ca_system_score_codex":0.0023942036,"about_ca_system_score_gemma":0.0014658008,"threshold_uncertainty_score":0.084308684},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035465006,0.0123613505,0.9674494,0.00031261885,0.00016162064,0.000038160862,0.00009527301,0.00014347173,0.015891554],"genre_scores_gemma":[0.17326598,0.058352116,0.74145305,0.00070588925,0.0011813232,0.00048179465,0.00075552386,0.0007047219,0.023099571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994054,0.00017075198,0.00004789609,0.00007673477,0.00026139067,0.000037851296],"domain_scores_gemma":[0.99918,0.00043993987,0.00005105633,0.00004569939,0.00025535008,0.000027866801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013472654,0.0011573656,0.0009803468,0.0020311137,0.00066114555,0.0012559306,0.0008012169,0.0010960554,0.0036938356],"category_scores_gemma":[0.002435443,0.00047549137,0.0013884077,0.0025450336,0.00088602776,0.0015912759,0.0011016221,0.0015889565,0.0010111771],"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.000057665686,0.00009663053,0.0011179654,0.0019213897,0.00007091701,0.00013380517,0.00029829374,0.17192744,0.0040383455,0.4651438,0.010450975,0.34474263],"study_design_scores_gemma":[0.000011065855,0.000083723055,0.00052980246,0.00032607498,0.000031815776,0.00021894697,0.000103507584,0.7919133,0.0022489275,0.13497064,0.06951118,0.000051104114],"about_ca_topic_score_codex":0.003561888,"about_ca_topic_score_gemma":0.0027877633,"teacher_disagreement_score":0.0036938356,"about_ca_system_score_codex":0.00088097685,"about_ca_system_score_gemma":0.0017481294,"threshold_uncertainty_score":0.012357175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018483879,0.002761395,0.7156254,0.00209565,0.00044017163,0.00014101504,0.0014441058,0.00030804722,0.25870028],"genre_scores_gemma":[0.45504135,0.0064019915,0.32635367,0.0018449017,0.0011141794,0.0012522864,0.0031393282,0.0011418563,0.20371039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946314,0.00012435862,0.000032842945,0.0001359184,0.00017090832,0.0000728622],"domain_scores_gemma":[0.99945575,0.00021552878,0.000046340643,0.00007894891,0.00013042346,0.00007293577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009391458,0.0012508174,0.0010495421,0.0020192408,0.0011096527,0.0035314301,0.0016177724,0.0015357475,0.018940113],"category_scores_gemma":[0.0017802141,0.00054287247,0.0011229145,0.0014868985,0.0023085172,0.004295646,0.002346683,0.004222058,0.0027706798],"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.000009344774,0.0000060762623,0.00004646003,0.00006857133,0.000007635484,0.00003853296,0.00007483756,0.0030397372,0.0007696768,0.98708284,0.002722291,0.006134012],"study_design_scores_gemma":[0.000009847045,0.000031505228,0.00015317206,0.000052994354,0.00001275944,0.00016791663,0.00011266274,0.019631196,0.0007590081,0.9503002,0.028753612,0.000015141752],"about_ca_topic_score_codex":0.0007162757,"about_ca_topic_score_gemma":0.0007560505,"teacher_disagreement_score":0.018940113,"about_ca_system_score_codex":0.0010842677,"about_ca_system_score_gemma":0.0007947607,"threshold_uncertainty_score":0.06336099},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035979345,0.00017578111,0.9934477,0.00011100394,0.000030666666,0.00007266478,0.000093653594,0.0008703992,0.0016001267],"genre_scores_gemma":[0.031128125,0.00021617947,0.9642401,0.00006162596,0.000025858037,0.00022376272,0.00029235863,0.00031228294,0.0034998255],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.00013208382,0.00002357112,0.00012269242,0.0001924418,0.00007574995],"domain_scores_gemma":[0.9992053,0.00044413074,0.000052274852,0.00010496405,0.000146994,0.000046386594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090881175,0.0012443317,0.0011518307,0.0017337566,0.00084892486,0.0015228848,0.0014606382,0.0017257993,0.015072877],"category_scores_gemma":[0.00272964,0.0007513432,0.0012332621,0.0013967056,0.0007646439,0.0014747286,0.0011874886,0.002251978,0.00366865],"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.00021750762,0.00013522586,0.00086647656,0.0004157243,0.000092061455,0.000115147195,0.00025908282,0.20752825,0.013812544,0.049742244,0.009236843,0.7175789],"study_design_scores_gemma":[0.00012321943,0.00018529897,0.0007023025,0.000080524325,0.00003245203,0.00024543278,0.00008837535,0.9414214,0.0066652307,0.029347382,0.02107251,0.000035821366],"about_ca_topic_score_codex":0.007098062,"about_ca_topic_score_gemma":0.009635718,"teacher_disagreement_score":0.015072877,"about_ca_system_score_codex":0.0015285499,"about_ca_system_score_gemma":0.0014234708,"threshold_uncertainty_score":0.0504238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009735147,0.111447416,0.08833545,0.012702984,0.01643614,0.00027215687,0.0017413131,0.0036938717,0.76439714],"genre_scores_gemma":[0.0068814843,0.12462951,0.088918775,0.004096115,0.005396005,0.00023866408,0.0020693573,0.002190042,0.76557994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893516,0.00010554549,0.000055935438,0.00021125542,0.0006183968,0.00007365038],"domain_scores_gemma":[0.9984773,0.00027584512,0.00005557425,0.00029556683,0.0006890583,0.00020662937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020164752,0.0019074052,0.0008097123,0.0030453396,0.0011000024,0.006594115,0.0024730477,0.002359691,0.1571808],"category_scores_gemma":[0.0026690785,0.0009853715,0.0010131771,0.003196914,0.0010357946,0.006950921,0.0023171855,0.0034785909,0.14990409],"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.00003714241,0.00006792179,0.000086449734,0.0009524896,0.000012906556,0.00009069061,0.00011220497,0.0010567526,0.0024138403,0.14575747,0.4236525,0.4257595],"study_design_scores_gemma":[0.0000026173727,0.000012731949,0.000028824246,0.00018000403,0.0000027014257,0.00009857521,0.00001615311,0.00024337643,0.0004940189,0.011231306,0.98768324,0.000006404921],"about_ca_topic_score_codex":0.0018255841,"about_ca_topic_score_gemma":0.0021302346,"teacher_disagreement_score":0.1571808,"about_ca_system_score_codex":0.0021849473,"about_ca_system_score_gemma":0.0027860273,"threshold_uncertainty_score":0.52582216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013974261,0.00015034826,0.95909935,0.00016160624,0.00014024961,0.00009198733,0.0008200524,0.03232189,0.005817167],"genre_scores_gemma":[0.021476958,0.00049986324,0.9535103,0.0003071482,0.00007734126,0.00067050586,0.0021931056,0.012812522,0.008452306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903166,0.00021758844,0.000088275774,0.00013117465,0.00044241222,0.000088884],"domain_scores_gemma":[0.9983576,0.00089165603,0.00010025813,0.00031714936,0.0002486534,0.00008470719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018890558,0.0012163671,0.0014369409,0.0006989154,0.0007463028,0.001640961,0.002937223,0.0013452857,0.039630897],"category_scores_gemma":[0.0070969597,0.00097520684,0.001393286,0.0009026474,0.0009853288,0.0029989318,0.0030615022,0.0035338944,0.014022885],"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.0010840903,0.00027497555,0.0029248872,0.0024120482,0.00018123646,0.0013153728,0.0007028407,0.0810397,0.024237286,0.17477487,0.20284161,0.5082111],"study_design_scores_gemma":[0.00049987534,0.00017386628,0.0010029621,0.00028164417,0.000047273676,0.0009472172,0.000082639934,0.4567273,0.024755245,0.09859311,0.4167779,0.00011104384],"about_ca_topic_score_codex":0.00096182985,"about_ca_topic_score_gemma":0.0014474281,"teacher_disagreement_score":0.039630897,"about_ca_system_score_codex":0.00038557535,"about_ca_system_score_gemma":0.0022508372,"threshold_uncertainty_score":0.13257855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029556984,0.00068944396,0.9274711,0.0003409153,0.0005304512,0.00012265543,0.00021481585,0.00089873804,0.040174954],"genre_scores_gemma":[0.40966028,0.00094806735,0.53654855,0.0005865426,0.0004185839,0.0003134464,0.0006542164,0.001097778,0.04977261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986761,0.00025207188,0.000078677556,0.00023101938,0.0005679606,0.0001940655],"domain_scores_gemma":[0.9971718,0.0012860298,0.00015568211,0.00060696376,0.000624309,0.00015514884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017299415,0.0006008123,0.001217223,0.0009031365,0.0010299786,0.0017992295,0.0018004101,0.00085463346,0.0065924632],"category_scores_gemma":[0.0064472957,0.0005200491,0.00077017245,0.0013157167,0.0019320898,0.0023573663,0.0011349883,0.0036874656,0.0018064145],"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.00016653378,0.00008828362,0.0004993303,0.0002141391,0.000026300715,0.00015080468,0.0001499065,0.025999418,0.0063155107,0.81752646,0.013760168,0.13510315],"study_design_scores_gemma":[0.000041231044,0.00014470125,0.00026940802,0.00006828036,0.000029106875,0.00020368739,0.000052092597,0.23514804,0.010828289,0.7340801,0.019077018,0.000058023666],"about_ca_topic_score_codex":0.0014958668,"about_ca_topic_score_gemma":0.0025553945,"teacher_disagreement_score":0.0065924632,"about_ca_system_score_codex":0.00067983,"about_ca_system_score_gemma":0.00166302,"threshold_uncertainty_score":0.022053957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015357954,0.0001815806,0.98314315,0.00009583017,0.000047122165,0.00002719565,0.000018463144,0.00011841078,0.001010231],"genre_scores_gemma":[0.39171967,0.0003373335,0.60393435,0.00008442906,0.000058852915,0.0002122255,0.00012371273,0.00011501553,0.0034144013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996871,0.00008521021,0.000021857826,0.000037738388,0.00014210095,0.000026162437],"domain_scores_gemma":[0.9995745,0.00019093453,0.000046752382,0.00006155298,0.00009251059,0.000033889137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057529396,0.00050645537,0.00075745967,0.0005988828,0.0005548164,0.0005549394,0.0009448059,0.0010219894,0.00089749455],"category_scores_gemma":[0.0012991546,0.00029631652,0.0009840783,0.0005727319,0.00067883614,0.000811049,0.0012497231,0.00095755706,0.00023240302],"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.000058608664,0.00007420166,0.0009169757,0.0001292574,0.0000382653,0.00013424041,0.00013551228,0.88671005,0.009261109,0.0470177,0.0007592356,0.054764826],"study_design_scores_gemma":[0.000004879577,0.000008115788,0.00004292642,0.000002594657,0.000001802971,0.000010931385,0.0000043123764,0.9964696,0.00065843924,0.0021519912,0.000640588,0.0000037306766],"about_ca_topic_score_codex":0.0042173136,"about_ca_topic_score_gemma":0.0027470381,"teacher_disagreement_score":0.0042173136,"about_ca_system_score_codex":0.00045998683,"about_ca_system_score_gemma":0.0010487495,"threshold_uncertainty_score":0.008385539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00943867,0.000145765,0.9797538,0.00025951493,0.000102065744,0.00010515352,0.00013334474,0.00017499608,0.009886606],"genre_scores_gemma":[0.43831125,0.00019370764,0.5457121,0.00025660015,0.00013007098,0.0004873536,0.00039791132,0.00032545347,0.014185565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953127,0.000116010786,0.000019828905,0.000075173775,0.00018158228,0.000076229604],"domain_scores_gemma":[0.99899894,0.00048965414,0.000056189074,0.00012140972,0.00026703198,0.00006683667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735433,0.0008833021,0.0011815807,0.00036725384,0.00043229962,0.0014306334,0.0011947829,0.0018597497,0.010830953],"category_scores_gemma":[0.002550374,0.00054018915,0.0007139872,0.00053466967,0.0006586466,0.00096300856,0.0015262252,0.0017563642,0.0011145454],"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.00007478615,0.000037116853,0.00015966935,0.000097452496,0.000015059841,0.00011727538,0.000029726945,0.9588129,0.0010866988,0.016937872,0.0026689498,0.019962592],"study_design_scores_gemma":[0.00000640054,0.000008302313,0.000016369577,0.0000031237591,0.000001985959,0.000008442687,0.000005783857,0.9975904,0.0001441847,0.0018795306,0.0003335687,0.0000019123916],"about_ca_topic_score_codex":0.0069714203,"about_ca_topic_score_gemma":0.007963159,"teacher_disagreement_score":0.010830953,"about_ca_system_score_codex":0.00081334414,"about_ca_system_score_gemma":0.0018116591,"threshold_uncertainty_score":0.036233127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009174716,0.000121706,0.9977609,0.00004030395,0.00007465567,0.000011880309,0.000023269391,0.00006173321,0.0009880582],"genre_scores_gemma":[0.026705325,0.00032576808,0.9662796,0.00009889894,0.000112094436,0.00011491564,0.0001473122,0.00037068344,0.00584533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995222,0.000170324,0.000027130867,0.00007166338,0.0001697629,0.00003889202],"domain_scores_gemma":[0.9991522,0.00040730677,0.000037345086,0.00011536968,0.00021289095,0.000074878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011167161,0.0012135429,0.0011205273,0.0009338457,0.00052840204,0.00075505185,0.0011023218,0.0012524275,0.006358317],"category_scores_gemma":[0.00260244,0.0007144269,0.0014759395,0.0009253518,0.0007992191,0.0014056253,0.0020255395,0.0030464253,0.0023541779],"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.00027803323,0.0002389997,0.00041238376,0.0005011567,0.0001327367,0.000162789,0.00019500298,0.16063148,0.030288758,0.22615784,0.019896442,0.5611044],"study_design_scores_gemma":[0.000029345507,0.00006514821,0.00012421055,0.00003369308,0.00003315674,0.00009353719,0.000022670394,0.92824,0.0024758587,0.057773788,0.011088471,0.00002009708],"about_ca_topic_score_codex":0.0012746127,"about_ca_topic_score_gemma":0.0019349322,"teacher_disagreement_score":0.006358317,"about_ca_system_score_codex":0.00033642864,"about_ca_system_score_gemma":0.00071624364,"threshold_uncertainty_score":0.021270692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075323024,0.0001373952,0.9980703,0.00004486675,0.00002697354,0.000022789658,0.0000068893505,0.000051141695,0.0008864],"genre_scores_gemma":[0.058116965,0.0004951477,0.93754655,0.00008777682,0.000089827714,0.00037062433,0.00008641926,0.0001457575,0.003060878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989586,0.00050902215,0.000036877485,0.00009551674,0.0003503804,0.00004961401],"domain_scores_gemma":[0.99877006,0.00085337466,0.00008017806,0.00006989727,0.00018141717,0.000045019115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022618768,0.0011691615,0.001340688,0.0009811616,0.0007907195,0.00074078265,0.0013011129,0.0014950908,0.0038660215],"category_scores_gemma":[0.0038184463,0.0007209717,0.0012599024,0.0010034327,0.0012711721,0.0011524573,0.0017082259,0.0030639777,0.0011199467],"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.00011375912,0.00011241116,0.00034027852,0.00047708157,0.000065754895,0.00022583135,0.00019505939,0.7298799,0.008437787,0.09202669,0.004239591,0.16388573],"study_design_scores_gemma":[0.000020530993,0.000038065635,0.000033248973,0.000020612491,0.000006472784,0.0000553011,0.000011603475,0.9776314,0.00088340783,0.017440183,0.0038489378,0.00001021816],"about_ca_topic_score_codex":0.0010449582,"about_ca_topic_score_gemma":0.00075734744,"teacher_disagreement_score":0.0038660215,"about_ca_system_score_codex":0.0003855141,"about_ca_system_score_gemma":0.0010109821,"threshold_uncertainty_score":0.012933135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04905515,0.00026348428,0.93711823,0.00044531023,0.00006818192,0.00011609988,0.00012751309,0.0003630224,0.012443009],"genre_scores_gemma":[0.7433782,0.0005938506,0.24826159,0.00026314205,0.00011077632,0.0004276528,0.00037045788,0.0003908839,0.0062034396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736255,0.0013459988,0.0001115177,0.0002447987,0.00063014927,0.00030502758],"domain_scores_gemma":[0.9940002,0.0040838756,0.00042819246,0.00063825195,0.0005974441,0.00025199325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061088568,0.0015163154,0.0013374169,0.0013954823,0.0007317268,0.002997599,0.0013162807,0.000956432,0.004408859],"category_scores_gemma":[0.014508461,0.00066347374,0.001704075,0.0013087122,0.002713123,0.0038846687,0.0030122788,0.0046460913,0.0007817518],"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.000118619304,0.00007023518,0.0003834823,0.000100258614,0.000021369573,0.00011084068,0.00014114792,0.17214493,0.001854316,0.8000752,0.0014140701,0.023565566],"study_design_scores_gemma":[0.000047005815,0.00013477729,0.00013128757,0.00005511387,0.000014506335,0.00007118063,0.0000372607,0.4666327,0.0040682764,0.5258622,0.0029177626,0.000028020313],"about_ca_topic_score_codex":0.0004644102,"about_ca_topic_score_gemma":0.00042988738,"teacher_disagreement_score":0.0061088568,"about_ca_system_score_codex":0.001691354,"about_ca_system_score_gemma":0.0019658613,"threshold_uncertainty_score":0.03230709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012057817,0.00007940757,0.9977302,0.00004199068,0.000028253033,0.000023817887,0.000014378119,0.00019575615,0.00068036554],"genre_scores_gemma":[0.094962984,0.0002095941,0.8994584,0.00010940483,0.000057527235,0.00021775227,0.00012959402,0.0003442579,0.0045104115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912256,0.00022983484,0.000045203422,0.00009996751,0.0004435573,0.00005878525],"domain_scores_gemma":[0.99753916,0.0013348388,0.00011891049,0.00027939666,0.00058497424,0.00014272987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019850773,0.0009312251,0.0015600816,0.00059463806,0.00046166658,0.0011766931,0.0031491718,0.0019583446,0.0044247196],"category_scores_gemma":[0.007698094,0.00067290606,0.0008625162,0.00073781307,0.0010383289,0.0015911305,0.0030690387,0.002855877,0.0018152118],"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.00038870625,0.00014721425,0.00032597088,0.00034570598,0.00009060149,0.00016973141,0.00019923064,0.6945321,0.009346957,0.067976065,0.0062188758,0.22025885],"study_design_scores_gemma":[0.00001805689,0.000028330964,0.000016769956,0.000006861798,0.000005464309,0.000019120718,0.0000029024768,0.9949721,0.00076867983,0.00319216,0.0009636694,0.000005836687],"about_ca_topic_score_codex":0.004068271,"about_ca_topic_score_gemma":0.0035398551,"teacher_disagreement_score":0.0044247196,"about_ca_system_score_codex":0.00067140773,"about_ca_system_score_gemma":0.0021493265,"threshold_uncertainty_score":0.014802158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02058837,0.0008153377,0.95705545,0.003965441,0.0003127177,0.00008803195,0.0003730797,0.0003309967,0.016470628],"genre_scores_gemma":[0.51900965,0.002002054,0.4499548,0.0031197558,0.001341352,0.00042985057,0.0023482197,0.0009856349,0.020808708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955096,0.0022437691,0.00016253143,0.0008269825,0.001025,0.00023201892],"domain_scores_gemma":[0.97062194,0.024878249,0.0009911906,0.001700074,0.0015056175,0.0003029841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047393325,0.0018253113,0.0018274949,0.0013215044,0.0012759647,0.0024617948,0.0029825184,0.002229167,0.011762179],"category_scores_gemma":[0.03480344,0.0016723529,0.0017790123,0.0027450586,0.0050530415,0.0076854653,0.004011606,0.0076088174,0.001178512],"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.00023210743,0.00019293411,0.00090631744,0.00041772847,0.00011655001,0.00021299397,0.00045165207,0.15571919,0.0011577768,0.75384384,0.021306712,0.06544211],"study_design_scores_gemma":[0.000020221143,0.00002050001,0.0000941877,0.000026654898,0.000010097385,0.00004328787,0.00004967207,0.11864979,0.0002444572,0.87964416,0.0011848599,0.000012086129],"about_ca_topic_score_codex":0.002682988,"about_ca_topic_score_gemma":0.0033212109,"teacher_disagreement_score":0.011762179,"about_ca_system_score_codex":0.0015304185,"about_ca_system_score_gemma":0.0016047744,"threshold_uncertainty_score":0.039348364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011178739,0.00062370714,0.9723504,0.00073201326,0.0001470618,0.00005293407,0.000328942,0.0002845918,0.01430154],"genre_scores_gemma":[0.39107922,0.0020628413,0.5655823,0.0010220467,0.00075912365,0.00064938597,0.0023343763,0.001570041,0.03494075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953576,0.0018354021,0.00019501221,0.0008602094,0.0013715453,0.00038015237],"domain_scores_gemma":[0.9861135,0.010151872,0.0007060953,0.0015843712,0.0008570855,0.0005869958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005526525,0.0025031525,0.0030263686,0.0019606387,0.0012292619,0.005285376,0.004572221,0.002573688,0.012569552],"category_scores_gemma":[0.028517006,0.0016854265,0.0023740907,0.00306011,0.0040600915,0.009321424,0.0063947616,0.012017746,0.0019352022],"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.00021344237,0.00009904008,0.00021815984,0.00020972743,0.00004725954,0.00004144981,0.00014293687,0.060579553,0.00070204854,0.90207314,0.005092607,0.030580724],"study_design_scores_gemma":[0.000019157473,0.000024123154,0.000071053175,0.000032447693,0.000013875635,0.000026643136,0.000016008391,0.111690074,0.000385253,0.88601947,0.001691254,0.000010710425],"about_ca_topic_score_codex":0.0018437138,"about_ca_topic_score_gemma":0.0019400562,"teacher_disagreement_score":0.012569552,"about_ca_system_score_codex":0.0028936367,"about_ca_system_score_gemma":0.0016478922,"threshold_uncertainty_score":0.04204935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089676003,0.00056077633,0.9951552,0.00015983052,0.000092133036,0.000052668074,0.000076274555,0.0002806933,0.0027257353],"genre_scores_gemma":[0.043508783,0.0011256742,0.94656557,0.00021945992,0.00015338096,0.0006614059,0.00035344367,0.00047628535,0.0069360207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986897,0.0006114256,0.00007893551,0.00014703786,0.00039287464,0.00007999],"domain_scores_gemma":[0.9949563,0.0037698282,0.0002857948,0.00029838365,0.0005913098,0.000098403245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021948374,0.0014338647,0.0012714003,0.00089761,0.0006105583,0.0013061322,0.0014864227,0.0019926017,0.011490869],"category_scores_gemma":[0.010169081,0.00069282524,0.0012437801,0.0014151206,0.0010776324,0.0012136082,0.0019709442,0.0025669804,0.003492467],"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.000107145584,0.00007280109,0.0007528313,0.0007642069,0.00009732075,0.00009937832,0.00014742567,0.7933052,0.0030016026,0.08983461,0.00677126,0.105046205],"study_design_scores_gemma":[0.000022697375,0.000016477816,0.00007023268,0.000057958514,0.000007195578,0.000023774808,0.000019651561,0.966349,0.00046635728,0.024939366,0.00801742,0.000009925844],"about_ca_topic_score_codex":0.0044051604,"about_ca_topic_score_gemma":0.0052555725,"teacher_disagreement_score":0.011490869,"about_ca_system_score_codex":0.00078094436,"about_ca_system_score_gemma":0.0020183963,"threshold_uncertainty_score":0.038440824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025535475,0.0009082501,0.9620506,0.0013479202,0.00013150874,0.000024621524,0.000115990995,0.00014505888,0.009740636],"genre_scores_gemma":[0.84909505,0.002289421,0.13375816,0.000641583,0.00072485325,0.00019819938,0.00028131745,0.00062780705,0.012383666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888796,0.00054540153,0.000035766203,0.00014604996,0.00027105366,0.00011384996],"domain_scores_gemma":[0.9935866,0.0043658204,0.00057044707,0.00039000923,0.000752777,0.00033433657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035489881,0.0011872873,0.0015663145,0.0013122589,0.0008095006,0.0026351106,0.0016692304,0.0013414308,0.0027537986],"category_scores_gemma":[0.01626978,0.0007629668,0.0008213847,0.0008106155,0.002765395,0.0041326685,0.0026998227,0.0034703626,0.00030581417],"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.00004195427,0.000036682195,0.00043801696,0.00011840626,0.000045074325,0.00009394474,0.00012057235,0.22654964,0.00171921,0.76110214,0.0027411173,0.006993336],"study_design_scores_gemma":[0.0000029316298,0.0000071203863,0.00008580545,0.0000146681605,0.0000052346795,0.000017124468,0.0000132293935,0.79958284,0.0002233408,0.19954808,0.0004880338,0.000011627109],"about_ca_topic_score_codex":0.002353309,"about_ca_topic_score_gemma":0.0019404634,"teacher_disagreement_score":0.0035489881,"about_ca_system_score_codex":0.0015890427,"about_ca_system_score_gemma":0.0015299437,"threshold_uncertainty_score":0.018769085},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123168435,0.0001559835,0.98635834,0.00008776147,0.000033869153,0.000036769812,0.000033137625,0.00015832207,0.00081895036],"genre_scores_gemma":[0.245754,0.00039579233,0.7487752,0.00007200212,0.00009157242,0.00019597457,0.0002505191,0.00040954683,0.004055349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985316,0.0006091139,0.00007601775,0.00019582352,0.0004783995,0.0001090443],"domain_scores_gemma":[0.9950133,0.0033379977,0.00031891535,0.0003637445,0.0006489111,0.0003170186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037588228,0.0018965382,0.002669872,0.0020162351,0.00070222764,0.0024192848,0.0023435415,0.0026413726,0.0034865953],"category_scores_gemma":[0.018608725,0.0017363125,0.001167945,0.0014088824,0.0021993325,0.003052131,0.003904838,0.0035790678,0.0010098327],"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.0003396101,0.0001615096,0.0008032107,0.00034620365,0.000110676025,0.00016559153,0.00022143153,0.8285965,0.0029481663,0.071523435,0.0023928706,0.092390776],"study_design_scores_gemma":[0.00001804852,0.000052572526,0.00009762942,0.000023350976,0.0000118890475,0.000026566318,0.000024921737,0.96539056,0.0012812228,0.032494444,0.00056981615,0.000009013435],"about_ca_topic_score_codex":0.0026415826,"about_ca_topic_score_gemma":0.003286966,"teacher_disagreement_score":0.0037588228,"about_ca_system_score_codex":0.001333852,"about_ca_system_score_gemma":0.00205463,"threshold_uncertainty_score":0.019878745},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006533258,0.00046322015,0.97660404,0.0002182341,0.000154462,0.00006584643,0.00031838292,0.00029837628,0.01534411],"genre_scores_gemma":[0.27998975,0.001450589,0.6952636,0.00032083067,0.00023399836,0.00043435197,0.0022117312,0.00082398887,0.019271208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986291,0.00030279122,0.00007162175,0.0003073668,0.00049648446,0.0001925295],"domain_scores_gemma":[0.99844104,0.0008045204,0.0000858002,0.0002775013,0.0002829146,0.00010822294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011832229,0.0018964814,0.0023810035,0.00081484247,0.0007641962,0.0034156411,0.002188543,0.0016029242,0.017324261],"category_scores_gemma":[0.0050245267,0.0012271941,0.0015982838,0.0021647678,0.0011448654,0.0038306655,0.0048682606,0.004809463,0.0030482088],"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.00022331107,0.00015802599,0.00034403036,0.0008357231,0.00012491293,0.00020451879,0.00020518612,0.53080255,0.0036712217,0.22949548,0.020220377,0.2137146],"study_design_scores_gemma":[0.000038642647,0.000075538446,0.00019296427,0.0000936568,0.000018835419,0.00015333218,0.00008772697,0.7980735,0.00182796,0.19078405,0.0086192945,0.000034533397],"about_ca_topic_score_codex":0.002378934,"about_ca_topic_score_gemma":0.0026182712,"teacher_disagreement_score":0.017324261,"about_ca_system_score_codex":0.00095055293,"about_ca_system_score_gemma":0.0019806072,"threshold_uncertainty_score":0.057955444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10011594,0.0030555164,0.87305367,0.0018180708,0.000118457836,0.00008953023,0.00010664606,0.000072518174,0.021569617],"genre_scores_gemma":[0.8593932,0.0034491788,0.124577135,0.00040239297,0.00019890038,0.00021080315,0.0001914122,0.0001076596,0.011469419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940264,0.0002727847,0.000025560908,0.00011788738,0.000104871404,0.00007617902],"domain_scores_gemma":[0.9974179,0.0017478311,0.00016766628,0.000074380114,0.00036464754,0.00022755777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030451743,0.0010113823,0.0012690212,0.0013585893,0.0009202237,0.0017006764,0.0007951868,0.0016378048,0.0023619572],"category_scores_gemma":[0.007202048,0.00031074794,0.000850485,0.00090836117,0.0024841465,0.0025857647,0.0019455837,0.0024556888,0.00019805385],"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.000144971,0.0001232213,0.0017457822,0.00042883048,0.000054213408,0.00041560997,0.0004759642,0.16060871,0.00950817,0.7901536,0.0022029413,0.03413803],"study_design_scores_gemma":[0.000014269679,0.00011115055,0.0003787722,0.00006192345,0.000011525275,0.00010880378,0.00012049604,0.8127507,0.0012873618,0.18359688,0.0015288901,0.00002918631],"about_ca_topic_score_codex":0.0018308025,"about_ca_topic_score_gemma":0.0012562248,"teacher_disagreement_score":0.0030451743,"about_ca_system_score_codex":0.0013757881,"about_ca_system_score_gemma":0.0012217124,"threshold_uncertainty_score":0.016104579},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060049584,0.00044263896,0.99566674,0.00019339952,0.00005418453,0.000052165986,0.000042700212,0.00018011301,0.0027675268],"genre_scores_gemma":[0.09322836,0.0022453081,0.8928521,0.0002897252,0.00035498283,0.0011344273,0.00049318356,0.0002801469,0.00912168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988482,0.00048359693,0.00005037893,0.00013668527,0.000379937,0.00010114108],"domain_scores_gemma":[0.9990959,0.00053635385,0.00008418301,0.00007703879,0.00015295956,0.00005355276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015705535,0.002148527,0.0012276453,0.0008952266,0.0005767645,0.0019754085,0.0013690112,0.0010765679,0.00787724],"category_scores_gemma":[0.0036764562,0.00061374943,0.0011563275,0.001848967,0.0013016156,0.0015801227,0.002108269,0.0037506998,0.0025342035],"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.000032408072,0.00008467145,0.00025311662,0.00033140572,0.000055393277,0.00007105363,0.000091370064,0.55420345,0.0010480413,0.36858016,0.0075127906,0.06773611],"study_design_scores_gemma":[0.000016176708,0.00003171302,0.000044678363,0.00003471311,0.0000066785906,0.000016408654,0.000023867713,0.8724223,0.00020033422,0.119385995,0.007808407,0.000008770373],"about_ca_topic_score_codex":0.0036114308,"about_ca_topic_score_gemma":0.003963714,"teacher_disagreement_score":0.00787724,"about_ca_system_score_codex":0.0012189971,"about_ca_system_score_gemma":0.0019344111,"threshold_uncertainty_score":0.026351988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001480859,0.00019301382,0.9949222,0.00016671632,0.00007443432,0.000032284406,0.000043825297,0.00006297856,0.003023595],"genre_scores_gemma":[0.12027939,0.00070586085,0.86728835,0.00040755278,0.00022293576,0.0004197641,0.00028016488,0.00028180593,0.010114178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971086,0.000101075435,0.000010845563,0.00003718843,0.000114084665,0.000025909101],"domain_scores_gemma":[0.9992119,0.00046973344,0.00003681539,0.00003914761,0.0001881829,0.000054199772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567881,0.0009260689,0.0012668481,0.0006241198,0.00048566944,0.0011394531,0.0013276626,0.0018512091,0.007971744],"category_scores_gemma":[0.0022562118,0.00054189045,0.00074767554,0.0009352468,0.00078445993,0.0010954886,0.0016798915,0.002048513,0.00084464275],"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.00016350271,0.00010544906,0.00023470052,0.00034867105,0.00006301174,0.00013109652,0.000080865335,0.7698966,0.0041638254,0.10092568,0.010638193,0.11324833],"study_design_scores_gemma":[0.000008760125,0.000012608685,0.000014869263,0.000008983983,0.0000040414243,0.000009471646,0.0000045891957,0.99283653,0.00015259093,0.005986508,0.0009578782,0.0000031562413],"about_ca_topic_score_codex":0.0031912054,"about_ca_topic_score_gemma":0.0037964822,"teacher_disagreement_score":0.007971744,"about_ca_system_score_codex":0.000692546,"about_ca_system_score_gemma":0.0016610397,"threshold_uncertainty_score":0.026668131},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011973678,0.0009510981,0.9709236,0.00046477537,0.00010835463,0.00007763958,0.00023730696,0.00021113442,0.015052484],"genre_scores_gemma":[0.37335035,0.0018391937,0.61380094,0.00058723625,0.00019964794,0.00042585604,0.0009515559,0.00027419592,0.008570961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987062,0.00048113996,0.000053091684,0.00012777033,0.00047889407,0.00015292235],"domain_scores_gemma":[0.99708396,0.0015924049,0.00018187542,0.0003917196,0.0005806719,0.00016938821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022983206,0.001129529,0.0009973614,0.0010319424,0.00047989035,0.0012729046,0.001352248,0.0010156381,0.005099852],"category_scores_gemma":[0.008859816,0.00053023145,0.0010607152,0.001487807,0.0009182011,0.0016544957,0.0017622756,0.003510194,0.000785322],"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.000082500905,0.00008850971,0.0005998498,0.00024121003,0.000034465338,0.00007974999,0.00013621741,0.7497516,0.001019822,0.20402539,0.004817341,0.039123382],"study_design_scores_gemma":[0.000005685569,0.000012201237,0.00003918989,0.000019159503,0.0000025778031,0.00000914254,0.000015730775,0.97802186,0.00012948652,0.020102454,0.0016394283,0.000003078854],"about_ca_topic_score_codex":0.007190138,"about_ca_topic_score_gemma":0.008764623,"teacher_disagreement_score":0.007190138,"about_ca_system_score_codex":0.0014775039,"about_ca_system_score_gemma":0.0018140967,"threshold_uncertainty_score":0.017060757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31369,0.0007488878,0.6157955,0.0029916125,0.00076546473,0.0002038331,0.0025719807,0.0061992183,0.057033483],"genre_scores_gemma":[0.7773436,0.00040841065,0.20677985,0.00023010737,0.00008501795,0.000108148364,0.0013084623,0.0012667958,0.012469663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999881,0.000018475168,0.0000069451366,0.000015752048,0.000049427592,0.000028400638],"domain_scores_gemma":[0.9993667,0.00028710492,0.000055356042,0.00005898765,0.00014902365,0.000082840124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043805144,0.000725883,0.00039031685,0.00092699274,0.00024267737,0.0013398322,0.0005699239,0.0007362496,0.01562875],"category_scores_gemma":[0.0014434211,0.00021905742,0.00028123497,0.0006600422,0.00041236807,0.000728839,0.00072798313,0.001287777,0.0006415032],"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.0013523428,0.00039996763,0.0055424483,0.0010270646,0.00005355285,0.0010403529,0.001226048,0.3906404,0.09232579,0.2649166,0.038607527,0.20286787],"study_design_scores_gemma":[0.00005022925,0.00006564494,0.0030333407,0.00008737133,0.000008880874,0.0002393428,0.00018364371,0.9486106,0.0133200865,0.017032092,0.017328372,0.000040456558],"about_ca_topic_score_codex":0.0028515714,"about_ca_topic_score_gemma":0.0024025661,"teacher_disagreement_score":0.01562875,"about_ca_system_score_codex":0.0005386978,"about_ca_system_score_gemma":0.0011645694,"threshold_uncertainty_score":0.052283406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033576448,0.000542566,0.9444206,0.0009416343,0.00014085598,0.000034141674,0.00022421288,0.00032145786,0.019798007],"genre_scores_gemma":[0.65308154,0.0016121531,0.27783057,0.000887468,0.0005345542,0.0003398444,0.0013577405,0.00094326754,0.06341286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978606,0.0009600976,0.000109513705,0.00032286986,0.0005361471,0.00021071607],"domain_scores_gemma":[0.9967229,0.0017316596,0.00041069023,0.0004038629,0.0004207644,0.0003102945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028521437,0.0017392401,0.0014271119,0.0011153856,0.0010022284,0.0026803317,0.0016935597,0.0015273053,0.009009792],"category_scores_gemma":[0.010640637,0.0012263563,0.0017231044,0.0010138386,0.002656898,0.005834335,0.0038844196,0.0035530492,0.0016840743],"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.00004739452,0.000026524553,0.00017393676,0.000046777754,0.000029590812,0.000073299525,0.00008200276,0.023897463,0.00058735046,0.9649848,0.0015421571,0.008508719],"study_design_scores_gemma":[0.000009283983,0.000021932863,0.00006645986,0.000012370779,0.000010332033,0.000050741422,0.000027819393,0.11795283,0.00034782747,0.879554,0.0019365242,0.000009917436],"about_ca_topic_score_codex":0.0013581637,"about_ca_topic_score_gemma":0.001426203,"teacher_disagreement_score":0.009009792,"about_ca_system_score_codex":0.0014480547,"about_ca_system_score_gemma":0.0011721094,"threshold_uncertainty_score":0.030140698},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071129896,0.00039475685,0.78664505,0.00019341048,0.00017521372,0.00019125947,0.0054626325,0.1936341,0.012592376],"genre_scores_gemma":[0.015131175,0.0008475031,0.78805053,0.00094136206,0.00027366856,0.0013289452,0.01587103,0.14294748,0.034608312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861336,0.00027787947,0.00018128546,0.00018279601,0.00060582266,0.00013881357],"domain_scores_gemma":[0.9972191,0.0012197325,0.00018821801,0.0004279753,0.00072768156,0.00021740962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017364491,0.0019892552,0.0020664178,0.0017653577,0.00089416874,0.0025109914,0.004884307,0.0021425395,0.2167612],"category_scores_gemma":[0.008582807,0.0016387204,0.001579352,0.0017559003,0.0005567425,0.0038229323,0.0032773162,0.0036135213,0.1589612],"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.00058525545,0.00018633352,0.0010381269,0.0019249027,0.00014999472,0.00044013647,0.0005434732,0.009165126,0.015609437,0.02887555,0.6292672,0.3122145],"study_design_scores_gemma":[0.0006167509,0.00008093777,0.00066996313,0.0002684142,0.000045721034,0.0006466947,0.00006778901,0.06872775,0.014445241,0.0332721,0.880887,0.00027166234],"about_ca_topic_score_codex":0.0029524837,"about_ca_topic_score_gemma":0.0039274003,"teacher_disagreement_score":0.2167612,"about_ca_system_score_codex":0.00067946914,"about_ca_system_score_gemma":0.0018553636,"threshold_uncertainty_score":0.7251384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04675588,0.00005979953,0.9494261,0.00015377055,0.000030231435,0.000061520564,0.00028760548,0.0016440107,0.0015811208],"genre_scores_gemma":[0.4642355,0.00010591502,0.53119457,0.00009014301,0.000032167056,0.00010689689,0.0011681387,0.0005550784,0.0025115276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991935,0.00019374429,0.00003958689,0.000112521804,0.00037401824,0.00008665541],"domain_scores_gemma":[0.99497,0.0018827994,0.00043130992,0.0011029829,0.0013801595,0.00023285806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094696914,0.00066651043,0.0007872487,0.0012651134,0.00031384826,0.00087606144,0.0008714662,0.0005706226,0.0029513498],"category_scores_gemma":[0.00985174,0.00045164052,0.0003466754,0.0009333387,0.00056758936,0.0013238607,0.001164022,0.0009442938,0.0012167188],"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.0009082488,0.0002994784,0.011570433,0.0003824078,0.00011477296,0.0005629607,0.0003197071,0.19646804,0.17838866,0.05091134,0.019640632,0.5404333],"study_design_scores_gemma":[0.000026910413,0.0000650116,0.0018781653,0.0000074475447,0.000006691648,0.000138287,0.00003435339,0.9544221,0.024369908,0.017704492,0.0013246925,0.000021919257],"about_ca_topic_score_codex":0.0015735377,"about_ca_topic_score_gemma":0.002608806,"teacher_disagreement_score":0.0029513498,"about_ca_system_score_codex":0.00032716856,"about_ca_system_score_gemma":0.0009910889,"threshold_uncertainty_score":0.009873271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020742426,0.00022236638,0.99493945,0.00008439166,0.00008069206,0.000034097604,0.000019911218,0.000045397075,0.0024993813],"genre_scores_gemma":[0.073729165,0.00047605016,0.91419345,0.0001764121,0.0001493592,0.00032217926,0.00015346298,0.0003009873,0.01049897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.0005277888,0.000039375278,0.00010568953,0.0003437302,0.000055763983],"domain_scores_gemma":[0.99846715,0.0007522369,0.000079131496,0.00016167693,0.00038525162,0.00015443984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465852,0.0012774196,0.0017503784,0.001127233,0.0006982716,0.0014069993,0.0020697913,0.00167908,0.0051203417],"category_scores_gemma":[0.0059695677,0.0006712951,0.0013897576,0.0009980558,0.0014866854,0.001943346,0.0035285417,0.0035165292,0.0013433076],"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.00032589014,0.00036437795,0.00066103897,0.00049660547,0.000119232216,0.0001582862,0.000334096,0.29122475,0.0060011186,0.43631953,0.009031537,0.25496352],"study_design_scores_gemma":[0.00002759472,0.00007439278,0.00008819681,0.0000291403,0.000016068925,0.000051827214,0.000031789354,0.9369344,0.0007912703,0.05696109,0.0049772803,0.000016999495],"about_ca_topic_score_codex":0.0009551302,"about_ca_topic_score_gemma":0.0015623367,"teacher_disagreement_score":0.0051203417,"about_ca_system_score_codex":0.00052483217,"about_ca_system_score_gemma":0.0011353915,"threshold_uncertainty_score":0.017129242},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116009064,0.00050585356,0.8636286,0.0010763318,0.000084568055,0.00011274198,0.00021424724,0.00008316133,0.018285422],"genre_scores_gemma":[0.83177894,0.000684076,0.15713342,0.00029969003,0.00015064699,0.0004222742,0.00044967892,0.00020391286,0.008877339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878234,0.0005828365,0.000049378457,0.00015636526,0.00028442292,0.00014462016],"domain_scores_gemma":[0.9964631,0.0017826214,0.00052690576,0.00022008395,0.00067593926,0.00033133963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039294995,0.0010388398,0.0015932748,0.0021425416,0.00092307065,0.004169201,0.0017788691,0.0014681317,0.005026947],"category_scores_gemma":[0.013440036,0.0010152676,0.0009866919,0.0019051743,0.002367431,0.0046165744,0.0028859715,0.0028867302,0.0003498074],"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.00018101215,0.0001181765,0.00059268874,0.00009263685,0.00004201706,0.000036125,0.00013576228,0.12066791,0.00092182163,0.85963356,0.0019648205,0.015613415],"study_design_scores_gemma":[0.00003620023,0.00005238728,0.00029661576,0.00003219144,0.000012222547,0.000032669832,0.00006903603,0.54142696,0.00055641006,0.45647362,0.0009980835,0.000013601004],"about_ca_topic_score_codex":0.0012635762,"about_ca_topic_score_gemma":0.0008811325,"teacher_disagreement_score":0.005026947,"about_ca_system_score_codex":0.0022011937,"about_ca_system_score_gemma":0.0017324513,"threshold_uncertainty_score":0.020781398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015306027,0.00024328557,0.99031234,0.0001022682,0.00020608662,0.000099114826,0.00018973896,0.0009825112,0.0063341395],"genre_scores_gemma":[0.031998444,0.0003800557,0.957775,0.00014685256,0.00017717973,0.00037160912,0.0006582034,0.0010568465,0.0074357907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967597,0.00091143826,0.00018080183,0.00037188578,0.0015770108,0.0001991276],"domain_scores_gemma":[0.9974477,0.0006534521,0.00014365574,0.00060873653,0.0010181068,0.0001283619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023479324,0.0015494935,0.0019699691,0.0013887045,0.000921129,0.0025648763,0.0033180725,0.0015205157,0.020281984],"category_scores_gemma":[0.0082461955,0.0010900695,0.0019904578,0.0020906238,0.00083056564,0.0026823515,0.0030268144,0.004540009,0.006335952],"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.0002527969,0.00021776125,0.000678999,0.0005248925,0.00018923676,0.0002342075,0.00019249565,0.40989053,0.0060720923,0.14718665,0.031815354,0.40274498],"study_design_scores_gemma":[0.00007115386,0.00007627429,0.0001572193,0.00005222211,0.00002995862,0.00016828913,0.000021260787,0.92730397,0.0029304794,0.031065268,0.038077228,0.000046553294],"about_ca_topic_score_codex":0.002814601,"about_ca_topic_score_gemma":0.0031021172,"teacher_disagreement_score":0.020281984,"about_ca_system_score_codex":0.00089194946,"about_ca_system_score_gemma":0.0022060093,"threshold_uncertainty_score":0.067849934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10801872,0.00021807784,0.8526194,0.0008688671,0.0001270703,0.00018470381,0.0003264025,0.00051627145,0.037120435],"genre_scores_gemma":[0.5846151,0.00036050266,0.38641924,0.00052804913,0.00027838495,0.00053092843,0.0010291698,0.00061209657,0.025626516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912435,0.00027792013,0.000028998631,0.00015328971,0.00028722695,0.000128271],"domain_scores_gemma":[0.99888295,0.0006100885,0.00010441331,0.00020952191,0.000107447326,0.000085602085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011421236,0.00075815327,0.00091405126,0.00050747715,0.0004827285,0.0013289358,0.0011126555,0.00065076165,0.005300228],"category_scores_gemma":[0.0027090015,0.00035640993,0.0014337901,0.0005442135,0.0014695402,0.0018312233,0.0018450402,0.0027033275,0.0008755023],"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.00010941654,0.00033580657,0.00026639173,0.00020101498,0.00004250581,0.0001845583,0.00019945634,0.13041557,0.0038434216,0.8085611,0.0067111375,0.049129546],"study_design_scores_gemma":[0.000047352925,0.0000728921,0.00008236528,0.000013438584,0.00000976148,0.00005081424,0.00003915697,0.28562453,0.0021725127,0.7089845,0.0028904388,0.000012263425],"about_ca_topic_score_codex":0.0006223732,"about_ca_topic_score_gemma":0.00088908366,"teacher_disagreement_score":0.005300228,"about_ca_system_score_codex":0.00085922476,"about_ca_system_score_gemma":0.0008781855,"threshold_uncertainty_score":0.01773101},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16697617,0.002558972,0.7521533,0.003643737,0.0004458211,0.00018388403,0.0013711083,0.0005992157,0.07206786],"genre_scores_gemma":[0.88254035,0.0007496685,0.09355021,0.00044168413,0.00051595754,0.0001942345,0.0009890633,0.00025694395,0.020761825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839956,0.00058935094,0.000047954003,0.00035622393,0.00029063877,0.00031626353],"domain_scores_gemma":[0.9963936,0.0026774965,0.00040518193,0.0001693226,0.00019695109,0.00015749643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014170194,0.0012823591,0.0013343832,0.00054473866,0.00062401395,0.0019309958,0.0013014947,0.0021463619,0.008364468],"category_scores_gemma":[0.008218239,0.00038524283,0.000615159,0.0010150616,0.001662037,0.0018806333,0.0013651918,0.0023440768,0.00066066463],"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.000540802,0.00027208318,0.0008537238,0.0007149863,0.000078889505,0.0012092389,0.00019422908,0.43632525,0.001691652,0.5015815,0.01830484,0.038232792],"study_design_scores_gemma":[0.00012322633,0.000112969974,0.0003347022,0.000034940906,0.000016153637,0.0002208944,0.00010351987,0.6758071,0.0009425057,0.3193078,0.0029636028,0.00003259526],"about_ca_topic_score_codex":0.0027210861,"about_ca_topic_score_gemma":0.0027161995,"teacher_disagreement_score":0.008364468,"about_ca_system_score_codex":0.0008920888,"about_ca_system_score_gemma":0.0009427839,"threshold_uncertainty_score":0.027981937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019977506,0.00038728307,0.97528255,0.0003781068,0.000040513576,0.000051036728,0.0002677803,0.0004560878,0.0031591346],"genre_scores_gemma":[0.31655383,0.00048982364,0.6748492,0.0003317089,0.00012711197,0.0002354076,0.0017330584,0.0003596527,0.005320176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776924,0.00070480385,0.00013291444,0.00050038425,0.0006590974,0.0002337119],"domain_scores_gemma":[0.99719906,0.0014293747,0.00038426474,0.00036034457,0.0005088259,0.000118072174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032126233,0.0017967006,0.00238024,0.0014575773,0.00077586406,0.0032421504,0.002374163,0.0031363755,0.005515747],"category_scores_gemma":[0.0105385035,0.00074467267,0.0015650614,0.0021448417,0.0014033662,0.0043740347,0.002740319,0.0026531555,0.0017453823],"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.0003348563,0.0001484527,0.00127262,0.00023345333,0.00007950708,0.00013767694,0.00014486093,0.83378375,0.0018590058,0.0236074,0.005287926,0.13311058],"study_design_scores_gemma":[0.000026055583,0.000053050935,0.00019457225,0.00001514627,0.0000069954244,0.000051756524,0.000049367347,0.97898406,0.0010841977,0.018364253,0.0011577129,0.0000128],"about_ca_topic_score_codex":0.0045371563,"about_ca_topic_score_gemma":0.0031285419,"teacher_disagreement_score":0.005515747,"about_ca_system_score_codex":0.0013044936,"about_ca_system_score_gemma":0.0016295796,"threshold_uncertainty_score":0.018452048},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038984116,0.0010782095,0.94569117,0.00064236403,0.00020015182,0.00009018839,0.00015704238,0.0004991963,0.0126575325],"genre_scores_gemma":[0.51469755,0.0010099179,0.4685723,0.00043119016,0.00017461262,0.00031113403,0.00042637312,0.0003888048,0.013988156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983413,0.0005582416,0.00008428068,0.0004812183,0.00038320431,0.00015171318],"domain_scores_gemma":[0.99720496,0.0015590839,0.00027466437,0.00044025265,0.00035891376,0.00016210422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018926798,0.0010488839,0.0008705835,0.00058268174,0.00064941193,0.0018121997,0.0011471694,0.00082767726,0.007356321],"category_scores_gemma":[0.006315259,0.0005174791,0.001153731,0.00073861436,0.0010566784,0.0016296841,0.0022070464,0.0031464368,0.0008640107],"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.0007774931,0.000295725,0.0028201733,0.0014456365,0.00020031769,0.0002486237,0.000770741,0.48338538,0.036536597,0.1934463,0.0071153054,0.27295768],"study_design_scores_gemma":[0.00008290785,0.0005246863,0.0006134392,0.000144219,0.00005396862,0.00025334503,0.00024470018,0.91401184,0.010798548,0.05207003,0.021159424,0.000042901374],"about_ca_topic_score_codex":0.0018507764,"about_ca_topic_score_gemma":0.0031665282,"teacher_disagreement_score":0.007356321,"about_ca_system_score_codex":0.001012422,"about_ca_system_score_gemma":0.0014669381,"threshold_uncertainty_score":0.024609327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004843696,0.0007885534,0.9814882,0.00051560235,0.00043171554,0.00002862221,0.00007792056,0.00017599418,0.011649704],"genre_scores_gemma":[0.3294966,0.0029380517,0.63325745,0.00089796534,0.0010989665,0.00038445188,0.0003370517,0.0009240776,0.030665409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866915,0.0006088243,0.00007505681,0.00022956256,0.00035280283,0.00006478191],"domain_scores_gemma":[0.9988238,0.0006432932,0.00011898938,0.00017113062,0.00018852844,0.000054311833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019777564,0.001026974,0.00054706406,0.0008393748,0.00050308445,0.0013464226,0.000643059,0.0006274837,0.007760609],"category_scores_gemma":[0.006542001,0.00041905904,0.00068494934,0.0016604869,0.0028095334,0.0029515533,0.0018407807,0.002990556,0.0024623454],"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.00010739214,0.000034701912,0.0003174121,0.00022733114,0.000023844817,0.00014119298,0.00016222209,0.05224437,0.0050041145,0.82013774,0.006235908,0.115363866],"study_design_scores_gemma":[0.000027870456,0.00015285746,0.00029162137,0.000079844904,0.00001210519,0.00013356072,0.000052558393,0.28502876,0.005204435,0.67540276,0.033577386,0.000036148664],"about_ca_topic_score_codex":0.00094152003,"about_ca_topic_score_gemma":0.0006171742,"teacher_disagreement_score":0.007760609,"about_ca_system_score_codex":0.0007092607,"about_ca_system_score_gemma":0.0007928677,"threshold_uncertainty_score":0.025961816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011692515,0.009652178,0.82327837,0.0030018399,0.0007376539,0.00009877756,0.0008544993,0.00059881597,0.15008532],"genre_scores_gemma":[0.37955984,0.022312874,0.4311323,0.0025166194,0.0030002291,0.0013871794,0.003852683,0.0017643468,0.1544739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992411,0.00024334839,0.000031797434,0.00013239369,0.00023809465,0.000113240705],"domain_scores_gemma":[0.99864477,0.00086117734,0.000072843315,0.00015076912,0.00018615495,0.00008425501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575945,0.0022353088,0.0011956117,0.0025084943,0.00074740016,0.00271358,0.0011911868,0.0009745093,0.01837937],"category_scores_gemma":[0.0035854334,0.0009872768,0.0021038784,0.0030917868,0.0016915511,0.004339956,0.0022652445,0.007072952,0.0038366618],"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.000048184014,0.000060872782,0.00012602037,0.00023573272,0.000044834298,0.00004998852,0.00014633557,0.0056672464,0.00094447215,0.9235285,0.018535845,0.050611973],"study_design_scores_gemma":[0.000022866314,0.000024170718,0.00019074035,0.000063819,0.000027919494,0.0000727477,0.000026284051,0.021673955,0.00042548747,0.9627796,0.01468281,0.000009517727],"about_ca_topic_score_codex":0.0013674417,"about_ca_topic_score_gemma":0.0012822138,"teacher_disagreement_score":0.01837937,"about_ca_system_score_codex":0.0016183795,"about_ca_system_score_gemma":0.00091094914,"threshold_uncertainty_score":0.06148511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078109154,0.000037391,0.9897343,0.00008461592,0.000020799323,0.000051447998,0.00003447641,0.00022608554,0.0020000588],"genre_scores_gemma":[0.16638842,0.000101076315,0.8272465,0.00011831441,0.000048900667,0.00022254046,0.00020097975,0.00031357148,0.0053597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993967,0.000198526,0.000020812919,0.00006495511,0.0002485367,0.00007042155],"domain_scores_gemma":[0.99914384,0.0004104321,0.00006764994,0.00016415898,0.00016463138,0.000049300423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012115274,0.0010707837,0.001123633,0.0006833806,0.00053091143,0.000848687,0.0008923656,0.00085695094,0.004411707],"category_scores_gemma":[0.0036832164,0.00044383807,0.0010861218,0.00038358752,0.0015307094,0.0008807795,0.001850729,0.002237063,0.0014531569],"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.00023923324,0.00019172739,0.0008845378,0.000275679,0.000046929737,0.0002907574,0.0003766953,0.46060902,0.019918006,0.28170165,0.008110515,0.22735533],"study_design_scores_gemma":[0.000023976661,0.00008323388,0.00009589174,0.000015539068,0.000007018149,0.000061648585,0.00003239658,0.90378153,0.005008793,0.08805261,0.0028217363,0.000015615933],"about_ca_topic_score_codex":0.0013695993,"about_ca_topic_score_gemma":0.0019607926,"teacher_disagreement_score":0.004411707,"about_ca_system_score_codex":0.0006964666,"about_ca_system_score_gemma":0.0011725454,"threshold_uncertainty_score":0.014758587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008905189,0.00004587687,0.9979625,0.000051410785,0.000017260507,0.000026400958,0.000019428953,0.000083764084,0.00090283866],"genre_scores_gemma":[0.060699917,0.00015485176,0.93535846,0.00010367225,0.000053529475,0.0002747357,0.00014513747,0.00022757523,0.002982144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927396,0.00036401598,0.00002486521,0.000083532905,0.00021921458,0.00003437052],"domain_scores_gemma":[0.99897134,0.0005767946,0.000090142,0.00012700717,0.00017809842,0.000056553676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018143454,0.0010548458,0.0012931931,0.0005779432,0.0004748957,0.00087193376,0.0011766808,0.0011558072,0.0044732485],"category_scores_gemma":[0.0029913366,0.0005525761,0.0011384679,0.00069980155,0.0010511872,0.00081737887,0.0016015733,0.0033631828,0.001470887],"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.00008710225,0.0001418624,0.0002814528,0.00022107331,0.00006630758,0.00014874824,0.00012095118,0.8248895,0.005821621,0.08067017,0.005640795,0.08191043],"study_design_scores_gemma":[0.000010302419,0.000018457582,0.000017629925,0.0000073960878,0.0000030321946,0.000023680574,0.000004391789,0.9906254,0.0005612447,0.0074612903,0.0012615386,0.0000056478125],"about_ca_topic_score_codex":0.0012093858,"about_ca_topic_score_gemma":0.0016248858,"teacher_disagreement_score":0.0044732485,"about_ca_system_score_codex":0.0005898305,"about_ca_system_score_gemma":0.0013107088,"threshold_uncertainty_score":0.014964461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17716317,0.0014582492,0.69773304,0.0018963371,0.0003976721,0.000089689755,0.0021271557,0.0005115037,0.11862319],"genre_scores_gemma":[0.8062419,0.0010830188,0.14927973,0.00041628358,0.0003273754,0.00014453691,0.0035109196,0.00038551888,0.038610697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985165,0.00026589292,0.000108874614,0.00040021102,0.00054843613,0.00016012312],"domain_scores_gemma":[0.9980996,0.0009995498,0.00027590492,0.0001819064,0.00029272083,0.00015036814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008808454,0.0005489039,0.0008348246,0.0010698864,0.0010781398,0.0032200422,0.0007439322,0.0007078221,0.011217032],"category_scores_gemma":[0.0035886136,0.00074539334,0.001073587,0.0009583831,0.0022046755,0.0037949064,0.0021883452,0.0030036743,0.0025068605],"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.00046043674,0.000050605315,0.00087549206,0.00032509293,0.000091755945,0.00060946384,0.0006949733,0.023970092,0.013071787,0.87901354,0.008663616,0.07217319],"study_design_scores_gemma":[0.000037853144,0.00012516085,0.0011669362,0.000087361106,0.000048264024,0.0006055487,0.00036056398,0.06665835,0.009267188,0.8964315,0.025163509,0.00004770851],"about_ca_topic_score_codex":0.0011732689,"about_ca_topic_score_gemma":0.0009489016,"teacher_disagreement_score":0.011217032,"about_ca_system_score_codex":0.00091812573,"about_ca_system_score_gemma":0.00052955066,"threshold_uncertainty_score":0.0375247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009590333,0.00025431806,0.985704,0.00012757014,0.00003653973,0.000023692586,0.00003918612,0.00012519436,0.004099275],"genre_scores_gemma":[0.5589984,0.0008002796,0.42406738,0.00028260425,0.00010138614,0.00031564748,0.00027515565,0.00035240722,0.014806757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999079,0.00038405787,0.000034928038,0.00018530135,0.00022769254,0.000089034475],"domain_scores_gemma":[0.9986879,0.00092284544,0.00009824584,0.000101019876,0.00013256987,0.00005733548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018798789,0.0010123155,0.0012733502,0.00081438915,0.00046930922,0.0015769281,0.0008483264,0.001052553,0.0049016015],"category_scores_gemma":[0.005195196,0.0005364029,0.0007613073,0.0007159137,0.0015770962,0.0016753243,0.002022727,0.0013609877,0.00067538215],"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.00011550684,0.000040834107,0.00036377553,0.00015005813,0.00004515193,0.00009061145,0.0000636771,0.8146136,0.0019019039,0.14387259,0.0015574022,0.03718487],"study_design_scores_gemma":[0.000008003668,0.000017331025,0.00003198782,0.00000979824,0.000003435248,0.0000092645,0.000007762424,0.9661808,0.0005817337,0.032487106,0.0006590894,0.0000035551645],"about_ca_topic_score_codex":0.0018199647,"about_ca_topic_score_gemma":0.0014214619,"teacher_disagreement_score":0.0049016015,"about_ca_system_score_codex":0.0008014518,"about_ca_system_score_gemma":0.0007762911,"threshold_uncertainty_score":0.016397417},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25986215,0.001726814,0.68655735,0.0032282965,0.00021361763,0.00022858805,0.001552677,0.00081848586,0.04581207],"genre_scores_gemma":[0.8238322,0.0007870576,0.15982088,0.00049389445,0.00017097993,0.0002713565,0.0010446616,0.00027031946,0.013308617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994779,0.00015313031,0.000019684,0.00014784698,0.00007437893,0.00012707266],"domain_scores_gemma":[0.9991134,0.00044593262,0.00010494609,0.00013024233,0.000078689045,0.00012681486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011691276,0.0014598825,0.0013017036,0.00057577423,0.00070950406,0.0023132907,0.0014132626,0.0024184012,0.009567366],"category_scores_gemma":[0.0034333612,0.00037845044,0.0013362487,0.0013218177,0.0009942288,0.002888666,0.0020437692,0.0021063325,0.0007021216],"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.0003615894,0.00032759193,0.0012400782,0.0003886909,0.00012302953,0.00038324148,0.00010940896,0.8434974,0.003683832,0.106221184,0.008124829,0.035539087],"study_design_scores_gemma":[0.00005315691,0.00012004975,0.0003506575,0.000023063161,0.000035253688,0.00006368915,0.0000510539,0.9259033,0.001262975,0.06956711,0.0025506644,0.000018957457],"about_ca_topic_score_codex":0.0036040773,"about_ca_topic_score_gemma":0.0037765936,"teacher_disagreement_score":0.009567366,"about_ca_system_score_codex":0.0010983653,"about_ca_system_score_gemma":0.0010371394,"threshold_uncertainty_score":0.032006085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010969366,0.00013015511,0.9971596,0.0001262273,0.000027349097,0.000016364254,0.000014712254,0.00003271011,0.0013959437],"genre_scores_gemma":[0.11846952,0.00056610873,0.8738127,0.00020604244,0.00020554275,0.00023105917,0.00013364466,0.00019118373,0.0061842273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989887,0.00037985243,0.000031283183,0.00012126881,0.00040420584,0.00007469937],"domain_scores_gemma":[0.9990157,0.0005659465,0.000064345484,0.00006568645,0.00021277844,0.000075578544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792076,0.0013547499,0.001312837,0.0012119423,0.0005456972,0.001535407,0.0018910951,0.0016470223,0.0036110412],"category_scores_gemma":[0.004118823,0.0008228786,0.00088363886,0.0011613031,0.001606138,0.0017458252,0.0023135582,0.003036846,0.00064907037],"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.00006330778,0.00010393942,0.00030396748,0.00018783807,0.00005798146,0.00009822334,0.00010681705,0.65599686,0.0018729958,0.2615101,0.0031478116,0.076550186],"study_design_scores_gemma":[0.00002330477,0.000028414523,0.00004012298,0.000013577539,0.000009224836,0.000024178835,0.00000739704,0.95981747,0.00039468548,0.037746992,0.0018865942,0.000007980278],"about_ca_topic_score_codex":0.002688245,"about_ca_topic_score_gemma":0.0023405442,"teacher_disagreement_score":0.0036110412,"about_ca_system_score_codex":0.0011033256,"about_ca_system_score_gemma":0.0016801346,"threshold_uncertainty_score":0.014766097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023849804,0.0007169627,0.9793521,0.00032988776,0.00035847776,0.000041766754,0.00011800605,0.00021875053,0.01647912],"genre_scores_gemma":[0.04455231,0.001678221,0.9079671,0.00057211565,0.0004820527,0.0002445857,0.0003394658,0.00063376484,0.04353039],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996495,0.0000933868,0.000013194811,0.00005774199,0.00015167963,0.000034382127],"domain_scores_gemma":[0.9996038,0.00021749265,0.000024021781,0.000052558942,0.00007701954,0.000025149773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006456859,0.0012043036,0.00071732973,0.0008668235,0.000568716,0.0012748276,0.0016120271,0.0013817897,0.013454831],"category_scores_gemma":[0.0017281784,0.000704832,0.0011449886,0.0011425224,0.00088546023,0.0019256255,0.0015685868,0.0033543012,0.002697474],"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.00017642637,0.00010733707,0.00020029017,0.00050443714,0.00009804536,0.00014867108,0.00016624683,0.27860442,0.012085206,0.28085086,0.045157637,0.38190037],"study_design_scores_gemma":[0.000031646523,0.000050349783,0.00009977713,0.00006756727,0.00002357912,0.00011656355,0.000026386468,0.8854801,0.0020931615,0.07218286,0.039804034,0.000023988063],"about_ca_topic_score_codex":0.0023815313,"about_ca_topic_score_gemma":0.00399933,"teacher_disagreement_score":0.013454831,"about_ca_system_score_codex":0.0005908625,"about_ca_system_score_gemma":0.0010320314,"threshold_uncertainty_score":0.045010865},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005841369,0.000028224204,0.9920276,0.000059174832,0.000014327659,0.000074867516,0.00003294062,0.00022714186,0.0016943166],"genre_scores_gemma":[0.1642201,0.000048473383,0.8333256,0.00008244664,0.000015709622,0.00022920333,0.00020018216,0.00014198424,0.001736411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978562,0.0009083014,0.00010405313,0.0002544846,0.0006581279,0.0002187147],"domain_scores_gemma":[0.9956743,0.0025655054,0.00028037088,0.0008095148,0.00052072963,0.000149605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032582562,0.00067122467,0.00084125,0.00074705196,0.0006529279,0.0009984586,0.002021169,0.00094520824,0.0060397964],"category_scores_gemma":[0.008980517,0.0004836556,0.0009132709,0.000959437,0.0011758254,0.0015838192,0.0032144976,0.0027067813,0.0009606458],"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.00034044433,0.00025787656,0.0006447468,0.0002424338,0.000057829264,0.00017630692,0.00041840758,0.3998336,0.016984038,0.36079383,0.005635965,0.2146145],"study_design_scores_gemma":[0.00003432482,0.000033800858,0.000038785816,0.000011147179,0.00000590893,0.00002702055,0.000014080327,0.96662694,0.0035488964,0.027894855,0.0017545632,0.000009601215],"about_ca_topic_score_codex":0.0010895712,"about_ca_topic_score_gemma":0.0016728992,"teacher_disagreement_score":0.0060397964,"about_ca_system_score_codex":0.0011960805,"about_ca_system_score_gemma":0.001474063,"threshold_uncertainty_score":0.02020514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071987933,0.00013647972,0.98674715,0.00011710626,0.00006579461,0.000054324806,0.00006581249,0.0003076149,0.0053069014],"genre_scores_gemma":[0.2371953,0.00037781548,0.7538518,0.000111407055,0.00006915568,0.00041231702,0.00037320654,0.00030826358,0.0073007015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996916,0.00011374417,0.000014596386,0.000028279865,0.00012389995,0.000027859884],"domain_scores_gemma":[0.99944776,0.00030087476,0.000053537813,0.000042960866,0.00010997269,0.000044912136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065904093,0.00064259797,0.0012447597,0.000495792,0.00059080694,0.0007314546,0.0013250477,0.0014887382,0.0035366795],"category_scores_gemma":[0.0014978681,0.0004528046,0.0008949801,0.00068443414,0.0006881767,0.00055391865,0.0011690964,0.0017003929,0.0006810072],"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.000028440063,0.000028077406,0.00032172658,0.00006973683,0.00001744911,0.000073203475,0.000039241408,0.9780718,0.0021824113,0.0085507585,0.0008710099,0.009746121],"study_design_scores_gemma":[0.000004574079,0.0000042013435,0.000016460677,0.0000027896754,0.0000011135307,0.000008072331,0.0000025534669,0.9984847,0.00028560322,0.000561864,0.0006261247,0.0000019836925],"about_ca_topic_score_codex":0.0034010073,"about_ca_topic_score_gemma":0.0023228377,"teacher_disagreement_score":0.0035366795,"about_ca_system_score_codex":0.00043715767,"about_ca_system_score_gemma":0.0015525905,"threshold_uncertainty_score":0.011831343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023002878,0.0028916118,0.95882463,0.00051260006,0.00041954944,0.000037809627,0.00008123464,0.00031290163,0.03461932],"genre_scores_gemma":[0.3183738,0.015779443,0.6125555,0.0010524316,0.0024342323,0.0007010526,0.00067599554,0.0024304271,0.045997214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558336,0.0014043045,0.00013750333,0.00046445077,0.0021423628,0.00026798993],"domain_scores_gemma":[0.97878796,0.0140876025,0.0010353253,0.0021126487,0.0033899893,0.0005865098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046826913,0.0028085168,0.0013375627,0.0029930098,0.0011511123,0.0041734613,0.0019986862,0.0018561258,0.018538607],"category_scores_gemma":[0.038271904,0.0007923824,0.0009757492,0.0022752623,0.003691129,0.005179145,0.003918453,0.007854874,0.008710561],"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.00016536709,0.000093258815,0.00039107184,0.0005770222,0.0000573145,0.00016435394,0.0003629932,0.12308176,0.003917968,0.7166289,0.018301807,0.13625816],"study_design_scores_gemma":[0.000019441268,0.000053084404,0.00026212618,0.00044241245,0.000024378698,0.00013513473,0.000085281914,0.3924549,0.0038894906,0.5809851,0.021603879,0.00004481402],"about_ca_topic_score_codex":0.00096686435,"about_ca_topic_score_gemma":0.0011428604,"teacher_disagreement_score":0.018538607,"about_ca_system_score_codex":0.0012299113,"about_ca_system_score_gemma":0.0013618065,"threshold_uncertainty_score":0.0620178},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22392325,0.0036284162,0.45319688,0.0036004728,0.0016868134,0.0001921453,0.0015767601,0.00087204773,0.31132317],"genre_scores_gemma":[0.81623626,0.0021255522,0.1295591,0.00087615714,0.00056778855,0.00014759153,0.0012034513,0.0006810052,0.048603106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995802,0.000054293225,0.000020502783,0.00014788227,0.00013176273,0.00006532041],"domain_scores_gemma":[0.9996201,0.0000875936,0.00006766341,0.00006563361,0.00008071533,0.0000782569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013795226,0.00044683917,0.00055128115,0.00081936584,0.0012119099,0.002533725,0.0005331092,0.00057364505,0.010344054],"category_scores_gemma":[0.0016274615,0.000369341,0.0005034771,0.00070644065,0.0023872706,0.0018847856,0.0015486468,0.0013346646,0.0033145219],"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.00026803627,0.000027787291,0.0011613193,0.00033050682,0.000019901301,0.00043167343,0.00029902402,0.0038103461,0.013740715,0.8636394,0.01967756,0.09659366],"study_design_scores_gemma":[0.000051819952,0.00010089658,0.0015739178,0.00013628893,0.00003132978,0.0013931843,0.00053990475,0.013155516,0.013057809,0.8412702,0.12862185,0.00006729191],"about_ca_topic_score_codex":0.0010439482,"about_ca_topic_score_gemma":0.001062364,"teacher_disagreement_score":0.010344054,"about_ca_system_score_codex":0.0005157929,"about_ca_system_score_gemma":0.00057652406,"threshold_uncertainty_score":0.03460431},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011727977,0.0009554722,0.9749145,0.00086036546,0.00022042185,0.00008144673,0.00014425952,0.00018385172,0.01091172],"genre_scores_gemma":[0.41554675,0.0017008467,0.5587169,0.000758323,0.0006420113,0.00052900385,0.00057455804,0.0004001567,0.021131475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985877,0.00070337544,0.000038019185,0.00013007056,0.0003508812,0.0001899821],"domain_scores_gemma":[0.9936878,0.0052034464,0.00021188299,0.00035005066,0.00038000394,0.00016677375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003026728,0.0014574523,0.0015059821,0.001232992,0.0009070794,0.0023580506,0.0019910007,0.0020654092,0.009560121],"category_scores_gemma":[0.016340112,0.00076862396,0.0010345381,0.0019654797,0.0017685362,0.0024752002,0.001821352,0.0037857923,0.0010255983],"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.00027810328,0.00018940106,0.0002828235,0.00026375955,0.000051096828,0.000078212186,0.00016540174,0.6831516,0.00093137915,0.21921542,0.010060296,0.08533246],"study_design_scores_gemma":[0.000017918026,0.000020113546,0.000027132774,0.000022765109,0.000008055956,0.000011844018,0.000018729621,0.92428845,0.00025771032,0.0742341,0.0010883779,0.00000480889],"about_ca_topic_score_codex":0.0044982666,"about_ca_topic_score_gemma":0.0056789424,"teacher_disagreement_score":0.009560121,"about_ca_system_score_codex":0.0018983803,"about_ca_system_score_gemma":0.0017374635,"threshold_uncertainty_score":0.031981766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077390536,0.00023919054,0.9901225,0.00009613944,0.00002605918,0.000016711181,0.000014849391,0.00010294985,0.0016424721],"genre_scores_gemma":[0.52616924,0.0012893974,0.4595214,0.000118128446,0.00014040974,0.00022318395,0.00019869843,0.00018140468,0.012158093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968183,0.00014433975,0.00001361802,0.00003380852,0.000101333666,0.000025173718],"domain_scores_gemma":[0.99970716,0.00012027746,0.000045272936,0.000037745045,0.00007383345,0.000015628639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023487,0.0004722506,0.00059552514,0.0004192003,0.00023486807,0.0005883188,0.00055806834,0.00088482595,0.0014193996],"category_scores_gemma":[0.0013749368,0.00022061268,0.0006278286,0.0004309472,0.00068302604,0.0009752575,0.0010063129,0.0007901664,0.0005287442],"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.00007007508,0.000057364585,0.0004885744,0.00033502362,0.000060438342,0.00019393924,0.00029207362,0.50018024,0.033523954,0.38571486,0.0024809644,0.07660241],"study_design_scores_gemma":[0.0000044830663,0.000011337924,0.000043145992,0.0000034905765,0.0000019323807,0.000026928352,0.000006715691,0.9846668,0.000803878,0.013670417,0.000754666,0.000006275893],"about_ca_topic_score_codex":0.0012062128,"about_ca_topic_score_gemma":0.0005239035,"teacher_disagreement_score":0.0014193996,"about_ca_system_score_codex":0.00033995326,"about_ca_system_score_gemma":0.00058578025,"threshold_uncertainty_score":0.0047483444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027848114,0.0005101973,0.96732026,0.00042361516,0.00023786211,0.000027615142,0.000084471314,0.000046994475,0.028564118],"genre_scores_gemma":[0.38767257,0.0030553276,0.52508277,0.0016334577,0.0011087842,0.0003091066,0.00044871194,0.00037600566,0.08031324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956685,0.000126269,0.000016751752,0.00006235152,0.00018983861,0.000037846614],"domain_scores_gemma":[0.99924254,0.00032173787,0.000037855774,0.00007811939,0.00026437154,0.000055460598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005728378,0.00068834896,0.0007761336,0.0013583563,0.00060118467,0.0014932262,0.0013717506,0.0007580554,0.009983076],"category_scores_gemma":[0.0019680096,0.0003694498,0.0007461022,0.0013563572,0.0008302056,0.0011184674,0.0016016954,0.0018578245,0.0011827282],"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.000022687625,0.00005800332,0.00016728464,0.00014013953,0.000036644356,0.000070102076,0.000047620815,0.15789156,0.0015316426,0.7826617,0.006071938,0.051300656],"study_design_scores_gemma":[0.000006190796,0.000022630202,0.00007764683,0.00002877232,0.000018563505,0.000054286767,0.000023625409,0.7934338,0.000554764,0.19424848,0.011521251,0.000010028252],"about_ca_topic_score_codex":0.0035056034,"about_ca_topic_score_gemma":0.0049563837,"teacher_disagreement_score":0.009983076,"about_ca_system_score_codex":0.0008383944,"about_ca_system_score_gemma":0.001015895,"threshold_uncertainty_score":0.03339666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07371398,0.0010606888,0.9059787,0.0016420311,0.00031858677,0.00013812586,0.00015271375,0.0006579405,0.016337229],"genre_scores_gemma":[0.5611987,0.00092179386,0.42909217,0.00054669456,0.000103787,0.00044522487,0.00035310487,0.001012802,0.006325731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941156,0.003155766,0.00034020914,0.0004211112,0.0015489497,0.00041842167],"domain_scores_gemma":[0.9802721,0.014565261,0.0006235318,0.0025925,0.0012884664,0.0006580823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008609428,0.0011138852,0.001924438,0.0012078914,0.0026894775,0.0032941534,0.0011410596,0.0018533046,0.0066667143],"category_scores_gemma":[0.04941898,0.0012591118,0.0013101022,0.0013395706,0.0034307677,0.0040797982,0.004360978,0.0039687376,0.001749798],"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.0004930641,0.0001779765,0.004012295,0.00037888708,0.00013951906,0.00043984543,0.00050820067,0.47297543,0.002496029,0.4390963,0.00973211,0.0695503],"study_design_scores_gemma":[0.000036801615,0.000041286432,0.00015373029,0.00006077232,0.000013808545,0.00010413525,0.00009997784,0.69054,0.0013387607,0.30428356,0.0033009637,0.000026259226],"about_ca_topic_score_codex":0.0017581525,"about_ca_topic_score_gemma":0.0025115365,"teacher_disagreement_score":0.008609428,"about_ca_system_score_codex":0.00090798433,"about_ca_system_score_gemma":0.0011533969,"threshold_uncertainty_score":0.04553157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0600622,0.0026974254,0.6214445,0.009518778,0.0034827709,0.00018310436,0.0014117219,0.0007504451,0.30044904],"genre_scores_gemma":[0.7451965,0.0035432323,0.15740293,0.004787882,0.003599991,0.0002356842,0.0013022093,0.0008072111,0.08312432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978788,0.00044173904,0.000108545886,0.00050878315,0.0008513643,0.0002108576],"domain_scores_gemma":[0.99316376,0.0032492238,0.00040277594,0.0013778852,0.0014195979,0.00038677553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035386528,0.0010227906,0.0011460454,0.0023147296,0.0013568172,0.0027818205,0.0020187872,0.0010357265,0.013564204],"category_scores_gemma":[0.020366807,0.0005431015,0.0014932844,0.0024023422,0.004036586,0.009580656,0.0051150634,0.0063296836,0.0028821141],"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.000054588672,0.000034239845,0.00079726236,0.000115982904,0.00002285196,0.00017419683,0.0002797456,0.0008845221,0.0023508093,0.9658333,0.009400939,0.0200516],"study_design_scores_gemma":[0.000028313472,0.000048612485,0.0010293957,0.000059209557,0.000037663714,0.0005037187,0.00008641493,0.009376184,0.0023237825,0.9570574,0.029413642,0.000035703117],"about_ca_topic_score_codex":0.0020631528,"about_ca_topic_score_gemma":0.0017160069,"teacher_disagreement_score":0.013564204,"about_ca_system_score_codex":0.0012863912,"about_ca_system_score_gemma":0.0010687552,"threshold_uncertainty_score":0.045376778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015209771,0.00016802253,0.99542576,0.000057726138,0.00004346992,0.000021994447,0.000038039005,0.00014789043,0.0025761526],"genre_scores_gemma":[0.079491735,0.00030917092,0.9144936,0.000096796495,0.00004995408,0.0002622694,0.0002433264,0.00022304263,0.004830071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.00014211393,0.000024136325,0.000042058422,0.00019488316,0.000024371047],"domain_scores_gemma":[0.9993005,0.00037060727,0.000032198044,0.00007224565,0.00020169564,0.000022852917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296003,0.0006322321,0.0009594566,0.0007852385,0.00051860296,0.00075570366,0.0015817839,0.0016477932,0.006006191],"category_scores_gemma":[0.0029564097,0.00037615045,0.00072877615,0.0010650697,0.00047135315,0.0008741436,0.0011088923,0.0014103007,0.0015403037],"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.0001395852,0.00008333337,0.00042325258,0.0002916004,0.000088370914,0.00008166265,0.00009391034,0.7106813,0.0070525217,0.044534814,0.0076450435,0.22888461],"study_design_scores_gemma":[0.0000064554015,0.000007739098,0.000041341864,0.000008076836,0.00000375874,0.000009312815,0.0000037796929,0.9927449,0.00056361937,0.0043732063,0.0022337644,0.0000041136154],"about_ca_topic_score_codex":0.005634148,"about_ca_topic_score_gemma":0.005432593,"teacher_disagreement_score":0.006006191,"about_ca_system_score_codex":0.0005631265,"about_ca_system_score_gemma":0.0011145528,"threshold_uncertainty_score":0.020092666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062824544,0.0034957791,0.9188824,0.00062549097,0.0011777901,0.00007442911,0.000232037,0.0008879901,0.06834164],"genre_scores_gemma":[0.2692778,0.003086289,0.5794027,0.0007740707,0.00078482216,0.00041000213,0.00089235895,0.0008971913,0.14447473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979514,0.00004251179,0.000008642496,0.000045654928,0.00009215094,0.000015858719],"domain_scores_gemma":[0.9996513,0.00017418554,0.00002158189,0.000065785876,0.00006752589,0.000019611594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029147396,0.0007047159,0.0009338484,0.0005878124,0.00031227386,0.0011117815,0.0008504433,0.0013759198,0.019521277],"category_scores_gemma":[0.0020121194,0.00039658937,0.00053046906,0.0007175944,0.000479608,0.000745101,0.0012554963,0.0011299519,0.005145124],"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.00019497136,0.00008730908,0.000361814,0.00031313318,0.000109566434,0.00009564542,0.000041904583,0.34022784,0.004750891,0.07189303,0.04645159,0.53547233],"study_design_scores_gemma":[0.000030504469,0.000027261129,0.000118956275,0.00003772818,0.00001723376,0.000076766526,0.000009376108,0.9593174,0.0010540892,0.0247727,0.014526117,0.000011902271],"about_ca_topic_score_codex":0.0014439201,"about_ca_topic_score_gemma":0.0017232193,"teacher_disagreement_score":0.019521277,"about_ca_system_score_codex":0.00035856105,"about_ca_system_score_gemma":0.0004886001,"threshold_uncertainty_score":0.065305114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013413547,0.0019865013,0.9159065,0.0018837164,0.00091589714,0.00023081504,0.0011233467,0.0022214137,0.06231821],"genre_scores_gemma":[0.22359172,0.0037198763,0.67985106,0.0015556163,0.00065416266,0.00088082213,0.0042773923,0.0047863172,0.080683075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99401975,0.0016922449,0.0004534763,0.0010666897,0.0022769733,0.00049088645],"domain_scores_gemma":[0.99355257,0.003813906,0.00025251374,0.0011293637,0.0011014484,0.0001501953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041306657,0.0023302163,0.0020864527,0.0013927832,0.0014335505,0.004436936,0.0019326758,0.0024837116,0.0261811],"category_scores_gemma":[0.018328493,0.0014202698,0.0039606728,0.0017583962,0.0021533987,0.0050701126,0.00433885,0.0051036933,0.008653061],"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.0008790161,0.00022020581,0.001983503,0.0018848858,0.0004042192,0.0012296463,0.00070269697,0.2556327,0.009495529,0.39943683,0.033767957,0.2943628],"study_design_scores_gemma":[0.00015764995,0.00019771208,0.0006756167,0.00043594895,0.0001522705,0.0005588862,0.00024122513,0.545725,0.011994218,0.33550298,0.10426279,0.000095703006],"about_ca_topic_score_codex":0.0047347913,"about_ca_topic_score_gemma":0.007988882,"teacher_disagreement_score":0.0261811,"about_ca_system_score_codex":0.0017811813,"about_ca_system_score_gemma":0.0026417999,"threshold_uncertainty_score":0.087584496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021297175,0.000054643562,0.99653566,0.000025426281,0.000009364374,0.000025702506,0.000009403536,0.00013161458,0.0010784925],"genre_scores_gemma":[0.10382565,0.00016661466,0.8933922,0.00004311477,0.000024604273,0.00021420285,0.00009344533,0.000109608816,0.002130588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958664,0.00013332172,0.00002033737,0.00006255246,0.00015631593,0.00004081939],"domain_scores_gemma":[0.99935037,0.00038670824,0.000054345644,0.000046168007,0.00013133517,0.000031131265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010086169,0.0008683048,0.0011515394,0.00065488694,0.00043223164,0.0006030196,0.0013014413,0.0009199103,0.003932989],"category_scores_gemma":[0.0019458892,0.0004554257,0.0006746134,0.0008716422,0.0007515288,0.0009848882,0.0012595592,0.0016149883,0.0007503858],"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.00013000371,0.000120544355,0.0003624026,0.00021637707,0.00004051435,0.00011313807,0.00011336629,0.754341,0.004483078,0.063958235,0.0025630924,0.17355812],"study_design_scores_gemma":[0.00001544164,0.000028023213,0.000026930444,0.000007767508,0.0000032384264,0.000026008573,0.0000058543383,0.9928757,0.000626443,0.005537184,0.0008426594,0.0000047922636],"about_ca_topic_score_codex":0.0019981365,"about_ca_topic_score_gemma":0.0015091088,"teacher_disagreement_score":0.003932989,"about_ca_system_score_codex":0.00058176246,"about_ca_system_score_gemma":0.0014553498,"threshold_uncertainty_score":0.013157129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008329158,0.00006494476,0.997928,0.000032871874,0.000016295167,0.000014909911,0.000010593623,0.00006309477,0.0010363881],"genre_scores_gemma":[0.08574077,0.00026424028,0.9098963,0.00008766807,0.00006272834,0.00023998052,0.00014932666,0.00022917452,0.0033297618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.00034559335,0.000029714925,0.0001035137,0.00023604983,0.000069154536],"domain_scores_gemma":[0.9994267,0.0002861288,0.000052575542,0.00007575486,0.00011992318,0.000038953334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018301428,0.0014206303,0.0009981832,0.000778895,0.0004759972,0.00091595366,0.0010508943,0.00103576,0.0033366727],"category_scores_gemma":[0.0023545676,0.0006481419,0.0013674827,0.0007675912,0.00084107404,0.0011582484,0.001650065,0.002133509,0.0009237125],"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.000055559438,0.00006903467,0.00036079698,0.00015700256,0.00007465168,0.00007975906,0.0000903537,0.83346885,0.004533812,0.06357183,0.0030384196,0.094499975],"study_design_scores_gemma":[0.0000067577125,0.00001663351,0.000028290506,0.000008304078,0.000004721699,0.000011779041,0.000006325777,0.9921395,0.00043474653,0.005616552,0.0017221917,0.0000041290277],"about_ca_topic_score_codex":0.0019958217,"about_ca_topic_score_gemma":0.0026989998,"teacher_disagreement_score":0.0033366727,"about_ca_system_score_codex":0.0005634734,"about_ca_system_score_gemma":0.0013556295,"threshold_uncertainty_score":0.011162281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018297986,0.0000825837,0.99688727,0.00005853554,0.000022652266,0.000013955125,0.000005936677,0.00011461381,0.0009846403],"genre_scores_gemma":[0.08253367,0.00030163492,0.91153187,0.00015500546,0.00008748809,0.0001335507,0.000057491012,0.00032164008,0.0048777075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957186,0.00014307242,0.000015749714,0.000057852318,0.00018544211,0.000026043921],"domain_scores_gemma":[0.99966407,0.00013132214,0.000032537355,0.00003828178,0.000099491794,0.00003423731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010287787,0.0006779491,0.0006582243,0.00045050535,0.0002753899,0.00060886727,0.0009298083,0.0009117211,0.001322991],"category_scores_gemma":[0.0017764863,0.00031637988,0.0004992563,0.00030405333,0.0011392876,0.0012286976,0.0011507587,0.0010425826,0.0008269787],"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.00014051281,0.00015060269,0.000991035,0.000527489,0.00012535248,0.0002667163,0.00034286885,0.3509143,0.039639607,0.41950688,0.0057870853,0.18160754],"study_design_scores_gemma":[0.000018061619,0.00008783374,0.00014047789,0.000017668834,0.000009454649,0.00009925841,0.000009465439,0.9698991,0.004269308,0.0196877,0.0057409042,0.000020768543],"about_ca_topic_score_codex":0.0009874607,"about_ca_topic_score_gemma":0.0008315119,"teacher_disagreement_score":0.001322991,"about_ca_system_score_codex":0.00033419605,"about_ca_system_score_gemma":0.0008533087,"threshold_uncertainty_score":0.0054407716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017297852,0.00015825608,0.99631894,0.000099155084,0.000044172226,0.000027882967,0.0000134447755,0.0002177821,0.0013905268],"genre_scores_gemma":[0.11230516,0.00041160212,0.8791249,0.0002354536,0.000119321616,0.0003888391,0.00014912972,0.00044019433,0.0068253903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835086,0.00055103673,0.00009531781,0.00023510102,0.00061272626,0.00015503039],"domain_scores_gemma":[0.99751115,0.0014535286,0.00017406642,0.00036456008,0.00040265283,0.00009406922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023346595,0.0012880898,0.001425059,0.0012143458,0.0007090688,0.0010925455,0.0021427923,0.0015017828,0.006551754],"category_scores_gemma":[0.0113172,0.000623623,0.00096573285,0.0013241954,0.0015929745,0.0021273172,0.0031653575,0.0033294982,0.0016247104],"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.00017368609,0.00013439596,0.000445767,0.00034450472,0.00006605382,0.000105315594,0.00027722868,0.43238097,0.004717562,0.30515426,0.005892334,0.25030786],"study_design_scores_gemma":[0.000031899057,0.000036781654,0.00009560336,0.000023256178,0.000013176332,0.000055413886,0.000020279369,0.9115407,0.0013691833,0.08382036,0.0029720366,0.000021263017],"about_ca_topic_score_codex":0.0033395947,"about_ca_topic_score_gemma":0.0046988563,"teacher_disagreement_score":0.006551754,"about_ca_system_score_codex":0.0014177643,"about_ca_system_score_gemma":0.0016052725,"threshold_uncertainty_score":0.02191776},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018988918,0.005757719,0.10963805,0.0956671,0.7164041,0.0001341469,0.0054682265,0.006077215,0.058954548],"genre_scores_gemma":[0.062450994,0.0072037666,0.18869081,0.032664847,0.08349279,0.00034059334,0.0054449793,0.017048892,0.6026624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962364,0.00080371066,0.00040559447,0.00059954525,0.0016933697,0.00026145868],"domain_scores_gemma":[0.9855547,0.002989331,0.0007484951,0.002611908,0.0075925835,0.0005029063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029520725,0.0025127528,0.0018574125,0.0032281366,0.002203351,0.0032064922,0.0040058238,0.0043559438,0.15636037],"category_scores_gemma":[0.048361864,0.0013144308,0.001812878,0.0030818426,0.0018087554,0.004872219,0.002452972,0.010015367,0.05069291],"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.00006974273,0.000017967956,0.0000741262,0.00018099809,0.000021146729,0.00016680082,0.00004079312,0.0017698696,0.0002823056,0.041326832,0.92948866,0.026560828],"study_design_scores_gemma":[0.00007533715,0.000022262207,0.0004749905,0.0002433126,0.000042434007,0.0005345562,0.00007771356,0.01353486,0.0019495225,0.061679505,0.92126584,0.00009960298],"about_ca_topic_score_codex":0.011646559,"about_ca_topic_score_gemma":0.016979204,"teacher_disagreement_score":0.15636037,"about_ca_system_score_codex":0.003279926,"about_ca_system_score_gemma":0.0033944629,"threshold_uncertainty_score":0.52307755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026279371,0.0010545566,0.95037234,0.00073268096,0.00015914919,0.000100866695,0.00028092318,0.00032597824,0.02069404],"genre_scores_gemma":[0.7271041,0.0008775941,0.2555617,0.00040180987,0.00017406093,0.0004243379,0.00057519425,0.00048953167,0.014391718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951494,0.00020242983,0.000017267717,0.00007829869,0.00009154341,0.000095583695],"domain_scores_gemma":[0.99823016,0.0012374875,0.0001259032,0.0001083621,0.00018266925,0.00011545696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015248292,0.0014595371,0.0016353996,0.0008956779,0.00052548666,0.001591488,0.0016823794,0.0018089957,0.009530558],"category_scores_gemma":[0.006012161,0.0008316677,0.00092403905,0.0012426688,0.00093623425,0.0015796773,0.0021885578,0.0024054388,0.0006555636],"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.000060053404,0.000028633225,0.00011152927,0.00009829685,0.000021999589,0.000033206066,0.000025765052,0.96724665,0.0003204191,0.020657126,0.0016003745,0.00979593],"study_design_scores_gemma":[0.0000071320555,0.000026057365,0.000028530209,0.000010303751,0.000005511141,0.0000074117593,0.00001154247,0.99326044,0.00010301456,0.006042092,0.00049453945,0.0000033822785],"about_ca_topic_score_codex":0.004712251,"about_ca_topic_score_gemma":0.003645831,"teacher_disagreement_score":0.009530558,"about_ca_system_score_codex":0.0010890419,"about_ca_system_score_gemma":0.0012348896,"threshold_uncertainty_score":0.031882823},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012969966,0.101208836,0.048698105,0.101153664,0.52164096,0.00021456406,0.0036866404,0.00091936014,0.22118092],"genre_scores_gemma":[0.025057392,0.052406777,0.015703557,0.02494662,0.43989083,0.00030979296,0.0035793388,0.0022403726,0.4358654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986975,0.00035114476,0.00009244601,0.00029447468,0.0005001446,0.000064199594],"domain_scores_gemma":[0.9933077,0.0021847805,0.00021863324,0.00060147163,0.0030743515,0.0006130973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021677478,0.002500551,0.0017296927,0.00323764,0.0016837503,0.0030632638,0.0014453379,0.0023200025,0.11080101],"category_scores_gemma":[0.014447825,0.0005718251,0.0011562989,0.003209874,0.0012032974,0.0037017602,0.001819,0.0068570464,0.08606704],"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.0000230596,0.000038672737,0.00006204292,0.00030886734,0.000012816828,0.00003019022,0.000028408731,0.0008900329,0.00017343939,0.0156020215,0.94252425,0.0403062],"study_design_scores_gemma":[0.000028410737,0.000087716864,0.000966753,0.0007499291,0.000034032757,0.00013324477,0.000074891526,0.0026112215,0.0004890098,0.0687367,0.9260403,0.000047909278],"about_ca_topic_score_codex":0.0025878365,"about_ca_topic_score_gemma":0.003178381,"teacher_disagreement_score":0.11080101,"about_ca_system_score_codex":0.0028817824,"about_ca_system_score_gemma":0.0019714555,"threshold_uncertainty_score":0.37066633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065238858,0.0007299618,0.98557264,0.0002727262,0.00008654703,0.00008154849,0.00017485682,0.00067849737,0.0058794445],"genre_scores_gemma":[0.1029024,0.0005450828,0.8875598,0.00036868293,0.000100671554,0.0005307754,0.00063064205,0.0005286453,0.006833348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995863,0.00015864278,0.000017547354,0.000051171042,0.00015212229,0.00003425058],"domain_scores_gemma":[0.9993062,0.00039905412,0.00003931987,0.00008611032,0.00012481191,0.00004452751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345116,0.00093250093,0.0011583307,0.0006911702,0.0005575462,0.00082618755,0.0014758321,0.0010520077,0.0074075633],"category_scores_gemma":[0.0026397014,0.00039158703,0.00093037455,0.00082140113,0.00047144594,0.0010079833,0.001380452,0.0013078805,0.0015893823],"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.0002114666,0.00014423548,0.0009699812,0.00062757655,0.00012470642,0.0002640488,0.0001455132,0.6524421,0.006422582,0.032562133,0.020410294,0.28567538],"study_design_scores_gemma":[0.000027829683,0.00002587484,0.0001537978,0.000019120167,0.000008130884,0.000046304332,0.000012015591,0.98261696,0.0007589769,0.0087704845,0.007549894,0.0000106677035],"about_ca_topic_score_codex":0.0052914843,"about_ca_topic_score_gemma":0.009849596,"teacher_disagreement_score":0.0074075633,"about_ca_system_score_codex":0.0004581884,"about_ca_system_score_gemma":0.0012073134,"threshold_uncertainty_score":0.02478081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031789378,0.00037657813,0.96761537,0.00039946803,0.00040614334,0.00004937826,0.00006515954,0.00031389415,0.02759508],"genre_scores_gemma":[0.31749678,0.0011281589,0.6024838,0.0010933552,0.0009233362,0.00083865796,0.00047280805,0.0009905016,0.0745726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948466,0.00017443275,0.000016974802,0.000089560825,0.00020420169,0.000030127276],"domain_scores_gemma":[0.9991918,0.00040711203,0.000057548303,0.00010295034,0.0001968669,0.000043678185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009244397,0.0011052028,0.00080840854,0.0008044553,0.0006345069,0.0012931648,0.0011678581,0.0015171719,0.008554864],"category_scores_gemma":[0.0039473805,0.00037761865,0.0005525948,0.0009207079,0.001327789,0.0012567748,0.0018339622,0.0019409965,0.0022553662],"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.00014635596,0.000093696566,0.00019869625,0.00020606494,0.000039226783,0.00006126696,0.00007715763,0.37808362,0.004699056,0.4732769,0.020262104,0.1228558],"study_design_scores_gemma":[0.000013349316,0.000018690027,0.000029170884,0.000013531505,0.0000044400495,0.000011115459,0.000005058351,0.9346674,0.00065594283,0.06031996,0.004252657,0.000008704545],"about_ca_topic_score_codex":0.0026090876,"about_ca_topic_score_gemma":0.0025472012,"teacher_disagreement_score":0.008554864,"about_ca_system_score_codex":0.0011940269,"about_ca_system_score_gemma":0.0010092258,"threshold_uncertainty_score":0.028618932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006450261,0.00011484942,0.9887412,0.00014555565,0.000032300675,0.000043146276,0.000030379464,0.00012585791,0.0043164734],"genre_scores_gemma":[0.34694678,0.0006146682,0.6366496,0.00012988244,0.00005029674,0.00040387013,0.00024789502,0.00024678448,0.014710242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961394,0.000150099,0.000015303222,0.0000619826,0.00012705628,0.000031694894],"domain_scores_gemma":[0.9994128,0.00023057438,0.0000725154,0.000045166988,0.00017961398,0.000059296417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008272518,0.00064170745,0.0004369171,0.00051762414,0.0007498901,0.0009307607,0.0006955307,0.0008391016,0.00564912],"category_scores_gemma":[0.0023809923,0.00024591238,0.0005559725,0.0005247321,0.0010357867,0.0009865711,0.0011905669,0.0014487029,0.0010126329],"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.00010767738,0.00007634567,0.0011195325,0.00020543965,0.000023402457,0.00031023967,0.00047849907,0.39368275,0.0097801285,0.4979121,0.0058694845,0.09043441],"study_design_scores_gemma":[0.000011851539,0.00012382219,0.00009727381,0.000035900775,0.0000035797784,0.00009172202,0.00003420303,0.94930816,0.0013427878,0.042428747,0.0065054675,0.000016507074],"about_ca_topic_score_codex":0.0020477264,"about_ca_topic_score_gemma":0.0011962998,"teacher_disagreement_score":0.00564912,"about_ca_system_score_codex":0.00086985633,"about_ca_system_score_gemma":0.0010452599,"threshold_uncertainty_score":0.018898189},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018441003,0.00017241505,0.97841793,0.00043144258,0.000036123893,0.000041526597,0.00006849713,0.00029571168,0.0020953736],"genre_scores_gemma":[0.45254382,0.00019749101,0.54384935,0.0001920161,0.000056559893,0.00022029203,0.00025401625,0.00032515443,0.002361255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997352,0.00006706522,0.000013906199,0.000076573066,0.00006294783,0.000044257325],"domain_scores_gemma":[0.99847955,0.0009139745,0.00014996843,0.00012958502,0.00023283518,0.00009413549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012793137,0.0005865157,0.001184315,0.0007467723,0.0005773682,0.0009127963,0.00091586506,0.0012349861,0.0047183153],"category_scores_gemma":[0.007108265,0.00049321086,0.000581493,0.0006015876,0.00077916635,0.0012435373,0.0012736074,0.0018809895,0.00082262774],"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.00016913125,0.000050349514,0.0011995404,0.00028902473,0.000048825794,0.000145948,0.00014262232,0.87214565,0.006298475,0.053026605,0.0032258371,0.06325797],"study_design_scores_gemma":[0.00001360057,0.000037009413,0.00019869264,0.000026024627,0.000007053179,0.000029699382,0.000030711682,0.97604525,0.0018125909,0.020813078,0.0009760804,0.000010306902],"about_ca_topic_score_codex":0.0030932717,"about_ca_topic_score_gemma":0.0022176534,"teacher_disagreement_score":0.0047183153,"about_ca_system_score_codex":0.0007706448,"about_ca_system_score_gemma":0.0013611848,"threshold_uncertainty_score":0.015784323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016418145,0.0001388219,0.9974976,0.000057024954,0.000028477461,0.000014376345,0.0000056234126,0.00006792981,0.0005482998],"genre_scores_gemma":[0.14072236,0.0004932843,0.8548634,0.00012711722,0.000104003266,0.00027461012,0.000102193786,0.00020009068,0.0031128789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00026505665,0.000030775405,0.0000899773,0.00022598296,0.000054429907],"domain_scores_gemma":[0.999138,0.00045151962,0.00006711893,0.00008792638,0.0002028545,0.000052536805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017089369,0.0012324513,0.0019145282,0.0006745745,0.0005194628,0.0010162488,0.0017133655,0.001480186,0.0023010734],"category_scores_gemma":[0.0029431416,0.0005255816,0.00089473586,0.0008826838,0.0012509539,0.0015757348,0.001617094,0.0030202286,0.0009786087],"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.00013857959,0.00015380846,0.00048275935,0.00035404382,0.000068733694,0.00013220077,0.00012503991,0.8123974,0.005751894,0.08387239,0.0028679997,0.093655154],"study_design_scores_gemma":[0.000008355576,0.00001477318,0.000016919583,0.0000043033306,0.0000031142542,0.000015404707,0.0000034099655,0.9955485,0.00035629573,0.0035076719,0.0005174071,0.0000038527746],"about_ca_topic_score_codex":0.0014559895,"about_ca_topic_score_gemma":0.0009993798,"teacher_disagreement_score":0.0023010734,"about_ca_system_score_codex":0.00076412194,"about_ca_system_score_gemma":0.0014141714,"threshold_uncertainty_score":0.009037852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035311505,0.0008447789,0.9578299,0.00095422694,0.00009960509,0.00012798732,0.00010580471,0.00011592039,0.0046102563],"genre_scores_gemma":[0.5385848,0.0015137948,0.4477915,0.00035649797,0.00045603502,0.0009417908,0.0006642656,0.00058591197,0.009105327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973525,0.0013050664,0.00012628411,0.00030821678,0.0007211916,0.00018677863],"domain_scores_gemma":[0.9504051,0.045070104,0.0013523394,0.0009856232,0.0015024317,0.000684458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005319469,0.0015887168,0.0028027778,0.001751362,0.0011683512,0.0035194163,0.0029211836,0.0030145696,0.00479842],"category_scores_gemma":[0.03153826,0.0012448854,0.0021154084,0.001507623,0.0033859597,0.005942607,0.0047562267,0.005908091,0.00038552075],"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.00034052038,0.00024588662,0.001467209,0.0005676322,0.00011042402,0.00014293092,0.00028652386,0.7049926,0.0024672626,0.24884723,0.002803281,0.03772851],"study_design_scores_gemma":[0.000011813207,0.000021182508,0.000081995684,0.000011175937,0.000007036096,0.000011535989,0.000013718663,0.95347637,0.00018318975,0.045985572,0.00018828646,0.000008123388],"about_ca_topic_score_codex":0.004024603,"about_ca_topic_score_gemma":0.003442063,"teacher_disagreement_score":0.005319469,"about_ca_system_score_codex":0.002119149,"about_ca_system_score_gemma":0.0029633713,"threshold_uncertainty_score":0.028132439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008190035,0.00029267042,0.99647456,0.000055481036,0.000023040253,0.000019797642,0.000023550494,0.00009394646,0.0021979997],"genre_scores_gemma":[0.059086,0.0006555921,0.9357455,0.00006807263,0.000040139952,0.0002801864,0.00016604342,0.00009412747,0.0038643328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951875,0.00016516594,0.000023882028,0.000047653608,0.0002212303,0.000023398006],"domain_scores_gemma":[0.9996332,0.00019443608,0.000028139422,0.000038777594,0.00009065741,0.000014820686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064558187,0.000657932,0.00073278684,0.0006531793,0.0005182111,0.0006586227,0.0011198897,0.001036451,0.003392207],"category_scores_gemma":[0.0021847633,0.00025420656,0.000647447,0.00094790396,0.0004788219,0.0006825188,0.0010381993,0.0013570738,0.001016322],"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.00010082815,0.000052799827,0.0006247718,0.00044583328,0.00010390306,0.00017697849,0.00014268575,0.57262,0.010651456,0.092301376,0.008877965,0.31390136],"study_design_scores_gemma":[0.000011568184,0.000018277753,0.000116864496,0.00001900252,0.0000073147794,0.000048192123,0.0000100584275,0.97292966,0.0014472777,0.014994126,0.010387048,0.000010538849],"about_ca_topic_score_codex":0.0041870982,"about_ca_topic_score_gemma":0.0051888,"teacher_disagreement_score":0.0041870982,"about_ca_system_score_codex":0.000572879,"about_ca_system_score_gemma":0.0011880883,"threshold_uncertainty_score":0.011348128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011033643,0.0006245368,0.9694512,0.0006181317,0.00059683184,0.00005702827,0.00005697994,0.0005524089,0.017009245],"genre_scores_gemma":[0.4579857,0.0010423944,0.51278055,0.0002616364,0.00056747743,0.00024758256,0.00020671339,0.00050837774,0.026399491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993893,0.00020397319,0.00002184446,0.000065063374,0.00024013409,0.000079682504],"domain_scores_gemma":[0.9988104,0.0005226254,0.00009005016,0.00019426622,0.00029724702,0.00008548362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001571924,0.0011646942,0.0009139695,0.0008259034,0.00067588506,0.0018121239,0.0012820532,0.0010868441,0.00969281],"category_scores_gemma":[0.0073959706,0.000494998,0.0005601763,0.0010035723,0.0010896454,0.0018048511,0.0020029263,0.0022362545,0.001973905],"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.00046870162,0.00020996116,0.0012615385,0.00026784948,0.000069431815,0.00010391468,0.00013658962,0.4536676,0.0036742059,0.28448054,0.010267211,0.24539256],"study_design_scores_gemma":[0.00002101686,0.000029304316,0.00014018356,0.00001664698,0.000006144821,0.000027692533,0.000010587612,0.97170615,0.0007678643,0.02420995,0.0030580154,0.0000065018094],"about_ca_topic_score_codex":0.0025345688,"about_ca_topic_score_gemma":0.0028623764,"teacher_disagreement_score":0.00969281,"about_ca_system_score_codex":0.00085646316,"about_ca_system_score_gemma":0.0016920295,"threshold_uncertainty_score":0.0324257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096432853,0.00051376235,0.9966929,0.0002443944,0.000037042417,0.000013691299,0.000017862423,0.000025573272,0.0014905524],"genre_scores_gemma":[0.17848447,0.0026680746,0.80842507,0.00061133236,0.0006520837,0.00047256617,0.00027913996,0.00028694983,0.008120381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981687,0.0010062463,0.000078478304,0.00022588315,0.0004302966,0.00009038856],"domain_scores_gemma":[0.99863523,0.00062976574,0.00018877456,0.0001801985,0.00024926846,0.00011670885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036336675,0.002166836,0.0021059487,0.0016143841,0.0007024084,0.0019071157,0.0026603763,0.0027267742,0.0018015262],"category_scores_gemma":[0.0050388477,0.0007721485,0.0021396352,0.0012976663,0.0027319111,0.0028943908,0.0038022231,0.004515977,0.0005318188],"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.00001819585,0.000041707233,0.00023409912,0.00022938478,0.0000822787,0.00008229941,0.00013012653,0.21733089,0.0020573854,0.764206,0.0015732666,0.014014407],"study_design_scores_gemma":[0.000008021611,0.00003188974,0.00006281076,0.000036456968,0.000016692138,0.00004546455,0.000020374,0.8444951,0.00026715445,0.15111238,0.0038875248,0.000016219266],"about_ca_topic_score_codex":0.001484955,"about_ca_topic_score_gemma":0.0017369979,"teacher_disagreement_score":0.0036336675,"about_ca_system_score_codex":0.0011682299,"about_ca_system_score_gemma":0.0016699298,"threshold_uncertainty_score":0.019216895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034785926,0.00012330769,0.9569216,0.0001578922,0.00002603608,0.000081188315,0.00018089985,0.00023113911,0.007492044],"genre_scores_gemma":[0.37444344,0.0001871377,0.62095505,0.00010714128,0.000024351662,0.00024203773,0.00058335124,0.00026783318,0.0031896054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00020736032,0.000042618827,0.00014113463,0.00027301305,0.00017104887],"domain_scores_gemma":[0.9987888,0.000644783,0.00011742831,0.00015345437,0.00022421281,0.000071424736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010917287,0.0009927134,0.0013268705,0.00041265847,0.0005250341,0.0019942466,0.0009330236,0.00078583293,0.005994164],"category_scores_gemma":[0.0037159617,0.000580079,0.0007580655,0.0008754511,0.0007090157,0.0017926431,0.0017094258,0.00219137,0.0007053434],"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.00013933089,0.00013005175,0.00073953246,0.00021755551,0.00003325962,0.00014053997,0.00016132483,0.8283577,0.0052567087,0.07068098,0.0037181312,0.09042487],"study_design_scores_gemma":[0.000015602787,0.00004258799,0.00018120735,0.000019505214,0.0000041965263,0.000055734592,0.00005477284,0.9696483,0.0021048,0.026314376,0.001550897,0.000008046407],"about_ca_topic_score_codex":0.002633101,"about_ca_topic_score_gemma":0.0033814602,"teacher_disagreement_score":0.005994164,"about_ca_system_score_codex":0.0006781611,"about_ca_system_score_gemma":0.0022276423,"threshold_uncertainty_score":0.020052493},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011345585,0.017638525,0.53334177,0.0016871386,0.0018519189,0.00007294388,0.001417107,0.0017699822,0.44108608],"genre_scores_gemma":[0.03942668,0.025131967,0.23393132,0.0010542856,0.0021137928,0.00040212958,0.0031100123,0.002770787,0.69205904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944896,0.000069072375,0.000026990405,0.00011889683,0.00030791148,0.000028212748],"domain_scores_gemma":[0.9996489,0.000089346984,0.000017919296,0.00011022753,0.000112450994,0.000021173979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005970007,0.0019982746,0.0020745432,0.0012180135,0.0005570905,0.002211535,0.0011413618,0.0009923948,0.04924036],"category_scores_gemma":[0.0014388203,0.00073332264,0.00085320626,0.002430944,0.000963837,0.0016920416,0.0016252749,0.0031071128,0.04031733],"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.000022362177,0.000035835023,0.00009304051,0.00030549345,0.000041085095,0.000049365448,0.00004268277,0.020463977,0.0011694483,0.23943627,0.33892694,0.39941353],"study_design_scores_gemma":[0.000015133639,0.000037966587,0.000460659,0.0002121896,0.0000390009,0.00028301147,0.000031916967,0.08701644,0.0021731912,0.27532798,0.63436234,0.000040151714],"about_ca_topic_score_codex":0.0016070205,"about_ca_topic_score_gemma":0.0031028457,"teacher_disagreement_score":0.04924036,"about_ca_system_score_codex":0.0009360402,"about_ca_system_score_gemma":0.00084456074,"threshold_uncertainty_score":0.16472536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024585936,0.00011764044,0.9940712,0.00011607999,0.000047240548,0.00003141247,0.000028665032,0.000069610775,0.0030595462],"genre_scores_gemma":[0.20913182,0.0010023444,0.771729,0.0002355267,0.00019879083,0.0005140937,0.00046559784,0.0010207827,0.015702052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877375,0.0006243937,0.0000508161,0.0001665195,0.0003219585,0.00006258677],"domain_scores_gemma":[0.9965385,0.0019223642,0.000247881,0.00033861998,0.00079050654,0.00016208892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036646156,0.0015039544,0.0016174613,0.0015395492,0.00094850286,0.0031751492,0.0021664712,0.0018216348,0.006702866],"category_scores_gemma":[0.016292969,0.0012017511,0.0013074054,0.0009474169,0.0021500813,0.0031841872,0.0042892545,0.0039080093,0.0021231833],"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.0001706822,0.00013197225,0.0007819242,0.00063011737,0.00006837971,0.00013771791,0.00043005362,0.36082822,0.0047360337,0.49396288,0.008784999,0.12933706],"study_design_scores_gemma":[0.000008517622,0.000022327675,0.00004350104,0.000042804408,0.0000070035185,0.000022159033,0.00003106905,0.9008565,0.0008885043,0.09529483,0.0027721839,0.000010614342],"about_ca_topic_score_codex":0.0013834718,"about_ca_topic_score_gemma":0.0011698507,"teacher_disagreement_score":0.006702866,"about_ca_system_score_codex":0.0008498471,"about_ca_system_score_gemma":0.0019000191,"threshold_uncertainty_score":0.022423327},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048179813,0.0031246026,0.547985,0.0013709294,0.00079997076,0.0010068441,0.07476336,0.2863003,0.07983097],"genre_scores_gemma":[0.042002358,0.006030254,0.6352809,0.0018088829,0.00036044949,0.0054663974,0.1578779,0.110260606,0.04091229],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982256,0.0005389459,0.00015497339,0.00019357214,0.0006699689,0.00021699033],"domain_scores_gemma":[0.9964336,0.0018313396,0.00021987414,0.00044653297,0.0009300442,0.0001385423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026745154,0.0023531176,0.0018074644,0.0019974255,0.00062763505,0.0026470353,0.002873106,0.0012842255,0.07880018],"category_scores_gemma":[0.009249188,0.0012518734,0.0024077732,0.0024974346,0.00045106636,0.0014141923,0.0018357489,0.0033674303,0.052179415],"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.00035920597,0.00023979651,0.0018756101,0.0029151512,0.00037407508,0.00038991845,0.00011206233,0.070032015,0.0033674887,0.039968584,0.70789087,0.17247523],"study_design_scores_gemma":[0.0003938982,0.00013365448,0.0015463047,0.0004330121,0.00015830835,0.0004308351,0.000080461694,0.22516224,0.008448356,0.044501416,0.7185656,0.00014595933],"about_ca_topic_score_codex":0.0038004988,"about_ca_topic_score_gemma":0.0041691316,"teacher_disagreement_score":0.07880018,"about_ca_system_score_codex":0.0007876633,"about_ca_system_score_gemma":0.0034182782,"threshold_uncertainty_score":0.2636128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22722065,0.0033386033,0.7315795,0.0019358349,0.0005255795,0.00013087264,0.0011040915,0.00040733963,0.03375756],"genre_scores_gemma":[0.9276663,0.0023919486,0.055264216,0.00029347138,0.0003017609,0.00015505806,0.0005543964,0.0001521714,0.013220641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995733,0.00014889093,0.000016135446,0.00007396612,0.00010922606,0.00007850215],"domain_scores_gemma":[0.9972012,0.0014952639,0.00055028696,0.00017836601,0.0003662504,0.00020859546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284433,0.0007257364,0.00036726065,0.0016232375,0.00051753485,0.001012533,0.0007112473,0.00092393515,0.008994205],"category_scores_gemma":[0.008914661,0.0004293218,0.000577136,0.0008351846,0.0019721594,0.0015548888,0.00094260206,0.0016984409,0.0018534423],"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.00025589627,0.000086107124,0.0036430005,0.00042385556,0.00008499737,0.0006050688,0.00057795073,0.045169275,0.017972466,0.8764717,0.006071972,0.048637755],"study_design_scores_gemma":[0.000058054105,0.00015789804,0.009828758,0.00012772215,0.00003015049,0.0010726928,0.000247311,0.3445371,0.0033823866,0.6284023,0.011981351,0.0001743191],"about_ca_topic_score_codex":0.0012793709,"about_ca_topic_score_gemma":0.0009364331,"teacher_disagreement_score":0.008994205,"about_ca_system_score_codex":0.00045739723,"about_ca_system_score_gemma":0.0006434145,"threshold_uncertainty_score":0.030088544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0831713,0.00024711151,0.91094726,0.000120951416,0.000032476546,0.000056742552,0.000030252706,0.00010945072,0.005284354],"genre_scores_gemma":[0.74475354,0.00070152286,0.24768126,0.00006289661,0.000034475608,0.00018426424,0.00012879775,0.0002270541,0.0062262625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905044,0.0004725279,0.000044886572,0.00009979932,0.0002256166,0.000106745545],"domain_scores_gemma":[0.9958982,0.0027457336,0.00041236135,0.00029128327,0.00046883605,0.00018356873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036974258,0.0009666225,0.000667057,0.00087147276,0.00040726629,0.0012416815,0.00067168195,0.0006137737,0.0016794844],"category_scores_gemma":[0.012061459,0.00041102932,0.0006608315,0.00039084876,0.0020196664,0.0015418775,0.0017042495,0.0018798099,0.00029182015],"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.0001823851,0.000046108413,0.000872557,0.00012181163,0.00002150831,0.000091536764,0.00039308413,0.7795061,0.008826627,0.18141241,0.00041259144,0.028113239],"study_design_scores_gemma":[0.0000033563254,0.00005706621,0.00009183824,0.000013218447,0.0000019175209,0.000015703703,0.00002521646,0.986791,0.0017934039,0.010694141,0.000507046,0.000006102924],"about_ca_topic_score_codex":0.0012950074,"about_ca_topic_score_gemma":0.0006826828,"teacher_disagreement_score":0.0036974258,"about_ca_system_score_codex":0.00107239,"about_ca_system_score_gemma":0.0007104872,"threshold_uncertainty_score":0.019554079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018996054,0.0002087422,0.9726802,0.00015518027,0.0001632089,0.00013821604,0.0002476035,0.0010020533,0.006408846],"genre_scores_gemma":[0.14016476,0.00030080543,0.8513212,0.00013243615,0.00006929156,0.00031943317,0.0007261288,0.00066437194,0.00630154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976286,0.0009224729,0.00018656772,0.0003914099,0.0006506648,0.00022025376],"domain_scores_gemma":[0.99710935,0.0010789132,0.00015765165,0.0010079544,0.0005113153,0.00013483709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148065,0.0012434302,0.0010789991,0.0008943356,0.0011449291,0.0019415377,0.0007760296,0.0009350486,0.010986415],"category_scores_gemma":[0.010352605,0.00073970476,0.0011126476,0.0011837031,0.001301473,0.0023064679,0.0021994424,0.0019369915,0.004769721],"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.00086752005,0.00020995538,0.001777041,0.00042962006,0.00010562667,0.00034236556,0.0007680068,0.19421937,0.021722332,0.2851778,0.018179143,0.47620127],"study_design_scores_gemma":[0.00020638725,0.00031285008,0.00055184227,0.000109839144,0.00004248923,0.00044393397,0.0002463069,0.5816404,0.02815196,0.33640435,0.05178281,0.00010682893],"about_ca_topic_score_codex":0.0027505844,"about_ca_topic_score_gemma":0.003158297,"teacher_disagreement_score":0.010986415,"about_ca_system_score_codex":0.0004618759,"about_ca_system_score_gemma":0.0015959182,"threshold_uncertainty_score":0.036753237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020499771,0.00078753126,0.9760193,0.0002672634,0.000037126712,0.00004740552,0.000034592704,0.00013667361,0.0021703385],"genre_scores_gemma":[0.2772739,0.0013482777,0.7162822,0.00011180535,0.00016680092,0.00024320805,0.0002666192,0.00024359081,0.0040636295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979802,0.0007978965,0.00014368774,0.00048887107,0.000459995,0.0001292559],"domain_scores_gemma":[0.9932601,0.004628935,0.0006724281,0.00058632856,0.00056187436,0.00029036487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049645766,0.0011570812,0.0018666658,0.0028223577,0.0010918305,0.0029307867,0.002425776,0.0017956995,0.002008205],"category_scores_gemma":[0.019458322,0.0009325552,0.0015654155,0.0018569839,0.0036449945,0.005326157,0.004403979,0.0027877714,0.0005912255],"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.00008927789,0.00005474045,0.0016103587,0.00015107232,0.0000954187,0.00010279724,0.0003703196,0.13688259,0.0015014311,0.78466845,0.0012109501,0.07326265],"study_design_scores_gemma":[0.000023953045,0.000056137975,0.00024855146,0.000037185877,0.000016774053,0.000072925526,0.000064617125,0.4360515,0.000998432,0.5600676,0.0023384143,0.000023983219],"about_ca_topic_score_codex":0.0014477383,"about_ca_topic_score_gemma":0.0009005895,"teacher_disagreement_score":0.0049645766,"about_ca_system_score_codex":0.0015575443,"about_ca_system_score_gemma":0.000950116,"threshold_uncertainty_score":0.026255488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011964825,0.00019488712,0.995372,0.00018122996,0.00011918313,0.000035623798,0.00002937628,0.00010570264,0.0027654464],"genre_scores_gemma":[0.060375303,0.0004106605,0.9311591,0.00022410913,0.00012945267,0.00032499118,0.00011312695,0.00027781617,0.006985461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993461,0.00019089073,0.000029667824,0.00007316951,0.0003233739,0.000036923648],"domain_scores_gemma":[0.9988405,0.0006052021,0.00008460507,0.00013914128,0.00024413118,0.000086458334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015386216,0.00070763694,0.0008405177,0.00090007787,0.0008528047,0.0012885156,0.0016604498,0.0017093283,0.0048650666],"category_scores_gemma":[0.0052144784,0.0004946796,0.00083012495,0.00092329807,0.0016492954,0.001387553,0.0023641922,0.002229605,0.0013663612],"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.00008915985,0.00007948598,0.00060402974,0.00028868043,0.00006233313,0.00015893385,0.00018019888,0.5506617,0.010962402,0.3309979,0.004615994,0.10129917],"study_design_scores_gemma":[0.000018346838,0.000016329288,0.000039714792,0.000026851545,0.000005440021,0.000031589556,0.000010771942,0.96037304,0.0007375463,0.031203723,0.0075280312,0.00000862399],"about_ca_topic_score_codex":0.003423524,"about_ca_topic_score_gemma":0.0035656404,"teacher_disagreement_score":0.0048650666,"about_ca_system_score_codex":0.0008928257,"about_ca_system_score_gemma":0.0016318557,"threshold_uncertainty_score":0.016275287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057454733,0.00009498139,0.9933729,0.00007666254,0.000018251127,0.000027782284,0.000019495616,0.00015205162,0.0004923396],"genre_scores_gemma":[0.22627644,0.00042445242,0.7686644,0.00010213667,0.00008246186,0.00022202195,0.00022518625,0.00035934144,0.0036435237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984628,0.0005770172,0.000083904844,0.00024586212,0.00050814456,0.00012233664],"domain_scores_gemma":[0.99569774,0.0025535559,0.00040486132,0.0005379367,0.00059045333,0.00021548927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003263107,0.0019223675,0.0022435093,0.0016410188,0.0007071482,0.0020631617,0.0017813542,0.0020448081,0.0029396524],"category_scores_gemma":[0.018698545,0.001348454,0.001252477,0.001165325,0.0024758193,0.003150657,0.0043322365,0.004067143,0.0015500622],"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.00023316628,0.000092573326,0.001207822,0.0002776543,0.0000886377,0.00022324313,0.0002997843,0.8155417,0.0040073837,0.09783023,0.002482112,0.07771567],"study_design_scores_gemma":[0.000015041943,0.00005398066,0.00010907535,0.000024378347,0.000007805257,0.000040682673,0.000029042756,0.95068204,0.0020722742,0.04603512,0.0009194307,0.00001122772],"about_ca_topic_score_codex":0.0023583218,"about_ca_topic_score_gemma":0.002328911,"teacher_disagreement_score":0.003263107,"about_ca_system_score_codex":0.0012056603,"about_ca_system_score_gemma":0.0020523397,"threshold_uncertainty_score":0.017257154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05135126,0.00058205664,0.9250839,0.0012168633,0.00008431655,0.000040050643,0.00019972796,0.000091033,0.021350827],"genre_scores_gemma":[0.806893,0.0014893939,0.17899486,0.00054919807,0.00047813568,0.0003208686,0.00043948565,0.00020019224,0.010634787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851567,0.0006552825,0.000047096415,0.00019698562,0.00040964555,0.00017537933],"domain_scores_gemma":[0.9960115,0.002362981,0.00053725427,0.00021945218,0.0005515433,0.0003173209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002734586,0.0010777946,0.0009248503,0.0018359544,0.0007342411,0.0028909373,0.0014169147,0.0010405474,0.004867692],"category_scores_gemma":[0.011228022,0.00038755022,0.0006899471,0.001066383,0.0037374117,0.0035330264,0.003264041,0.0026064087,0.0008410949],"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.00003608842,0.000013001065,0.00030021116,0.000048018577,0.000013416129,0.00007186382,0.000096366566,0.02224662,0.0016091344,0.9658501,0.0012214349,0.008493791],"study_design_scores_gemma":[0.000013408772,0.00006400092,0.00033152028,0.000028688026,0.000008063903,0.00009078123,0.00008456892,0.16625151,0.0011186517,0.8295949,0.002393929,0.000019990048],"about_ca_topic_score_codex":0.0007133197,"about_ca_topic_score_gemma":0.00048796032,"teacher_disagreement_score":0.004867692,"about_ca_system_score_codex":0.001064782,"about_ca_system_score_gemma":0.00047322374,"threshold_uncertainty_score":0.016284108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29369137,0.0005834524,0.6450324,0.00065605633,0.00010850889,0.00006734457,0.00019456659,0.00020773322,0.05945862],"genre_scores_gemma":[0.9272753,0.0004420973,0.05769576,0.00015983997,0.000106093845,0.000095423515,0.00020014192,0.00011508824,0.013910169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995284,0.00010323617,0.000022172193,0.00007943045,0.00018559345,0.00008108928],"domain_scores_gemma":[0.9992623,0.00017642506,0.00015604106,0.000087003056,0.0001706598,0.00014755776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074678904,0.00035508827,0.00033085915,0.0009739403,0.0006871203,0.0020419357,0.0004893237,0.00039965688,0.0040210932],"category_scores_gemma":[0.0018358898,0.00018100548,0.00051998073,0.00050235563,0.0016599576,0.0026450146,0.001286901,0.001375855,0.00041943436],"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.000008638365,0.000009369348,0.00015073833,0.000016843496,0.0000025122827,0.000022341563,0.000059128746,0.0030565471,0.00086268806,0.9907815,0.0004159285,0.0046138642],"study_design_scores_gemma":[0.000010003491,0.00002771224,0.00041155602,0.000021817026,0.0000050565145,0.000116962874,0.00013704502,0.082148,0.0017141782,0.91083586,0.0045595802,0.000012301607],"about_ca_topic_score_codex":0.0006691671,"about_ca_topic_score_gemma":0.000536452,"teacher_disagreement_score":0.0040210932,"about_ca_system_score_codex":0.00071786216,"about_ca_system_score_gemma":0.00052233133,"threshold_uncertainty_score":0.013451874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29005912,0.00021896067,0.69504356,0.00019291908,0.00005166149,0.000057148834,0.00030993065,0.0001745139,0.013892175],"genre_scores_gemma":[0.8814879,0.00026259804,0.11139167,0.00009048744,0.00003603645,0.00009057291,0.00069592934,0.0001142352,0.0058305636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991208,0.00016875935,0.000040199888,0.00013059827,0.0004034693,0.00013613747],"domain_scores_gemma":[0.9972178,0.0013322146,0.00041605235,0.00026711775,0.00040181624,0.000365008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013068179,0.0007210599,0.00071367703,0.0009288096,0.0005157772,0.002328035,0.0012879143,0.0005242115,0.0035397105],"category_scores_gemma":[0.0078697335,0.0005186215,0.00065732654,0.00061477127,0.0013724314,0.0017109343,0.001649067,0.0018630135,0.00033887813],"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.00018809948,0.0001240042,0.002993373,0.00012962295,0.000031666925,0.00018554443,0.00032531578,0.2717571,0.0051520662,0.6957493,0.0018006174,0.021563333],"study_design_scores_gemma":[0.000008470566,0.000046494642,0.00047720628,0.000031793432,0.0000038405005,0.00006175668,0.00012572447,0.87835413,0.0011865018,0.11851279,0.0011784647,0.000012837698],"about_ca_topic_score_codex":0.0020037643,"about_ca_topic_score_gemma":0.0022719954,"teacher_disagreement_score":0.0035397105,"about_ca_system_score_codex":0.0018127268,"about_ca_system_score_gemma":0.00065752206,"threshold_uncertainty_score":0.013152301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40585703,0.0023233776,0.4579425,0.005465195,0.0009547868,0.00021168237,0.0014041926,0.00071013696,0.12513116],"genre_scores_gemma":[0.8451504,0.00074401277,0.11769598,0.0014589545,0.00027937224,0.00012280246,0.0015029701,0.00032034094,0.03272513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978527,0.00036912606,0.000095700794,0.000605563,0.0006250452,0.00045181307],"domain_scores_gemma":[0.9938466,0.002260051,0.0004264173,0.0021451826,0.000531871,0.0007899479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017212394,0.0011277255,0.0014829095,0.0013760095,0.0017951388,0.0037327805,0.0022161715,0.0022829215,0.02570484],"category_scores_gemma":[0.008852408,0.0008977605,0.0016960842,0.0011644929,0.0029593054,0.0058970116,0.0061508464,0.0042032995,0.0021510648],"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.0005560195,0.0002250004,0.0039852867,0.00040352295,0.00012600284,0.0008761407,0.0009086439,0.050952327,0.018498953,0.87773114,0.010897635,0.034839425],"study_design_scores_gemma":[0.000117089025,0.00013316551,0.0018510175,0.00012699534,0.000083113555,0.0006994776,0.00035968478,0.10233305,0.0055997046,0.85791063,0.030721301,0.00006478634],"about_ca_topic_score_codex":0.0028515726,"about_ca_topic_score_gemma":0.004387651,"teacher_disagreement_score":0.02570484,"about_ca_system_score_codex":0.0016730942,"about_ca_system_score_gemma":0.0004854114,"threshold_uncertainty_score":0.085991204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040337335,0.00059139385,0.83781534,0.0006181041,0.0007078933,0.00012456438,0.00083175243,0.000433639,0.11853996],"genre_scores_gemma":[0.55470365,0.0011672209,0.36743987,0.0005470962,0.0003424532,0.00046941263,0.0011549768,0.0011549602,0.07302029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00013537086,0.000023911565,0.00012467417,0.0001579359,0.000067778215],"domain_scores_gemma":[0.9994783,0.00012237478,0.000044569297,0.00011371719,0.00017387922,0.000067202585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004453141,0.0009651732,0.0010317267,0.0010082417,0.0007787799,0.0017626935,0.0010081553,0.00082817586,0.012961257],"category_scores_gemma":[0.002194384,0.0004886441,0.0006007915,0.0009430903,0.0011778398,0.0012759779,0.0020852657,0.0014660389,0.0032210695],"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.00023300404,0.00004603782,0.00037854136,0.00016586558,0.000037748887,0.00012765925,0.00008929236,0.039866343,0.008817251,0.8849128,0.011175175,0.05415035],"study_design_scores_gemma":[0.000116209514,0.00016536213,0.0009233385,0.00007699446,0.00003831477,0.00053808396,0.00017958468,0.29426682,0.011794182,0.6212494,0.070558466,0.000093164206],"about_ca_topic_score_codex":0.0011598145,"about_ca_topic_score_gemma":0.0009424588,"teacher_disagreement_score":0.012961257,"about_ca_system_score_codex":0.00063101307,"about_ca_system_score_gemma":0.0005458559,"threshold_uncertainty_score":0.043359756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027019497,0.00083846063,0.9545357,0.0007365651,0.00007329811,0.000039308634,0.00010561987,0.00010537549,0.016546223],"genre_scores_gemma":[0.65510166,0.001642512,0.31964064,0.00029701163,0.00009900449,0.00030791273,0.00032193147,0.00036016086,0.02222917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977,0.00007684011,0.00001014915,0.000052985582,0.000052860614,0.00003719652],"domain_scores_gemma":[0.99954045,0.00023788451,0.000051078354,0.00003034008,0.00009286685,0.00004737614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111402,0.00094257103,0.0006902747,0.0007617351,0.0004380623,0.0017819953,0.0006476874,0.0008846447,0.0055129435],"category_scores_gemma":[0.0026926384,0.00040026693,0.0005686279,0.00062096806,0.001150099,0.0019279565,0.0013506602,0.0014803375,0.0008101939],"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.00009749138,0.00005318586,0.00079563505,0.00026467818,0.00003629341,0.00020723556,0.00013310897,0.25515342,0.0058618104,0.702154,0.006115502,0.029127717],"study_design_scores_gemma":[0.000009969765,0.0000315043,0.0001714746,0.00003424531,0.000009688227,0.00007061492,0.000053831987,0.8945467,0.001473731,0.10025753,0.0033260104,0.000014737069],"about_ca_topic_score_codex":0.0014373453,"about_ca_topic_score_gemma":0.0011858145,"teacher_disagreement_score":0.0055129435,"about_ca_system_score_codex":0.001018092,"about_ca_system_score_gemma":0.0009652637,"threshold_uncertainty_score":0.01844269},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04669274,0.00066891307,0.9424569,0.00054517726,0.00023404195,0.00012112353,0.0004464731,0.002039162,0.0067954864],"genre_scores_gemma":[0.28405827,0.0005829501,0.7044256,0.0002910635,0.00025252803,0.00034477434,0.0014183185,0.0008055343,0.007820969],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857914,0.0003899037,0.00006620226,0.0002788729,0.00043197192,0.00025393654],"domain_scores_gemma":[0.9962351,0.0015902907,0.00017817265,0.0013704246,0.00036894545,0.00025707218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001753969,0.0014240775,0.0020119348,0.0010905255,0.0007058921,0.0019792758,0.00259421,0.0015918337,0.009547127],"category_scores_gemma":[0.0097055705,0.0007072234,0.0014606426,0.0018761818,0.0015032013,0.0042090956,0.004140135,0.0038072134,0.0028252567],"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.00082604017,0.0004988254,0.0028768545,0.0006462542,0.000118686614,0.00027085602,0.00031919967,0.29367808,0.013301169,0.15674746,0.026839746,0.5038768],"study_design_scores_gemma":[0.000044103825,0.00012976627,0.00038427947,0.000057278794,0.000035663576,0.00016330257,0.00006803868,0.84535134,0.003169077,0.1463275,0.00425328,0.000016411026],"about_ca_topic_score_codex":0.0017403035,"about_ca_topic_score_gemma":0.0030823348,"teacher_disagreement_score":0.009547127,"about_ca_system_score_codex":0.0009382993,"about_ca_system_score_gemma":0.0016735761,"threshold_uncertainty_score":0.031938255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021083055,0.000640963,0.9945663,0.00017077828,0.00007408722,0.00003275561,0.000037508387,0.00008056324,0.00228877],"genre_scores_gemma":[0.11395462,0.0020321547,0.8724006,0.00030265274,0.00023414963,0.0004684353,0.00033369442,0.0003848523,0.0098888455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.0002839125,0.000023778002,0.000060659757,0.00020744815,0.000036252008],"domain_scores_gemma":[0.99890065,0.00065604993,0.00010646807,0.00009557005,0.00019871003,0.000042503867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012815997,0.0012354308,0.0009680925,0.00056892715,0.00045558964,0.0007970379,0.0010553559,0.0013245222,0.003552877],"category_scores_gemma":[0.0031240287,0.0006018597,0.0008988365,0.0006191989,0.0011037798,0.001175977,0.0013241123,0.0016959356,0.0012917011],"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.00006373177,0.00006695039,0.00046718385,0.0005201708,0.000110731955,0.000096879536,0.000120877994,0.757761,0.004462387,0.18424807,0.0039753714,0.04810672],"study_design_scores_gemma":[0.000008488762,0.000016296612,0.00004147215,0.000014104646,0.0000039073807,0.000012613407,0.0000071322524,0.9760548,0.00036898482,0.021063823,0.002403299,0.000005168378],"about_ca_topic_score_codex":0.0026511399,"about_ca_topic_score_gemma":0.0028166373,"teacher_disagreement_score":0.003552877,"about_ca_system_score_codex":0.0006840583,"about_ca_system_score_gemma":0.0012742304,"threshold_uncertainty_score":0.011885583},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011938894,0.0004288458,0.9176652,0.00031126948,0.00017853748,0.00014390847,0.005562492,0.062200636,0.012315216],"genre_scores_gemma":[0.0310345,0.00089775556,0.9005568,0.0007973979,0.00009344672,0.0012345341,0.010965142,0.040167984,0.014252477],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999263,0.00016445828,0.00007833003,0.000110858375,0.0003115413,0.00007181657],"domain_scores_gemma":[0.99699354,0.0019781129,0.00015433578,0.00023116592,0.00054252835,0.00010022671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013982466,0.0016451456,0.0011123271,0.00091546634,0.00038885453,0.0015218932,0.0022407072,0.0014345372,0.120114505],"category_scores_gemma":[0.008248411,0.0009679469,0.0011604505,0.0010341253,0.00051993487,0.0015735076,0.0020675922,0.0032983269,0.038614195],"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.0002847866,0.00019381015,0.0016388743,0.0026263145,0.00023594961,0.00053006026,0.00030422417,0.118263066,0.006819591,0.098769546,0.5151661,0.25516766],"study_design_scores_gemma":[0.00036520828,0.000065711225,0.0005223896,0.00031300422,0.00004837097,0.00047501645,0.00007898668,0.586911,0.011052111,0.0818653,0.31821895,0.000083887295],"about_ca_topic_score_codex":0.0022737603,"about_ca_topic_score_gemma":0.004561565,"teacher_disagreement_score":0.120114505,"about_ca_system_score_codex":0.00056999264,"about_ca_system_score_gemma":0.0021077432,"threshold_uncertainty_score":0.40182304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012110678,0.0005635177,0.97670186,0.0008681507,0.00006956593,0.00015814774,0.00062415295,0.00012677413,0.008777177],"genre_scores_gemma":[0.21242459,0.0012869508,0.7799588,0.00038375167,0.00011971512,0.0006087633,0.000998318,0.00015873204,0.0040603853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831057,0.0007453701,0.00007134969,0.00025279121,0.00048248787,0.0001374305],"domain_scores_gemma":[0.9936718,0.005137011,0.00036287648,0.00032623333,0.00036780667,0.00013435377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020833504,0.0012525271,0.001067469,0.0009477721,0.00071043975,0.0020953156,0.0019184466,0.0015233954,0.0071483506],"category_scores_gemma":[0.008055028,0.00073516497,0.0010783277,0.0025690822,0.0017920152,0.002276215,0.0013872611,0.003647789,0.00055706577],"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.000024997007,0.00004091613,0.00015801081,0.00009349553,0.000018642946,0.00007213876,0.00003948993,0.8832367,0.0003608056,0.10037205,0.0016923342,0.013890419],"study_design_scores_gemma":[0.000019727759,0.000014055349,0.00003785897,0.00001894114,0.000004970389,0.000024910698,0.000026377167,0.9296744,0.00021074373,0.06749413,0.0024680686,0.0000058716882],"about_ca_topic_score_codex":0.008187891,"about_ca_topic_score_gemma":0.008281672,"teacher_disagreement_score":0.008187891,"about_ca_system_score_codex":0.00211242,"about_ca_system_score_gemma":0.0020088675,"threshold_uncertainty_score":0.023913622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004914781,0.00003177945,0.99816376,0.000018368695,0.000011223527,0.000016957123,0.000013380394,0.0007052819,0.000547901],"genre_scores_gemma":[0.041548833,0.00009586149,0.9553952,0.000036508554,0.000029866262,0.0001543759,0.00013182653,0.0004553351,0.0021522203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985808,0.00034630822,0.000099555495,0.00018224977,0.0006783176,0.000112786416],"domain_scores_gemma":[0.9985796,0.00040954578,0.000089518995,0.0003809951,0.00046874591,0.000071537586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001437947,0.0011178816,0.0011618835,0.0006216061,0.0004400438,0.0013077442,0.002897227,0.0014015277,0.0074324347],"category_scores_gemma":[0.00673017,0.00057895464,0.0007698371,0.0010502267,0.0006846804,0.00160591,0.0019391369,0.0021910113,0.0048234165],"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.000241809,0.0001756685,0.0004342649,0.00023444423,0.00009186958,0.00022473336,0.00022371228,0.4176525,0.011658502,0.11662845,0.010869675,0.4415643],"study_design_scores_gemma":[0.000021480566,0.000031436775,0.000033612523,0.000009152393,0.000006273579,0.00003828368,0.0000074865616,0.9849629,0.0028198562,0.007978404,0.004078912,0.000012205233],"about_ca_topic_score_codex":0.003985348,"about_ca_topic_score_gemma":0.0043420214,"teacher_disagreement_score":0.0074324347,"about_ca_system_score_codex":0.0006617766,"about_ca_system_score_gemma":0.0016487412,"threshold_uncertainty_score":0.024863958},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067908373,0.0001956455,0.9901916,0.000064834625,0.000043396678,0.000031235464,0.000027433158,0.00017524023,0.00247978],"genre_scores_gemma":[0.13172957,0.0005937432,0.861372,0.00016145702,0.00011751368,0.0001976067,0.00021890074,0.0004296681,0.0051795603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998906,0.00051271165,0.00004872988,0.00017352728,0.00029515394,0.000063890475],"domain_scores_gemma":[0.9982135,0.000694405,0.0002136503,0.00037102203,0.00038737725,0.00012009535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015928388,0.0011058131,0.000823281,0.0010097538,0.00043111338,0.0012285168,0.0010314535,0.00075774227,0.004207485],"category_scores_gemma":[0.00541541,0.00048702123,0.0009109075,0.00072435796,0.0013779458,0.0013438188,0.0034700623,0.0020860217,0.0013099799],"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.00018661484,0.000103918865,0.0012764157,0.00041086486,0.00006680062,0.00012053696,0.000430786,0.22797626,0.019373957,0.53462976,0.004889974,0.21053416],"study_design_scores_gemma":[0.00003414334,0.00019069178,0.00031278594,0.000058556627,0.00001628879,0.0001632016,0.00007956132,0.85453296,0.0067802197,0.12722272,0.010580246,0.000028619139],"about_ca_topic_score_codex":0.00087785756,"about_ca_topic_score_gemma":0.0008751241,"teacher_disagreement_score":0.004207485,"about_ca_system_score_codex":0.00053262996,"about_ca_system_score_gemma":0.0011400421,"threshold_uncertainty_score":0.014075458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023669675,0.00065427716,0.9903432,0.00053466205,0.00011598839,0.000016644915,0.00003334882,0.00007580966,0.0058591617],"genre_scores_gemma":[0.15854686,0.0024545172,0.8194704,0.00082141574,0.0009711531,0.00024022326,0.00017984169,0.0006806124,0.016634975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822086,0.00079189165,0.000075409895,0.00024711573,0.0005663417,0.00009839478],"domain_scores_gemma":[0.99768674,0.0012866423,0.0001981285,0.00033942066,0.00032239055,0.000166564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003445364,0.0011772251,0.0011389165,0.0017071433,0.0009803744,0.0026388403,0.0018667527,0.0015353967,0.004698611],"category_scores_gemma":[0.007464804,0.0007581324,0.0015611709,0.0011850907,0.004602873,0.005348492,0.0034798027,0.0052666473,0.0012987409],"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.0000064114693,0.0000089403575,0.00007699977,0.00004049218,0.0000074308196,0.000019662833,0.00008900344,0.014837113,0.00036725355,0.97644037,0.0008559986,0.007250321],"study_design_scores_gemma":[0.000007232762,0.000021940192,0.00008219295,0.000025557016,0.000005442919,0.000029303415,0.000031455522,0.17775518,0.0003558877,0.8122687,0.00940353,0.000013566837],"about_ca_topic_score_codex":0.0019162721,"about_ca_topic_score_gemma":0.0020430388,"teacher_disagreement_score":0.004698611,"about_ca_system_score_codex":0.0021840525,"about_ca_system_score_gemma":0.0016923631,"threshold_uncertainty_score":0.01822102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019222426,0.00007568402,0.9955171,0.00004848681,0.000022562703,0.000024805815,0.00001428257,0.00011404952,0.0022609313],"genre_scores_gemma":[0.1926064,0.0005070573,0.8005716,0.00011901481,0.000051684834,0.0003302381,0.0001097574,0.00020384282,0.005500445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.000096011834,0.000013273769,0.000027076576,0.00014880959,0.000019515532],"domain_scores_gemma":[0.99961615,0.00021115463,0.000024127417,0.000033677006,0.00009841521,0.000016543798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005973371,0.00077944295,0.00071061077,0.0009904702,0.00057829043,0.0006529273,0.00093833235,0.00086800376,0.0032366584],"category_scores_gemma":[0.0011475431,0.00048772857,0.00081872393,0.0005796319,0.0005712914,0.0006416374,0.00097084837,0.0010621157,0.0006963452],"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.00003197983,0.000074902935,0.00044478153,0.00023261462,0.000047767015,0.00011590157,0.00011613835,0.8789656,0.01462623,0.041659083,0.0013914815,0.06229343],"study_design_scores_gemma":[0.0000018915856,0.0000058245105,0.000024807307,0.000005308423,0.0000020050916,0.000013515337,0.000003862829,0.9964461,0.00065567065,0.0017035828,0.0011340275,0.0000035021178],"about_ca_topic_score_codex":0.0037000899,"about_ca_topic_score_gemma":0.0029589015,"teacher_disagreement_score":0.0037000899,"about_ca_system_score_codex":0.00043009108,"about_ca_system_score_gemma":0.001194866,"threshold_uncertainty_score":0.010827661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025316168,0.0013699221,0.9544961,0.0007056436,0.00012649539,0.00010530381,0.00026993352,0.00027537486,0.0173351],"genre_scores_gemma":[0.6295315,0.0026431552,0.34830153,0.0010428042,0.00033568396,0.0005360594,0.0011083081,0.00045783204,0.016043102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848783,0.0005549527,0.00006628679,0.00031683702,0.000418812,0.00015520462],"domain_scores_gemma":[0.99723357,0.0018741401,0.0002894617,0.00015460247,0.0002682166,0.00018004738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020997638,0.0017323978,0.0012657999,0.00075340347,0.0007784134,0.0023227602,0.0009496241,0.0014239142,0.0060546254],"category_scores_gemma":[0.006186182,0.0008760248,0.001218339,0.0013713607,0.0022714639,0.002418544,0.002121292,0.003870733,0.00077925547],"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.00013759432,0.00015867414,0.0007976628,0.0003999985,0.00008603932,0.00049647584,0.00022130585,0.5385119,0.0022973367,0.41118184,0.008559188,0.03715198],"study_design_scores_gemma":[0.000025857595,0.00007224069,0.00015583822,0.000050828352,0.000012662883,0.00010191603,0.000045411623,0.7837049,0.00059392495,0.21189734,0.0033175573,0.000021485841],"about_ca_topic_score_codex":0.0026378967,"about_ca_topic_score_gemma":0.0026865746,"teacher_disagreement_score":0.0060546254,"about_ca_system_score_codex":0.0012690979,"about_ca_system_score_gemma":0.0014464498,"threshold_uncertainty_score":0.02025479},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012626644,0.0003860801,0.9920438,0.00015539861,0.000086106775,0.00003052518,0.00004526927,0.00016549732,0.0058247284],"genre_scores_gemma":[0.101101324,0.0012580181,0.87776273,0.00034473688,0.00024264133,0.00040014443,0.00036903538,0.00070294435,0.01781841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999037,0.00039883767,0.0000344717,0.00011555589,0.00033419929,0.00008004087],"domain_scores_gemma":[0.998026,0.0013280615,0.00011765451,0.00016825512,0.00027721515,0.00008285784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958314,0.001447118,0.0017250142,0.001114245,0.0010067486,0.0015876958,0.0017499235,0.0015535125,0.007643895],"category_scores_gemma":[0.0064343577,0.0013170958,0.0009802898,0.001875813,0.001552949,0.0020490696,0.002256114,0.0046899263,0.0021557997],"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.0001465685,0.0001411801,0.00031461474,0.0004429972,0.00008563488,0.000041515148,0.0001683842,0.44911453,0.0017490762,0.32642305,0.016695432,0.20467702],"study_design_scores_gemma":[0.000025371985,0.000026644317,0.00009100132,0.000043210886,0.000011935501,0.000018723496,0.000021481115,0.855278,0.0007310634,0.13594674,0.0077916463,0.000014187063],"about_ca_topic_score_codex":0.005333445,"about_ca_topic_score_gemma":0.008941625,"teacher_disagreement_score":0.007643895,"about_ca_system_score_codex":0.0014632862,"about_ca_system_score_gemma":0.0018970193,"threshold_uncertainty_score":0.025571406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00248406,0.012091819,0.24767843,0.0032252,0.0035149825,0.00004516866,0.00078843744,0.00056923844,0.72960263],"genre_scores_gemma":[0.04105592,0.009769089,0.04482804,0.0006439162,0.0015452434,0.00014062993,0.001017044,0.00059580174,0.90040433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998084,0.000027252154,0.000007865173,0.00003864708,0.00010674393,0.000011101956],"domain_scores_gemma":[0.9998723,0.0000309466,0.0000104526835,0.000025560194,0.00004694098,0.000013752025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030282987,0.0010330515,0.00086683297,0.00066864945,0.00042185027,0.0012675781,0.0005989855,0.0006544817,0.056564685],"category_scores_gemma":[0.00071912684,0.0002773278,0.0005501607,0.0008830143,0.0005621575,0.0010337337,0.0011741141,0.0016206747,0.024878465],"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.00003920672,0.000052372354,0.00018708556,0.0003121059,0.000050120678,0.000052894684,0.000042373656,0.039203864,0.0024454393,0.35976812,0.26742363,0.33042288],"study_design_scores_gemma":[0.00002129515,0.000051158866,0.0006260979,0.00012639174,0.000030013542,0.0002266158,0.000035830908,0.13883242,0.002117891,0.24163726,0.6162634,0.000031726933],"about_ca_topic_score_codex":0.0010176392,"about_ca_topic_score_gemma":0.0014996114,"teacher_disagreement_score":0.056564685,"about_ca_system_score_codex":0.0006077593,"about_ca_system_score_gemma":0.0005213105,"threshold_uncertainty_score":0.18922776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009536438,0.0006008072,0.9808719,0.0005093255,0.00009862323,0.00007190555,0.00006612485,0.00012355705,0.008121203],"genre_scores_gemma":[0.4522651,0.0012676587,0.5386569,0.0007530392,0.00036525668,0.00049031206,0.0004424247,0.00030255684,0.005456728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963315,0.0025442564,0.00008319771,0.00020792159,0.00063675054,0.00019640803],"domain_scores_gemma":[0.99245936,0.0058645993,0.00045357842,0.0004274655,0.0005963925,0.00019857712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066435956,0.0014662839,0.0021512625,0.0012080111,0.00070713874,0.002111383,0.0012708119,0.0015542908,0.003546512],"category_scores_gemma":[0.015708162,0.00075420295,0.0012491328,0.0019142857,0.0017697555,0.0020428416,0.0028230303,0.0034795632,0.00063859567],"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.00010723154,0.000092303526,0.00034086304,0.00014342557,0.000042224463,0.00009684043,0.000057920442,0.87105924,0.0004494743,0.10280728,0.0024224473,0.02238079],"study_design_scores_gemma":[0.00001216902,0.00003378965,0.000034487388,0.000028009772,0.000004017121,0.000016672335,0.000009541904,0.9666918,0.00019769145,0.031920362,0.0010474981,0.0000040053615],"about_ca_topic_score_codex":0.0012614549,"about_ca_topic_score_gemma":0.0009777714,"teacher_disagreement_score":0.0066435956,"about_ca_system_score_codex":0.0010765151,"about_ca_system_score_gemma":0.0013395618,"threshold_uncertainty_score":0.03513509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5974715,0.005263538,0.33561593,0.0026977032,0.000628307,0.001278944,0.0038234447,0.0021065508,0.051114142],"genre_scores_gemma":[0.7209075,0.0019576047,0.26529548,0.00046241167,0.00012552048,0.0009354238,0.0045351433,0.00025670143,0.0055241105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954314,0.0023695584,0.00019717304,0.00044118674,0.0011215836,0.00043906205],"domain_scores_gemma":[0.9785634,0.016282564,0.0011248139,0.0017019385,0.0019979803,0.00032936552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053113787,0.0014423673,0.0009067303,0.001217655,0.0008492991,0.0014913292,0.0015365558,0.0015821515,0.0074863927],"category_scores_gemma":[0.019703934,0.00039693207,0.00074388116,0.0021212446,0.0010102104,0.0028475972,0.0011855542,0.0027267314,0.0008939723],"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.0013286587,0.00623362,0.0025158683,0.0018085694,0.00016876018,0.00015922978,0.00018927697,0.81694317,0.007980171,0.021366619,0.015918622,0.12538745],"study_design_scores_gemma":[0.00013943367,0.00079246995,0.0008200026,0.00006852038,0.00002925759,0.000066859226,0.0002037405,0.98186696,0.0052067144,0.0084989695,0.0022801028,0.000026978016],"about_ca_topic_score_codex":0.0044271355,"about_ca_topic_score_gemma":0.003937241,"teacher_disagreement_score":0.0074863927,"about_ca_system_score_codex":0.0018409665,"about_ca_system_score_gemma":0.0012606845,"threshold_uncertainty_score":0.028089643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07368701,0.0010150537,0.8780104,0.0010408929,0.00013755882,0.00022713096,0.000269527,0.00015707132,0.04545539],"genre_scores_gemma":[0.6287471,0.0014706025,0.36083573,0.0005737856,0.00021004595,0.00061570015,0.00082908175,0.00030995,0.0064079827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995815,0.0021481812,0.00018664442,0.0005895476,0.0009768674,0.0002838317],"domain_scores_gemma":[0.9887912,0.008343331,0.0009002856,0.0006957445,0.00097083993,0.0002986084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062076785,0.00088762015,0.00097458734,0.0011638746,0.00069884415,0.0022532083,0.0015359436,0.00087364484,0.0050915168],"category_scores_gemma":[0.02106586,0.00055931415,0.0008270067,0.0018149725,0.002290077,0.003062773,0.0020618849,0.0038725354,0.000434812],"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.00024088085,0.00025711642,0.00079743343,0.00025439664,0.000028768238,0.00010071878,0.0003021261,0.44464546,0.0018062068,0.4992375,0.0026211222,0.049708344],"study_design_scores_gemma":[0.00005043703,0.000120003766,0.00040874083,0.000048647125,0.000010176057,0.00008185919,0.00011917861,0.78709936,0.00096102036,0.20780334,0.0032782368,0.000019031948],"about_ca_topic_score_codex":0.0013440017,"about_ca_topic_score_gemma":0.0013089429,"teacher_disagreement_score":0.0062076785,"about_ca_system_score_codex":0.001387417,"about_ca_system_score_gemma":0.0012961945,"threshold_uncertainty_score":0.032829702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493969,0.0003380306,0.99002075,0.00015240884,0.000108995046,0.00008525139,0.00007292397,0.00015040528,0.008221947],"genre_scores_gemma":[0.081451446,0.0018677785,0.89717954,0.00039841357,0.00025783342,0.0005403769,0.00047921768,0.0002637832,0.0175616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.00049256,0.000064606174,0.00018001956,0.0004459884,0.00011182552],"domain_scores_gemma":[0.99936205,0.0002765739,0.000050281174,0.000077840996,0.00019379954,0.00003940928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017860392,0.001613562,0.0011586435,0.0011969843,0.0005970499,0.0017497828,0.0013479039,0.0013433754,0.010858186],"category_scores_gemma":[0.002574943,0.00074301753,0.0013729432,0.0010688824,0.00080249336,0.0014043307,0.0016544226,0.003027245,0.0027163685],"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.00011737569,0.00011257303,0.00048251322,0.00043512086,0.00014794283,0.00012201055,0.00011582571,0.46112996,0.004025216,0.27601779,0.017590066,0.23970358],"study_design_scores_gemma":[0.000044825665,0.000050911254,0.00010451423,0.00006292021,0.0000309049,0.00009727018,0.0000259558,0.91781443,0.0023030725,0.04938286,0.030058816,0.00002349489],"about_ca_topic_score_codex":0.0019333893,"about_ca_topic_score_gemma":0.0013240466,"teacher_disagreement_score":0.010858186,"about_ca_system_score_codex":0.0008209375,"about_ca_system_score_gemma":0.0018937476,"threshold_uncertainty_score":0.036324203},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674416,0.0022312524,0.57249373,0.0028765136,0.00041830298,0.00014020324,0.000517908,0.00036891707,0.15351155],"genre_scores_gemma":[0.85328996,0.001072755,0.10738699,0.0002709371,0.00030398087,0.00022470989,0.00046417722,0.00037397415,0.0366126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864954,0.0003294492,0.000067458735,0.00019704942,0.0006089471,0.00014756857],"domain_scores_gemma":[0.9954423,0.002857989,0.00031213198,0.00045831533,0.0005803934,0.0003489119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015731668,0.00088268454,0.0013320785,0.0020556443,0.0016249694,0.0033384487,0.0021022623,0.0015631707,0.008517413],"category_scores_gemma":[0.008662946,0.0005534368,0.0014559424,0.0015705043,0.005276724,0.007422469,0.0033915075,0.005912353,0.0009079636],"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.000022069602,0.000007379557,0.00009462423,0.000021038486,0.0000039695915,0.000017940474,0.00006904829,0.0041571716,0.00026587062,0.9911345,0.00076266984,0.0034436597],"study_design_scores_gemma":[0.0000058577175,0.00000927314,0.000099240126,0.0000066203916,0.0000032094335,0.00003779764,0.000026990918,0.02458982,0.00031473336,0.9736839,0.0012116239,0.000010806838],"about_ca_topic_score_codex":0.0014081709,"about_ca_topic_score_gemma":0.0013818278,"teacher_disagreement_score":0.008517413,"about_ca_system_score_codex":0.0024380463,"about_ca_system_score_gemma":0.0011670681,"threshold_uncertainty_score":0.028493583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009264351,0.0010999145,0.93427503,0.0013883491,0.00024303186,0.000036702124,0.00015515991,0.00004678608,0.05349073],"genre_scores_gemma":[0.57509387,0.004715377,0.33077776,0.001035777,0.0011039473,0.00043993472,0.00071319507,0.0002973045,0.08582283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933004,0.00028146096,0.00002866926,0.000080871716,0.00022270765,0.00005632865],"domain_scores_gemma":[0.99842346,0.00089576124,0.00012833219,0.00007152305,0.00036542022,0.00011555423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015258873,0.0010521971,0.0008025882,0.0009097058,0.00058110384,0.0022489897,0.0012332276,0.0012467775,0.0058942754],"category_scores_gemma":[0.0047270656,0.00046897714,0.00066375843,0.0011411693,0.001892832,0.0024421122,0.0017211975,0.0025912088,0.0006960671],"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.000014757863,0.000019133933,0.00006873789,0.000060367114,0.000011565145,0.000028058352,0.0000598379,0.049103368,0.00037670735,0.93893564,0.0023502384,0.0089714965],"study_design_scores_gemma":[0.0000067660135,0.000019325786,0.00007362957,0.000025603338,0.0000071195195,0.000031916727,0.000043406122,0.34200224,0.00019360513,0.6531075,0.004477619,0.0000112457865],"about_ca_topic_score_codex":0.002687897,"about_ca_topic_score_gemma":0.0025358638,"teacher_disagreement_score":0.0058942754,"about_ca_system_score_codex":0.0012660946,"about_ca_system_score_gemma":0.0012540844,"threshold_uncertainty_score":0.01971829},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050367154,0.0041199545,0.92762935,0.0009879714,0.0008682254,0.000046697533,0.000087481756,0.000109718334,0.061113887],"genre_scores_gemma":[0.30971214,0.010649657,0.61301005,0.0017436874,0.002363833,0.0004726286,0.0005557095,0.00071523676,0.060777098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852425,0.0009488982,0.000038638802,0.00009748073,0.00033139042,0.000059325113],"domain_scores_gemma":[0.9986865,0.0009556242,0.00006229364,0.00011415268,0.00013037452,0.000051059495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028656104,0.0013891034,0.0015610482,0.00087156205,0.0005223465,0.0023411268,0.0014378156,0.0012572674,0.00593755],"category_scores_gemma":[0.0064607435,0.0006633239,0.0013715684,0.0019353044,0.0019044816,0.0026620885,0.002831408,0.0045471042,0.0011596405],"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.00006367194,0.000069797694,0.00012276658,0.00026122903,0.000042314827,0.00007860321,0.00007720626,0.084194705,0.00081024406,0.85647875,0.009520183,0.04828047],"study_design_scores_gemma":[0.000012761986,0.00004403341,0.00007652214,0.000094013674,0.000011252108,0.000073297495,0.000023523893,0.3046296,0.00032028178,0.68263936,0.0120636085,0.000011667404],"about_ca_topic_score_codex":0.0004937316,"about_ca_topic_score_gemma":0.0005128302,"teacher_disagreement_score":0.00593755,"about_ca_system_score_codex":0.0008983921,"about_ca_system_score_gemma":0.00072532846,"threshold_uncertainty_score":0.019863069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026810241,0.00005135016,0.9940925,0.00008761179,0.000024734249,0.00003779419,0.000058771497,0.0008210477,0.0021451232],"genre_scores_gemma":[0.07899488,0.000083869185,0.91645443,0.000097472905,0.000028980876,0.0002766402,0.00028231362,0.00037496796,0.0034064746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955446,0.000115436276,0.000020307409,0.000050052193,0.0002258605,0.000034007535],"domain_scores_gemma":[0.99888414,0.0005774074,0.000088357745,0.0001416275,0.00024897064,0.000059520506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009311931,0.0010339962,0.0007728338,0.00057236163,0.00065941067,0.0008610065,0.0013903824,0.001315572,0.0059025628],"category_scores_gemma":[0.002726542,0.00058198324,0.0007613915,0.00080396334,0.0006577057,0.0007686771,0.0014755841,0.0015087877,0.0016738964],"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.000039126953,0.000057284688,0.00030512482,0.00010097718,0.000029824781,0.000110003435,0.000060658313,0.9115277,0.002642658,0.01158706,0.003948974,0.06959064],"study_design_scores_gemma":[0.000011515009,0.000011627944,0.00003392622,0.0000047244166,0.0000021893773,0.000013397857,0.0000036794422,0.99578166,0.00041116297,0.0022077707,0.0015145061,0.0000039769084],"about_ca_topic_score_codex":0.0072961375,"about_ca_topic_score_gemma":0.01132567,"teacher_disagreement_score":0.0072961375,"about_ca_system_score_codex":0.00047260616,"about_ca_system_score_gemma":0.0017859703,"threshold_uncertainty_score":0.019746006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033746008,0.00018908431,0.9940858,0.000076073,0.00018138734,0.000030922558,0.000018966775,0.00015139907,0.001891726],"genre_scores_gemma":[0.12964907,0.00042015483,0.85339147,0.00028041302,0.00027767575,0.00031653675,0.00014404365,0.00025369928,0.015266875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996271,0.00011685507,0.000019543608,0.000058179023,0.00015878852,0.000019465298],"domain_scores_gemma":[0.9996075,0.0001438205,0.000032856024,0.000043533677,0.00012800226,0.000044338736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064026,0.0007870072,0.0010305896,0.00063510746,0.00046556818,0.0008214176,0.001227643,0.0016665253,0.0041710623],"category_scores_gemma":[0.0010404305,0.0004276178,0.0006947632,0.00075518066,0.0006764083,0.0010399623,0.0016385604,0.0007735003,0.0015954624],"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.00057631516,0.00027915995,0.0012630641,0.0007060178,0.0003909387,0.00039418467,0.00015353982,0.4267398,0.06385183,0.095773295,0.010552003,0.39931983],"study_design_scores_gemma":[0.00004093607,0.00008605075,0.00012325904,0.000008708355,0.000023204815,0.00012568546,0.0000053354024,0.987183,0.0023057647,0.005285826,0.004786541,0.000025697762],"about_ca_topic_score_codex":0.0006275824,"about_ca_topic_score_gemma":0.00083152065,"teacher_disagreement_score":0.0041710623,"about_ca_system_score_codex":0.00019743184,"about_ca_system_score_gemma":0.00065373676,"threshold_uncertainty_score":0.013953626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012691993,0.00023881962,0.9945075,0.0003083416,0.00023697194,0.000026967064,0.000019915236,0.00012796423,0.0032642945],"genre_scores_gemma":[0.14436415,0.00082208804,0.83659214,0.00070768566,0.0012733175,0.0003132677,0.00014866535,0.0007363122,0.015042436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969043,0.0012263505,0.00017750174,0.0004367565,0.0010533568,0.00020157557],"domain_scores_gemma":[0.99689084,0.0013088993,0.00015591725,0.0007634279,0.0007452732,0.00013566818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851099,0.001998225,0.003002143,0.0014995541,0.0010321027,0.0024690023,0.0034138188,0.0030740292,0.007831895],"category_scores_gemma":[0.013452939,0.0009346419,0.002273454,0.001475865,0.0020793898,0.0043421863,0.0038497366,0.0050899424,0.0019396133],"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.0001781077,0.00015553951,0.00037845975,0.00033589618,0.00021905887,0.0001222722,0.00018060548,0.24458943,0.0057774736,0.62039053,0.009343829,0.11832886],"study_design_scores_gemma":[0.000026205189,0.00007290001,0.000115663075,0.000019820143,0.000028492215,0.00006965647,0.000011979202,0.858978,0.0012805966,0.13383773,0.005526369,0.000032574462],"about_ca_topic_score_codex":0.0024694977,"about_ca_topic_score_gemma":0.0029449528,"teacher_disagreement_score":0.007831895,"about_ca_system_score_codex":0.001134847,"about_ca_system_score_gemma":0.0020738156,"threshold_uncertainty_score":0.026200294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078718085,0.00025998533,0.98893166,0.00013044263,0.00013099039,0.000054354903,0.000017366247,0.00009086913,0.002512561],"genre_scores_gemma":[0.34331167,0.0007820265,0.6461412,0.00028450252,0.00024084562,0.00035526697,0.00014177662,0.00026118883,0.008481441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.00029058615,0.000032259184,0.00009358018,0.0003072291,0.000050875653],"domain_scores_gemma":[0.9977264,0.0011806473,0.0001690679,0.00016640882,0.000637899,0.00011974632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020771774,0.0009015005,0.0010703722,0.0009551712,0.0004890714,0.001147319,0.0014551377,0.0016182545,0.0030847345],"category_scores_gemma":[0.006773702,0.00046157307,0.0005639494,0.00089076505,0.0014812046,0.001721931,0.0019045179,0.0012734819,0.0006850293],"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.00032197448,0.0001146073,0.00091266265,0.00046965355,0.00011372898,0.0001466918,0.00013164323,0.8027891,0.012579889,0.09995722,0.0032146028,0.07924832],"study_design_scores_gemma":[0.000012374273,0.000026695057,0.000050945084,0.000006455216,0.0000059896593,0.000023235907,0.0000037357822,0.9966987,0.0006260621,0.0020495001,0.00048968045,0.000006644628],"about_ca_topic_score_codex":0.00204543,"about_ca_topic_score_gemma":0.0015092008,"teacher_disagreement_score":0.0030847345,"about_ca_system_score_codex":0.00057181745,"about_ca_system_score_gemma":0.0014652677,"threshold_uncertainty_score":0.010985315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012617774,0.000096436466,0.99725807,0.000050122995,0.00002366162,0.000015505464,0.000012031285,0.00010348166,0.0011788456],"genre_scores_gemma":[0.12009201,0.00036239793,0.87552994,0.00012432826,0.00007156422,0.00025087185,0.00017692614,0.00011367764,0.0032783793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990313,0.00028555497,0.00004659175,0.00012124484,0.00043511347,0.00008015537],"domain_scores_gemma":[0.99886703,0.0006412803,0.00006743052,0.000098250624,0.00029262452,0.00003355595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014130009,0.00088230195,0.00096645043,0.00063361647,0.0005687583,0.0009940137,0.0011304041,0.0011574086,0.0031452973],"category_scores_gemma":[0.0044354517,0.0003804258,0.0007204054,0.0011126805,0.00070252415,0.0012175193,0.0010855001,0.0019943481,0.0009490268],"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.00010390508,0.000062849525,0.00036770472,0.00014006098,0.000050033905,0.00006455231,0.00009109753,0.7361421,0.0021346079,0.071315154,0.004132532,0.18539536],"study_design_scores_gemma":[0.000009494399,0.000016933282,0.000026459238,0.000006362456,0.000003484264,0.000019489049,0.0000065702093,0.99070835,0.00027218676,0.007713127,0.0012143407,0.0000032065318],"about_ca_topic_score_codex":0.0033251892,"about_ca_topic_score_gemma":0.0030222118,"teacher_disagreement_score":0.0033251892,"about_ca_system_score_codex":0.00072320056,"about_ca_system_score_gemma":0.0014475385,"threshold_uncertainty_score":0.010522127},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005362128,0.0008346167,0.9746746,0.0003182519,0.00009403059,0.00007690906,0.00005639283,0.00013025507,0.018452862],"genre_scores_gemma":[0.3138809,0.0016008145,0.6495882,0.00049198105,0.00025062298,0.0010199505,0.00025060336,0.00026061625,0.032656286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999665,0.00016273692,0.000009710762,0.00003564775,0.000109376175,0.000017577113],"domain_scores_gemma":[0.99951017,0.00033924967,0.00003484674,0.000032109452,0.00006461197,0.000019079147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190107,0.0006010423,0.0006310407,0.00066471775,0.00024516557,0.0008831683,0.0007039731,0.0007423911,0.005611888],"category_scores_gemma":[0.0029321287,0.00037124383,0.00053723616,0.0005415843,0.000733997,0.0005808846,0.0014255071,0.0008539618,0.0009066456],"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.00006162917,0.000037924412,0.0004058637,0.00023899827,0.00005946534,0.000093498944,0.000063840576,0.7298309,0.001767945,0.17126958,0.00626938,0.089900956],"study_design_scores_gemma":[0.000014083204,0.000016712964,0.00005422178,0.000020241538,0.0000032644016,0.00001550854,0.000005959878,0.96707356,0.00020115118,0.029232124,0.003359172,0.0000039332067],"about_ca_topic_score_codex":0.0020163015,"about_ca_topic_score_gemma":0.0020267372,"teacher_disagreement_score":0.005611888,"about_ca_system_score_codex":0.0005604073,"about_ca_system_score_gemma":0.000595093,"threshold_uncertainty_score":0.018773675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017108988,0.0004149188,0.9911396,0.00035370677,0.00019998799,0.000045989647,0.000060512648,0.00007478638,0.005999537],"genre_scores_gemma":[0.048428845,0.00093007763,0.93178815,0.000600992,0.00036127173,0.00046639144,0.00016146689,0.0003192765,0.016943563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932694,0.00026630497,0.000029742045,0.0001045207,0.00023449905,0.00003803307],"domain_scores_gemma":[0.9992298,0.0004499581,0.000049953498,0.00005994288,0.00015500624,0.000055442015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014224463,0.0012247604,0.0009897763,0.0009781067,0.00051933754,0.001173323,0.0015012495,0.0023001693,0.007483516],"category_scores_gemma":[0.0031467464,0.00056514074,0.0010920158,0.0010755074,0.0011669548,0.0018238887,0.002521556,0.002431144,0.0015554522],"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.00013135502,0.00011859018,0.0006112766,0.00062290457,0.00010234605,0.00033238193,0.00017757172,0.56506205,0.008328074,0.3083981,0.010968935,0.105146356],"study_design_scores_gemma":[0.000032207758,0.00003589651,0.0000625474,0.000039839753,0.000008969165,0.00006323769,0.000011007606,0.9633544,0.00064921257,0.024250675,0.011472711,0.000019307217],"about_ca_topic_score_codex":0.0032994556,"about_ca_topic_score_gemma":0.0029081174,"teacher_disagreement_score":0.007483516,"about_ca_system_score_codex":0.00064825494,"about_ca_system_score_gemma":0.0012151656,"threshold_uncertainty_score":0.025034845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045606587,0.00021147239,0.9889938,0.00028731595,0.00005719709,0.000023110066,0.00007990347,0.00006722466,0.0057193055],"genre_scores_gemma":[0.5419098,0.00084915065,0.43764666,0.0003391629,0.00018515141,0.00031561824,0.00068960444,0.00037471662,0.017690146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925965,0.00022818329,0.000028803657,0.000094690666,0.00033858424,0.000050036095],"domain_scores_gemma":[0.9986143,0.0009359624,0.000078593046,0.00007850039,0.00023438189,0.00005818657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013812549,0.000907257,0.001303158,0.0008430033,0.00056861574,0.0015906389,0.001064412,0.00093162304,0.006207695],"category_scores_gemma":[0.0041574477,0.0005060302,0.0008497904,0.001010825,0.0012697466,0.0012886985,0.0018277968,0.0020547456,0.000735847],"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.00011372746,0.00007893223,0.0003271394,0.00019946013,0.000042714026,0.00003479106,0.000049632225,0.7104136,0.0014474207,0.2242313,0.0042994265,0.058761947],"study_design_scores_gemma":[0.000007368659,0.000013242933,0.000029155035,0.0000070968663,0.000003185198,0.000005485299,0.00000428174,0.95218563,0.0001923407,0.046884976,0.0006638697,0.0000033624563],"about_ca_topic_score_codex":0.0036842157,"about_ca_topic_score_gemma":0.004068246,"teacher_disagreement_score":0.006207695,"about_ca_system_score_codex":0.0015174847,"about_ca_system_score_gemma":0.0013491529,"threshold_uncertainty_score":0.020766854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18366678,0.0008391143,0.80381286,0.0027406444,0.00010042592,0.00035534066,0.0013072795,0.0016980442,0.0054794075],"genre_scores_gemma":[0.8787848,0.00031257115,0.11557464,0.000732747,0.0002798632,0.00046066192,0.0020044083,0.0005218582,0.0013285541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9553638,0.019131687,0.003233424,0.0077832267,0.011191515,0.0032963692],"domain_scores_gemma":[0.6067125,0.3154538,0.019012308,0.046569657,0.008575822,0.003675965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02133064,0.0020150123,0.003674462,0.00320947,0.0018008266,0.006355049,0.0057983138,0.0040410417,0.0033073197],"category_scores_gemma":[0.18969029,0.0014346603,0.0033217978,0.0037531718,0.012978465,0.018230444,0.00981173,0.0071237925,0.000879251],"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.005108145,0.00057609845,0.03326572,0.00060020783,0.0008032098,0.0011219573,0.0014154899,0.49232283,0.0155121125,0.33324328,0.008112147,0.1079188],"study_design_scores_gemma":[0.00011098947,0.00026782975,0.002258579,0.000053685642,0.000061731895,0.0004072099,0.00020781395,0.7903399,0.0064933007,0.19879171,0.0009370585,0.000070253926],"about_ca_topic_score_codex":0.0028950886,"about_ca_topic_score_gemma":0.0014219948,"teacher_disagreement_score":0.02133064,"about_ca_system_score_codex":0.0038234189,"about_ca_system_score_gemma":0.0027185034,"threshold_uncertainty_score":0.112808526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005357044,0.00047679103,0.9906679,0.00044210095,0.00010134703,0.000018423534,0.00007871717,0.000255084,0.0026024883],"genre_scores_gemma":[0.3295675,0.003116609,0.6154026,0.00037387127,0.0008913983,0.00030141755,0.0010002147,0.0007893703,0.048557047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990012,0.0003690624,0.00003372473,0.0002984882,0.00022394248,0.00007372566],"domain_scores_gemma":[0.99823546,0.0009530693,0.00018137784,0.00024467343,0.00027371466,0.00011172073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015473554,0.0011542322,0.0016664085,0.0007466698,0.00064139377,0.0028306623,0.0013812614,0.0022032075,0.008273198],"category_scores_gemma":[0.0059924005,0.000998725,0.0012549082,0.0016155211,0.0009746008,0.002556604,0.0020302883,0.0022415272,0.0020235963],"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.000049902745,0.000069256406,0.0008529524,0.00015067268,0.00009523111,0.000072012524,0.00009149923,0.8123286,0.0021549538,0.09096169,0.008753294,0.08441991],"study_design_scores_gemma":[0.000005875114,0.00001410936,0.00017934892,0.000008694729,0.000008512624,0.000013693139,0.000010635344,0.9551485,0.00037183744,0.03969068,0.004540268,0.000007824566],"about_ca_topic_score_codex":0.010266945,"about_ca_topic_score_gemma":0.0072635375,"teacher_disagreement_score":0.010266945,"about_ca_system_score_codex":0.001263634,"about_ca_system_score_gemma":0.0011978335,"threshold_uncertainty_score":0.027676582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1373593,0.0061400943,0.80496293,0.0034271951,0.00045314562,0.000116141586,0.00048412915,0.0021686666,0.044888463],"genre_scores_gemma":[0.6811439,0.0023866585,0.29632133,0.00053774,0.00016259331,0.00020163327,0.00088951155,0.0011129424,0.017243706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979152,0.000854413,0.00009971615,0.0002839728,0.0006352429,0.00021149285],"domain_scores_gemma":[0.96757287,0.02338451,0.0015667325,0.0031767192,0.003130829,0.0011684691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008285879,0.0009476741,0.0009093873,0.0020586133,0.0010550885,0.0020773138,0.0023682432,0.0016942347,0.0049070865],"category_scores_gemma":[0.053136326,0.0004948164,0.0009977692,0.0013057466,0.0022423838,0.0034147792,0.0026868863,0.003480132,0.00114106],"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.0011069915,0.0002975049,0.00963584,0.0013190011,0.00025662748,0.0004847743,0.0011288547,0.3574616,0.017167022,0.46451187,0.016520448,0.13010935],"study_design_scores_gemma":[0.000022379701,0.000073764575,0.0015044507,0.00018609627,0.0000451465,0.00025098075,0.00010338928,0.95413965,0.0053973696,0.034123555,0.004122795,0.000030344805],"about_ca_topic_score_codex":0.0048354617,"about_ca_topic_score_gemma":0.0034442556,"teacher_disagreement_score":0.008285879,"about_ca_system_score_codex":0.0019028063,"about_ca_system_score_gemma":0.0018371161,"threshold_uncertainty_score":0.04382044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025549305,0.00010209785,0.99528116,0.00013063321,0.00007299242,0.00003310888,0.00007455163,0.00034450603,0.0014061134],"genre_scores_gemma":[0.06540541,0.00017160957,0.9274655,0.00024049277,0.00007432016,0.00023676701,0.0002924304,0.00075769343,0.0053557362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999065,0.0004580113,0.000036678954,0.000094989475,0.00030071393,0.000044642307],"domain_scores_gemma":[0.998151,0.00093536585,0.00014915469,0.00020839268,0.0004365052,0.00011951679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001914131,0.0012646754,0.001384643,0.00081093464,0.0005450306,0.0013005784,0.001679889,0.0029410224,0.0048416723],"category_scores_gemma":[0.0060830642,0.0007706798,0.0006252257,0.00084784365,0.0011583759,0.0012869616,0.0019277353,0.0022440956,0.0019194119],"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.00045275156,0.00012610981,0.0007008556,0.00039610843,0.00013677448,0.00016377024,0.0001918757,0.74637693,0.011902455,0.11662826,0.012890316,0.1100338],"study_design_scores_gemma":[0.000012288563,0.000016353273,0.000031976466,0.0000121264275,0.00000348833,0.000013695724,0.000003931877,0.99156183,0.0007180654,0.0060154335,0.0016040184,0.000006758713],"about_ca_topic_score_codex":0.0035621754,"about_ca_topic_score_gemma":0.004486668,"teacher_disagreement_score":0.0048416723,"about_ca_system_score_codex":0.0005824299,"about_ca_system_score_gemma":0.0017249705,"threshold_uncertainty_score":0.016197026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01616641,0.00025156318,0.9807767,0.00034041575,0.000056938385,0.000020096006,0.00001430367,0.00011000383,0.0022635644],"genre_scores_gemma":[0.63489085,0.00050581445,0.3580291,0.00019930008,0.00013456284,0.000121474215,0.00006995363,0.00026255992,0.0057863197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989427,0.0005721984,0.000026820866,0.00010679736,0.00028623088,0.000065242275],"domain_scores_gemma":[0.9972474,0.0018405458,0.00021094416,0.0002856228,0.0003346898,0.00008085911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026196912,0.0008186459,0.0010111358,0.00047941966,0.0003467749,0.0013523367,0.00071788917,0.0008510525,0.0017472984],"category_scores_gemma":[0.009643325,0.00040881286,0.00038216656,0.00062962866,0.0017071035,0.0012163913,0.0013881895,0.0014706594,0.0004660195],"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.000110512236,0.000028027487,0.00025068785,0.00010196246,0.00003527881,0.000053823016,0.000058405327,0.8590746,0.0037811012,0.103545606,0.001602756,0.03135725],"study_design_scores_gemma":[0.0000066282923,0.000019119261,0.000034995883,0.0000048426054,0.0000019805311,0.0000068307836,0.0000034395327,0.98491955,0.0008862377,0.013771449,0.00034109165,0.0000038585504],"about_ca_topic_score_codex":0.0016035403,"about_ca_topic_score_gemma":0.0012856268,"teacher_disagreement_score":0.0026196912,"about_ca_system_score_codex":0.00079295837,"about_ca_system_score_gemma":0.0010651422,"threshold_uncertainty_score":0.013854444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046251738,0.02967673,0.8318433,0.03577402,0.0063392017,0.000107687105,0.000598185,0.0002724519,0.09076332],"genre_scores_gemma":[0.15062216,0.02912472,0.7468079,0.015670566,0.021299643,0.0005139734,0.0009906361,0.0011481949,0.0338223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9853616,0.006790385,0.00072356756,0.0013707991,0.004948458,0.00080525427],"domain_scores_gemma":[0.97738034,0.01657007,0.0005791446,0.002397776,0.0022679854,0.0008046145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019742286,0.0020836876,0.0035565575,0.00495399,0.0038294243,0.007398793,0.0055634314,0.0049965465,0.00949049],"category_scores_gemma":[0.04080918,0.0017428882,0.0049675526,0.0066833696,0.008267406,0.016194757,0.006879476,0.021077998,0.0025267894],"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.000035530604,0.00002658476,0.0000704511,0.00013145214,0.000037533267,0.00006116691,0.00014745913,0.0025616456,0.00025417397,0.9682198,0.013434575,0.015019652],"study_design_scores_gemma":[0.000019727557,0.000018500858,0.000116843075,0.00009472262,0.000018552926,0.00006217295,0.000039276583,0.01746567,0.00014195622,0.9670674,0.014911159,0.000044096767],"about_ca_topic_score_codex":0.004455635,"about_ca_topic_score_gemma":0.0055042757,"teacher_disagreement_score":0.019742286,"about_ca_system_score_codex":0.004804691,"about_ca_system_score_gemma":0.0023826791,"threshold_uncertainty_score":0.10440838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013173246,0.00020000077,0.99317956,0.00008436491,0.00006763277,0.000029274255,0.00002734397,0.000085551466,0.005008863],"genre_scores_gemma":[0.04380968,0.00045881924,0.9431854,0.00017990304,0.00013023852,0.0001984259,0.00015465956,0.00024769883,0.01163502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.00009037603,0.00000973487,0.00004471937,0.000187874,0.000017492463],"domain_scores_gemma":[0.9993906,0.0003360365,0.00003242569,0.000049170678,0.00016217191,0.00002957919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683636,0.00075652014,0.00086700683,0.001040723,0.0004582513,0.0012107971,0.0014891727,0.0011926327,0.005303223],"category_scores_gemma":[0.0023242459,0.00051578286,0.0006652035,0.0008026926,0.00089848967,0.0010862299,0.0012432537,0.0022814819,0.001104717],"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.00016531856,0.00012992471,0.00024001626,0.0003839478,0.00006150023,0.00013948849,0.00017390857,0.18208617,0.01526574,0.4834664,0.021548046,0.29633963],"study_design_scores_gemma":[0.000021136826,0.000032244505,0.00009360417,0.000032419644,0.000013201934,0.00010529118,0.000014422753,0.91748035,0.0026862018,0.06784217,0.0116627,0.000016238253],"about_ca_topic_score_codex":0.0007287421,"about_ca_topic_score_gemma":0.0009902677,"teacher_disagreement_score":0.005303223,"about_ca_system_score_codex":0.00070758973,"about_ca_system_score_gemma":0.00089451513,"threshold_uncertainty_score":0.017741084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039464184,0.00011465204,0.99394035,0.00007040728,0.00010946529,0.000034851673,0.000011947835,0.00011055977,0.0016613442],"genre_scores_gemma":[0.12627494,0.00024809164,0.8668401,0.00017999562,0.00017011783,0.0003069073,0.00007740127,0.00015288973,0.0057495073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00024972405,0.00003062589,0.00005800776,0.00022113019,0.000025231027],"domain_scores_gemma":[0.99941754,0.0002821825,0.00004936267,0.00006728244,0.00014659275,0.000037107493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011128543,0.00078603136,0.00097104674,0.00064679445,0.00046442106,0.0009401477,0.0011710452,0.0015118568,0.002974597],"category_scores_gemma":[0.0014737339,0.0005829953,0.0008656977,0.0007561211,0.0008405429,0.0010947937,0.0016964298,0.0010327366,0.0007966669],"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.00027610516,0.0002187923,0.00084230205,0.00034672106,0.00029804104,0.00017239744,0.00010627198,0.7664946,0.020625748,0.038709395,0.0033254174,0.1685843],"study_design_scores_gemma":[0.000022843642,0.000050455714,0.000086957625,0.0000049934965,0.000010879881,0.000028342904,0.000003850283,0.9953583,0.0009037761,0.0020891156,0.0014307795,0.000009568928],"about_ca_topic_score_codex":0.00091050065,"about_ca_topic_score_gemma":0.0011189,"teacher_disagreement_score":0.002974597,"about_ca_system_score_codex":0.00023415436,"about_ca_system_score_gemma":0.00072623935,"threshold_uncertainty_score":0.009951055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11237743,0.0031482961,0.86492175,0.00052220176,0.0007048407,0.00023246737,0.00015142758,0.0006604297,0.01728108],"genre_scores_gemma":[0.4963375,0.0014622522,0.49483418,0.0002857595,0.00019333574,0.00033029023,0.00040908376,0.00047271748,0.005674861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984945,0.00088401476,0.00007411835,0.00009954631,0.00036815478,0.00007966827],"domain_scores_gemma":[0.9963086,0.002422041,0.00009218091,0.00021955199,0.0008497681,0.000107845655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030180183,0.0011309163,0.0015566123,0.0012329145,0.0007188239,0.0012053301,0.001046626,0.0017303795,0.004229358],"category_scores_gemma":[0.007985834,0.00036128974,0.000893618,0.0013938327,0.00063091953,0.0012415105,0.0011145294,0.0010234592,0.0005141488],"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.00083074457,0.00030935404,0.0013630746,0.00055589795,0.00024235374,0.00008630286,0.000096355696,0.8317305,0.0030377493,0.012673487,0.00278811,0.14628612],"study_design_scores_gemma":[0.00004768622,0.00014494536,0.0005771874,0.000016082815,0.000025489151,0.000025312365,0.000022932854,0.9955445,0.0010579993,0.0016681788,0.0008573281,0.000012372846],"about_ca_topic_score_codex":0.004527108,"about_ca_topic_score_gemma":0.0038829139,"teacher_disagreement_score":0.004527108,"about_ca_system_score_codex":0.0005079224,"about_ca_system_score_gemma":0.001579654,"threshold_uncertainty_score":0.015960991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016004231,0.000080086895,0.9977714,0.000048605973,0.000041881227,0.00001792806,0.0000133376725,0.000050241186,0.00037613552],"genre_scores_gemma":[0.14759149,0.00039654397,0.84364426,0.00018508495,0.0002029129,0.0002882878,0.0001864169,0.00031934323,0.007185597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990344,0.0004382005,0.000056280947,0.00016401442,0.00026875324,0.00003824111],"domain_scores_gemma":[0.99677926,0.001994701,0.00018864777,0.00026448426,0.00061258837,0.00016034256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023542943,0.0010473267,0.0018720397,0.0004926329,0.00040689472,0.0013039856,0.0017911743,0.001982264,0.003255238],"category_scores_gemma":[0.007092438,0.00075094163,0.0010975782,0.000466371,0.0013355191,0.0018857744,0.002384153,0.002675537,0.00091232633],"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.0004146284,0.00016352138,0.0004713736,0.00056276564,0.0001684298,0.0002679602,0.00019341832,0.7699831,0.014749055,0.08688478,0.0043645017,0.12177651],"study_design_scores_gemma":[0.0000052148207,0.000036238653,0.000022445154,0.0000047830436,0.000004467685,0.000014590582,0.000002732755,0.99623775,0.00031788342,0.0027949489,0.0005540177,0.00000495605],"about_ca_topic_score_codex":0.0024691748,"about_ca_topic_score_gemma":0.002378057,"teacher_disagreement_score":0.003255238,"about_ca_system_score_codex":0.0006203428,"about_ca_system_score_gemma":0.0013883071,"threshold_uncertainty_score":0.012450874},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053630956,0.0034276494,0.92371655,0.0022265874,0.00036282203,0.000080666076,0.0001110578,0.00028280038,0.064428754],"genre_scores_gemma":[0.21237099,0.007034234,0.734574,0.0018701727,0.00090889476,0.0005583682,0.00039457966,0.00054935616,0.041739505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643147,0.0014919881,0.00016136222,0.000482915,0.0011621638,0.0002701564],"domain_scores_gemma":[0.9955302,0.002985411,0.00018645763,0.0007435458,0.00044674764,0.00010770345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028981199,0.0017141086,0.0009919164,0.0013472551,0.000985826,0.0032518543,0.0022216716,0.0012428026,0.00887784],"category_scores_gemma":[0.010030166,0.00095613854,0.0014745978,0.002722773,0.0025237266,0.0044022,0.0029444124,0.007574509,0.0026625786],"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.00004974548,0.00008930691,0.00008643392,0.00012644647,0.000024248266,0.00003667722,0.00013491347,0.013850335,0.00061386474,0.92586315,0.0060910885,0.053033844],"study_design_scores_gemma":[0.000017548233,0.000022687691,0.00007842761,0.000045679724,0.000017567909,0.000055068536,0.00003529209,0.06092344,0.001179385,0.9199425,0.01767022,0.000012136645],"about_ca_topic_score_codex":0.00069509103,"about_ca_topic_score_gemma":0.0010216701,"teacher_disagreement_score":0.00887784,"about_ca_system_score_codex":0.0020414996,"about_ca_system_score_gemma":0.0012268592,"threshold_uncertainty_score":0.029699326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084315444,0.00059060316,0.99655664,0.00021152523,0.000030069026,0.000021257385,0.000021631033,0.00004456196,0.0016806117],"genre_scores_gemma":[0.24156468,0.0048306864,0.74702644,0.0004057375,0.0004054849,0.0005158413,0.00027788724,0.00030613487,0.004667141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788195,0.0010585501,0.00008705571,0.00027137192,0.0006090457,0.000091936716],"domain_scores_gemma":[0.99210864,0.006080439,0.0006271,0.00047890958,0.0005451177,0.00015985842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039083674,0.0016623029,0.0018035999,0.0010215519,0.00049091026,0.0026143678,0.0019470712,0.0018972316,0.0032997176],"category_scores_gemma":[0.015737021,0.0012668383,0.0012380884,0.0012703072,0.0025570116,0.0030251069,0.00338897,0.004463932,0.0009715641],"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.00005278315,0.00004299092,0.00036184952,0.00026383623,0.000043875898,0.0000698418,0.000118418735,0.808186,0.00089407654,0.15535103,0.002185489,0.03242976],"study_design_scores_gemma":[0.000007762077,0.00001913026,0.000031487154,0.000036046906,0.000005460496,0.000020574058,0.000012262763,0.9595456,0.0002752978,0.038551062,0.001487618,0.000007633937],"about_ca_topic_score_codex":0.002511184,"about_ca_topic_score_gemma":0.0018398165,"teacher_disagreement_score":0.0039083674,"about_ca_system_score_codex":0.0011869994,"about_ca_system_score_gemma":0.0014827056,"threshold_uncertainty_score":0.02066964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050368556,0.000096814285,0.9984829,0.000033642613,0.000023557213,0.00001233376,0.000028361737,0.0003202869,0.0004984904],"genre_scores_gemma":[0.19770381,0.0005446337,0.7941333,0.00019988204,0.00015147547,0.0003035548,0.00042733017,0.0012404391,0.005295597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.00054510555,0.000053373376,0.00017886957,0.00048458128,0.00012250736],"domain_scores_gemma":[0.99803215,0.0009847403,0.000115695584,0.00032668703,0.00041742527,0.0001233028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025036905,0.0014588431,0.0019793324,0.00063239987,0.00046944479,0.0014490278,0.0028077464,0.0017374157,0.004959491],"category_scores_gemma":[0.00754044,0.0007820164,0.0012194559,0.0007945449,0.0010420647,0.0019950506,0.0027830456,0.00316862,0.0018534475],"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.00034050073,0.00006660341,0.00018559299,0.00022360566,0.00006854883,0.00008558599,0.00007955019,0.79944617,0.004234849,0.076478094,0.008314854,0.11047605],"study_design_scores_gemma":[0.000011394467,0.000027225704,0.00001170599,0.0000056722547,0.0000050515214,0.000010852072,0.0000033149704,0.9891755,0.0005893272,0.008838915,0.0013156141,0.000005361806],"about_ca_topic_score_codex":0.0038152873,"about_ca_topic_score_gemma":0.0031915272,"teacher_disagreement_score":0.004959491,"about_ca_system_score_codex":0.000689399,"about_ca_system_score_gemma":0.0017740028,"threshold_uncertainty_score":0.016591132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002831638,0.00050305173,0.97699773,0.00057568884,0.00010961562,0.0000376348,0.00011138524,0.00006530813,0.018768003],"genre_scores_gemma":[0.29019606,0.0028345615,0.66801345,0.0010154141,0.00084614457,0.00082643394,0.0009866658,0.00052625587,0.034754906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986021,0.00054862956,0.00006306337,0.0002489077,0.00044882926,0.0000885092],"domain_scores_gemma":[0.9983708,0.0007239709,0.00017227905,0.00016173488,0.00047463528,0.00009658064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026159137,0.0012192143,0.0009439155,0.00084940996,0.00064305036,0.0029328666,0.0012228412,0.0013719186,0.0071703307],"category_scores_gemma":[0.0042746854,0.00044190115,0.0006216043,0.0013107731,0.0018931916,0.002754873,0.0017977048,0.004456746,0.0016557572],"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.0000336984,0.000060236132,0.00014030212,0.0001433813,0.000014733061,0.000054432305,0.00005655899,0.099197075,0.0006944661,0.8770361,0.0053543206,0.017214745],"study_design_scores_gemma":[0.00001705894,0.000050224055,0.00007396327,0.00005275562,0.00000798948,0.00006141883,0.000057567937,0.6268747,0.0010945249,0.35413992,0.017558621,0.000011306368],"about_ca_topic_score_codex":0.0012637983,"about_ca_topic_score_gemma":0.0012657685,"teacher_disagreement_score":0.0071703307,"about_ca_system_score_codex":0.0017739867,"about_ca_system_score_gemma":0.0015956768,"threshold_uncertainty_score":0.023987114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003915571,0.000035154495,0.99052024,0.000059659058,0.000032068114,0.00009507269,0.000050117753,0.0022347402,0.0030574144],"genre_scores_gemma":[0.10308634,0.00006876591,0.8926486,0.00009702386,0.000027295757,0.00036781316,0.00022704604,0.000649988,0.002827046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940777,0.00010213414,0.000033679975,0.0000910596,0.00028821817,0.00007712769],"domain_scores_gemma":[0.99924207,0.00018865473,0.00007453845,0.00014470081,0.00028720795,0.00006284026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081606436,0.0009106364,0.0007360353,0.0006154619,0.0004960454,0.0009334872,0.0024137306,0.0009358846,0.010845548],"category_scores_gemma":[0.0024231432,0.00053957757,0.00066723407,0.0005858531,0.0004956616,0.00065704656,0.0013408433,0.001269789,0.0040124785],"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.00046594065,0.00031552493,0.002013987,0.00050087745,0.0001333308,0.00025397932,0.00027605557,0.47946897,0.06270322,0.052152846,0.014902389,0.38681296],"study_design_scores_gemma":[0.00008668705,0.000106638894,0.00016883388,0.000018196935,0.00002054428,0.000073695555,0.000020899051,0.96365964,0.02054738,0.004263114,0.011018349,0.000016052001],"about_ca_topic_score_codex":0.0011363042,"about_ca_topic_score_gemma":0.0015157394,"teacher_disagreement_score":0.010845548,"about_ca_system_score_codex":0.00045720043,"about_ca_system_score_gemma":0.0016993952,"threshold_uncertainty_score":0.036281943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067763315,0.00047217956,0.98728,0.0003292185,0.0001045099,0.000042792675,0.000049877784,0.00014662609,0.0047984477],"genre_scores_gemma":[0.23754838,0.0012011658,0.73798335,0.00051142595,0.00027532995,0.0004561947,0.00025581787,0.00048518763,0.0212831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999461,0.00023914434,0.000019248499,0.000054207027,0.00018434739,0.000042038537],"domain_scores_gemma":[0.9988871,0.00068476365,0.000078339624,0.000057884292,0.00021127205,0.00008061017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170129,0.0012116381,0.0010915529,0.00072129566,0.0004137961,0.00085338834,0.0013724477,0.0015970469,0.0031397971],"category_scores_gemma":[0.002918263,0.00051783386,0.0010837952,0.0006756879,0.0014131907,0.001024101,0.0018285573,0.0019650543,0.00073397916],"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.00020814546,0.000082998034,0.0007081756,0.00038296956,0.00010625009,0.0003408702,0.0002118338,0.82141477,0.011838889,0.10195721,0.0061085448,0.0566394],"study_design_scores_gemma":[0.000006214418,0.000018809995,0.000039334172,0.000006553694,0.0000021251544,0.000013088734,0.0000040642935,0.9959556,0.00033605561,0.0027023554,0.00091116515,0.000004665917],"about_ca_topic_score_codex":0.0071197157,"about_ca_topic_score_gemma":0.0055774306,"teacher_disagreement_score":0.0071197157,"about_ca_system_score_codex":0.0009772414,"about_ca_system_score_gemma":0.0014203854,"threshold_uncertainty_score":0.01415652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014902193,0.00008713183,0.99626863,0.00013716353,0.00003485338,0.000023040215,0.000017409206,0.00012334932,0.0018180896],"genre_scores_gemma":[0.074105226,0.00041176303,0.9091547,0.00020837625,0.00014552432,0.0002602414,0.00018013573,0.00038212133,0.015151933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928755,0.000235174,0.00002955088,0.000100605735,0.00029985266,0.00004729383],"domain_scores_gemma":[0.9985625,0.00084691664,0.00011559711,0.00015531425,0.00024932213,0.00007041936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068495,0.0009124989,0.000756842,0.0009278504,0.00065194705,0.0010613272,0.0011983601,0.0014094984,0.004491249],"category_scores_gemma":[0.004149167,0.0005411784,0.0012826528,0.0008933796,0.0013218109,0.00130632,0.0018753267,0.0031895074,0.00093499414],"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.00009107442,0.000109295026,0.0005331649,0.00023635729,0.000071926814,0.0001371378,0.00019348931,0.4955883,0.0131494915,0.33628505,0.0072292364,0.14637557],"study_design_scores_gemma":[0.000006865848,0.00001463579,0.000047175974,0.000013176112,0.000005479002,0.000020135192,0.0000067101787,0.97437257,0.0010914244,0.0201442,0.004270107,0.0000075434923],"about_ca_topic_score_codex":0.0025236127,"about_ca_topic_score_gemma":0.0038525206,"teacher_disagreement_score":0.004491249,"about_ca_system_score_codex":0.0010554222,"about_ca_system_score_gemma":0.0016860564,"threshold_uncertainty_score":0.015024722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030911686,0.0002455572,0.99497896,0.000079569836,0.00003528392,0.000024323359,0.000014015581,0.00012801781,0.0014030018],"genre_scores_gemma":[0.15393221,0.00048251924,0.83867925,0.0002045199,0.00009386975,0.00027214308,0.00010832344,0.00014806708,0.0060791355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996444,0.00014255597,0.000015597521,0.00005251453,0.00012135083,0.000023639383],"domain_scores_gemma":[0.9996886,0.00015235158,0.000028479924,0.000028897317,0.0000792061,0.00002239546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008941291,0.0007911029,0.000872691,0.00063003536,0.0003750669,0.0007563388,0.0010555077,0.0012285748,0.0029718745],"category_scores_gemma":[0.0014346835,0.00042284976,0.0005423059,0.0009900281,0.000557766,0.00094074575,0.0009909401,0.0008365513,0.0007702466],"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.000111084075,0.00008819621,0.0007631534,0.00017168766,0.00011256127,0.00011049999,0.00006002443,0.77812195,0.006151944,0.047006704,0.0034217385,0.1638805],"study_design_scores_gemma":[0.000012492469,0.000022985036,0.000049935574,0.0000041752205,0.0000046252076,0.000018521097,0.0000020210468,0.9961125,0.00045379027,0.0021280725,0.0011862905,0.0000046219006],"about_ca_topic_score_codex":0.0023714912,"about_ca_topic_score_gemma":0.0026020885,"teacher_disagreement_score":0.0029718745,"about_ca_system_score_codex":0.0004186869,"about_ca_system_score_gemma":0.00072617154,"threshold_uncertainty_score":0.009941936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004495451,0.00056014647,0.9885129,0.00051252363,0.00011088875,0.000071195755,0.000071336915,0.000054745957,0.0056108986],"genre_scores_gemma":[0.36157468,0.00263841,0.61269027,0.0007378964,0.0006107598,0.0010494025,0.00083160657,0.0006402377,0.01922678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983412,0.000891837,0.00008090666,0.00021010463,0.00033452915,0.00014132337],"domain_scores_gemma":[0.99485236,0.0039364942,0.00034055737,0.00020378223,0.0004631761,0.00020346764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049896576,0.0022975456,0.0026307942,0.0012786643,0.0007899943,0.0026691966,0.0021244818,0.0024608464,0.004322192],"category_scores_gemma":[0.012978594,0.0014419031,0.002062457,0.0012944783,0.0026991987,0.0021651913,0.004616125,0.0054563526,0.00067977974],"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.00007581172,0.00009128919,0.00020591689,0.00029618063,0.0000683774,0.000087407745,0.0001522862,0.8671027,0.00083629065,0.11027083,0.002571649,0.018241284],"study_design_scores_gemma":[0.000007671697,0.000017070115,0.000030627354,0.000019989042,0.000006037628,0.000010204274,0.000016624843,0.9818932,0.00012280406,0.017094152,0.00077531073,0.000006357811],"about_ca_topic_score_codex":0.0043243514,"about_ca_topic_score_gemma":0.003619004,"teacher_disagreement_score":0.0049896576,"about_ca_system_score_codex":0.0015640551,"about_ca_system_score_gemma":0.0019991295,"threshold_uncertainty_score":0.026388109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016032385,0.00015864342,0.9961654,0.000061366925,0.000027230784,0.000013434911,0.000009205341,0.00012116077,0.0018402915],"genre_scores_gemma":[0.11889629,0.0007695232,0.8758041,0.000077438905,0.00008152669,0.00020244549,0.00008384266,0.00024082347,0.0038439375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997075,0.000103432656,0.000019394372,0.000037154525,0.00011627705,0.000016136966],"domain_scores_gemma":[0.99923575,0.00053062016,0.00003242014,0.00007754776,0.00010266249,0.00002096784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007174809,0.0007418162,0.0007296243,0.0010094085,0.00062949996,0.0005775955,0.0009785355,0.00089900516,0.0046010604],"category_scores_gemma":[0.0032948784,0.0004052812,0.0007630992,0.0008232398,0.00080201216,0.0010383877,0.0014594614,0.0013528153,0.0010351485],"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.00008353777,0.00004940362,0.00067626935,0.00024126399,0.000068798596,0.00026264967,0.00018274899,0.49384603,0.006040444,0.16938959,0.0025509726,0.3266082],"study_design_scores_gemma":[0.000017592554,0.000047401467,0.00013244692,0.000026813625,0.0000090085805,0.00009897015,0.00001996336,0.924039,0.0018471562,0.065276,0.008470935,0.000014744266],"about_ca_topic_score_codex":0.0020416102,"about_ca_topic_score_gemma":0.0018041297,"teacher_disagreement_score":0.0046010604,"about_ca_system_score_codex":0.00037837843,"about_ca_system_score_gemma":0.0007683508,"threshold_uncertainty_score":0.015392065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02023594,0.00069418864,0.9696334,0.0012429955,0.00008717487,0.00016632103,0.00026116704,0.0004486526,0.0072301836],"genre_scores_gemma":[0.6438464,0.0013246312,0.33590868,0.0012469245,0.0003730668,0.0010812015,0.0012480518,0.0009032485,0.014067785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964887,0.0020483288,0.00009196433,0.00045417537,0.0004998014,0.00041717855],"domain_scores_gemma":[0.96208924,0.034531992,0.0010147397,0.0009883817,0.00066232,0.00071327866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007551793,0.0034751596,0.004545911,0.0013636604,0.00108339,0.0036112608,0.0032323662,0.0036234255,0.0069121243],"category_scores_gemma":[0.033958737,0.002480203,0.0023793026,0.0011531839,0.004165111,0.0043860413,0.0050296662,0.008528313,0.0008059788],"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.00013677891,0.00010050965,0.000356997,0.00012259977,0.0000425061,0.00006700912,0.00006370864,0.95189416,0.00027662108,0.04084115,0.0014113092,0.004686698],"study_design_scores_gemma":[0.000010727492,0.000009049949,0.000018643676,0.000009213846,0.0000039993797,0.000003040288,0.000005766158,0.9820562,0.000054400098,0.017705537,0.00012079945,0.0000026101789],"about_ca_topic_score_codex":0.011197158,"about_ca_topic_score_gemma":0.010983332,"teacher_disagreement_score":0.011197158,"about_ca_system_score_codex":0.003630311,"about_ca_system_score_gemma":0.004693986,"threshold_uncertainty_score":0.03993815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017395627,0.00006852575,0.9939528,0.00012251853,0.00005467675,0.000029197108,0.000046872163,0.00092896726,0.0030567541],"genre_scores_gemma":[0.14685902,0.00033480665,0.84273165,0.00031486026,0.00014989408,0.000268141,0.00031751048,0.0015092178,0.0075148665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992933,0.00016723938,0.000019736146,0.00006499046,0.00040409685,0.000050604343],"domain_scores_gemma":[0.9989999,0.00045679256,0.00008820456,0.00013836681,0.0002606361,0.00005607601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010156585,0.0012521931,0.00080634095,0.000709451,0.00040716885,0.0010577998,0.0009820408,0.0012097493,0.007086004],"category_scores_gemma":[0.0035062798,0.0006278489,0.0007878371,0.00047869547,0.0010158007,0.0008305854,0.0018797249,0.0023037307,0.003093926],"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.000121740326,0.00013716813,0.0011221204,0.000333024,0.000094234456,0.0003171106,0.00020653325,0.64985055,0.024011727,0.13436675,0.014875154,0.17456387],"study_design_scores_gemma":[0.000008125021,0.000013713046,0.000052730415,0.0000127963085,0.0000044151975,0.000042185256,0.00000589409,0.98007286,0.00197805,0.012814292,0.0049856924,0.000009294875],"about_ca_topic_score_codex":0.0023563213,"about_ca_topic_score_gemma":0.0032816993,"teacher_disagreement_score":0.007086004,"about_ca_system_score_codex":0.00061980827,"about_ca_system_score_gemma":0.0014892168,"threshold_uncertainty_score":0.023705065},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059179505,0.5035723,0.010806378,0.1600684,0.057294726,0.000038997336,0.0010581218,0.00041695972,0.26082617],"genre_scores_gemma":[0.06018195,0.22806163,0.0107478835,0.028770749,0.03913516,0.000091944574,0.0009451,0.0013600228,0.63070554],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849784,0.00028905002,0.00008147324,0.00038367545,0.0006235774,0.00012442394],"domain_scores_gemma":[0.9984055,0.00049847335,0.00012278254,0.00013349824,0.0004519457,0.00038773307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018509148,0.000850436,0.0006951013,0.002166637,0.0020933573,0.005561195,0.00078409,0.0016812017,0.021811591],"category_scores_gemma":[0.006488939,0.0005000748,0.00038570215,0.0023477438,0.0028465225,0.0050118486,0.0028062232,0.0037908072,0.01636227],"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.0000772397,0.00002144509,0.00047652825,0.0002563008,0.000020082038,0.00010035103,0.0006157878,0.00030422834,0.00050372304,0.1680915,0.7251061,0.1044267],"study_design_scores_gemma":[0.0000021078324,0.0000059601543,0.00019415023,0.00018030278,0.0000023929192,0.00009878929,0.000056627487,0.00003653643,0.000125014,0.01170596,0.9875832,0.000008955148],"about_ca_topic_score_codex":0.0024313545,"about_ca_topic_score_gemma":0.0022468613,"teacher_disagreement_score":0.021811591,"about_ca_system_score_codex":0.0045074387,"about_ca_system_score_gemma":0.0022711395,"threshold_uncertainty_score":0.07296711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008445875,0.00021968725,0.9970584,0.000075808945,0.00008568203,0.000017940996,0.000016868478,0.00008882848,0.0015922897],"genre_scores_gemma":[0.058839425,0.00056722097,0.9324986,0.00014309678,0.00016736778,0.00016190945,0.00010277468,0.0001502139,0.007369284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994184,0.00015701372,0.000020101532,0.00008662228,0.00029248992,0.00002540822],"domain_scores_gemma":[0.999582,0.00019629799,0.000031052277,0.000040533923,0.000115662275,0.000034327808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090411375,0.0007335981,0.0007663111,0.0006629488,0.00041170092,0.0007271951,0.0013191873,0.0011788792,0.0032301913],"category_scores_gemma":[0.0015634394,0.00040314053,0.0006678235,0.00067970844,0.0011007504,0.00095334597,0.00095775136,0.0014139734,0.001027061],"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.00008887618,0.000093869625,0.000615274,0.00054201536,0.00010733117,0.0002260993,0.00013860177,0.50338423,0.0136324195,0.22135384,0.00995414,0.24986325],"study_design_scores_gemma":[0.000015616406,0.000030607003,0.00008845887,0.000019220986,0.000008799228,0.00006869261,0.0000046502946,0.9774704,0.0010501937,0.01016005,0.011065341,0.000017911352],"about_ca_topic_score_codex":0.0023539874,"about_ca_topic_score_gemma":0.0025965762,"teacher_disagreement_score":0.0032301913,"about_ca_system_score_codex":0.00048678386,"about_ca_system_score_gemma":0.0010870512,"threshold_uncertainty_score":0.010806024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017381627,0.0002446473,0.99691486,0.00008775636,0.000046723468,0.000028496812,0.0000080062455,0.00006095069,0.00087033334],"genre_scores_gemma":[0.07298081,0.00066578755,0.9218963,0.0001693955,0.0000818595,0.00025635495,0.000061569146,0.00012403043,0.0037638764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00038535596,0.000032869124,0.00010061972,0.00022173367,0.000038896378],"domain_scores_gemma":[0.9993992,0.00030882985,0.00005833063,0.000054883945,0.00014707666,0.00003163512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712653,0.0010842197,0.0011583754,0.0006119763,0.0005172828,0.000692547,0.0009955306,0.001347114,0.0020708544],"category_scores_gemma":[0.00279544,0.00047447963,0.000684979,0.0007965819,0.0010108631,0.0012211773,0.0010038428,0.0015806163,0.0009093366],"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.00029040631,0.00019777738,0.0009789803,0.00088119577,0.00022478259,0.00039644545,0.00023519111,0.5077678,0.040873215,0.21501495,0.0059152585,0.22722399],"study_design_scores_gemma":[0.00002506479,0.000051689723,0.00008817162,0.000012465114,0.000009277113,0.00006108022,0.0000068893405,0.98492765,0.0024079438,0.009902121,0.002492039,0.000015608446],"about_ca_topic_score_codex":0.0012251997,"about_ca_topic_score_gemma":0.0012741315,"teacher_disagreement_score":0.0020708544,"about_ca_system_score_codex":0.00040587605,"about_ca_system_score_gemma":0.0010166212,"threshold_uncertainty_score":0.0077809095},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013234629,0.0002568034,0.99619055,0.00017554189,0.00002993109,0.000016686763,0.000027898575,0.00003720312,0.0019419611],"genre_scores_gemma":[0.14522235,0.0014211978,0.8440383,0.0004126259,0.0003706896,0.0003520356,0.00031093677,0.00032954352,0.007542287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985915,0.0006376984,0.00004762747,0.00024534544,0.00035650464,0.00012133278],"domain_scores_gemma":[0.99857545,0.0009020128,0.00013976512,0.00014721493,0.00016011485,0.0000755098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033070839,0.0020982458,0.0016010473,0.0010614146,0.00051277183,0.0020184633,0.0020399524,0.001696533,0.002859143],"category_scores_gemma":[0.005195043,0.001101193,0.0016344251,0.0012432395,0.0026814397,0.0025210907,0.0033710438,0.005136676,0.00074964826],"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.00005683754,0.00007595722,0.00027036984,0.00024782258,0.00007972686,0.00009509596,0.00016650703,0.63243335,0.0028605303,0.32345727,0.0032711478,0.036985394],"study_design_scores_gemma":[0.00000904065,0.000027471599,0.000039558498,0.000024964249,0.000010017027,0.000028821743,0.00001807643,0.9348976,0.0009097578,0.061049987,0.002974483,0.000010298784],"about_ca_topic_score_codex":0.0019178569,"about_ca_topic_score_gemma":0.001621729,"teacher_disagreement_score":0.0033070839,"about_ca_system_score_codex":0.0014321957,"about_ca_system_score_gemma":0.0016117708,"threshold_uncertainty_score":0.01748979},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015704975,0.022770654,0.3600305,0.0017377059,0.001802389,0.000041021944,0.0002449461,0.0005484103,0.6112539],"genre_scores_gemma":[0.06682302,0.04044646,0.23064946,0.0017833012,0.0031687533,0.000269291,0.0006693624,0.0013301168,0.65486014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950457,0.00013185508,0.00001971605,0.00008064799,0.00023682116,0.000026342665],"domain_scores_gemma":[0.9995591,0.0002425899,0.000019975607,0.00008975519,0.00006618398,0.000022422731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053334015,0.0016439062,0.0012595447,0.0011975773,0.0006179243,0.0021156038,0.0009938541,0.0010011437,0.045678988],"category_scores_gemma":[0.0020171537,0.000619368,0.0008861185,0.001978146,0.001429435,0.0021857156,0.0020908606,0.002351619,0.01424044],"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.000020423535,0.0000352592,0.00010593908,0.00036624956,0.0000358675,0.0000702032,0.00007966733,0.016417442,0.0013695038,0.69332796,0.07132578,0.21684581],"study_design_scores_gemma":[0.000006177938,0.000017246253,0.00025484213,0.0002058322,0.000014683078,0.0001902586,0.000035985504,0.030541457,0.0009688421,0.6363131,0.33143312,0.000018510593],"about_ca_topic_score_codex":0.0007164666,"about_ca_topic_score_gemma":0.0011912142,"teacher_disagreement_score":0.045678988,"about_ca_system_score_codex":0.000760184,"about_ca_system_score_gemma":0.00066592,"threshold_uncertainty_score":0.15281147},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007871616,0.028316442,0.5901394,0.0016329262,0.004344804,0.000111676585,0.0009559244,0.0011853264,0.37252638],"genre_scores_gemma":[0.020196293,0.0386754,0.2999144,0.0019958625,0.0044380045,0.0006187054,0.0018505463,0.0040549394,0.62825584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992507,0.00014829217,0.000030494926,0.00012062714,0.00040688607,0.00004289967],"domain_scores_gemma":[0.99949193,0.0002475708,0.000024992178,0.00008684116,0.00012310313,0.0000255003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006509558,0.0020389606,0.0019146996,0.001227819,0.00054645044,0.0025220804,0.0015715655,0.0013252186,0.06443732],"category_scores_gemma":[0.0016850302,0.0008781248,0.0011545423,0.0030419044,0.0014768239,0.0023455713,0.0013966603,0.004372658,0.050836273],"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.000032543623,0.00012567194,0.00007105463,0.0012201603,0.000038124792,0.000054427754,0.00010306364,0.02851757,0.0027554196,0.19408467,0.31861734,0.45437995],"study_design_scores_gemma":[0.000017160355,0.000050780924,0.0003012617,0.00056185434,0.000028460754,0.00022978857,0.00005252426,0.03583869,0.0025271056,0.22984827,0.73051083,0.000033324104],"about_ca_topic_score_codex":0.00069298333,"about_ca_topic_score_gemma":0.00096582907,"teacher_disagreement_score":0.06443732,"about_ca_system_score_codex":0.000766054,"about_ca_system_score_gemma":0.0010334718,"threshold_uncertainty_score":0.21556437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010136956,0.04042063,0.48536804,0.0020741615,0.0028574634,0.00009391917,0.0008843233,0.00081249693,0.46647528],"genre_scores_gemma":[0.0434703,0.068551384,0.2946495,0.0024019468,0.0041702734,0.0006357943,0.0016200142,0.0030690662,0.58143175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937797,0.00016330903,0.000023449682,0.00009793063,0.0003023206,0.000034929362],"domain_scores_gemma":[0.9996132,0.00020555392,0.00002103078,0.00005309269,0.000085458545,0.000021801128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054802274,0.0013608484,0.0012765185,0.0008830652,0.0005582708,0.0027218615,0.0010537736,0.0010350893,0.0466163],"category_scores_gemma":[0.001458277,0.0005967683,0.00084322307,0.0028125474,0.001439348,0.0018673908,0.0011179941,0.0038861115,0.027629165],"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.000025828296,0.00006410109,0.000095337724,0.00075685553,0.00003720055,0.000042946227,0.00009881359,0.022623304,0.0016004465,0.5108364,0.19270386,0.27111495],"study_design_scores_gemma":[0.000010448171,0.000031893076,0.00025753118,0.00034449928,0.000016326732,0.00015902042,0.000058441794,0.026320921,0.001447174,0.42140764,0.5499165,0.000029638333],"about_ca_topic_score_codex":0.001213191,"about_ca_topic_score_gemma":0.00126813,"teacher_disagreement_score":0.0466163,"about_ca_system_score_codex":0.0009196163,"about_ca_system_score_gemma":0.0012820624,"threshold_uncertainty_score":0.15594703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009246924,0.024610355,0.5359169,0.0015067955,0.0017543085,0.00007759496,0.0009208924,0.0016285804,0.43265986],"genre_scores_gemma":[0.021540282,0.026375817,0.32717356,0.0013327413,0.0014414391,0.0004004196,0.0017515623,0.0023540407,0.61763024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997559,0.00003233861,0.0000121011,0.000045528006,0.00014005155,0.000014060621],"domain_scores_gemma":[0.99984086,0.000050929662,0.0000068773734,0.00003618656,0.00005286673,0.000012155545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035426693,0.0014183072,0.0011790679,0.0011330686,0.00045214215,0.0016794157,0.0010300453,0.0010804685,0.05191461],"category_scores_gemma":[0.00084777176,0.00054561405,0.0006135579,0.0019432931,0.000716159,0.0019167492,0.0012332611,0.0021776417,0.04266193],"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.000015967977,0.000046903457,0.000063706924,0.00045756358,0.000020989452,0.000048092457,0.00010635136,0.0070967753,0.0027465913,0.38565314,0.20500077,0.39874315],"study_design_scores_gemma":[0.000011293998,0.000021725908,0.00026790396,0.00021416156,0.000012302445,0.00022626073,0.00002998704,0.01964202,0.0015272913,0.2807552,0.69726366,0.00002826888],"about_ca_topic_score_codex":0.0004434095,"about_ca_topic_score_gemma":0.00075071235,"teacher_disagreement_score":0.05191461,"about_ca_system_score_codex":0.0004238395,"about_ca_system_score_gemma":0.00044289135,"threshold_uncertainty_score":0.17367166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009808169,0.015316491,0.49155313,0.001448881,0.003253097,0.00007043886,0.0007329426,0.0015813037,0.4850628],"genre_scores_gemma":[0.0144745065,0.011015006,0.18607005,0.0007289562,0.0009863204,0.00016509979,0.0010084723,0.0022808674,0.7832707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.000064248874,0.00001178123,0.000048298018,0.00022259481,0.000017314396],"domain_scores_gemma":[0.99973005,0.00010246732,0.000010307286,0.000059163383,0.0000779166,0.000020164027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562776,0.0012375949,0.0012172248,0.00096705876,0.0005968906,0.0014520066,0.0010567402,0.001045836,0.09224488],"category_scores_gemma":[0.0010676424,0.0006782984,0.0006717188,0.001604174,0.00091329485,0.0016182069,0.0012594536,0.0028521642,0.043629657],"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.000027714417,0.00005823338,0.00006298476,0.00043404975,0.00002745629,0.000036291174,0.00009108291,0.0120633915,0.0019767561,0.42536014,0.23219466,0.32766727],"study_design_scores_gemma":[0.00001528591,0.000026402822,0.00023889032,0.00017746678,0.000013164228,0.0001379329,0.000024519542,0.028213186,0.0013349225,0.19752015,0.77227616,0.00002195029],"about_ca_topic_score_codex":0.0010890445,"about_ca_topic_score_gemma":0.0022227278,"teacher_disagreement_score":0.09224488,"about_ca_system_score_codex":0.0006362519,"about_ca_system_score_gemma":0.000815178,"threshold_uncertainty_score":0.30858988},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007972168,0.03260029,0.30912423,0.0057871654,0.003785012,0.000061858846,0.0011660075,0.00044722453,0.639056],"genre_scores_gemma":[0.19345789,0.04965258,0.16551788,0.0036205861,0.0063279695,0.000371962,0.002193733,0.0011131327,0.57774436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956685,0.0000673939,0.000016944496,0.00007371347,0.00024536293,0.000029806604],"domain_scores_gemma":[0.99931014,0.000381368,0.00004528561,0.00006710931,0.00014459368,0.000051446645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007445,0.001224484,0.0007033277,0.00063465175,0.00064930855,0.0029916964,0.0008189868,0.00075654354,0.01658242],"category_scores_gemma":[0.0022512034,0.00042832317,0.0005724887,0.0022827107,0.0018398165,0.0025885296,0.0007059668,0.004385569,0.003622138],"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.000020952984,0.00006870043,0.00011124878,0.00021115458,0.000009791785,0.00003696565,0.0000925755,0.007637014,0.00069319026,0.82195276,0.10836906,0.060796708],"study_design_scores_gemma":[0.000008975422,0.00002746597,0.00046389777,0.00009493023,0.0000071674003,0.00012450217,0.00006558545,0.02830805,0.00035593522,0.83697224,0.1335484,0.000022863853],"about_ca_topic_score_codex":0.001958614,"about_ca_topic_score_gemma":0.0032153071,"teacher_disagreement_score":0.01658242,"about_ca_system_score_codex":0.0012388214,"about_ca_system_score_gemma":0.0014540692,"threshold_uncertainty_score":0.055473745},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021593983,0.019602949,0.28138468,0.0037066308,0.002831751,0.000035833917,0.0005015006,0.00059398526,0.68918324],"genre_scores_gemma":[0.06259111,0.021744294,0.1001497,0.0021753947,0.0028270024,0.0002655628,0.0010933848,0.0014679435,0.8076856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968195,0.0000729068,0.0000120731165,0.000048410187,0.00016728943,0.000017446791],"domain_scores_gemma":[0.9998016,0.00008897303,0.000011060603,0.000047282163,0.000034262437,0.0000168439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044989533,0.0013305747,0.0013762068,0.0006748649,0.0005425029,0.0017440253,0.0008071363,0.00093609776,0.034497134],"category_scores_gemma":[0.0011835683,0.00046228443,0.00071446097,0.0012727312,0.0012274612,0.0016749185,0.0015753651,0.0029904835,0.012994919],"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.000013606685,0.000035909747,0.00005413612,0.00027043212,0.000032479118,0.000027059323,0.000060216647,0.016181009,0.0009154038,0.6921436,0.15812647,0.13213971],"study_design_scores_gemma":[0.0000099799445,0.000018124934,0.00026283963,0.00014216504,0.0000145453605,0.0000923034,0.000026536241,0.03580864,0.0007310349,0.6936135,0.2692588,0.000021462094],"about_ca_topic_score_codex":0.00048636872,"about_ca_topic_score_gemma":0.00086906384,"teacher_disagreement_score":0.034497134,"about_ca_system_score_codex":0.0007670051,"about_ca_system_score_gemma":0.0005352331,"threshold_uncertainty_score":0.11540443},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061180275,0.027596291,0.29193318,0.005484889,0.0013306754,0.0001008661,0.00085057085,0.0006434551,0.66594213],"genre_scores_gemma":[0.38465154,0.051849686,0.24168645,0.006458216,0.008097718,0.0013191827,0.0026466148,0.0016828107,0.30160782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986713,0.00036379715,0.00008404539,0.00030495168,0.00045687362,0.00011904555],"domain_scores_gemma":[0.99813724,0.0011077416,0.00008043244,0.00037657822,0.00023481323,0.000063241874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120883,0.0014899181,0.0012750068,0.0022403,0.001377078,0.0055568847,0.0013394628,0.0015782808,0.021228619],"category_scores_gemma":[0.0049534943,0.0006887521,0.0013110128,0.0037436876,0.0049394052,0.008980182,0.0019307543,0.0053740004,0.00634903],"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.0000047788203,0.000007184498,0.000035541958,0.00006408098,0.0000054617176,0.000009581355,0.000049960418,0.00039686862,0.00009682429,0.97954524,0.0069983103,0.012786067],"study_design_scores_gemma":[0.00000342049,0.0000042163038,0.000060470724,0.000022550576,0.0000042286865,0.000042229098,0.000015187578,0.00091635453,0.000086975255,0.9688516,0.02998952,0.0000030932451],"about_ca_topic_score_codex":0.00079966587,"about_ca_topic_score_gemma":0.0005365146,"teacher_disagreement_score":0.021228619,"about_ca_system_score_codex":0.0023394322,"about_ca_system_score_gemma":0.0009266179,"threshold_uncertainty_score":0.07101679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010440609,0.012070567,0.5328894,0.0012123521,0.003320185,0.00005825786,0.00040944517,0.001189537,0.4478062],"genre_scores_gemma":[0.020013642,0.010681729,0.17630109,0.0009324782,0.0014947316,0.00019599106,0.0008400304,0.0017712988,0.787769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996538,0.00008730675,0.000010345576,0.00005195352,0.00017900245,0.00001753775],"domain_scores_gemma":[0.9997687,0.00008454224,0.000009311133,0.000054953794,0.000064039144,0.00001855254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004929176,0.0014639965,0.0011151413,0.0011565589,0.0005551261,0.0018768107,0.0009550469,0.0012530258,0.065343216],"category_scores_gemma":[0.001138686,0.00056015555,0.00062713696,0.0016604838,0.0010133929,0.0015285268,0.0014420899,0.0026778753,0.04093649],"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.000029132645,0.000047810237,0.000055566205,0.00025023887,0.000028456921,0.000037650072,0.00006998457,0.006627608,0.0022161545,0.5151803,0.18585005,0.28960708],"study_design_scores_gemma":[0.000016140408,0.000028798835,0.00018312334,0.00010062485,0.000014922028,0.00017404763,0.000026329313,0.019245174,0.0025171011,0.32445323,0.65321493,0.000025592313],"about_ca_topic_score_codex":0.00038009282,"about_ca_topic_score_gemma":0.0008047823,"teacher_disagreement_score":0.065343216,"about_ca_system_score_codex":0.0005181568,"about_ca_system_score_gemma":0.00069612055,"threshold_uncertainty_score":0.21859485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01294255,0.004467104,0.9242658,0.0024348751,0.0010527401,0.00010376388,0.00043474307,0.000970719,0.053327642],"genre_scores_gemma":[0.24892414,0.0046633985,0.6684934,0.0023123175,0.0013183276,0.00027489476,0.0014664526,0.0014621684,0.07108491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969892,0.000688071,0.0001298143,0.0006258792,0.0013158065,0.0002513503],"domain_scores_gemma":[0.99144495,0.005638215,0.00019350884,0.0012040208,0.0012342666,0.00028503206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030169582,0.0019587155,0.0025814613,0.0023549239,0.0015295371,0.0035553966,0.0033647364,0.0034022601,0.02328069],"category_scores_gemma":[0.023745345,0.00094786554,0.0014173695,0.00423831,0.0019416513,0.0067965016,0.006887769,0.007184524,0.0066003124],"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.0005234809,0.00023862191,0.00087223394,0.00074811454,0.00012449101,0.00027086996,0.00034921378,0.13698873,0.0047563487,0.42299715,0.0648079,0.36732292],"study_design_scores_gemma":[0.00008960401,0.0001900977,0.00039269248,0.0002193623,0.000076465105,0.0002900137,0.00013881449,0.5656992,0.0039993674,0.387929,0.04091015,0.000065153305],"about_ca_topic_score_codex":0.0041883173,"about_ca_topic_score_gemma":0.004585318,"teacher_disagreement_score":0.02328069,"about_ca_system_score_codex":0.0017625105,"about_ca_system_score_gemma":0.0022119125,"threshold_uncertainty_score":0.077881634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004093345,0.00043488303,0.9915665,0.00020580363,0.00007133857,0.0000343712,0.000047497168,0.000060729177,0.0034855052],"genre_scores_gemma":[0.39111796,0.0017477286,0.58619297,0.0004459061,0.00030585364,0.0005024384,0.000571684,0.00036704255,0.018748483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945766,0.00021603295,0.000024984172,0.00008407467,0.00016569856,0.00005153276],"domain_scores_gemma":[0.99898106,0.0005683681,0.00010849782,0.00006787943,0.00019962675,0.00007453718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429759,0.0013618856,0.0009101198,0.00084177766,0.00041660687,0.0011368792,0.0010714398,0.0012190907,0.0038396392],"category_scores_gemma":[0.002756099,0.00046330082,0.00090282067,0.0007799467,0.001024645,0.0012916839,0.0016029364,0.002231324,0.0005952632],"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.00005841135,0.00005800767,0.00041974738,0.00024610234,0.00004294163,0.00010331167,0.0000638424,0.84211093,0.0017387604,0.11943685,0.0019249534,0.033796106],"study_design_scores_gemma":[0.0000042911042,0.000014948088,0.000023381617,0.000010359077,0.000002384952,0.000008903815,0.000005110525,0.98964137,0.00019432971,0.008864093,0.0012269678,0.0000037825475],"about_ca_topic_score_codex":0.0029047942,"about_ca_topic_score_gemma":0.0025931725,"teacher_disagreement_score":0.0038396392,"about_ca_system_score_codex":0.000779323,"about_ca_system_score_gemma":0.0011867638,"threshold_uncertainty_score":0.012844861},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088525405,0.0006903007,0.9846591,0.0006492833,0.0001629555,0.000025761676,0.000037923262,0.00008275362,0.004839347],"genre_scores_gemma":[0.43096304,0.0028622546,0.5197719,0.00057328236,0.0006364294,0.00030343805,0.00032158932,0.0006185554,0.043949556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.0003242607,0.000018414328,0.000068987756,0.0001511513,0.00003248111],"domain_scores_gemma":[0.99819344,0.0011541996,0.0001062631,0.00016050252,0.0002903912,0.000095275245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017794694,0.0010459018,0.0010502943,0.0010296166,0.00058069965,0.0018935095,0.00087083783,0.0012514121,0.0035632555],"category_scores_gemma":[0.009631488,0.0006216292,0.00064410164,0.001055749,0.0025998533,0.00261469,0.0021492376,0.0025529661,0.0010198419],"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.00012594038,0.000050845327,0.00033831308,0.00026803484,0.000060858183,0.000105768224,0.00013909178,0.19006412,0.0030481417,0.75854903,0.0056899823,0.0415599],"study_design_scores_gemma":[0.000014248746,0.000021822556,0.00011076111,0.000017290991,0.00000795653,0.000030335666,0.000016095519,0.69488204,0.0006894395,0.30162513,0.002574735,0.000010136244],"about_ca_topic_score_codex":0.0018048297,"about_ca_topic_score_gemma":0.001912633,"teacher_disagreement_score":0.0035632555,"about_ca_system_score_codex":0.0011033125,"about_ca_system_score_gemma":0.000935397,"threshold_uncertainty_score":0.011920273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09275508,0.0019553485,0.88449264,0.00090312574,0.00025126967,0.00017388367,0.00009651162,0.00023989541,0.019132324],"genre_scores_gemma":[0.5963279,0.0025420398,0.38151354,0.0007094266,0.00025511568,0.0004047356,0.00042664554,0.0006411574,0.017179528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788195,0.0009814235,0.00010651042,0.00017573299,0.0006375693,0.00021677706],"domain_scores_gemma":[0.974294,0.019536592,0.0008760211,0.0011840566,0.0029274828,0.0011819571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008798321,0.0015118072,0.001478911,0.0021934605,0.0012012664,0.00226478,0.002354209,0.0017712463,0.004867787],"category_scores_gemma":[0.04011333,0.00077178655,0.0012714408,0.001484456,0.0042983205,0.0041020303,0.005627271,0.00470378,0.0006326368],"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.0008004145,0.00018832016,0.002868637,0.00029689146,0.00008662129,0.00013289857,0.000662735,0.27660164,0.0053861686,0.61935455,0.004116379,0.08950473],"study_design_scores_gemma":[0.000034206445,0.000081612154,0.00027449336,0.00006215355,0.000013720859,0.000049939397,0.00009127959,0.8595378,0.00080746895,0.13781533,0.0012173769,0.000014580866],"about_ca_topic_score_codex":0.007560779,"about_ca_topic_score_gemma":0.004840641,"teacher_disagreement_score":0.008798321,"about_ca_system_score_codex":0.0017260071,"about_ca_system_score_gemma":0.0018388324,"threshold_uncertainty_score":0.046530485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043580066,0.00057739246,0.983008,0.00056791113,0.00016084954,0.00004916537,0.00024277528,0.0009070236,0.010128876],"genre_scores_gemma":[0.13294262,0.0017315353,0.8292432,0.00087111327,0.0006167882,0.00041795714,0.0028538662,0.0028238986,0.028498994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835783,0.00063522777,0.000091573565,0.0003283857,0.00046387513,0.00012312045],"domain_scores_gemma":[0.9961046,0.0022028915,0.00017328767,0.000940214,0.00047383414,0.00010531258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018654915,0.0012805704,0.0013642157,0.0009065536,0.00079411984,0.0023212137,0.0016807113,0.0014081729,0.012142708],"category_scores_gemma":[0.009419466,0.0010363553,0.0013642808,0.0015303369,0.0013652262,0.0031649498,0.0020804775,0.005271883,0.0047170413],"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.0004421877,0.00033511565,0.00040552183,0.0007236261,0.000072413044,0.00024153615,0.00027911045,0.07931406,0.016986791,0.4730161,0.054011475,0.37417206],"study_design_scores_gemma":[0.00004538037,0.000064063745,0.00027360793,0.00010216116,0.000016493084,0.00016773236,0.000050858947,0.3500853,0.009678625,0.61734086,0.022133205,0.000041726493],"about_ca_topic_score_codex":0.0006150582,"about_ca_topic_score_gemma":0.0009502124,"teacher_disagreement_score":0.012142708,"about_ca_system_score_codex":0.0007580904,"about_ca_system_score_gemma":0.0012228435,"threshold_uncertainty_score":0.04062146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026047272,0.049396355,0.18132818,0.0076197796,0.0047851047,0.000072058945,0.0002948258,0.00045993045,0.7534391],"genre_scores_gemma":[0.21537562,0.085637204,0.2157425,0.0077126566,0.008748767,0.00059251476,0.0010418433,0.0014629464,0.46368587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998895,0.00036485353,0.000051183077,0.00021053858,0.0003818809,0.000096542826],"domain_scores_gemma":[0.9994067,0.00031518564,0.00003934442,0.0001043033,0.00009088425,0.000043627704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009637571,0.0011545907,0.0009266249,0.0015109422,0.0014032432,0.0039841617,0.001127029,0.0013359765,0.02419802],"category_scores_gemma":[0.0024186475,0.00055336376,0.0013476406,0.0019002281,0.0032614556,0.0036808618,0.003369971,0.0047882157,0.007728602],"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.000008154238,0.000010375184,0.000054926608,0.00012413971,0.000010370881,0.00004684222,0.00009698725,0.00080597383,0.00018354096,0.9359127,0.028884767,0.033861153],"study_design_scores_gemma":[0.0000049359514,0.00001329262,0.000099501456,0.0001399902,0.000005007956,0.00025847435,0.00005597886,0.0022124334,0.0002627817,0.67604464,0.32089475,0.000008268449],"about_ca_topic_score_codex":0.0006301344,"about_ca_topic_score_gemma":0.0007559259,"teacher_disagreement_score":0.02419802,"about_ca_system_score_codex":0.0018696534,"about_ca_system_score_gemma":0.0012074526,"threshold_uncertainty_score":0.08095044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024526522,0.0047655487,0.46582773,0.0011307572,0.0016848281,0.00006661432,0.0006839584,0.0016278329,0.52176005],"genre_scores_gemma":[0.036769673,0.006078639,0.14798832,0.001320521,0.0011145601,0.00028998734,0.001736001,0.0028581773,0.80184424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993674,0.00011764625,0.000019651774,0.000108714965,0.0003301674,0.00005643679],"domain_scores_gemma":[0.9995796,0.00012256134,0.000017458518,0.00013899959,0.00010701619,0.000034255616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014428,0.0015915964,0.0012732537,0.0022759042,0.0010968512,0.0025395332,0.0014753853,0.0013523755,0.07899141],"category_scores_gemma":[0.0022528868,0.00075532857,0.0011472715,0.0017247037,0.0013523683,0.002801076,0.0032636668,0.0037919115,0.051016822],"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.000030349582,0.00004319877,0.00011274485,0.00014921674,0.000030157027,0.00004129043,0.0001018833,0.00433319,0.001415733,0.6285829,0.1245187,0.24064066],"study_design_scores_gemma":[0.000012451901,0.000017463766,0.00019497826,0.00010595225,0.000015076417,0.00017979993,0.000037911686,0.02148391,0.0016146123,0.56362236,0.4126934,0.00002211093],"about_ca_topic_score_codex":0.00069352647,"about_ca_topic_score_gemma":0.0012880033,"teacher_disagreement_score":0.07899141,"about_ca_system_score_codex":0.00074093125,"about_ca_system_score_gemma":0.00068819075,"threshold_uncertainty_score":0.2642526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047604047,0.028009823,0.008420423,0.0060510044,0.013937884,0.00014346998,0.0052947896,0.0009574184,0.9367093],"genre_scores_gemma":[0.003694222,0.018996146,0.0069574052,0.0025629145,0.0021276567,0.00009329843,0.0093847355,0.0010102427,0.95517343],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991572,0.00008391004,0.000049411974,0.00015838348,0.00049468863,0.000056467125],"domain_scores_gemma":[0.99872524,0.00022758152,0.000059864866,0.00015494763,0.00073612685,0.00009623183],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044751845,0.000925731,0.0008854121,0.0040396005,0.0017772441,0.003719172,0.0016579342,0.0016176015,0.40275955],"category_scores_gemma":[0.0041078553,0.00040506356,0.00077976834,0.0049089473,0.00069726555,0.003978899,0.0018842922,0.0022145987,0.32337695],"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.000010323899,0.00001867818,0.000074599164,0.00023944375,0.000003962323,0.00007883241,0.00009373515,0.00019534424,0.0001498109,0.024587039,0.911943,0.06260538],"study_design_scores_gemma":[0.0000011824984,0.0000020657174,0.000060732273,0.00015309923,0.0000015123867,0.00006705411,0.00003158785,0.000029105808,0.000038760787,0.0046005743,0.9950111,0.0000033331946],"about_ca_topic_score_codex":0.0045301626,"about_ca_topic_score_gemma":0.007027427,"teacher_disagreement_score":0.59724045,"about_ca_system_score_codex":0.0021036442,"about_ca_system_score_gemma":0.0016637025,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058396566,0.046672586,0.3246211,0.021951461,0.0035627314,0.00019150956,0.0017131326,0.0008879134,0.5945599],"genre_scores_gemma":[0.33007374,0.090082854,0.28168607,0.007497555,0.01057948,0.00092684524,0.0054076356,0.0012414233,0.2725043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668723,0.0007514214,0.00017551957,0.0006469927,0.0015252512,0.00021365733],"domain_scores_gemma":[0.9960503,0.0022620172,0.000188453,0.00085689867,0.00047537655,0.00016695882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015757896,0.0013621516,0.0010808794,0.0015810573,0.0013143778,0.006972949,0.0016053772,0.0015508824,0.031522516],"category_scores_gemma":[0.0085643,0.00051812147,0.0014090046,0.0020303116,0.003770164,0.006367642,0.00373051,0.005203389,0.009231442],"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.000009435134,0.000011641995,0.00017115082,0.00024475902,0.000027354581,0.00003653612,0.00007437796,0.0022262663,0.00020537393,0.9046125,0.04695874,0.045421842],"study_design_scores_gemma":[0.000004937232,0.000011486833,0.00022534622,0.00012538042,0.000009769391,0.00015123347,0.000045389254,0.0042616087,0.00022755614,0.7973239,0.19760309,0.000010300531],"about_ca_topic_score_codex":0.0009956312,"about_ca_topic_score_gemma":0.0009129798,"teacher_disagreement_score":0.031522516,"about_ca_system_score_codex":0.002874461,"about_ca_system_score_gemma":0.0018978809,"threshold_uncertainty_score":0.10545331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033997136,0.8907412,0.090308875,0.0040408648,0.0016883631,0.00003056356,0.00014862137,0.00023781424,0.012463708],"genre_scores_gemma":[0.009502517,0.93393326,0.042926725,0.0025572595,0.0031779597,0.00012910123,0.00030314107,0.00021397296,0.007256009],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802655,0.0008431467,0.00013912737,0.00031872158,0.00062022405,0.000052211988],"domain_scores_gemma":[0.9972293,0.00191471,0.0001488363,0.00018668058,0.00047233634,0.000048160433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031055638,0.0009854636,0.0013707157,0.002414771,0.00031421232,0.0015889526,0.001093405,0.001728347,0.0058959825],"category_scores_gemma":[0.0064501003,0.00045226197,0.0007836852,0.0033436776,0.0020215001,0.0021610917,0.00093576644,0.0029905264,0.0071050455],"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.000034249897,0.000033544682,0.00021798474,0.008467398,0.00016192778,0.00015840874,0.00012886661,0.0056824386,0.0015287878,0.26306972,0.078886755,0.64162993],"study_design_scores_gemma":[0.000009049354,0.00006717099,0.0005082036,0.0020583048,0.00004025913,0.00060809706,0.00005575925,0.002921509,0.001099113,0.11882173,0.873758,0.000052821106],"about_ca_topic_score_codex":0.00094806566,"about_ca_topic_score_gemma":0.0007826396,"teacher_disagreement_score":0.0058959825,"about_ca_system_score_codex":0.0006459705,"about_ca_system_score_gemma":0.0013300678,"threshold_uncertainty_score":0.019724011},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11240111,0.0024006013,0.8659438,0.0022525445,0.00031021103,0.00006628512,0.00032691046,0.00042148362,0.015877048],"genre_scores_gemma":[0.7714631,0.0017079553,0.20492744,0.00037309443,0.0004582671,0.00029474086,0.0006449547,0.00037933502,0.019751156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846715,0.00040027162,0.000042165088,0.00028590835,0.0005861978,0.00021829082],"domain_scores_gemma":[0.9842786,0.01368998,0.000569668,0.00058912754,0.00059949514,0.0002731959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354463,0.0018203591,0.0024394104,0.0013505279,0.0009357388,0.0039919997,0.0013678904,0.0031662786,0.0034976287],"category_scores_gemma":[0.02419806,0.00066770765,0.0015211087,0.0015417256,0.002934582,0.001998771,0.0020591326,0.0059092315,0.00048660938],"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.0008320535,0.0001958789,0.0024925196,0.0007214907,0.00019771891,0.00043127337,0.00048170282,0.70864886,0.0049940567,0.20312314,0.005375285,0.07250605],"study_design_scores_gemma":[0.000052042862,0.00006046181,0.0007363684,0.00005344485,0.000018522647,0.000109544126,0.00003200051,0.9576605,0.001289339,0.03854495,0.001428489,0.00001442442],"about_ca_topic_score_codex":0.00873279,"about_ca_topic_score_gemma":0.006078326,"teacher_disagreement_score":0.00873279,"about_ca_system_score_codex":0.003352306,"about_ca_system_score_gemma":0.0013858409,"threshold_uncertainty_score":0.024322748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027345964,0.00016356506,0.9930512,0.00023154529,0.00008146264,0.000033185726,0.000044124066,0.00009504929,0.0035652698],"genre_scores_gemma":[0.19774625,0.0007473862,0.78139156,0.0005899464,0.0005913919,0.00051539723,0.00050953607,0.00066722435,0.017241346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877816,0.00040269224,0.00005582774,0.00017443334,0.00048307492,0.00010576779],"domain_scores_gemma":[0.99748456,0.0013019808,0.00013969408,0.00034969026,0.00057594554,0.00014796894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018440358,0.0013861827,0.0014528704,0.0009773071,0.0005573005,0.001538407,0.0021711758,0.0019995568,0.0058398866],"category_scores_gemma":[0.007392622,0.0005081645,0.00097029307,0.0011854859,0.0013970542,0.002190336,0.0031098214,0.0047259126,0.0011706465],"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.00030327373,0.00028012626,0.00061948784,0.00046830435,0.000085878644,0.0002661046,0.00021286296,0.41562775,0.01055583,0.41993612,0.021670504,0.12997368],"study_design_scores_gemma":[0.000009919654,0.000021986047,0.000034172535,0.000005266375,0.0000050794297,0.000021080514,0.000005101635,0.98445696,0.00037442546,0.013998653,0.0010610436,0.0000063155953],"about_ca_topic_score_codex":0.0034895875,"about_ca_topic_score_gemma":0.0048565073,"teacher_disagreement_score":0.0058398866,"about_ca_system_score_codex":0.000830062,"about_ca_system_score_gemma":0.002110008,"threshold_uncertainty_score":0.019536376},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072074693,0.06119188,0.005870889,0.019530125,0.89347744,0.00006818771,0.00035806265,0.00023611171,0.01854651],"genre_scores_gemma":[0.0038547849,0.04147313,0.0034231048,0.0062597743,0.8688969,0.00008696785,0.0009086645,0.00044385105,0.07465288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997982,0.00036177182,0.00015895728,0.00037143764,0.00095243583,0.00017328214],"domain_scores_gemma":[0.9940485,0.0020600234,0.00043971915,0.00032630132,0.0016706284,0.0014548845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018813529,0.0017879887,0.0024792275,0.0032671792,0.0013317018,0.0053545884,0.0017576136,0.002533948,0.06349137],"category_scores_gemma":[0.005886368,0.0005916796,0.0012712805,0.002910549,0.0010583184,0.0039123218,0.0023114944,0.004599307,0.021611728],"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.000053110714,0.000049190123,0.00008863296,0.00040868888,0.000034262514,0.00004883023,0.0000165204,0.00019968585,0.0006665466,0.002998862,0.9482659,0.047169738],"study_design_scores_gemma":[0.00002372618,0.00013667282,0.00057633396,0.00028227185,0.000036345966,0.00022590083,0.000029131561,0.0006553151,0.00041370746,0.007432013,0.9901648,0.000023662411],"about_ca_topic_score_codex":0.00034032617,"about_ca_topic_score_gemma":0.0009315618,"teacher_disagreement_score":0.06349137,"about_ca_system_score_codex":0.0012317641,"about_ca_system_score_gemma":0.0014586374,"threshold_uncertainty_score":0.21239978},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024982292,0.000633254,0.91528857,0.0055488427,0.0008415499,0.0008341624,0.0019821343,0.026381968,0.023507264],"genre_scores_gemma":[0.19038379,0.00042259778,0.7850584,0.0031257581,0.0004750103,0.0010783896,0.005974476,0.0034625002,0.010019162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962668,0.0011268501,0.00029300648,0.00070367137,0.0011790831,0.00043066245],"domain_scores_gemma":[0.98842245,0.0068274545,0.00068718084,0.001021128,0.0025206138,0.00052112405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00568856,0.0015678686,0.0013226653,0.0015382862,0.00095095875,0.004354548,0.002212082,0.002264752,0.015782649],"category_scores_gemma":[0.036300056,0.00061466906,0.0009877064,0.0011867298,0.00086422643,0.0029991143,0.0016819079,0.005625934,0.012095183],"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.0012587155,0.00087018806,0.0068330145,0.0006051447,0.00010535171,0.0002837525,0.00033479524,0.1368656,0.005358001,0.05991534,0.21709462,0.57047546],"study_design_scores_gemma":[0.00011639058,0.00009367412,0.00037197987,0.000114215174,0.000015477226,0.00006379613,0.00009574722,0.94467825,0.0045807306,0.029410047,0.020436082,0.000023571207],"about_ca_topic_score_codex":0.0027943675,"about_ca_topic_score_gemma":0.0030836263,"teacher_disagreement_score":0.015782649,"about_ca_system_score_codex":0.0015479967,"about_ca_system_score_gemma":0.0045485506,"threshold_uncertainty_score":0.05279821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082558684,0.0008244334,0.89911526,0.0004778542,0.00006674764,0.00005976776,0.0001531719,0.00006184197,0.016682206],"genre_scores_gemma":[0.85342544,0.0007930011,0.13784645,0.0001588227,0.00007025161,0.00031923552,0.00030045782,0.00014753336,0.0069386796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991061,0.00041922918,0.000030800686,0.00011509886,0.0002069321,0.00012183127],"domain_scores_gemma":[0.99809366,0.0013064798,0.00016931411,0.0000962341,0.0001783276,0.00015598141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022299276,0.0012637567,0.0012056511,0.00082745095,0.00060648104,0.0032461225,0.0010752692,0.001115841,0.003415224],"category_scores_gemma":[0.005727262,0.0006370847,0.0007574975,0.0008252469,0.0029574991,0.0024853959,0.002360223,0.0025387022,0.00039095554],"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.0001319155,0.000053046453,0.00039375632,0.00012951116,0.000025608131,0.0001651955,0.00020294718,0.24245894,0.0021631261,0.7457671,0.0007227339,0.00778604],"study_design_scores_gemma":[0.00003043757,0.00006532977,0.0001082316,0.000049395163,0.0000108256945,0.000065500324,0.00010113514,0.7383565,0.0011241065,0.2585885,0.0014837533,0.000016365122],"about_ca_topic_score_codex":0.0009309838,"about_ca_topic_score_gemma":0.0006169554,"teacher_disagreement_score":0.003415224,"about_ca_system_score_codex":0.001365701,"about_ca_system_score_gemma":0.00081459404,"threshold_uncertainty_score":0.011793137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016162788,0.00026846986,0.96858346,0.00033581382,0.00004901225,0.00019186747,0.00006481511,0.00036686205,0.013976927],"genre_scores_gemma":[0.15425897,0.0007190518,0.8301885,0.000239525,0.000081161,0.0006834224,0.00046902915,0.00042707604,0.012933278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979146,0.0005478014,0.00011150072,0.0004502738,0.0007128845,0.0002629443],"domain_scores_gemma":[0.99416083,0.004717595,0.00021457471,0.00030751832,0.00049814093,0.00010130293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019864163,0.0013735325,0.0010785239,0.00087078585,0.0010453425,0.0025260793,0.0011023433,0.0011858242,0.013613292],"category_scores_gemma":[0.01322439,0.0010688998,0.0018204264,0.0010370313,0.0018547561,0.0037490109,0.004325622,0.0053915004,0.0020795423],"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.00027046274,0.00017827634,0.0005853118,0.0010108895,0.000099462675,0.0005039339,0.0013231699,0.3113151,0.017443432,0.49907166,0.008266821,0.1599314],"study_design_scores_gemma":[0.00007126206,0.00014411431,0.00019636683,0.00016777542,0.000042836065,0.00016190618,0.00026824453,0.615177,0.010518922,0.35673913,0.016476737,0.0000357284],"about_ca_topic_score_codex":0.0017678107,"about_ca_topic_score_gemma":0.0017040329,"teacher_disagreement_score":0.013613292,"about_ca_system_score_codex":0.00095263455,"about_ca_system_score_gemma":0.0018065503,"threshold_uncertainty_score":0.04554099},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03145461,0.0009891051,0.9497289,0.00068476755,0.00012028526,0.00007376664,0.000084933796,0.00031768682,0.016546017],"genre_scores_gemma":[0.4262178,0.0015554082,0.5452801,0.00038563047,0.0003253295,0.00035615094,0.0004276969,0.0003689556,0.025082905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987847,0.0006438894,0.000036537764,0.0001376133,0.00026309298,0.00013414172],"domain_scores_gemma":[0.99672663,0.0026678415,0.00014783198,0.00011132167,0.00020638238,0.00013995207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021173782,0.0005466036,0.0006949824,0.0007073019,0.00050691585,0.0017609391,0.00085937214,0.000589479,0.0045994967],"category_scores_gemma":[0.0059141354,0.00048462843,0.000518138,0.0013188248,0.00086284574,0.0015650606,0.0010698218,0.0018658956,0.00079732155],"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.0003794336,0.00027501915,0.0020271102,0.00027290927,0.00006528915,0.00012909733,0.00023288565,0.33511418,0.0042476924,0.37629962,0.010202707,0.27075407],"study_design_scores_gemma":[0.000052484746,0.00008566981,0.00023805024,0.000040074017,0.000018915622,0.000032845433,0.00003271005,0.8343371,0.0014437115,0.15880251,0.004903238,0.00001259228],"about_ca_topic_score_codex":0.0017286843,"about_ca_topic_score_gemma":0.0024980379,"teacher_disagreement_score":0.0045994967,"about_ca_system_score_codex":0.0009814888,"about_ca_system_score_gemma":0.00094083714,"threshold_uncertainty_score":0.01538682},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086623215,0.07191632,0.0056085424,0.031487178,0.84961194,0.00013107593,0.00056908856,0.0003323254,0.03947721],"genre_scores_gemma":[0.003761407,0.046428766,0.0019347944,0.0078009367,0.80230504,0.00013622736,0.00081682345,0.0005896992,0.13622624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980835,0.00022706728,0.00014510438,0.000495643,0.0008700545,0.00017852042],"domain_scores_gemma":[0.99564713,0.001307906,0.00034711912,0.00024495425,0.001123807,0.0013290284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001789954,0.0021032027,0.0027900045,0.0030684567,0.0016102623,0.0052643195,0.0017149786,0.0027054327,0.06841301],"category_scores_gemma":[0.0050005643,0.0007034222,0.0018563803,0.0018475192,0.0010351011,0.0033725966,0.0023110018,0.005297044,0.03627234],"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.000033025997,0.000036835674,0.00013092201,0.00032667982,0.00002678317,0.0000835378,0.00002964129,0.00022189453,0.00059306104,0.0025686268,0.9628541,0.033094943],"study_design_scores_gemma":[0.00001078903,0.00005991514,0.0005577777,0.00027097727,0.000018055407,0.00030785118,0.000028198263,0.0004029992,0.0002213952,0.0037941474,0.9943129,0.000015034284],"about_ca_topic_score_codex":0.00042801135,"about_ca_topic_score_gemma":0.00081915036,"teacher_disagreement_score":0.931587,"about_ca_system_score_codex":0.0017265215,"about_ca_system_score_gemma":0.0021727444,"threshold_uncertainty_score":0.22886437},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010884961,0.0113601275,0.093492396,0.0017123885,0.0013280713,0.000036458314,0.00077375857,0.0005860005,0.8896223],"genre_scores_gemma":[0.017280295,0.013155916,0.031336118,0.0006944409,0.0010374945,0.00013114014,0.0011462237,0.0008744903,0.9343438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963915,0.000036965237,0.000011828193,0.000064904416,0.00022730694,0.000019899986],"domain_scores_gemma":[0.9998332,0.000050178623,0.000008476159,0.00004276773,0.00005125544,0.000014027967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028996865,0.0014731614,0.0011208145,0.0013503246,0.0007118067,0.002546908,0.0008207334,0.00078832934,0.0789087],"category_scores_gemma":[0.0008591592,0.0005687537,0.0005970869,0.0024550706,0.0010397721,0.0021707553,0.0013329579,0.0031534533,0.05016146],"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.000013723613,0.000027052962,0.00005971092,0.00023145374,0.000017220935,0.000042082538,0.000081318445,0.0028900297,0.0013066634,0.39323264,0.33145055,0.2706476],"study_design_scores_gemma":[0.0000057217935,0.000016333795,0.0003268866,0.0001394535,0.000013278305,0.00016989604,0.000039215487,0.004935386,0.00096427277,0.2113434,0.78203076,0.00001540647],"about_ca_topic_score_codex":0.0008828435,"about_ca_topic_score_gemma":0.0018152283,"teacher_disagreement_score":0.0789087,"about_ca_system_score_codex":0.0011646298,"about_ca_system_score_gemma":0.0007512759,"threshold_uncertainty_score":0.26397586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005104676,0.003644053,0.2393327,0.0029208579,0.00097427785,0.0000595138,0.0010190178,0.0006210879,0.74632376],"genre_scores_gemma":[0.15438655,0.0075836387,0.11877475,0.0014152678,0.0015232398,0.00025086748,0.0027308506,0.001204172,0.7121307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962354,0.0000742105,0.000012766729,0.00008790631,0.00016880271,0.000032751188],"domain_scores_gemma":[0.9997329,0.000068890666,0.000022743548,0.000058268917,0.00008791626,0.000029146173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029951808,0.0009718603,0.0007658325,0.0013958978,0.0007869371,0.0031308746,0.0007615983,0.0006406021,0.06933863],"category_scores_gemma":[0.0010651504,0.00035220385,0.0007218675,0.0016295359,0.0011619908,0.0018773137,0.0013580434,0.002567542,0.019818557],"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.000007013059,0.000012809991,0.00005253378,0.00003942084,0.000007921376,0.000011225,0.000026505353,0.0034501867,0.00022961071,0.89836806,0.03954037,0.05825423],"study_design_scores_gemma":[0.0000065686054,0.00001473267,0.00014779187,0.000036511206,0.00000816419,0.00006827439,0.00003991627,0.009556914,0.00029124852,0.7707805,0.21904126,0.000008105639],"about_ca_topic_score_codex":0.0010448045,"about_ca_topic_score_gemma":0.0011180366,"teacher_disagreement_score":0.06933863,"about_ca_system_score_codex":0.0012059062,"about_ca_system_score_gemma":0.0007430023,"threshold_uncertainty_score":0.23196077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067150127,0.026898632,0.44605854,0.0128032295,0.009547457,0.00032720974,0.0077049257,0.0007823033,0.48916262],"genre_scores_gemma":[0.1852746,0.04899643,0.17843284,0.008192231,0.0077638193,0.0012944549,0.0070796465,0.001223779,0.5617422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876094,0.00024486435,0.00007705756,0.00028887423,0.0005329272,0.00009540545],"domain_scores_gemma":[0.9989254,0.0003127239,0.0001427397,0.0001567605,0.00040759429,0.000054684926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093749556,0.0015925597,0.001364232,0.0014634493,0.0010683389,0.0025503484,0.0016417846,0.0022266633,0.04848531],"category_scores_gemma":[0.0039799954,0.0005056243,0.0017015152,0.0014323177,0.0015102978,0.0025409516,0.0034005046,0.0037687405,0.016540948],"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.000023312103,0.0000280999,0.0006698428,0.00044074302,0.00004550753,0.00019628336,0.00017526247,0.025476221,0.0012876285,0.8738261,0.054247,0.04358401],"study_design_scores_gemma":[0.00002859761,0.000042605843,0.0007583931,0.000253848,0.000032648437,0.00054475595,0.00009566406,0.07575101,0.0007500867,0.4811292,0.440551,0.000062142666],"about_ca_topic_score_codex":0.004713649,"about_ca_topic_score_gemma":0.0035031692,"teacher_disagreement_score":0.04848531,"about_ca_system_score_codex":0.0014623438,"about_ca_system_score_gemma":0.0015641892,"threshold_uncertainty_score":0.1621995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010048574,0.009574322,0.16022876,0.0019786183,0.0012488705,0.00004396701,0.00055969745,0.00086833007,0.8244925],"genre_scores_gemma":[0.017375061,0.010135823,0.04943624,0.0008626655,0.0012024879,0.00013960262,0.0009145472,0.0006850315,0.91924864],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996039,0.00005805635,0.000011821867,0.00007702939,0.00022607316,0.000023111905],"domain_scores_gemma":[0.9997669,0.00008120964,0.000011508095,0.000053287135,0.000071794966,0.000015373646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431958,0.0014556055,0.00086339685,0.0009247644,0.0005947293,0.0023624012,0.00092323334,0.0006914314,0.07865514],"category_scores_gemma":[0.0008842524,0.0005336692,0.00046514723,0.0019844065,0.00087321165,0.0019788314,0.0010397809,0.002897387,0.04776374],"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.00001800232,0.00006675813,0.000081211445,0.00027378325,0.000019586036,0.00003437345,0.000069951115,0.005638162,0.0012209801,0.27638474,0.34747177,0.36872062],"study_design_scores_gemma":[0.000008268444,0.000025209265,0.00025648193,0.00014785648,0.000013370534,0.00012634226,0.000043798005,0.012227331,0.0011663445,0.24456646,0.74140316,0.000015388305],"about_ca_topic_score_codex":0.00095661834,"about_ca_topic_score_gemma":0.0018699575,"teacher_disagreement_score":0.07865514,"about_ca_system_score_codex":0.0010666938,"about_ca_system_score_gemma":0.00082683534,"threshold_uncertainty_score":0.26312762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015268217,0.0011160732,0.97113514,0.0014400561,0.0002161237,0.00014762692,0.00027409065,0.0016993327,0.008703227],"genre_scores_gemma":[0.20718499,0.0007496625,0.78044707,0.0011771659,0.00035305799,0.0008449881,0.001139218,0.0007205918,0.007383242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993299,0.0024704116,0.0003776458,0.0012776261,0.0018811509,0.0006941784],"domain_scores_gemma":[0.988786,0.006994031,0.00040871816,0.0026317416,0.0009462151,0.00023348122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043256674,0.0015015362,0.0016688704,0.0012491138,0.0012759324,0.0021747127,0.003502814,0.0016576059,0.0058902865],"category_scores_gemma":[0.020989986,0.0012388243,0.0020887454,0.0022662738,0.0022900738,0.0038372031,0.003537555,0.005646929,0.001926974],"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.0007214754,0.00030754838,0.0015998406,0.00040697952,0.00016664393,0.00009430103,0.00027478454,0.29453644,0.0070332903,0.51541746,0.021298705,0.1581426],"study_design_scores_gemma":[0.00022373795,0.000089196146,0.00031950197,0.000028765353,0.000034221623,0.000046965157,0.000025980788,0.7362169,0.0027273244,0.24999522,0.010255835,0.000036279715],"about_ca_topic_score_codex":0.0058303317,"about_ca_topic_score_gemma":0.009576285,"teacher_disagreement_score":0.0058902865,"about_ca_system_score_codex":0.004089905,"about_ca_system_score_gemma":0.0031008213,"threshold_uncertainty_score":0.02967447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040361047,0.0008605324,0.92774796,0.0007959341,0.00054382184,0.00037473624,0.0005987577,0.0039922716,0.024724847],"genre_scores_gemma":[0.15698391,0.00045517582,0.82703626,0.00038668234,0.00028917563,0.0003346843,0.001333401,0.001151948,0.0120287035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987357,0.00031950607,0.000109273875,0.00024362041,0.00044683236,0.00014507395],"domain_scores_gemma":[0.9952833,0.0024004583,0.0002857399,0.0011667669,0.0006812366,0.00018251705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567647,0.0009078758,0.0012035273,0.0015996225,0.00056968495,0.0019910776,0.001966859,0.00089736027,0.018552996],"category_scores_gemma":[0.010747582,0.0006312227,0.00085198967,0.0019741491,0.00042910047,0.0031199905,0.0014223759,0.0018841694,0.004276559],"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.0005832027,0.0004235938,0.0015503102,0.00030101617,0.00006970426,0.00018186349,0.00017690742,0.13821751,0.014625021,0.034608062,0.02905991,0.78020287],"study_design_scores_gemma":[0.00027278985,0.00017792976,0.0006917216,0.00009600999,0.000072497576,0.00017466543,0.00009647726,0.93331426,0.006924447,0.03972329,0.018419767,0.00003611241],"about_ca_topic_score_codex":0.002056205,"about_ca_topic_score_gemma":0.004791341,"teacher_disagreement_score":0.018552996,"about_ca_system_score_codex":0.000489288,"about_ca_system_score_gemma":0.0010458305,"threshold_uncertainty_score":0.06206596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058271834,0.00010545569,0.99357516,0.000027884573,0.000014256749,0.000019452538,0.0000046199334,0.000047716047,0.0003783038],"genre_scores_gemma":[0.2019608,0.00043144685,0.7947092,0.00004357396,0.000050345396,0.00031175927,0.0000627662,0.000075836586,0.0023541884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.00010384087,0.00001696742,0.00006337395,0.00009621366,0.000019673396],"domain_scores_gemma":[0.9997272,0.00014364813,0.000022494833,0.000023742426,0.000060671788,0.000022220634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008827804,0.0008197512,0.0009955874,0.00052876153,0.00040965006,0.00044968823,0.00094771927,0.0006829802,0.0013063169],"category_scores_gemma":[0.0013914203,0.00036655844,0.0007013849,0.0004515826,0.00094199023,0.001075471,0.0013892925,0.0012677865,0.0002908408],"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.00020388179,0.00008474881,0.0012380311,0.00048315714,0.000108031396,0.000277669,0.000478132,0.58428055,0.044879757,0.1261234,0.001438826,0.24040371],"study_design_scores_gemma":[0.00001436637,0.00011106167,0.00009455978,0.000010667915,0.00001066701,0.00005962986,0.00002275761,0.9804058,0.0027180675,0.01501746,0.001522421,0.000012507063],"about_ca_topic_score_codex":0.001066357,"about_ca_topic_score_gemma":0.0005959186,"teacher_disagreement_score":0.0013063169,"about_ca_system_score_codex":0.0002665081,"about_ca_system_score_gemma":0.0007139151,"threshold_uncertainty_score":0.0046685934},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011764084,0.07799212,0.14738235,0.0035009107,0.006095805,0.00005675627,0.00035268613,0.0008245324,0.7626185],"genre_scores_gemma":[0.00869352,0.044256415,0.0374803,0.00086092774,0.0031070788,0.00010487107,0.00034297243,0.00061785866,0.904536],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996842,0.000033819822,0.000010013589,0.000037275604,0.00022107201,0.000013686902],"domain_scores_gemma":[0.99972945,0.00010853635,0.000015693062,0.000040374074,0.00007824412,0.000027603712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003185582,0.0015459931,0.0010696484,0.0015776121,0.0005555898,0.0018140535,0.00083129527,0.00081736373,0.048012864],"category_scores_gemma":[0.0009301565,0.00054133346,0.00047469497,0.0020483471,0.0009154799,0.0025361462,0.0016461681,0.0024835428,0.0345653],"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.000018857905,0.00003950603,0.00010281579,0.00049431185,0.00002256066,0.000041114257,0.00009022586,0.005962707,0.0018358505,0.17137818,0.3849507,0.43506318],"study_design_scores_gemma":[0.0000041819094,0.000014206288,0.0002616057,0.0001964277,0.000009602963,0.00012375208,0.000031721695,0.0057458375,0.00057776,0.13106532,0.8619555,0.000013987414],"about_ca_topic_score_codex":0.0008739533,"about_ca_topic_score_gemma":0.0029600116,"teacher_disagreement_score":0.048012864,"about_ca_system_score_codex":0.00088494783,"about_ca_system_score_gemma":0.0007937306,"threshold_uncertainty_score":0.16061902},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015469358,0.00008929701,0.9764822,0.00022333677,0.000056473713,0.000050018385,0.000118619486,0.00080036593,0.0067102835],"genre_scores_gemma":[0.2177183,0.0002815724,0.76748854,0.0003100608,0.000075597156,0.00019307394,0.00045152038,0.0016817378,0.011799621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00016134372,0.000036811703,0.00016409594,0.00039331775,0.000112775364],"domain_scores_gemma":[0.9981717,0.0008461788,0.00013340639,0.0001833182,0.00051632983,0.00014914441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016848801,0.0008736794,0.0008277214,0.0007756933,0.00072045485,0.0022350142,0.0012620216,0.0009140365,0.007473139],"category_scores_gemma":[0.0055039343,0.00045690808,0.00094159535,0.0006499215,0.0016232785,0.002074389,0.002024387,0.0021500457,0.0017498061],"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.00020384985,0.00020586337,0.0032260886,0.00042637522,0.000059143484,0.00049314403,0.00051339495,0.4496269,0.014076463,0.3809643,0.00965823,0.14054616],"study_design_scores_gemma":[0.00001357898,0.000035736324,0.00015371344,0.000032434134,0.000006725076,0.000082824576,0.000053003983,0.92276514,0.00359859,0.06738114,0.005863253,0.000013814578],"about_ca_topic_score_codex":0.004684903,"about_ca_topic_score_gemma":0.0043432456,"teacher_disagreement_score":0.007473139,"about_ca_system_score_codex":0.0010464506,"about_ca_system_score_gemma":0.0021665103,"threshold_uncertainty_score":0.025000155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011924563,0.0056317016,0.2040661,0.0014278968,0.0013778774,0.00006296827,0.00047364878,0.0010905678,0.78467673],"genre_scores_gemma":[0.02624019,0.006589895,0.060218126,0.00070698815,0.00079607725,0.00016264526,0.0009652145,0.0011254268,0.9031955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996401,0.00004558938,0.000011332412,0.00008138711,0.00019975578,0.000021803959],"domain_scores_gemma":[0.9998487,0.000040571504,0.000008287845,0.00005084858,0.000040486433,0.00001101401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031599886,0.0011567859,0.0009370664,0.0008041978,0.0005347372,0.0017947262,0.0010681328,0.0009392353,0.101817206],"category_scores_gemma":[0.0009067515,0.00042383,0.0007160307,0.0010721694,0.0008346189,0.0017363258,0.0014890225,0.001969354,0.050735213],"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.000032939886,0.00004703402,0.00008437951,0.0004091126,0.00003271189,0.00004597577,0.000063450796,0.019968951,0.0031692453,0.41943425,0.18666907,0.37004283],"study_design_scores_gemma":[0.000012114795,0.000027674372,0.00020381522,0.0001283489,0.00001552744,0.00014059541,0.000023971266,0.0198992,0.0024381417,0.26450706,0.7125839,0.00001972191],"about_ca_topic_score_codex":0.000574924,"about_ca_topic_score_gemma":0.00083477003,"teacher_disagreement_score":0.101817206,"about_ca_system_score_codex":0.0007979482,"about_ca_system_score_gemma":0.000557334,"threshold_uncertainty_score":0.34061247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001149075,0.00014265168,0.99789834,0.00008263073,0.000019191042,0.000016444583,0.000008599929,0.000055489458,0.00062761246],"genre_scores_gemma":[0.19351335,0.0010079298,0.7949553,0.00022359137,0.00014071385,0.00043901528,0.00017046247,0.00031663396,0.009233003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909484,0.0005274312,0.000040790823,0.000095217794,0.00019000302,0.000051857267],"domain_scores_gemma":[0.996097,0.0030192942,0.00021024338,0.00018603327,0.0003762268,0.00011120469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035084097,0.0014401191,0.0015741887,0.00081501604,0.0005571866,0.0010730114,0.0015962382,0.0015983977,0.003634006],"category_scores_gemma":[0.009312982,0.0008246133,0.000912802,0.00089824316,0.0016142204,0.0011956727,0.0024027799,0.0025659206,0.0010492601],"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.00007185421,0.00005651251,0.00029309344,0.00027871956,0.00006974146,0.00014130952,0.0001070111,0.8349118,0.0014045883,0.12387808,0.0018671107,0.036920156],"study_design_scores_gemma":[0.000009724738,0.00001848787,0.00002581203,0.0000139107815,0.0000039303786,0.00001991461,0.000008118043,0.97866714,0.00030467697,0.020087177,0.00083574577,0.0000052869864],"about_ca_topic_score_codex":0.0017390605,"about_ca_topic_score_gemma":0.0019369114,"teacher_disagreement_score":0.003634006,"about_ca_system_score_codex":0.00075753365,"about_ca_system_score_gemma":0.0017071449,"threshold_uncertainty_score":0.01855445},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061558,0.0020095655,0.03619542,0.0022564735,0.0009400459,0.000059807477,0.00033771785,0.00032282565,0.9572626],"genre_scores_gemma":[0.024726503,0.0036027515,0.026421785,0.001752821,0.00086689333,0.00024255212,0.0005918686,0.00046849737,0.94132626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993755,0.000104985134,0.000020814861,0.00012908688,0.00029712234,0.00007241968],"domain_scores_gemma":[0.9996724,0.00008819384,0.000012782618,0.00008590954,0.00011211857,0.000028552398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005684946,0.0009486434,0.00049906527,0.0011220585,0.0016111595,0.0031217886,0.0014093999,0.001344101,0.10872934],"category_scores_gemma":[0.0014485057,0.00042109872,0.00045785966,0.00093789975,0.0026462674,0.003942692,0.0018671029,0.002539927,0.06731703],"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.000005623399,0.00001339157,0.000025982032,0.000057455458,0.000001931781,0.000014400446,0.00014632725,0.00019850177,0.00018822955,0.89250547,0.07408105,0.0327617],"study_design_scores_gemma":[0.0000027333108,0.0000060330985,0.00004205025,0.00004648013,0.0000015572688,0.000051917203,0.00004771261,0.00025333863,0.00018750368,0.3626833,0.6366729,0.0000044466574],"about_ca_topic_score_codex":0.0011845112,"about_ca_topic_score_gemma":0.0014464112,"teacher_disagreement_score":0.10872934,"about_ca_system_score_codex":0.0012652592,"about_ca_system_score_gemma":0.001324982,"threshold_uncertainty_score":0.36373585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001739832,0.00014180687,0.99715024,0.00010943627,0.00003120019,0.000030023279,0.000014269961,0.000046905378,0.0007362403],"genre_scores_gemma":[0.06369016,0.0005088307,0.9314386,0.0001635109,0.00010100058,0.0002416926,0.00010088045,0.0000801203,0.0036751188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965453,0.00011114216,0.000018034227,0.00006717636,0.0001305233,0.000018699659],"domain_scores_gemma":[0.9997235,0.00013817512,0.000026669928,0.000021960923,0.00006792081,0.000021705237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204277,0.00086907047,0.0006794177,0.00044746322,0.00036297986,0.00047175254,0.0009131982,0.0011771623,0.0017275171],"category_scores_gemma":[0.0011479837,0.00039777695,0.00067345233,0.00043548422,0.0007097134,0.0009713849,0.0011253388,0.0019573653,0.00047984623],"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.00014845555,0.00019008435,0.00085984106,0.0009487722,0.000135494,0.00033344366,0.00036087382,0.5276543,0.05567291,0.13162702,0.008165215,0.2739036],"study_design_scores_gemma":[0.000016328733,0.000045239052,0.000084271225,0.000009498758,0.000007646463,0.0000778816,0.000011680308,0.9885182,0.0030736101,0.005086058,0.0030539362,0.000015701631],"about_ca_topic_score_codex":0.0016333036,"about_ca_topic_score_gemma":0.0022520476,"teacher_disagreement_score":0.0017275171,"about_ca_system_score_codex":0.0003964306,"about_ca_system_score_gemma":0.001285382,"threshold_uncertainty_score":0.005779147},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003135466,0.003719235,0.5852951,0.0009180148,0.0014326565,0.00007966694,0.0005017303,0.0015469267,0.40337127],"genre_scores_gemma":[0.055661343,0.0064963736,0.2286354,0.001482823,0.0012324259,0.00034941782,0.0018200175,0.0035797125,0.7007425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992624,0.00013179008,0.000024766234,0.00012853216,0.000385614,0.000066851426],"domain_scores_gemma":[0.9995402,0.00014325861,0.000021358292,0.0001581379,0.00009859374,0.00003858542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067656947,0.0017362582,0.0013520136,0.0023337167,0.0011403516,0.0025178432,0.001770926,0.0014260522,0.06803764],"category_scores_gemma":[0.0024998863,0.00078868895,0.001288828,0.0016082681,0.0016584765,0.003157824,0.0036729558,0.003939475,0.04133733],"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.00003992986,0.00004398035,0.00012100776,0.00017265901,0.00003617463,0.000041320447,0.000115609764,0.00431506,0.001540996,0.6793841,0.06886594,0.24532315],"study_design_scores_gemma":[0.000017060696,0.000021235337,0.00018505997,0.00012487188,0.000017720009,0.00021729352,0.000042627973,0.020143492,0.0021358265,0.65656066,0.3205063,0.000027911963],"about_ca_topic_score_codex":0.00048336314,"about_ca_topic_score_gemma":0.00092326064,"teacher_disagreement_score":0.06803764,"about_ca_system_score_codex":0.00064776675,"about_ca_system_score_gemma":0.00065250735,"threshold_uncertainty_score":0.22760856},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04313123,0.01814114,0.74161476,0.002541055,0.001091879,0.00010424348,0.0006800258,0.00027803297,0.19241759],"genre_scores_gemma":[0.6082156,0.022715209,0.3106242,0.0017270166,0.0027134311,0.0005690829,0.0011111993,0.00052589446,0.051798385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00017709179,0.000052469186,0.00009819957,0.00021113003,0.000056713245],"domain_scores_gemma":[0.9989699,0.00042738672,0.0001472905,0.00014659963,0.000245371,0.000063465144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001341298,0.0009121851,0.00073498953,0.0020611668,0.0007328071,0.0028842213,0.0009062285,0.0009894152,0.0036639764],"category_scores_gemma":[0.0036831356,0.00031094975,0.00046759428,0.0027081063,0.003194292,0.0040758126,0.0012254671,0.0027100826,0.0015757311],"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.000014434846,0.00001008631,0.00020486189,0.000061286846,0.000004331135,0.000042729127,0.00017913895,0.0011515535,0.00078082475,0.97398776,0.002007551,0.021555403],"study_design_scores_gemma":[0.0000080170485,0.000042884825,0.0006649011,0.00009128299,0.00000991697,0.0005763478,0.00026822143,0.018619528,0.0019089028,0.8866745,0.09109984,0.000035605804],"about_ca_topic_score_codex":0.00072804483,"about_ca_topic_score_gemma":0.0004306985,"teacher_disagreement_score":0.0036639764,"about_ca_system_score_codex":0.0006621974,"about_ca_system_score_gemma":0.000523901,"threshold_uncertainty_score":0.012257278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005254558,0.00014558333,0.9935481,0.00010590211,0.000043811535,0.00003973223,0.00001503519,0.000101647405,0.00074565643],"genre_scores_gemma":[0.14371647,0.00029682057,0.8512785,0.00014548753,0.000089146095,0.00029824828,0.00014953956,0.000104481296,0.0039213495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995345,0.00012831177,0.000027967995,0.00006281036,0.00020438139,0.000042084226],"domain_scores_gemma":[0.99894565,0.00052947167,0.00006339143,0.00006758519,0.00031554903,0.00007834856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019270969,0.00090363534,0.0010179539,0.0007607268,0.0005664223,0.0005711793,0.0014257521,0.0014703198,0.0022896107],"category_scores_gemma":[0.0028832243,0.00043851102,0.0008228598,0.0006455843,0.0008384431,0.0012716037,0.001664898,0.0020178652,0.0005253882],"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.000264909,0.0002517072,0.0017523057,0.00040147468,0.000110940135,0.00030399582,0.0003254936,0.59902316,0.024945237,0.07828006,0.0047621755,0.28957862],"study_design_scores_gemma":[0.000011891716,0.00002618283,0.000044714943,0.0000057260727,0.0000035308142,0.000025006786,0.0000072660023,0.9932554,0.0008142249,0.0050433604,0.0007583847,0.000004286741],"about_ca_topic_score_codex":0.003593,"about_ca_topic_score_gemma":0.0033723467,"teacher_disagreement_score":0.003593,"about_ca_system_score_codex":0.00044439753,"about_ca_system_score_gemma":0.0019537702,"threshold_uncertainty_score":0.01019156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015492305,0.0008549665,0.97079957,0.00019749514,0.00018748033,0.00020527514,0.000100527046,0.0013760043,0.010786326],"genre_scores_gemma":[0.07704999,0.0007303429,0.9175579,0.00020639536,0.00013129902,0.00029291114,0.00033607546,0.00039932068,0.0032956733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901795,0.0004015403,0.000039234706,0.00014163174,0.0002685044,0.00013112281],"domain_scores_gemma":[0.9972384,0.0020018332,0.0001264742,0.00023492149,0.0003201752,0.00007815738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020731091,0.0016005664,0.001247694,0.0017994489,0.00047400407,0.0011556195,0.0008584702,0.00065378257,0.0077069905],"category_scores_gemma":[0.0041949293,0.00069417147,0.0011767251,0.0027268804,0.00039687168,0.0018644681,0.0008798405,0.0015918927,0.0019156638],"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.00022848968,0.00025861574,0.0008276915,0.0003255231,0.00012356382,0.00008515011,0.00008818985,0.4882524,0.010155352,0.020150438,0.009633659,0.469871],"study_design_scores_gemma":[0.000105124345,0.00012965324,0.00030697952,0.00004689321,0.000050864634,0.000037341375,0.000030723768,0.9768261,0.0033411426,0.011417573,0.007687358,0.00002030016],"about_ca_topic_score_codex":0.00397888,"about_ca_topic_score_gemma":0.008875729,"teacher_disagreement_score":0.0077069905,"about_ca_system_score_codex":0.00063409255,"about_ca_system_score_gemma":0.0018962305,"threshold_uncertainty_score":0.025782466},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004212951,0.0030547401,0.6226802,0.00089201564,0.0012653421,0.00009116312,0.0005375804,0.0016701331,0.36559594],"genre_scores_gemma":[0.073512524,0.005094793,0.21468134,0.0014388209,0.001163791,0.0004326178,0.0019781108,0.0033407006,0.69835734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928856,0.00013549995,0.000023594126,0.00013469919,0.00034870376,0.00006900533],"domain_scores_gemma":[0.9994906,0.00014804059,0.000023927725,0.00018695604,0.00010706903,0.00004326908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006560217,0.0016702827,0.0014777045,0.0024142496,0.0012560651,0.002530424,0.0017272768,0.0014280872,0.06417998],"category_scores_gemma":[0.0025839515,0.00078626507,0.0013030322,0.0017274882,0.0015710098,0.0032623443,0.0036551391,0.0039604716,0.039194506],"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.00004264161,0.000050185863,0.00013932624,0.00015079204,0.000036871963,0.00003678686,0.00011717271,0.003949518,0.0014705536,0.72290546,0.05943112,0.21166964],"study_design_scores_gemma":[0.000021024696,0.00002361883,0.00019687715,0.00009793355,0.000019292243,0.00018771862,0.000043126714,0.023220202,0.0022246984,0.7435615,0.2303794,0.000024633538],"about_ca_topic_score_codex":0.0004645499,"about_ca_topic_score_gemma":0.0008336116,"teacher_disagreement_score":0.06417998,"about_ca_system_score_codex":0.0006386394,"about_ca_system_score_gemma":0.0006461826,"threshold_uncertainty_score":0.21470344},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050254224,0.0003358777,0.017290518,0.00046487953,0.00081115874,0.00003826581,0.00034935214,0.00073873013,0.9794686],"genre_scores_gemma":[0.007019569,0.0006654854,0.006111624,0.00031049523,0.00019105684,0.000045145072,0.00054537103,0.00061184325,0.9844994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997794,0.000017867094,0.0000056556114,0.00006068798,0.00010083242,0.000035639045],"domain_scores_gemma":[0.99978036,0.000018757048,0.000008466073,0.000053451025,0.00010127332,0.00003764607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019912976,0.00091090926,0.00044124053,0.0008970897,0.0010120681,0.0028830857,0.00089461094,0.00078484655,0.28984362],"category_scores_gemma":[0.0007293699,0.000328903,0.00033946146,0.0007733075,0.00072601344,0.0025538285,0.001499757,0.0014489624,0.22458853],"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.000044721393,0.00003344718,0.00011701968,0.000092211136,0.0000030301808,0.00006108401,0.00020335137,0.00029040966,0.002983174,0.3423194,0.39033717,0.263515],"study_design_scores_gemma":[0.0000036232384,0.000006406112,0.00007220085,0.000020514968,0.0000017983415,0.000071811075,0.000050198138,0.00019186766,0.00078316795,0.026183698,0.97261083,0.000003906399],"about_ca_topic_score_codex":0.0018727455,"about_ca_topic_score_gemma":0.0027259598,"teacher_disagreement_score":0.28984362,"about_ca_system_score_codex":0.0007664498,"about_ca_system_score_gemma":0.00084367197,"threshold_uncertainty_score":0.9696235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004552676,0.0008947535,0.97468513,0.0010215259,0.00015771287,0.000016027861,0.00011076758,0.000042969838,0.018518554],"genre_scores_gemma":[0.55182916,0.0059778923,0.3885602,0.0010790572,0.0012699248,0.00030658825,0.00054693734,0.00020687858,0.050223365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924505,0.00027002854,0.000028267797,0.000072151444,0.00033910538,0.000045457116],"domain_scores_gemma":[0.99933857,0.0003239617,0.000060786482,0.00007348293,0.00013951237,0.00006365341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014573544,0.0005909841,0.0005996244,0.0007900259,0.00040203752,0.0014893458,0.0008641404,0.00056906627,0.003485421],"category_scores_gemma":[0.0021275035,0.0003060694,0.0005610299,0.00077048846,0.0019210213,0.0021132142,0.0013859319,0.0028832215,0.0006797376],"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.00000426089,0.0000075242997,0.000040752162,0.000028440722,0.0000055456003,0.000012417843,0.000023802713,0.01744585,0.00033058412,0.97684723,0.000844408,0.004409077],"study_design_scores_gemma":[0.000007676119,0.000019154159,0.00008431263,0.00001960521,0.000005097165,0.000043299966,0.000020456886,0.291915,0.00042444654,0.6967562,0.010692629,0.000012174102],"about_ca_topic_score_codex":0.00094899785,"about_ca_topic_score_gemma":0.0007515745,"teacher_disagreement_score":0.003485421,"about_ca_system_score_codex":0.0012857609,"about_ca_system_score_gemma":0.0010868774,"threshold_uncertainty_score":0.011659861},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033412094,0.00012650111,0.9949321,0.00013040048,0.000024881056,0.00003199431,0.00002117181,0.000058741247,0.0013329599],"genre_scores_gemma":[0.22922026,0.0004897455,0.7656747,0.00028568905,0.00018126913,0.00056301913,0.0003092798,0.00033388525,0.0029421973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934756,0.0031756943,0.0004678209,0.00076159986,0.0019609784,0.00015833128],"domain_scores_gemma":[0.98569065,0.009601676,0.0008287133,0.0016104525,0.0018855915,0.0003828945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009927655,0.0011508552,0.0013551681,0.0018127512,0.0008485556,0.0026909783,0.00246233,0.0018046853,0.002566857],"category_scores_gemma":[0.03556981,0.0007378043,0.0013356406,0.0017007426,0.0031855148,0.0044354536,0.0064598285,0.0036254714,0.00077094126],"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.00019369401,0.000075762015,0.00094791024,0.0002647473,0.00007710525,0.00009663476,0.00029449025,0.17626885,0.0036461216,0.7480101,0.0010901598,0.06903437],"study_design_scores_gemma":[0.000024455601,0.00012662988,0.0001454467,0.00006096942,0.000012921346,0.00006643355,0.000034737604,0.77469414,0.0033475033,0.21749036,0.003973066,0.000023352795],"about_ca_topic_score_codex":0.000618281,"about_ca_topic_score_gemma":0.00034643902,"teacher_disagreement_score":0.009927655,"about_ca_system_score_codex":0.0014121715,"about_ca_system_score_gemma":0.0015146862,"threshold_uncertainty_score":0.05250311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028264027,0.00123977,0.9876187,0.0005088816,0.00021899951,0.00006255877,0.00004997266,0.0001619922,0.0073127416],"genre_scores_gemma":[0.25771236,0.0045416974,0.71223134,0.0011969351,0.0009397844,0.0007588125,0.00045293785,0.0011485668,0.02101754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734265,0.0008296453,0.00016158973,0.00032420264,0.0011107537,0.00023114521],"domain_scores_gemma":[0.9854651,0.0074705863,0.00085573085,0.0010998936,0.004046279,0.0010624767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008421288,0.0024903954,0.0013016652,0.0026560568,0.0012655599,0.0026399437,0.0028585775,0.00302426,0.0045870873],"category_scores_gemma":[0.025906386,0.0007401412,0.0026542647,0.0013643788,0.0044484534,0.0034084336,0.0038202314,0.0050393213,0.0022054017],"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.00036553532,0.00026906643,0.0025868292,0.0011514882,0.00022672657,0.00051249634,0.0007425794,0.14694992,0.011530469,0.68437076,0.015580096,0.13571404],"study_design_scores_gemma":[0.000055842338,0.00019575034,0.0006624249,0.00026258695,0.00007151081,0.000464473,0.000094192306,0.8158915,0.008949285,0.16106068,0.012190809,0.0001009852],"about_ca_topic_score_codex":0.0026378187,"about_ca_topic_score_gemma":0.0015583868,"teacher_disagreement_score":0.008421288,"about_ca_system_score_codex":0.0017138999,"about_ca_system_score_gemma":0.0020360635,"threshold_uncertainty_score":0.04453653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004240829,0.00043512267,0.98242366,0.00017510586,0.00005336568,0.000017960701,0.00004940915,0.00035118914,0.012253352],"genre_scores_gemma":[0.18703139,0.0008325447,0.78617084,0.0002064114,0.00016933176,0.0002800315,0.00044867492,0.0010518999,0.023808932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992447,0.00028702413,0.000027277576,0.000121194425,0.00026155138,0.000058291364],"domain_scores_gemma":[0.99813336,0.0012533217,0.00007703022,0.00031469524,0.00016062502,0.000061020473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013131722,0.0015079525,0.0013504524,0.00085387076,0.0006961553,0.0017596856,0.001462504,0.0011968423,0.0100039225],"category_scores_gemma":[0.0059257383,0.0005305768,0.0010898219,0.0011087296,0.0017323896,0.00253645,0.0029026056,0.003557367,0.002103541],"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.00015689699,0.00010037281,0.0002081918,0.0002509733,0.000058465816,0.00004581714,0.00016103228,0.22028434,0.0023432707,0.4902953,0.01157315,0.27452222],"study_design_scores_gemma":[0.000048309725,0.000034776753,0.000065905864,0.000042529267,0.000016182905,0.00004274971,0.000024651872,0.67709935,0.0018583969,0.31375122,0.007002175,0.000013699326],"about_ca_topic_score_codex":0.0016330743,"about_ca_topic_score_gemma":0.0031889644,"teacher_disagreement_score":0.0100039225,"about_ca_system_score_codex":0.0011707798,"about_ca_system_score_gemma":0.0010401099,"threshold_uncertainty_score":0.03346646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09231121,0.00063470216,0.8506542,0.0012943845,0.00025210393,0.00046021587,0.00080819486,0.005436883,0.04814816],"genre_scores_gemma":[0.25416273,0.0003438342,0.7325969,0.00042183325,0.00012508254,0.00029330948,0.0012564362,0.0010327891,0.009767039],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809605,0.00056303723,0.00013633067,0.00039519338,0.0004983678,0.00031098083],"domain_scores_gemma":[0.99639374,0.0023113815,0.00022063937,0.00056017644,0.00041342436,0.00010058751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018471446,0.0014484753,0.0010756797,0.0011158095,0.0010017615,0.0022027378,0.0015103646,0.00079890346,0.018512942],"category_scores_gemma":[0.0068347254,0.00084126246,0.0012990414,0.00200699,0.00105845,0.0041864743,0.0027478456,0.0024733595,0.0031904168],"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.0021915664,0.0006571662,0.0017318598,0.001018525,0.00013034401,0.00045177055,0.0004398649,0.26506284,0.023192948,0.14105995,0.037080053,0.5269832],"study_design_scores_gemma":[0.000437743,0.0002872662,0.0003798769,0.000074598734,0.00007604997,0.00022171173,0.00026949716,0.78347427,0.013609722,0.18682365,0.014312375,0.000033242915],"about_ca_topic_score_codex":0.0022206826,"about_ca_topic_score_gemma":0.005804205,"teacher_disagreement_score":0.018512942,"about_ca_system_score_codex":0.0010491827,"about_ca_system_score_gemma":0.0013095745,"threshold_uncertainty_score":0.061931908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002715817,0.0040466464,0.16419987,0.0012667683,0.00078667246,0.000054195847,0.0004245069,0.00050898676,0.82599664],"genre_scores_gemma":[0.086867265,0.007896359,0.07393509,0.00083766575,0.00093415537,0.00026005204,0.0013479143,0.000979074,0.8269425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969065,0.000047339494,0.000010948538,0.0000996745,0.00012440044,0.000027001206],"domain_scores_gemma":[0.9997565,0.00007088685,0.000014724203,0.000078093566,0.00006339771,0.000016363867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032827366,0.001085722,0.0009468122,0.0011627416,0.0008747469,0.002165214,0.0010757308,0.00095570093,0.07087387],"category_scores_gemma":[0.0013141874,0.0004620419,0.0006893428,0.0014485546,0.0012592173,0.0027578636,0.0012196603,0.0027983526,0.028053282],"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.00001729181,0.000015930296,0.000044109805,0.000090101814,0.000009697791,0.000022792541,0.000053646487,0.0019250126,0.0005596699,0.85686654,0.047013346,0.09338178],"study_design_scores_gemma":[0.000011714715,0.000023843744,0.00012225607,0.000081497434,0.000011536185,0.000117335265,0.000039749066,0.0040863,0.00094969175,0.7081756,0.28636888,0.000011675766],"about_ca_topic_score_codex":0.00078825804,"about_ca_topic_score_gemma":0.0008787103,"teacher_disagreement_score":0.07087387,"about_ca_system_score_codex":0.0011960417,"about_ca_system_score_gemma":0.0005797642,"threshold_uncertainty_score":0.23709673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010173369,0.00011432506,0.9977718,0.00005542504,0.000031496173,0.000019453923,0.0000114323475,0.00009911471,0.0008795597],"genre_scores_gemma":[0.18742935,0.0007406722,0.800718,0.00030196737,0.00020520575,0.00041414573,0.00020343957,0.00025502004,0.009732184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993956,0.00021073852,0.000023689327,0.00008587781,0.00024946802,0.000034644472],"domain_scores_gemma":[0.99960476,0.00017644581,0.000024817806,0.000028661118,0.00014017322,0.000025227027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365755,0.00062466465,0.000701864,0.0005016642,0.0003190293,0.00047795888,0.001189409,0.00065829704,0.0037374757],"category_scores_gemma":[0.001686029,0.00028858497,0.0005709964,0.00054940034,0.00063320267,0.00092210673,0.0014226739,0.0014758897,0.0009045312],"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.00021822478,0.00015569325,0.00055791746,0.0009255415,0.000080477796,0.00020028219,0.00022082368,0.5254656,0.02468096,0.09329147,0.008048959,0.34615403],"study_design_scores_gemma":[0.000022614184,0.000084707215,0.00008487452,0.000011301772,0.000007897467,0.000045409874,0.000008695875,0.9863644,0.0012816024,0.0071398453,0.004938439,0.000010181081],"about_ca_topic_score_codex":0.0015474431,"about_ca_topic_score_gemma":0.0012403777,"teacher_disagreement_score":0.0037374757,"about_ca_system_score_codex":0.0004108607,"about_ca_system_score_gemma":0.0011217261,"threshold_uncertainty_score":0.0125030875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007448141,0.00096432626,0.9854908,0.0005897502,0.00022995433,0.000023032468,0.000044957418,0.000040723426,0.005168279],"genre_scores_gemma":[0.5541778,0.0022676769,0.4210872,0.0006186961,0.00042023679,0.00023141906,0.0003009599,0.00032708043,0.02056886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908686,0.00058575557,0.000033782922,0.000083596635,0.00015628606,0.00005374526],"domain_scores_gemma":[0.99763227,0.0015953949,0.00015821854,0.00020942149,0.00028322297,0.0001216091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002247505,0.0009012755,0.0011209681,0.0005985609,0.00049576745,0.0015180035,0.00084670924,0.0009696148,0.0019856752],"category_scores_gemma":[0.0062400643,0.00057147496,0.00090344675,0.0005779455,0.00216096,0.0020360453,0.00244752,0.0031814142,0.00026789345],"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.00013369009,0.00006814853,0.00056248636,0.00024523473,0.00005503636,0.00005833769,0.00016165276,0.35609132,0.0034559688,0.60953534,0.0027575742,0.026875162],"study_design_scores_gemma":[0.0000085930515,0.000023577959,0.000050075025,0.000022714568,0.000006759625,0.000016013826,0.000023418337,0.83664036,0.00043797444,0.16072595,0.002035709,0.000008910537],"about_ca_topic_score_codex":0.0023735361,"about_ca_topic_score_gemma":0.0022799312,"teacher_disagreement_score":0.0023735361,"about_ca_system_score_codex":0.00078850513,"about_ca_system_score_gemma":0.0010279288,"threshold_uncertainty_score":0.01188606},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000961323,0.0020533763,0.57541764,0.000768429,0.00095037115,0.00015796955,0.0021486306,0.028952215,0.3885901],"genre_scores_gemma":[0.012293293,0.0018801464,0.42946604,0.0010901303,0.00030219773,0.00046969834,0.0042636087,0.014799863,0.53543496],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995394,0.000049962353,0.000017806693,0.00010132483,0.00025140087,0.000040150702],"domain_scores_gemma":[0.9995208,0.00015931827,0.00001998698,0.00008137212,0.00017804706,0.00004051235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060496014,0.0011535706,0.0010794912,0.0012152832,0.0010800349,0.0018118885,0.0018061359,0.0013707986,0.25197867],"category_scores_gemma":[0.0017533012,0.0010328306,0.00090466527,0.0012878096,0.00055675075,0.0018969723,0.0017130075,0.0020076297,0.12238251],"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.00006288672,0.00005852962,0.00014311989,0.00041537947,0.000027060812,0.000045217486,0.000089623994,0.011972373,0.002671926,0.084974475,0.45259258,0.4469468],"study_design_scores_gemma":[0.000021911246,0.000018062106,0.00015365664,0.00012153143,0.000012026071,0.000100477126,0.000019396484,0.047479436,0.0021934174,0.05559189,0.8942625,0.000025629108],"about_ca_topic_score_codex":0.0031312539,"about_ca_topic_score_gemma":0.008260481,"teacher_disagreement_score":0.25197867,"about_ca_system_score_codex":0.0011187372,"about_ca_system_score_gemma":0.0012708894,"threshold_uncertainty_score":0.8429526},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011082721,0.0049180756,0.18195091,0.002803509,0.0010839812,0.000036541725,0.0003965487,0.0005794525,0.8071227],"genre_scores_gemma":[0.04178144,0.005694303,0.06008727,0.0010066867,0.0011142198,0.00013969162,0.0007518334,0.0010218227,0.88840264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962187,0.00008508286,0.000011572366,0.00006705852,0.00018936013,0.00002499812],"domain_scores_gemma":[0.99969196,0.00012845015,0.000012871127,0.00008740214,0.000059171394,0.000020163701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047154122,0.0012687045,0.0008995647,0.00061901775,0.00055033376,0.001699672,0.00081830076,0.0009291198,0.10963468],"category_scores_gemma":[0.0017203538,0.00040905864,0.0005546488,0.0010689823,0.00095826807,0.001707109,0.0012234137,0.0024597263,0.038839895],"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.000020237809,0.000042377993,0.000066546956,0.00020481435,0.000016536374,0.000033520046,0.00004660064,0.015525138,0.00078852306,0.53568363,0.25365862,0.19391343],"study_design_scores_gemma":[0.0000117182935,0.000025720094,0.00017608305,0.00009674575,0.000009351464,0.000096047545,0.000028859336,0.027060805,0.00067652465,0.50187504,0.46993187,0.000011245475],"about_ca_topic_score_codex":0.00075688964,"about_ca_topic_score_gemma":0.0012307703,"teacher_disagreement_score":0.10963468,"about_ca_system_score_codex":0.00091415545,"about_ca_system_score_gemma":0.0006438995,"threshold_uncertainty_score":0.36676455},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015735338,0.00014027668,0.9949338,0.00006472681,0.00008861587,0.000025594152,0.00006501944,0.0012506194,0.0018578352],"genre_scores_gemma":[0.044906244,0.00020974531,0.9480002,0.00016103339,0.00007981643,0.0002357924,0.0002527949,0.0014067051,0.004747705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988557,0.0004307657,0.00005582856,0.000111667396,0.00043986333,0.000106119944],"domain_scores_gemma":[0.99705815,0.0015685512,0.00016157646,0.00051707006,0.00053537067,0.00015943217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021167295,0.0016919787,0.0017050763,0.0016713525,0.0009293482,0.0020830294,0.0029916994,0.0016908676,0.021066748],"category_scores_gemma":[0.008705581,0.0011771747,0.0020249016,0.0021636134,0.0008043438,0.0029468716,0.0032346866,0.004816303,0.005762213],"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.00040999975,0.00021512217,0.0007239331,0.0004119278,0.00015615956,0.00016043813,0.00020037312,0.5487089,0.005051121,0.08387144,0.012689265,0.34740126],"study_design_scores_gemma":[0.000014343046,0.000023354603,0.000031238887,0.000022661005,0.000008869912,0.00002062049,0.000014367278,0.9841541,0.00085813156,0.010211647,0.004630068,0.000010554519],"about_ca_topic_score_codex":0.006005952,"about_ca_topic_score_gemma":0.008899318,"teacher_disagreement_score":0.021066748,"about_ca_system_score_codex":0.0009109123,"about_ca_system_score_gemma":0.0018968207,"threshold_uncertainty_score":0.07047534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035168822,0.0030203874,0.97350425,0.001224225,0.00046577278,0.000087966546,0.000106248655,0.00011207304,0.01796218],"genre_scores_gemma":[0.14397724,0.009242529,0.8043121,0.0016376659,0.0021434599,0.0010031149,0.0008275774,0.0012684697,0.035587873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979443,0.0012471934,0.00007478491,0.00021258979,0.00038291822,0.000138133],"domain_scores_gemma":[0.9925442,0.0061715064,0.00027519363,0.0003013632,0.00049658824,0.00021121127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004274838,0.002952614,0.0017154776,0.0017919607,0.0010440338,0.0020959687,0.0021495118,0.0023819155,0.010282534],"category_scores_gemma":[0.016297737,0.001196775,0.00192491,0.0026183296,0.002578156,0.0032700794,0.0036840562,0.007700667,0.0018868094],"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.0002158393,0.0002512011,0.00037474674,0.0012380468,0.00016333796,0.00018032681,0.00045085337,0.2943487,0.0023621821,0.55721015,0.019699078,0.12350553],"study_design_scores_gemma":[0.000054940894,0.00005294247,0.00010886611,0.00019029713,0.000033658536,0.00004473032,0.00006812992,0.65445226,0.00038155928,0.32960942,0.014981813,0.000021428914],"about_ca_topic_score_codex":0.0039261286,"about_ca_topic_score_gemma":0.0035853193,"teacher_disagreement_score":0.010282534,"about_ca_system_score_codex":0.0013721479,"about_ca_system_score_gemma":0.0015218678,"threshold_uncertainty_score":0.034398556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004654585,0.000316708,0.9879644,0.00032503213,0.00034736827,0.00007568399,0.00013460912,0.00041657407,0.0057650367],"genre_scores_gemma":[0.07504263,0.0006025113,0.90265554,0.0002910752,0.00023017116,0.00039717555,0.00036723455,0.00087909005,0.019534575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978596,0.00008835026,0.000013503634,0.00003005072,0.000065708395,0.000016457709],"domain_scores_gemma":[0.9994978,0.00018130211,0.000027969876,0.000059127527,0.00017582563,0.00005797406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074898096,0.000616153,0.00060439535,0.00047560513,0.000647859,0.00085822935,0.0010900805,0.0009613067,0.015925078],"category_scores_gemma":[0.0014623501,0.0004416803,0.00080323545,0.0005748133,0.000651525,0.00093032763,0.0011836472,0.0018566401,0.0031243092],"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.00026624248,0.0004250645,0.00068564323,0.0007235871,0.00014397544,0.00042074203,0.0005249535,0.33643243,0.019959249,0.25338256,0.06286023,0.32417542],"study_design_scores_gemma":[0.00003903694,0.000050401195,0.000087835295,0.00002720699,0.000008787781,0.000049310762,0.000033443026,0.9629523,0.001173536,0.025568571,0.009991936,0.000017677741],"about_ca_topic_score_codex":0.0037777582,"about_ca_topic_score_gemma":0.0058180257,"teacher_disagreement_score":0.015925078,"about_ca_system_score_codex":0.0003382992,"about_ca_system_score_gemma":0.0012047831,"threshold_uncertainty_score":0.05327469},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054943617,0.08742797,0.24377353,0.005615655,0.006752473,0.000054206466,0.00039019983,0.0010316233,0.6494599],"genre_scores_gemma":[0.1568339,0.083269574,0.16742446,0.0036901634,0.010563692,0.00018761466,0.000721453,0.0013427781,0.5759663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995049,0.00010555454,0.000015302547,0.00007356179,0.00027051018,0.000030206575],"domain_scores_gemma":[0.99943906,0.00029080798,0.000043727046,0.00007563092,0.00011796759,0.00003277507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051209604,0.0013286107,0.0008893158,0.001448063,0.0006626709,0.0024782373,0.00081812026,0.0006641947,0.020056488],"category_scores_gemma":[0.0025177835,0.0005996036,0.00040201913,0.0029463728,0.0020011817,0.0034424558,0.0010859718,0.0028370854,0.0089659095],"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.000020950742,0.000019193643,0.000081826394,0.0002301743,0.000013148303,0.000040120125,0.00009201217,0.0023969996,0.0007468091,0.77670765,0.08345443,0.13619672],"study_design_scores_gemma":[0.000007615451,0.000013914573,0.00018721756,0.000056402732,0.000008806496,0.00022830324,0.000029750567,0.0029010128,0.00033632285,0.80277234,0.19344588,0.0000124946455],"about_ca_topic_score_codex":0.0005526775,"about_ca_topic_score_gemma":0.00087263697,"teacher_disagreement_score":0.020056488,"about_ca_system_score_codex":0.00086804637,"about_ca_system_score_gemma":0.00069787743,"threshold_uncertainty_score":0.06709564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002439507,0.00012073044,0.9947472,0.000098611206,0.00003626396,0.000018805385,0.000010653809,0.00016313719,0.0023650331],"genre_scores_gemma":[0.08528281,0.00036160907,0.9037668,0.00020669951,0.00010053095,0.000154742,0.00007547092,0.00045668185,0.009594626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996238,0.00013200495,0.000011802963,0.000050045546,0.00015465826,0.000027677655],"domain_scores_gemma":[0.99972504,0.00011302338,0.000025197049,0.000035859593,0.00007281231,0.000028053288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009203268,0.0006665299,0.0005832373,0.0004946751,0.00031970826,0.00068376656,0.0008860734,0.0008790591,0.0018850727],"category_scores_gemma":[0.0015346449,0.0003224313,0.00052886916,0.00032269358,0.0012320294,0.0011162482,0.0013955688,0.0012161041,0.0009976816],"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.00012793853,0.00011873199,0.00071741117,0.00043927296,0.00010796719,0.00020565557,0.00031643567,0.24271849,0.028224587,0.5643356,0.0071715154,0.15551642],"study_design_scores_gemma":[0.000021181493,0.000086108,0.00015407786,0.000029395984,0.0000099339495,0.00010671908,0.000014191915,0.94255567,0.0044707893,0.04211304,0.010415558,0.000023247796],"about_ca_topic_score_codex":0.0013840345,"about_ca_topic_score_gemma":0.0012289071,"teacher_disagreement_score":0.0018850727,"about_ca_system_score_codex":0.00039545225,"about_ca_system_score_gemma":0.0010094956,"threshold_uncertainty_score":0.006306231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030997926,0.00020278274,0.9944382,0.00007422724,0.00016476752,0.000038798622,0.000022553986,0.00010070778,0.0018581719],"genre_scores_gemma":[0.100637175,0.00066870364,0.88599586,0.00019236554,0.00026830155,0.00032754528,0.00016368147,0.0004821545,0.011264171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999503,0.00023180169,0.000019792506,0.000041611078,0.00017842073,0.000025408845],"domain_scores_gemma":[0.99917173,0.00038972584,0.0000454465,0.00006228611,0.00026268337,0.00006815695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012363406,0.0010224968,0.0012140382,0.00066609425,0.00035816373,0.0007505782,0.0012367654,0.0012527418,0.0036932111],"category_scores_gemma":[0.002862609,0.00044101404,0.0008404216,0.0005326005,0.000752575,0.0010212633,0.0015763725,0.0017542912,0.0009910956],"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.00033086495,0.00022744904,0.00059426785,0.0006746285,0.00015593252,0.00029902987,0.00022409977,0.5268089,0.024930004,0.21838295,0.010289624,0.21708222],"study_design_scores_gemma":[0.000008342451,0.00003492526,0.000046253317,0.000010286963,0.0000065058,0.000027418928,0.00000416652,0.9899451,0.000698922,0.005969799,0.0032391923,0.000009042941],"about_ca_topic_score_codex":0.0017510134,"about_ca_topic_score_gemma":0.0018880507,"teacher_disagreement_score":0.0036932111,"about_ca_system_score_codex":0.0003520271,"about_ca_system_score_gemma":0.0011437774,"threshold_uncertainty_score":0.012355089},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05950314,0.00018971972,0.9218468,0.00047088257,0.00009925933,0.00010197569,0.00010699117,0.00028818217,0.017392892],"genre_scores_gemma":[0.60255355,0.00025821372,0.38319483,0.00042976235,0.00008199611,0.0002595917,0.0003680265,0.00028421148,0.012569741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933213,0.00025514356,0.000017993163,0.00009017387,0.0002268755,0.000077677076],"domain_scores_gemma":[0.9992519,0.00038100296,0.00008242124,0.0001050129,0.000116041316,0.00006365565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013364436,0.0007551415,0.00055908976,0.00044782803,0.0003277277,0.0006703508,0.00079905347,0.00056970696,0.004007658],"category_scores_gemma":[0.0027493264,0.00024838824,0.0008247147,0.00029713495,0.001126066,0.0008103657,0.0012830897,0.0017179822,0.00044137935],"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.00022963692,0.00024511604,0.0006811478,0.00017436592,0.000038336697,0.00027844255,0.0001435168,0.62397575,0.009687563,0.24527812,0.006904272,0.112363726],"study_design_scores_gemma":[0.000026534246,0.00005807901,0.00008774077,0.00001225616,0.0000062424265,0.00004166317,0.000021788084,0.9365602,0.0020769192,0.059446774,0.0016544192,0.0000072305347],"about_ca_topic_score_codex":0.0013149562,"about_ca_topic_score_gemma":0.0015172788,"teacher_disagreement_score":0.004007658,"about_ca_system_score_codex":0.0007306552,"about_ca_system_score_gemma":0.0008889947,"threshold_uncertainty_score":0.013406992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10700879,0.002469873,0.862991,0.0029005,0.0016974373,0.00032280243,0.00048577294,0.00084185443,0.021282004],"genre_scores_gemma":[0.47889307,0.0036752685,0.4595316,0.0006768681,0.0009002467,0.0013242693,0.0008550949,0.0026935884,0.051450104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996947,0.0015823832,0.00008162771,0.00033888963,0.00081015384,0.00023995744],"domain_scores_gemma":[0.9695227,0.025980812,0.0007215682,0.00071322225,0.0022351053,0.000826553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006738332,0.004536362,0.0034428877,0.00277449,0.0017957808,0.0047256723,0.0024868855,0.006081086,0.009886775],"category_scores_gemma":[0.030045148,0.0014292451,0.0021175505,0.0015706522,0.0037416453,0.003432702,0.0020897347,0.010381522,0.0021449754],"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.0020174796,0.0007114278,0.0023011537,0.0019051929,0.0004878733,0.0013229956,0.0016451471,0.5712574,0.068479545,0.19774911,0.015959015,0.13616365],"study_design_scores_gemma":[0.00015155235,0.00011943597,0.000993997,0.00012688867,0.00004888147,0.000255946,0.00021137699,0.9670442,0.016714076,0.007797293,0.0064486484,0.00008771921],"about_ca_topic_score_codex":0.021410005,"about_ca_topic_score_gemma":0.013028122,"teacher_disagreement_score":0.021410005,"about_ca_system_score_codex":0.0031488652,"about_ca_system_score_gemma":0.0033348019,"threshold_uncertainty_score":0.04257077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011312657,0.000088830435,0.97672606,0.00037669193,0.000048728707,0.00007050271,0.00017226061,0.0002700968,0.0109342635],"genre_scores_gemma":[0.41696388,0.00037450192,0.5662588,0.00055291294,0.00011711901,0.00082362344,0.0010965284,0.00044839477,0.013364261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.00029131948,0.0000321638,0.00016656985,0.0003154848,0.00009769024],"domain_scores_gemma":[0.99866116,0.00079289475,0.00013773111,0.00018845928,0.00016325836,0.000056480763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011929055,0.001232051,0.00078569213,0.0005871388,0.0004533365,0.0012060318,0.0013835008,0.0008856871,0.006451304],"category_scores_gemma":[0.0041714385,0.000615954,0.0012395545,0.0005038264,0.0014519127,0.001840348,0.0024405117,0.0028703162,0.0009858833],"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.000059306814,0.00008641996,0.00025235355,0.000097822944,0.000016619459,0.000113312555,0.00009727537,0.7957154,0.0019917958,0.16416936,0.005237247,0.032163188],"study_design_scores_gemma":[0.000011231824,0.000014716132,0.000028204291,0.000009177189,0.0000020248474,0.000012201264,0.000014996238,0.9499933,0.0003617352,0.048484687,0.0010634509,0.000004301721],"about_ca_topic_score_codex":0.0029425526,"about_ca_topic_score_gemma":0.0043005557,"teacher_disagreement_score":0.006451304,"about_ca_system_score_codex":0.0011497971,"about_ca_system_score_gemma":0.0011735846,"threshold_uncertainty_score":0.021581769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01887304,0.00012330282,0.97809327,0.000067227,0.00006116321,0.00005754213,0.000021468853,0.00052190514,0.0021811007],"genre_scores_gemma":[0.21796039,0.00014320562,0.77641934,0.00007244908,0.00004311108,0.00022419602,0.0001178991,0.00010488563,0.0049145506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998851,0.000021041958,0.0000071538293,0.00002603425,0.000046135043,0.000014538689],"domain_scores_gemma":[0.9997899,0.000080603335,0.000019400819,0.000028176599,0.00006318066,0.000018704457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039608477,0.0005283769,0.0006880141,0.0006731029,0.00051568233,0.0005379223,0.0010880393,0.00079847465,0.0033851506],"category_scores_gemma":[0.0006957879,0.00028911454,0.00045806373,0.0005673895,0.0004274091,0.0005952924,0.00081304775,0.00077699753,0.0005992479],"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.00019314338,0.00017574002,0.0011830417,0.0001562687,0.00006249976,0.00021533718,0.00017269282,0.4723525,0.020791013,0.026288286,0.0030926485,0.47531676],"study_design_scores_gemma":[0.000008369547,0.000022114926,0.000042572425,0.0000023520108,0.0000022133631,0.000013302474,0.000004330522,0.99777055,0.00075303484,0.00079624593,0.00058209896,0.000002909519],"about_ca_topic_score_codex":0.0042197416,"about_ca_topic_score_gemma":0.003724668,"teacher_disagreement_score":0.0042197416,"about_ca_system_score_codex":0.0003409006,"about_ca_system_score_gemma":0.0013811943,"threshold_uncertainty_score":0.011324465},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010758846,0.001670655,0.54339427,0.00045543938,0.0016099999,0.00016590304,0.0005663863,0.001515211,0.43986335],"genre_scores_gemma":[0.20329595,0.0040946645,0.42856348,0.0011440897,0.00087101496,0.000500376,0.0020605305,0.00326651,0.3562035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999081,0.00014067373,0.00006320117,0.00016706741,0.00044807477,0.00009989702],"domain_scores_gemma":[0.99937123,0.00015137039,0.000054340973,0.00019089498,0.00018174949,0.000050447343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937408,0.00088402495,0.0012164905,0.0021203978,0.0012825368,0.0022860733,0.0013635124,0.0008873148,0.041024458],"category_scores_gemma":[0.0027719343,0.00063291244,0.00096021296,0.0019038817,0.001942291,0.0025672098,0.0017695988,0.0027877367,0.016930819],"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.000035424284,0.000023322384,0.00009735387,0.00011996105,0.000013530774,0.00006358136,0.00007175009,0.003168591,0.00107751,0.87854916,0.022719085,0.09406073],"study_design_scores_gemma":[0.000022179713,0.000038276426,0.0002034829,0.00006572967,0.000015071225,0.00028245227,0.000057158362,0.010170595,0.0035929698,0.8814833,0.104032606,0.000036132686],"about_ca_topic_score_codex":0.0004620093,"about_ca_topic_score_gemma":0.0007938153,"teacher_disagreement_score":0.041024458,"about_ca_system_score_codex":0.00054708205,"about_ca_system_score_gemma":0.0009663021,"threshold_uncertainty_score":0.13724047},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018815622,0.0027427354,0.572909,0.00118839,0.0022048925,0.00025253612,0.002788665,0.0033845755,0.3957136],"genre_scores_gemma":[0.20124893,0.0042574382,0.59408426,0.001573575,0.0011007977,0.000390374,0.0053003924,0.0027036872,0.18934058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989982,0.00008378107,0.00015814186,0.00031883718,0.00035215038,0.00008888026],"domain_scores_gemma":[0.9986156,0.00048840645,0.00007005502,0.0004414064,0.0003289012,0.000055610162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062761083,0.0007276939,0.0012680576,0.0014898011,0.0016238496,0.0028744598,0.0016552301,0.0008624956,0.028980993],"category_scores_gemma":[0.0038419433,0.00053443783,0.00090965733,0.0026973176,0.0013293948,0.00482639,0.0012050007,0.0027265733,0.013621687],"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.00012205592,0.00009583094,0.00027498094,0.00036871585,0.000024979214,0.00014965847,0.00020166597,0.0017170346,0.00254102,0.5648416,0.05364408,0.3760183],"study_design_scores_gemma":[0.000034315937,0.000049551898,0.00020589957,0.00014610299,0.000040700696,0.00047445978,0.00007433855,0.007541268,0.0057212957,0.7617422,0.22393127,0.000038588998],"about_ca_topic_score_codex":0.0009811765,"about_ca_topic_score_gemma":0.0016970662,"teacher_disagreement_score":0.028980993,"about_ca_system_score_codex":0.00060157385,"about_ca_system_score_gemma":0.00088227174,"threshold_uncertainty_score":0.09695113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042768824,0.00011481032,0.99238,0.00006557154,0.00007009872,0.00002725741,0.000015924737,0.00067001994,0.0023793813],"genre_scores_gemma":[0.15318722,0.000429255,0.83547,0.000109738365,0.00010790687,0.00019305508,0.00014000777,0.0006322328,0.00973049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996151,0.00007726503,0.000021750744,0.000055612123,0.00019217817,0.000037957314],"domain_scores_gemma":[0.9995436,0.00012423727,0.000048511996,0.00010548386,0.00014022495,0.000037937232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066060363,0.0007041385,0.00064232363,0.0007618564,0.0005455553,0.00070019177,0.0011031013,0.0007812194,0.004363656],"category_scores_gemma":[0.001652967,0.0003478286,0.00070472626,0.0005136428,0.0007557631,0.00085785403,0.0013596513,0.0014293969,0.0018424444],"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.00022368168,0.00013687243,0.00090792135,0.0003092652,0.00008117505,0.00027243083,0.000504662,0.32103184,0.06676176,0.236166,0.008110553,0.36549374],"study_design_scores_gemma":[0.000018804682,0.0000879458,0.00013459564,0.000022450049,0.0000131282095,0.000083949766,0.00002245219,0.9633027,0.00981294,0.012983245,0.013492015,0.000025930345],"about_ca_topic_score_codex":0.0020788773,"about_ca_topic_score_gemma":0.0021090466,"teacher_disagreement_score":0.004363656,"about_ca_system_score_codex":0.0003566665,"about_ca_system_score_gemma":0.0010145999,"threshold_uncertainty_score":0.014597893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041985977,0.0002808596,0.9918487,0.00024505964,0.000043881406,0.0000445455,0.000058406273,0.00012702629,0.0031528997],"genre_scores_gemma":[0.15355602,0.0010749529,0.8368362,0.0002329338,0.0001262904,0.0006126661,0.00037646724,0.00034584073,0.0068384944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988984,0.000606472,0.000034141663,0.00010343473,0.00029090268,0.000066643915],"domain_scores_gemma":[0.9984068,0.0010811752,0.000097013384,0.00016908288,0.00016212137,0.00008378189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021679476,0.0015900931,0.001106517,0.00094091607,0.00069304084,0.0015596071,0.0012353996,0.0017989599,0.0060646543],"category_scores_gemma":[0.007126515,0.00077049725,0.0011183114,0.0013022157,0.0012747311,0.0020953903,0.0031262913,0.0034240969,0.0012344203],"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.00012909377,0.00008957444,0.00045182768,0.0002427867,0.00006467946,0.000095829186,0.00016207837,0.75361097,0.001656429,0.13846985,0.005310424,0.09971645],"study_design_scores_gemma":[0.00001287976,0.000023486686,0.00004336303,0.000023934621,0.0000039718243,0.000021896009,0.00001806911,0.94918215,0.00033776526,0.048523117,0.001802726,0.000006663159],"about_ca_topic_score_codex":0.0035631338,"about_ca_topic_score_gemma":0.0031149876,"teacher_disagreement_score":0.0060646543,"about_ca_system_score_codex":0.0007180934,"about_ca_system_score_gemma":0.0014631789,"threshold_uncertainty_score":0.020288289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004535987,0.00032572582,0.9860843,0.00027216322,0.00020451241,0.000054042946,0.000106230145,0.00014409088,0.008272972],"genre_scores_gemma":[0.08455176,0.0009050298,0.890698,0.00045787453,0.00034496735,0.0003544305,0.00034911663,0.00047610307,0.021862673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957615,0.00013920579,0.000015580223,0.00006346545,0.0001614954,0.00004408475],"domain_scores_gemma":[0.9993864,0.00034308757,0.000041477662,0.00007598233,0.00011120744,0.000041912874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088399247,0.0012203145,0.0007817511,0.00093036663,0.00054853153,0.0011820755,0.0015863638,0.0014104062,0.0102218315],"category_scores_gemma":[0.0026661858,0.0007436813,0.0011473272,0.001003632,0.0008468759,0.0017526061,0.0018724173,0.0030159557,0.0016747351],"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.0002768092,0.00015301917,0.00043985838,0.00061990117,0.00013126417,0.0002215886,0.00021959617,0.45505428,0.010817725,0.21251215,0.021944724,0.29760912],"study_design_scores_gemma":[0.000036006393,0.000050032377,0.000081829705,0.000042683074,0.000018474468,0.0000623643,0.000024323308,0.94959635,0.0011871231,0.037052564,0.011833028,0.0000152340035],"about_ca_topic_score_codex":0.0025175859,"about_ca_topic_score_gemma":0.0037052513,"teacher_disagreement_score":0.0102218315,"about_ca_system_score_codex":0.00054037024,"about_ca_system_score_gemma":0.001136471,"threshold_uncertainty_score":0.034195483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028885694,0.00013168942,0.9939474,0.00006617719,0.000028053058,0.00003981535,0.000023910532,0.00007151613,0.0028027913],"genre_scores_gemma":[0.23432529,0.00079133944,0.7563382,0.00019843753,0.0001019785,0.00038536964,0.00036189478,0.00034164966,0.007155878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00019500866,0.000041603213,0.00014464969,0.00022644472,0.00004763086],"domain_scores_gemma":[0.99908376,0.00051990367,0.00008247437,0.00010049078,0.00017356031,0.000039863404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017038301,0.0016458451,0.00088056596,0.00087923126,0.0003642215,0.0010603995,0.0011188132,0.00092800055,0.004176378],"category_scores_gemma":[0.005011045,0.00042995848,0.0008200567,0.0007563633,0.0013287422,0.0018974582,0.0015241359,0.002505107,0.0007107442],"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.00006251053,0.00005450716,0.00034619396,0.0002282577,0.000028894887,0.0001474548,0.00013007107,0.6051765,0.005117208,0.28902635,0.0023758882,0.09730614],"study_design_scores_gemma":[0.000010652024,0.000034709807,0.00005281632,0.000019989197,0.0000052919754,0.000041971685,0.000017599488,0.96442366,0.0015758404,0.031329356,0.0024790491,0.000009085638],"about_ca_topic_score_codex":0.0017199593,"about_ca_topic_score_gemma":0.0013373927,"teacher_disagreement_score":0.004176378,"about_ca_system_score_codex":0.0008862016,"about_ca_system_score_gemma":0.00092669023,"threshold_uncertainty_score":0.013971388},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011858621,0.00036247793,0.99741554,0.000101382204,0.000052395044,0.000028472348,0.0000075378766,0.000047500438,0.0007988281],"genre_scores_gemma":[0.0764286,0.0015441459,0.9181308,0.0002248113,0.0002456328,0.00035986243,0.00009300737,0.00014004989,0.0028329596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832004,0.0006727448,0.00010787176,0.00026015312,0.00054838625,0.00009083661],"domain_scores_gemma":[0.9981579,0.0011175281,0.00009575015,0.0001677486,0.0003879035,0.00007308237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032927634,0.0018062253,0.0016031319,0.00086507795,0.0007372104,0.0015265144,0.0021278772,0.0019884252,0.0025024798],"category_scores_gemma":[0.0072435774,0.00078540016,0.0015651247,0.001719946,0.0019980292,0.0029532013,0.0035543782,0.0044054114,0.00080452894],"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.0001536305,0.0001706671,0.0006169484,0.0007945418,0.0001398515,0.0001992534,0.0004437212,0.40461338,0.01145174,0.26468801,0.003759327,0.312969],"study_design_scores_gemma":[0.00001546002,0.000062636325,0.000049317372,0.000025221418,0.000009152137,0.00006322163,0.000016235665,0.9659457,0.0014210021,0.029569443,0.002808913,0.000013736194],"about_ca_topic_score_codex":0.0022823384,"about_ca_topic_score_gemma":0.0016508438,"teacher_disagreement_score":0.0032927634,"about_ca_system_score_codex":0.00067323097,"about_ca_system_score_gemma":0.0025893964,"threshold_uncertainty_score":0.017414033},"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":"editorial","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037108155,0.110714085,0.24151193,0.02667749,0.5356867,0.00021797654,0.0007979065,0.0005385433,0.0801446],"genre_scores_gemma":[0.03796681,0.086535856,0.06433482,0.009473767,0.6455283,0.0005327411,0.0018756369,0.001445126,0.15230705],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978179,0.0006569012,0.00019974336,0.0004758588,0.0007231187,0.00012649714],"domain_scores_gemma":[0.9954417,0.0029535743,0.0002202323,0.00036221973,0.00070475205,0.0003175664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024620127,0.0016691016,0.002221174,0.0018610266,0.0009693298,0.0043435427,0.0016575797,0.0029049572,0.03377108],"category_scores_gemma":[0.007832895,0.0005745879,0.0025652763,0.0015331251,0.0016333448,0.003495806,0.0015605608,0.006651618,0.008506102],"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.00010500499,0.00016055416,0.00047791505,0.0010985737,0.0002630948,0.00028476454,0.00011992895,0.0073966323,0.0014626577,0.14393722,0.7293127,0.11538097],"study_design_scores_gemma":[0.000048658512,0.00022579794,0.0011055842,0.0005424218,0.0001113008,0.0008920136,0.00007047712,0.035019472,0.00074331526,0.16646239,0.79471457,0.000063892614],"about_ca_topic_score_codex":0.00041947194,"about_ca_topic_score_gemma":0.00048924884,"teacher_disagreement_score":0.03377108,"about_ca_system_score_codex":0.001143376,"about_ca_system_score_gemma":0.0011802915,"threshold_uncertainty_score":0.11297548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006853789,0.00051927025,0.99200696,0.00010773627,0.000086527,0.000009431063,0.000066189554,0.00031689953,0.0062015834],"genre_scores_gemma":[0.13550282,0.0040853834,0.7409063,0.00036425472,0.00037940452,0.00022849129,0.0008756039,0.0009835525,0.11667419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998404,0.000034723675,0.0000060190346,0.000034396988,0.000074236865,0.000010312987],"domain_scores_gemma":[0.999848,0.00006405614,0.000011630243,0.0000307694,0.000038237155,0.000007177249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025271386,0.000678259,0.00074190454,0.0002881061,0.0002662653,0.00067196076,0.0009934291,0.00074923976,0.009304741],"category_scores_gemma":[0.000829247,0.00033211982,0.00067101914,0.00084549515,0.00037242088,0.0009933345,0.0006362309,0.001955168,0.0049101794],"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.000055448116,0.00007515091,0.00017814057,0.00036352928,0.000043693897,0.00008901712,0.00006231453,0.4697159,0.008324948,0.23199068,0.031632382,0.25746885],"study_design_scores_gemma":[0.0000048153242,0.000022603273,0.000091405076,0.000015402868,0.0000107111755,0.000054438136,0.000007376153,0.93531406,0.0012545693,0.043229774,0.019983798,0.000011165854],"about_ca_topic_score_codex":0.0026774067,"about_ca_topic_score_gemma":0.0034685933,"teacher_disagreement_score":0.009304741,"about_ca_system_score_codex":0.00043228807,"about_ca_system_score_gemma":0.0006059186,"threshold_uncertainty_score":0.031127453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021627152,0.003529434,0.91271704,0.0039996663,0.0020255796,0.000040019553,0.0001692657,0.0002642525,0.05562756],"genre_scores_gemma":[0.49463248,0.008839052,0.3111427,0.0015695926,0.0055248006,0.00037343384,0.00048287367,0.0009928317,0.17644225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943036,0.00029095245,0.000023972234,0.00010173767,0.00012975195,0.000023174849],"domain_scores_gemma":[0.99859923,0.0008749251,0.0001028421,0.00009956872,0.00023093706,0.00009250798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015281716,0.0010566139,0.00077204773,0.0012189101,0.0004944368,0.0015462833,0.0006124942,0.0008546704,0.009931016],"category_scores_gemma":[0.006652267,0.00044886142,0.0005994962,0.0017356458,0.002533678,0.0024954907,0.0012614368,0.003147882,0.001817028],"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.00007145511,0.000038459708,0.00021883681,0.0001364669,0.000021536549,0.000070682334,0.00008664162,0.026394226,0.0019395222,0.8772717,0.0124923475,0.08125808],"study_design_scores_gemma":[0.000016930391,0.000041433188,0.00024912696,0.000035262718,0.000008362932,0.000052705353,0.000023684863,0.16646133,0.00076909555,0.8185353,0.013789807,0.00001697291],"about_ca_topic_score_codex":0.0011959085,"about_ca_topic_score_gemma":0.00094993773,"teacher_disagreement_score":0.009931016,"about_ca_system_score_codex":0.0010343298,"about_ca_system_score_gemma":0.0007382266,"threshold_uncertainty_score":0.033222616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49842978,0.0029553592,0.4319214,0.0038548054,0.00030305432,0.00018900035,0.00051031116,0.00089142047,0.060944915],"genre_scores_gemma":[0.90211064,0.0014827119,0.07208237,0.0005531749,0.00023934743,0.00025479446,0.0005658547,0.0007039026,0.022007158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988127,0.00056536036,0.000043727076,0.00016755219,0.0002551788,0.00015554516],"domain_scores_gemma":[0.98603386,0.007994589,0.0011522142,0.00067005854,0.0018073682,0.0023419706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003906656,0.001332732,0.0017011637,0.0034240822,0.0017812051,0.0038752158,0.003976944,0.0025210918,0.006267113],"category_scores_gemma":[0.027198954,0.0014312486,0.0013139916,0.0013558639,0.0048954743,0.0048686485,0.0043441453,0.0029122808,0.00080188864],"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.00031770102,0.00013905099,0.002927655,0.00060581503,0.00012126345,0.0004374735,0.00051142514,0.19923773,0.006470806,0.77559054,0.0039695743,0.009670884],"study_design_scores_gemma":[0.000028669856,0.0000673733,0.0014316997,0.0001393411,0.000031271076,0.00028476835,0.00018892715,0.8066791,0.001023541,0.18870176,0.0013600874,0.00006346519],"about_ca_topic_score_codex":0.0077808714,"about_ca_topic_score_gemma":0.0061099,"teacher_disagreement_score":0.0077808714,"about_ca_system_score_codex":0.0031360341,"about_ca_system_score_gemma":0.0013110664,"threshold_uncertainty_score":0.022753656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20404828,0.000966981,0.74785,0.0007246823,0.0003672704,0.00014435916,0.0005776594,0.00066222885,0.04465848],"genre_scores_gemma":[0.8146564,0.0005666182,0.16632445,0.00037830567,0.00043689675,0.00020244456,0.0012769194,0.0003408551,0.015817126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826354,0.00045345022,0.000104170285,0.000310469,0.00066732435,0.00020112081],"domain_scores_gemma":[0.9968959,0.000937482,0.00043972646,0.0005218525,0.00078030466,0.00042480094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014175314,0.0006799738,0.0010863576,0.0021960104,0.0011786192,0.0027825877,0.00092374376,0.0011495923,0.007589065],"category_scores_gemma":[0.0072140624,0.0005661943,0.0006619494,0.0013300737,0.0020575263,0.0027509534,0.0022256635,0.0015369552,0.0021817375],"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.00027053128,0.00007964331,0.0006427174,0.00016353345,0.000025570565,0.00019399419,0.00024556115,0.01574579,0.008910518,0.91981006,0.005050716,0.04886145],"study_design_scores_gemma":[0.000053084816,0.00016660041,0.000479652,0.00007221662,0.000018197266,0.00034883647,0.00017582721,0.15564269,0.0063526393,0.8253473,0.011286421,0.000056577082],"about_ca_topic_score_codex":0.00061076577,"about_ca_topic_score_gemma":0.00054853596,"teacher_disagreement_score":0.007589065,"about_ca_system_score_codex":0.00071617094,"about_ca_system_score_gemma":0.0005695647,"threshold_uncertainty_score":0.025388002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091783024,0.00065725896,0.88482934,0.00042538604,0.00017193625,0.00006716869,0.00015407946,0.00140959,0.020502234],"genre_scores_gemma":[0.66603434,0.0007311684,0.31456947,0.00034782232,0.00008322292,0.00013190044,0.00034922897,0.0009301217,0.016822757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986626,0.00014515908,0.000072752206,0.00012688487,0.00086761895,0.00012503834],"domain_scores_gemma":[0.99517834,0.0018927092,0.00042355515,0.0013467001,0.0008319097,0.00032681678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022902165,0.0007493372,0.0008093914,0.0008519125,0.0006167911,0.0027128858,0.00070709566,0.0010470863,0.008308315],"category_scores_gemma":[0.011550933,0.0005280894,0.00061494915,0.00089686067,0.001881927,0.0033315704,0.00327351,0.001973713,0.002787668],"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.001607322,0.00028530025,0.004866942,0.00059518183,0.00010093885,0.00025276947,0.0005316545,0.20688857,0.10631992,0.40690917,0.0050157732,0.26662642],"study_design_scores_gemma":[0.00011289853,0.00041843855,0.0010173009,0.000114539376,0.000048314552,0.00033700137,0.00013231995,0.8019064,0.049497,0.12910368,0.017266534,0.000045553275],"about_ca_topic_score_codex":0.000681652,"about_ca_topic_score_gemma":0.0008468453,"teacher_disagreement_score":0.008308315,"about_ca_system_score_codex":0.0006532836,"about_ca_system_score_gemma":0.00044488136,"threshold_uncertainty_score":0.027794123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02172183,0.00052834733,0.9734655,0.00037802805,0.000084723215,0.000052540363,0.000018017778,0.00033955104,0.003411545],"genre_scores_gemma":[0.6081971,0.0008377951,0.38731548,0.00027477334,0.000129549,0.0001224187,0.00009999474,0.0004930619,0.0025298584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456716,0.0024519137,0.0002461835,0.00068793714,0.0016245029,0.00042233415],"domain_scores_gemma":[0.9611819,0.032799583,0.0008476984,0.0022246426,0.0024237856,0.00052248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012383721,0.0012510694,0.0013818672,0.001093843,0.0013532354,0.0029006356,0.0013463994,0.0020331687,0.0033414678],"category_scores_gemma":[0.059517387,0.00056505774,0.0013586003,0.0008669164,0.0026311735,0.0043282006,0.0020212384,0.0038984574,0.00054098526],"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.0005200803,0.00010908401,0.001310724,0.00020809173,0.00011876435,0.00010655964,0.0002696397,0.8436583,0.0033807498,0.08923595,0.0011671465,0.05991491],"study_design_scores_gemma":[0.000014928134,0.000060415256,0.00013361608,0.000016239284,0.000020745932,0.00002556492,0.00002054299,0.9813477,0.0016236816,0.016350457,0.00037057852,0.000015582547],"about_ca_topic_score_codex":0.008918937,"about_ca_topic_score_gemma":0.0033439286,"teacher_disagreement_score":0.012383721,"about_ca_system_score_codex":0.0018731866,"about_ca_system_score_gemma":0.0034199012,"threshold_uncertainty_score":0.06549215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010472268,0.00026927306,0.9850573,0.00014069537,0.00012029333,0.000060440514,0.000053969467,0.0005104469,0.0033152278],"genre_scores_gemma":[0.118058756,0.00025716503,0.8752338,0.00010473058,0.000095769756,0.00027314626,0.00015391858,0.00029801138,0.0055246195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.00014791061,0.000029746205,0.000046397137,0.00015421146,0.000036801437],"domain_scores_gemma":[0.99876046,0.000562922,0.000056982863,0.00017086587,0.0003508097,0.00009802368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012497302,0.00086194597,0.0014089482,0.0017150964,0.00079251267,0.0011761569,0.0017585761,0.0016448261,0.0077929706],"category_scores_gemma":[0.005418184,0.00045802313,0.0009150482,0.0011335707,0.0008765253,0.0014721019,0.0017057364,0.0022197636,0.0020203402],"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.0005548476,0.000277525,0.0012753981,0.00042412052,0.0001576455,0.00035711887,0.00029375893,0.3594992,0.010408784,0.2506297,0.008519752,0.36760223],"study_design_scores_gemma":[0.00004043975,0.000044899065,0.00010336388,0.000021626174,0.000010072953,0.000035766938,0.000013139036,0.97320366,0.0014138126,0.02235258,0.0027426886,0.000017900693],"about_ca_topic_score_codex":0.0035949415,"about_ca_topic_score_gemma":0.0043810117,"teacher_disagreement_score":0.0077929706,"about_ca_system_score_codex":0.00066425547,"about_ca_system_score_gemma":0.0019069723,"threshold_uncertainty_score":0.026070118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012232524,0.00017077409,0.9789017,0.0002752617,0.00006345411,0.00006336377,0.00019512018,0.0001716018,0.0079262415],"genre_scores_gemma":[0.4343242,0.0006697681,0.5566111,0.00021956084,0.00023493788,0.0005028015,0.00079996313,0.00029167268,0.006345955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874747,0.00047074043,0.00004644584,0.00015309575,0.00043317248,0.00014910613],"domain_scores_gemma":[0.99795854,0.0011581798,0.00018848157,0.0003226965,0.00025852973,0.000113681446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017813186,0.0010636076,0.00082008564,0.0020602667,0.0007138318,0.0021725367,0.0014172771,0.00095353584,0.0088038575],"category_scores_gemma":[0.009151518,0.00042189492,0.00086763245,0.001992721,0.0013298354,0.0036377127,0.0021326218,0.0032205577,0.0016703352],"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.000033606957,0.0000690197,0.00032211753,0.000057234945,0.000020769394,0.000047029025,0.00005350424,0.18173201,0.0009274379,0.777322,0.0021735441,0.037241638],"study_design_scores_gemma":[0.000011645361,0.00001851444,0.000087746725,0.00001505054,0.000004547065,0.00002012234,0.000024570469,0.35863727,0.0005931677,0.63888085,0.0016941293,0.000012297935],"about_ca_topic_score_codex":0.0013175957,"about_ca_topic_score_gemma":0.0019330602,"teacher_disagreement_score":0.0088038575,"about_ca_system_score_codex":0.0009795174,"about_ca_system_score_gemma":0.0012463174,"threshold_uncertainty_score":0.029451787},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019290001,0.011475759,0.3545433,0.002044366,0.0017198828,0.000072948875,0.00081770617,0.0021860155,0.62521106],"genre_scores_gemma":[0.06488922,0.01574587,0.14104494,0.001967683,0.0013709433,0.00031154073,0.001939927,0.0027715415,0.7699583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996946,0.000053380525,0.000010275064,0.00006462199,0.00015004243,0.000027144659],"domain_scores_gemma":[0.9997696,0.000094368916,0.000014613266,0.000057668683,0.000043101245,0.000020515765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036996877,0.0013660787,0.001231475,0.000543558,0.00045590635,0.002054851,0.0010367355,0.0010808381,0.08283878],"category_scores_gemma":[0.001352172,0.00048430724,0.00066515536,0.0009914534,0.0006665203,0.0018518956,0.0014797533,0.0024998458,0.032145746],"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.00007793059,0.00009626972,0.00012581445,0.0003633919,0.000050692568,0.00006876288,0.00003499904,0.040994965,0.0019806686,0.37816656,0.2837725,0.29426742],"study_design_scores_gemma":[0.000025627456,0.00004474668,0.00025188466,0.00023515394,0.000021539956,0.0001409533,0.000019989466,0.09520703,0.0018469023,0.50066245,0.401517,0.000026786565],"about_ca_topic_score_codex":0.00061724416,"about_ca_topic_score_gemma":0.0010779311,"teacher_disagreement_score":0.08283878,"about_ca_system_score_codex":0.0007083667,"about_ca_system_score_gemma":0.0008182914,"threshold_uncertainty_score":0.27712333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063382976,0.0037373619,0.8805636,0.009863352,0.0004886496,0.00009967116,0.00024154526,0.00014379006,0.041479144],"genre_scores_gemma":[0.75797296,0.003517272,0.22422758,0.002020073,0.000977121,0.00023790437,0.0002549234,0.00036995256,0.010422167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404883,0.0034385559,0.00031439442,0.0007052323,0.0012004229,0.0002926663],"domain_scores_gemma":[0.9773381,0.018241985,0.0010958778,0.0015578357,0.0013228495,0.00044338824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0110126,0.0011216657,0.0019443757,0.0023144323,0.0023409596,0.0047706263,0.0025981439,0.002285282,0.005763014],"category_scores_gemma":[0.051777873,0.001279581,0.0018218914,0.0025804376,0.008714547,0.01309396,0.008052099,0.009959398,0.0009325587],"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.000083762076,0.000046924913,0.00064603315,0.00020110059,0.000024914694,0.00011907749,0.00039776033,0.019604132,0.00050540385,0.9585921,0.0018404895,0.01793823],"study_design_scores_gemma":[0.000008672008,0.000020953292,0.00009291121,0.00005203964,0.0000049508776,0.00003403657,0.00005239435,0.03927384,0.00011499544,0.959305,0.0010312264,0.000009001728],"about_ca_topic_score_codex":0.0022587636,"about_ca_topic_score_gemma":0.0020341508,"teacher_disagreement_score":0.0110126,"about_ca_system_score_codex":0.0016125806,"about_ca_system_score_gemma":0.0024399604,"threshold_uncertainty_score":0.05824089},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006961013,0.0006649378,0.97711724,0.00059798337,0.00013845951,0.000029986488,0.000111304355,0.000045052846,0.014334038],"genre_scores_gemma":[0.29718763,0.003371584,0.6423264,0.00068795367,0.00079430145,0.00040429976,0.0008734708,0.00071248435,0.05364193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986545,0.0006418425,0.00005607924,0.00019870767,0.00031437434,0.00013448889],"domain_scores_gemma":[0.9967231,0.0019628615,0.0002528002,0.00044169437,0.00042639353,0.00019309211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003556723,0.002133652,0.0016869643,0.00138768,0.0007669313,0.002815076,0.0025499845,0.0027284033,0.0065206676],"category_scores_gemma":[0.015051831,0.0012414384,0.001789671,0.0016523603,0.0030477075,0.0053780903,0.0035383082,0.006236331,0.0012294978],"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.00007391971,0.00006127505,0.00015459677,0.0001690091,0.000025226473,0.00007149202,0.00016138976,0.18204933,0.0013172971,0.78544545,0.004594665,0.0258763],"study_design_scores_gemma":[0.000020822952,0.00003511778,0.000080459795,0.000046741145,0.000012835955,0.00007555277,0.000059212987,0.59783536,0.0005323734,0.39385983,0.0074221226,0.000019459001],"about_ca_topic_score_codex":0.0019063288,"about_ca_topic_score_gemma":0.0022408979,"teacher_disagreement_score":0.0065206676,"about_ca_system_score_codex":0.0012326767,"about_ca_system_score_gemma":0.001427447,"threshold_uncertainty_score":0.02181375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017270062,0.0007982043,0.9601862,0.00085578323,0.00031793368,0.0001407888,0.00028765952,0.0005702377,0.019573197],"genre_scores_gemma":[0.2206548,0.0006477602,0.76022434,0.00031276012,0.00023917148,0.0002166741,0.0006581147,0.00051226997,0.016534094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.00034478205,0.000026549062,0.00008874264,0.00021110404,0.00012379479],"domain_scores_gemma":[0.9982503,0.0010185535,0.000099991455,0.00020645242,0.00025363994,0.0001710976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016025971,0.001020078,0.0013306304,0.0011924327,0.000756053,0.0018789172,0.0014554372,0.0013764846,0.015825942],"category_scores_gemma":[0.0047241366,0.00072580314,0.0005924233,0.0014486097,0.0008711643,0.0020543085,0.0014052605,0.003111174,0.001771672],"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.00062004983,0.00053105917,0.0005526146,0.00049393397,0.00006450391,0.00019828741,0.00014048631,0.5120415,0.0033891415,0.21875198,0.026833082,0.23638332],"study_design_scores_gemma":[0.00010413417,0.00008807722,0.00012020809,0.00004866276,0.000018906923,0.00007275687,0.00004310414,0.92594665,0.0010931218,0.06712828,0.0053221234,0.000014011146],"about_ca_topic_score_codex":0.0025991795,"about_ca_topic_score_gemma":0.004616513,"teacher_disagreement_score":0.015825942,"about_ca_system_score_codex":0.0015504844,"about_ca_system_score_gemma":0.002641129,"threshold_uncertainty_score":0.05294311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085644834,0.0010612227,0.8711672,0.000506212,0.00008935688,0.00008965872,0.00056955207,0.0002193437,0.04065265],"genre_scores_gemma":[0.8508096,0.0019808454,0.12508301,0.00026581064,0.0002841546,0.00021621135,0.0010640855,0.00023893193,0.020057328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937385,0.00020363709,0.00003519317,0.000117250835,0.00018684562,0.00008338334],"domain_scores_gemma":[0.99912757,0.0003810173,0.00012687268,0.00008701855,0.00018856241,0.00008907533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008946898,0.00086236617,0.0006100182,0.00064398017,0.0003965355,0.0015373023,0.00043380907,0.00039960316,0.0040172585],"category_scores_gemma":[0.0022100515,0.0002789757,0.00067435665,0.00066306355,0.0011549983,0.0014429683,0.0009161574,0.0011886293,0.00056637585],"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.000051965864,0.000034508783,0.0006642065,0.00010984746,0.000025813073,0.00016009789,0.0000974178,0.09830877,0.0027034513,0.8797551,0.0020540897,0.01603472],"study_design_scores_gemma":[0.000016379867,0.00006127043,0.00040619803,0.000030454657,0.000008606793,0.00006718884,0.000082750244,0.46214482,0.0015401411,0.5312345,0.0043933704,0.000014355104],"about_ca_topic_score_codex":0.001919698,"about_ca_topic_score_gemma":0.0015048089,"teacher_disagreement_score":0.0040172585,"about_ca_system_score_codex":0.0009433284,"about_ca_system_score_gemma":0.0007244429,"threshold_uncertainty_score":0.013439059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015880037,0.0012171688,0.9724257,0.0004752782,0.00006709572,0.000022936101,0.00006256491,0.000042636762,0.009806465],"genre_scores_gemma":[0.65175694,0.0047196792,0.32818285,0.00042697604,0.0006308985,0.00028640567,0.00043649453,0.00015842487,0.013401273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992774,0.00025513372,0.000025915682,0.00010821076,0.00025777708,0.00007554155],"domain_scores_gemma":[0.9985648,0.00092669914,0.00018008788,0.000090381574,0.00018461347,0.000053376265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009669096,0.00082195667,0.0007194246,0.001103445,0.0004969626,0.0009138828,0.00062235654,0.0009801633,0.0029437167],"category_scores_gemma":[0.0026449226,0.00044585866,0.0011390423,0.0009971742,0.0013854805,0.0019442027,0.001243516,0.0015358143,0.0004457618],"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.000032382955,0.000029515459,0.00067433686,0.00015073679,0.000043001703,0.00021599294,0.00016280744,0.21004601,0.0033050405,0.7613703,0.0014036237,0.022566276],"study_design_scores_gemma":[0.0000070722645,0.000036483325,0.00023451637,0.000023763027,0.000007595149,0.00009687898,0.000040766823,0.77085096,0.0007950666,0.22458674,0.0033034107,0.000016724163],"about_ca_topic_score_codex":0.0014422361,"about_ca_topic_score_gemma":0.0011418093,"teacher_disagreement_score":0.0029437167,"about_ca_system_score_codex":0.0008495929,"about_ca_system_score_gemma":0.00054034265,"threshold_uncertainty_score":0.00984776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022150943,0.0003372276,0.9248139,0.000531373,0.00034025352,0.00011774423,0.0002152037,0.00052205083,0.050971303],"genre_scores_gemma":[0.2860237,0.00063369615,0.66685957,0.0004312186,0.0002753307,0.0002954576,0.00064163393,0.0007837778,0.04405557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992887,0.00014359703,0.00002327073,0.00009997956,0.0003397592,0.0001047629],"domain_scores_gemma":[0.99960786,0.00017905347,0.00001938802,0.000089164736,0.00007609765,0.000028321567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000499985,0.00072522345,0.00083396706,0.0005725621,0.0008244448,0.0016160551,0.001237681,0.0003920584,0.009777614],"category_scores_gemma":[0.0014844806,0.00042112765,0.0013920659,0.000907063,0.0010274237,0.001805456,0.002910891,0.0037273336,0.002239504],"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.00014136909,0.00033465523,0.0001721682,0.00025700688,0.00005946695,0.00017352516,0.00029822532,0.035426833,0.0108780395,0.75115955,0.010972124,0.19012706],"study_design_scores_gemma":[0.00006002485,0.00011915722,0.00016202213,0.00006333978,0.000056051853,0.00021819976,0.00012778354,0.18834612,0.009827515,0.77032745,0.030661944,0.000030357676],"about_ca_topic_score_codex":0.0007105881,"about_ca_topic_score_gemma":0.0011921716,"teacher_disagreement_score":0.009777614,"about_ca_system_score_codex":0.0006333979,"about_ca_system_score_gemma":0.001022509,"threshold_uncertainty_score":0.03270936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015083974,0.0006640107,0.9631407,0.00053455244,0.00017272696,0.000051121187,0.00015515738,0.00017344765,0.02002431],"genre_scores_gemma":[0.68936634,0.0018529937,0.28741363,0.0010062205,0.0005314088,0.00036796308,0.0007993437,0.00071535166,0.017946828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980844,0.0008823545,0.000046967547,0.00028950238,0.0004872192,0.0002095146],"domain_scores_gemma":[0.99370897,0.0042020157,0.00043958868,0.0005959524,0.00069530384,0.0003581166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035300443,0.0021706023,0.001108661,0.0012689172,0.00072958396,0.0016521764,0.0022553252,0.0010848669,0.008095648],"category_scores_gemma":[0.01178727,0.0004905487,0.0011400443,0.001553775,0.0025571552,0.002838099,0.0024877766,0.0042199036,0.0012617577],"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.00013742306,0.00012291229,0.00029573013,0.00023785849,0.000051273295,0.00007055782,0.00013155225,0.42013338,0.0027114868,0.54594153,0.005716721,0.024449565],"study_design_scores_gemma":[0.000012347598,0.00006048824,0.00010915892,0.000031263342,0.000010289577,0.000023694653,0.000020144746,0.7683896,0.0007627101,0.22886565,0.0016993388,0.000015477068],"about_ca_topic_score_codex":0.0016118637,"about_ca_topic_score_gemma":0.0019051869,"teacher_disagreement_score":0.008095648,"about_ca_system_score_codex":0.0019975167,"about_ca_system_score_gemma":0.0013302136,"threshold_uncertainty_score":0.027082682},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019681414,0.003934003,0.00015640826,0.011304863,0.9834593,0.000013659778,0.00003813523,0.000035798606,0.0010381803],"genre_scores_gemma":[0.00018140345,0.002541453,0.00008512667,0.004848464,0.9870669,0.000012365433,0.000021473286,0.00003313314,0.005209605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945275,0.00085516204,0.00059989403,0.0007147081,0.0029627443,0.00033994234],"domain_scores_gemma":[0.976143,0.007794277,0.0020607074,0.00059050164,0.00973143,0.003680134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005642901,0.0053003537,0.0055468073,0.0056663854,0.0030900664,0.010114449,0.0034276114,0.010809318,0.024903225],"category_scores_gemma":[0.022229351,0.0013493212,0.0034662767,0.0021169279,0.0022139656,0.004063355,0.0015756703,0.01363327,0.01891367],"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.000042310603,0.000012774155,0.000015273388,0.00016949148,0.00002264594,0.00006103929,0.0000046171085,0.000031329666,0.000068275265,0.00022229338,0.99567777,0.003672174],"study_design_scores_gemma":[0.00011414452,0.000049721686,0.00033212264,0.00046664543,0.00009491944,0.00030039108,0.00002891072,0.00033255684,0.00018911545,0.0019501807,0.9961106,0.00003074447],"about_ca_topic_score_codex":0.0009418138,"about_ca_topic_score_gemma":0.0034377885,"teacher_disagreement_score":0.024903225,"about_ca_system_score_codex":0.0024082712,"about_ca_system_score_gemma":0.0026190944,"threshold_uncertainty_score":0.08330965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010215676,0.000110897265,0.9816151,0.00027266797,0.00007782042,0.00008736719,0.000081147016,0.00027656436,0.007262777],"genre_scores_gemma":[0.33502215,0.00038091096,0.65170485,0.00053700537,0.00014933954,0.00049272674,0.00059136824,0.00044972342,0.010671941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924904,0.00019858283,0.00002759021,0.00013281751,0.0002782444,0.00011361589],"domain_scores_gemma":[0.9994049,0.00026252153,0.000048075268,0.00011510484,0.00012251118,0.00004681793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024853,0.00087549945,0.00081271114,0.00045019048,0.0005314788,0.00085050205,0.001003764,0.00075118465,0.007066906],"category_scores_gemma":[0.002710736,0.00029404517,0.0009972109,0.00041383886,0.0009577209,0.0009952973,0.0021060822,0.0024992204,0.0010676256],"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.00022874265,0.00018917542,0.0005172254,0.00030913038,0.000054927114,0.00023102749,0.0002281627,0.45278832,0.010190794,0.30476603,0.014707746,0.2157887],"study_design_scores_gemma":[0.000037917278,0.00010151411,0.00008947745,0.000021781,0.000012209809,0.00007512707,0.000045540633,0.9107012,0.0028772205,0.08041898,0.005604779,0.000014254498],"about_ca_topic_score_codex":0.0013763058,"about_ca_topic_score_gemma":0.0019496351,"teacher_disagreement_score":0.007066906,"about_ca_system_score_codex":0.000714921,"about_ca_system_score_gemma":0.0014822551,"threshold_uncertainty_score":0.02364117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020275174,0.00010919709,0.97808266,0.000107709595,0.00007734982,0.000042678716,0.000020954745,0.00028874658,0.0009954311],"genre_scores_gemma":[0.33802173,0.00011418704,0.6603008,0.00013841386,0.00004577124,0.00010246393,0.000070417256,0.00022675563,0.0009794058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990527,0.00032578438,0.000045172936,0.00009695346,0.0004196324,0.000059801914],"domain_scores_gemma":[0.99810445,0.0006211293,0.0001440988,0.00036025236,0.00065420737,0.000115824085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022227343,0.00074489345,0.0008002456,0.0008762889,0.0002987532,0.00078940776,0.0013797639,0.0012686254,0.0012999877],"category_scores_gemma":[0.0074245795,0.0002989501,0.00048232052,0.0008757021,0.0010483813,0.0010007847,0.0017055277,0.0013000612,0.00046536565],"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.00016215527,0.000079580575,0.0013875763,0.00011217096,0.000051464645,0.00014265896,0.000114171686,0.84020835,0.016093936,0.03219817,0.0025052188,0.1069446],"study_design_scores_gemma":[0.0000074693608,0.00001549841,0.00007363788,0.000004332187,0.0000021555193,0.000018066075,0.0000043796185,0.9959055,0.0013805096,0.002174828,0.0004071513,0.0000063639386],"about_ca_topic_score_codex":0.0030997808,"about_ca_topic_score_gemma":0.002413827,"teacher_disagreement_score":0.0030997808,"about_ca_system_score_codex":0.00072942866,"about_ca_system_score_gemma":0.0012112077,"threshold_uncertainty_score":0.011755049},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009104054,0.000067405585,0.997874,0.000057537716,0.000016312786,0.000013089742,0.000013225941,0.00006848051,0.0009795728],"genre_scores_gemma":[0.14088102,0.00044640232,0.8544475,0.0001530035,0.00007361723,0.00023622822,0.00013844839,0.00014301809,0.0034808943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.00022344234,0.000031590982,0.00010880772,0.000279932,0.000059976373],"domain_scores_gemma":[0.99911135,0.000521017,0.000079857644,0.00009046296,0.00015844796,0.000038910828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000995476,0.00091445766,0.00077910395,0.00053265126,0.00033781095,0.0009904819,0.0015182211,0.00076475093,0.0029402869],"category_scores_gemma":[0.0031437057,0.00052388327,0.0010321499,0.0009331146,0.0008235909,0.00084227585,0.0013386332,0.0029682287,0.0007250811],"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.0000372244,0.00004094145,0.00022713983,0.00014191658,0.000025110923,0.000055602948,0.000068055895,0.9034121,0.0030484963,0.044489827,0.0013100822,0.047143407],"study_design_scores_gemma":[0.0000038319968,0.000028637409,0.000019108636,0.000008277153,0.0000041708827,0.000020788133,0.00000649338,0.992619,0.00078426104,0.004782602,0.0017190339,0.0000039066],"about_ca_topic_score_codex":0.002244214,"about_ca_topic_score_gemma":0.001378159,"teacher_disagreement_score":0.0029402869,"about_ca_system_score_codex":0.00083121296,"about_ca_system_score_gemma":0.0010333394,"threshold_uncertainty_score":0.0098362565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23393089,0.00048085657,0.74680835,0.0006352884,0.00010713604,0.00008335634,0.00011274478,0.00084331085,0.0169981],"genre_scores_gemma":[0.84871113,0.0002659112,0.14356035,0.00026996477,0.00006233979,0.00019223354,0.00027219323,0.00039713958,0.0062687392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997044,0.00012550107,0.000009117992,0.000054754826,0.000064015614,0.000042089097],"domain_scores_gemma":[0.9984869,0.00087978604,0.00010640407,0.00028210718,0.00012485322,0.00011996154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087337306,0.000451481,0.0006833611,0.00034015538,0.00048601607,0.0006690128,0.0009314212,0.0007366483,0.0052811014],"category_scores_gemma":[0.005892258,0.0002777652,0.0006293959,0.00026310986,0.0012198264,0.0014586637,0.0016852426,0.0012485625,0.00046677573],"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.00017267591,0.00013821913,0.0014089479,0.00017512238,0.0000485566,0.0002631153,0.00020533774,0.5772744,0.005341313,0.36206284,0.0056111943,0.047298312],"study_design_scores_gemma":[0.000021563728,0.000030198411,0.00008243754,0.000009319022,0.0000038345333,0.000022236909,0.000025741838,0.92083865,0.0008861497,0.07676377,0.0013120351,0.000004084783],"about_ca_topic_score_codex":0.0013114279,"about_ca_topic_score_gemma":0.000995349,"teacher_disagreement_score":0.0052811014,"about_ca_system_score_codex":0.000412101,"about_ca_system_score_gemma":0.0005682763,"threshold_uncertainty_score":0.017666996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023824035,0.00006187463,0.99563295,0.0000440611,0.000012762549,0.00003482324,0.000018384257,0.00020045658,0.0016122361],"genre_scores_gemma":[0.0912271,0.00013831022,0.9051977,0.0000631958,0.000028278468,0.00023210143,0.00014120598,0.00018020414,0.0027918883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950933,0.00015283136,0.00002240379,0.00008625894,0.00017762155,0.000051499213],"domain_scores_gemma":[0.9992403,0.00043637457,0.000066898225,0.00006351301,0.00015058219,0.000042368913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096297,0.0009828405,0.0011361251,0.0007337756,0.0004671891,0.00069323805,0.0013736135,0.0010003534,0.0054528215],"category_scores_gemma":[0.002392639,0.0005210777,0.00080180616,0.00096648996,0.0008127921,0.0010706573,0.0014747053,0.001995232,0.0011410095],"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.00015996119,0.00014757764,0.0004459624,0.00024782436,0.00004906077,0.00012597934,0.00012822171,0.7069579,0.0044238665,0.07579141,0.004678453,0.20684387],"study_design_scores_gemma":[0.0000214685,0.00002944586,0.000032282143,0.000009313772,0.0000035485966,0.000024832438,0.000008298951,0.9890715,0.000699883,0.009021861,0.0010727342,0.0000049568303],"about_ca_topic_score_codex":0.0027849544,"about_ca_topic_score_gemma":0.0023987074,"teacher_disagreement_score":0.0054528215,"about_ca_system_score_codex":0.00069739943,"about_ca_system_score_gemma":0.0019015562,"threshold_uncertainty_score":0.018241465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023824035,0.00006187463,0.99563295,0.0000440611,0.000012762549,0.00003482324,0.000018384257,0.00020045658,0.0016122361],"genre_scores_gemma":[0.0912271,0.00013831022,0.9051977,0.0000631958,0.000028278468,0.00023210143,0.00014120598,0.00018020414,0.0027918883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950933,0.00015283136,0.00002240379,0.00008625894,0.00017762155,0.000051499213],"domain_scores_gemma":[0.9992403,0.00043637457,0.000066898225,0.00006351301,0.00015058219,0.000042368913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096297,0.0009828405,0.0011361251,0.0007337756,0.0004671891,0.00069323805,0.0013736135,0.0010003534,0.0054528215],"category_scores_gemma":[0.002392639,0.0005210777,0.00080180616,0.00096648996,0.0008127921,0.0010706573,0.0014747053,0.001995232,0.0011410095],"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.00015996119,0.00014757764,0.0004459624,0.00024782436,0.00004906077,0.00012597934,0.00012822171,0.7069579,0.0044238665,0.07579141,0.004678453,0.20684387],"study_design_scores_gemma":[0.0000214685,0.00002944586,0.000032282143,0.000009313772,0.0000035485966,0.000024832438,0.000008298951,0.9890715,0.000699883,0.009021861,0.0010727342,0.0000049568303],"about_ca_topic_score_codex":0.0027849544,"about_ca_topic_score_gemma":0.0023987074,"teacher_disagreement_score":0.0054528215,"about_ca_system_score_codex":0.00069739943,"about_ca_system_score_gemma":0.0019015562,"threshold_uncertainty_score":0.018241465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022780611,0.000046217243,0.9942404,0.00003731239,0.00006046721,0.000037729544,0.000018135388,0.00015809288,0.0031235446],"genre_scores_gemma":[0.07348933,0.000119618795,0.9205185,0.0000671498,0.000049460486,0.00027737216,0.00009578944,0.00021864695,0.0051641595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995524,0.00017034606,0.000022826614,0.000055553508,0.0001759785,0.000022768541],"domain_scores_gemma":[0.99956053,0.00016030033,0.0000272287,0.00005724794,0.00017472437,0.000019950752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007562588,0.00062705955,0.0008970303,0.00060858525,0.0007378092,0.0008329446,0.0010870592,0.0010532145,0.004832243],"category_scores_gemma":[0.0016868495,0.0003252854,0.0007328148,0.00083264615,0.0005780215,0.0007605043,0.0009561613,0.0008124232,0.0013118972],"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.00011727553,0.00019806571,0.0007939064,0.00033176978,0.00014106037,0.00020487985,0.00014863382,0.6580847,0.011224987,0.13387732,0.005816927,0.1890605],"study_design_scores_gemma":[0.000011228492,0.000020463322,0.0000956961,0.000007370148,0.000007936032,0.00003261533,0.000006913716,0.9900955,0.001413336,0.0057594446,0.0025420745,0.000007422528],"about_ca_topic_score_codex":0.0017559312,"about_ca_topic_score_gemma":0.0020104158,"teacher_disagreement_score":0.004832243,"about_ca_system_score_codex":0.00032048798,"about_ca_system_score_gemma":0.0012658661,"threshold_uncertainty_score":0.016165435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035028886,0.00069822744,0.93386096,0.0013416052,0.00029355724,0.00015492279,0.0006146125,0.0002346835,0.027772497],"genre_scores_gemma":[0.7566226,0.0015257042,0.20462658,0.001096775,0.00043750525,0.0008443874,0.0011562366,0.00019968803,0.033490505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992119,0.0002665022,0.000036110447,0.00018373164,0.00022633887,0.00007538045],"domain_scores_gemma":[0.9989017,0.0005271691,0.00017076427,0.000104301114,0.00022205984,0.00007393504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089098496,0.00072568655,0.00080139673,0.0008429608,0.00058339693,0.001238986,0.0009914086,0.0017662664,0.0062595746],"category_scores_gemma":[0.003497858,0.0004271853,0.0009663528,0.00060230674,0.0016911791,0.0015736695,0.0023540962,0.001630052,0.0007217244],"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.000025175486,0.00002417891,0.00074616814,0.00012223997,0.00004426145,0.00018861963,0.00015778755,0.24389872,0.0022195585,0.742556,0.0024324714,0.0075848866],"study_design_scores_gemma":[0.000029631343,0.000028468427,0.00024920242,0.000020086087,0.00000989108,0.000052843938,0.000040757754,0.7139443,0.00034425405,0.28139043,0.0038727194,0.000017426979],"about_ca_topic_score_codex":0.0034159608,"about_ca_topic_score_gemma":0.0031569444,"teacher_disagreement_score":0.0062595746,"about_ca_system_score_codex":0.0010038648,"about_ca_system_score_gemma":0.0011249331,"threshold_uncertainty_score":0.020940304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008836629,0.02681455,0.28470203,0.007219131,0.0023401664,0.00008105068,0.00038825342,0.00064663775,0.6689716],"genre_scores_gemma":[0.2641012,0.02925738,0.13734384,0.0051157344,0.002944049,0.00047777517,0.0008205765,0.0019989868,0.5579405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941456,0.0001266795,0.00003058594,0.00018257371,0.00018391073,0.00006157037],"domain_scores_gemma":[0.9993705,0.00034933488,0.000051040017,0.000093725415,0.00010127265,0.000034139142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006791898,0.0009852762,0.0008972581,0.0012597829,0.0012854584,0.0034499823,0.0009779978,0.0017563376,0.03695724],"category_scores_gemma":[0.003835392,0.00055818085,0.00061977335,0.0009056035,0.0034313744,0.0047115465,0.0020299726,0.003262876,0.010224543],"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.00001421514,0.0000074552327,0.000040650946,0.000110470166,0.0000049919636,0.000039355407,0.00015022393,0.0011416404,0.00033239173,0.9587644,0.01539504,0.023999237],"study_design_scores_gemma":[0.000007497806,0.000020035166,0.00011721596,0.00016958047,0.0000049974838,0.00013795015,0.000097748656,0.002358365,0.00058427313,0.8504158,0.14607345,0.000012947476],"about_ca_topic_score_codex":0.000423429,"about_ca_topic_score_gemma":0.00048522613,"teacher_disagreement_score":0.96304274,"about_ca_system_score_codex":0.0011718599,"about_ca_system_score_gemma":0.0006877112,"threshold_uncertainty_score":0.12363428},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026517125,0.00010862945,0.967562,0.00014827808,0.00005682353,0.00003216938,0.0000631144,0.00021701839,0.005294801],"genre_scores_gemma":[0.41868094,0.00036347544,0.57582295,0.0002936695,0.00010950043,0.0001513552,0.00043544485,0.00028819422,0.003854377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998858,0.00037878953,0.0000619661,0.00018351474,0.0004117431,0.000106041785],"domain_scores_gemma":[0.9977336,0.0010393824,0.00019291292,0.0004863508,0.00038706418,0.00016073411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016551362,0.0008309686,0.000884809,0.0012860267,0.0008684625,0.0015365507,0.0011789987,0.0010196427,0.0031718535],"category_scores_gemma":[0.008250701,0.00064400776,0.0007129564,0.0014615128,0.0015783957,0.0025567345,0.003530509,0.0021996452,0.0013094036],"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.00015909698,0.00010542598,0.00047834992,0.00014333981,0.000031584303,0.00009163045,0.0002480666,0.047827512,0.018691678,0.8314899,0.0032882201,0.09744522],"study_design_scores_gemma":[0.000024100334,0.000082668565,0.00015046874,0.00005021524,0.000013788096,0.00018163155,0.00010644038,0.3842025,0.00839775,0.60302794,0.0037277318,0.000034812416],"about_ca_topic_score_codex":0.00037817526,"about_ca_topic_score_gemma":0.0006082744,"teacher_disagreement_score":0.0031718535,"about_ca_system_score_codex":0.0005102601,"about_ca_system_score_gemma":0.0006875127,"threshold_uncertainty_score":0.010610938},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011300207,0.00019540514,0.9702472,0.0001746273,0.00009943627,0.00009698732,0.0019382432,0.017620552,0.008497493],"genre_scores_gemma":[0.027481772,0.00050892023,0.9377512,0.00036225189,0.000062744,0.0009163906,0.004657572,0.016872535,0.011386718],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994337,0.00012313681,0.000059768096,0.00006782644,0.00025834583,0.000057207664],"domain_scores_gemma":[0.997843,0.001244998,0.00012688525,0.00019609407,0.0005082879,0.00008071874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434846,0.0012790229,0.0012237797,0.0007999727,0.00044116966,0.0015584454,0.002120964,0.0014243495,0.06617115],"category_scores_gemma":[0.005662321,0.0008163308,0.0009800853,0.00086489867,0.00053572026,0.001195018,0.0019307939,0.0033250167,0.019599713],"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.00024557006,0.00019754893,0.0014934755,0.0025203947,0.00023779723,0.0005546699,0.00034393612,0.29002088,0.015030397,0.13045833,0.30125594,0.257641],"study_design_scores_gemma":[0.0001592308,0.00004421857,0.00027003718,0.0001584274,0.000037827554,0.00035678715,0.000052269428,0.77923584,0.013025175,0.039545327,0.16705643,0.00005837297],"about_ca_topic_score_codex":0.002004203,"about_ca_topic_score_gemma":0.0032671168,"teacher_disagreement_score":0.06617115,"about_ca_system_score_codex":0.00039758606,"about_ca_system_score_gemma":0.0022869948,"threshold_uncertainty_score":0.2213645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052787797,0.0001970992,0.9927241,0.000110399735,0.000052070376,0.00008220557,0.000033588076,0.00020232744,0.0013193834],"genre_scores_gemma":[0.24521661,0.0007514585,0.7488939,0.00018177244,0.00016810866,0.00043901324,0.00038120456,0.00070248643,0.003265428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978643,0.0010517993,0.00012767673,0.00019883428,0.00059277,0.0001646691],"domain_scores_gemma":[0.99203956,0.006217969,0.0003020851,0.00039631047,0.0007839318,0.0002602257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064814645,0.0027341284,0.0026473564,0.0017719909,0.00071506406,0.002713514,0.0021624207,0.0022557965,0.0040342496],"category_scores_gemma":[0.019250408,0.0014891678,0.0019151343,0.0011862128,0.0014858837,0.0029303643,0.0026096127,0.004171403,0.00079947885],"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.00006609854,0.00011756748,0.00024376139,0.00015565092,0.000048690665,0.000046288387,0.000045437184,0.9504268,0.0007370426,0.013725671,0.0007334102,0.033653565],"study_design_scores_gemma":[0.0000058703013,0.000014157543,0.000018233963,0.000007973307,0.000005453562,0.000003387715,0.00000533241,0.9956714,0.00016286463,0.003941954,0.00016116502,0.000002211109],"about_ca_topic_score_codex":0.006258768,"about_ca_topic_score_gemma":0.007452131,"teacher_disagreement_score":0.0064814645,"about_ca_system_score_codex":0.0017155356,"about_ca_system_score_gemma":0.0033261313,"threshold_uncertainty_score":0.034277678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044213827,0.0011824173,0.9915241,0.0002193273,0.00007916087,0.00002895812,0.000022546134,0.00003961954,0.0024824743],"genre_scores_gemma":[0.2787059,0.003910533,0.70308554,0.00035266543,0.0004274137,0.00050439505,0.00025609203,0.0002930892,0.012464396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992731,0.0004267862,0.000021217149,0.000083023835,0.0001593622,0.000036528832],"domain_scores_gemma":[0.99911493,0.0005599109,0.00006803482,0.00004995371,0.00015630774,0.000050965056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809559,0.0012590279,0.001268925,0.00053576677,0.0003885429,0.0008944827,0.0010672259,0.0013274457,0.0012434627],"category_scores_gemma":[0.002932596,0.0004358526,0.0009539207,0.00062532525,0.0012661604,0.0008806369,0.0011555733,0.001864888,0.00051529513],"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.0001645576,0.00012051283,0.0010413193,0.001010861,0.00019830297,0.00042044703,0.00024507288,0.5287732,0.019497178,0.3870984,0.005269912,0.05616025],"study_design_scores_gemma":[0.0000067948927,0.000048723803,0.00008232527,0.00001596015,0.0000072773596,0.000037079808,0.0000069298812,0.9848321,0.00062717206,0.012502949,0.0018274591,0.000005212111],"about_ca_topic_score_codex":0.0021156138,"about_ca_topic_score_gemma":0.0012808016,"teacher_disagreement_score":0.0021156138,"about_ca_system_score_codex":0.0006158632,"about_ca_system_score_gemma":0.0012447769,"threshold_uncertainty_score":0.009569943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024359352,0.000064504195,0.9967539,0.00003406018,0.000013069826,0.000021322528,0.0000122386145,0.000105048406,0.00055987807],"genre_scores_gemma":[0.13054708,0.00032262542,0.8646101,0.00011568259,0.000053033753,0.0003158074,0.00018686049,0.00032164677,0.0035271407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937207,0.00021581532,0.000036050373,0.00010720816,0.00020894251,0.000059896556],"domain_scores_gemma":[0.99902403,0.0005014452,0.00009075376,0.00012726632,0.0002045144,0.000052081716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013338139,0.001137908,0.001351951,0.00090935966,0.0005119206,0.0009583055,0.0013783048,0.0008993311,0.003410955],"category_scores_gemma":[0.0029167456,0.00053401035,0.0010011514,0.0008563465,0.00087398494,0.0018719905,0.0012563948,0.0022915397,0.0010069108],"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.00021704954,0.00008601984,0.0009806893,0.00021494106,0.000053598862,0.0001522231,0.0001861638,0.6722946,0.018028785,0.06928433,0.0038179122,0.23468372],"study_design_scores_gemma":[0.0000047692643,0.000027849386,0.000048225407,0.000008515482,0.0000040960217,0.000019772726,0.0000063623697,0.99400926,0.0013023041,0.0033695833,0.0011938482,0.0000054604375],"about_ca_topic_score_codex":0.0026763133,"about_ca_topic_score_gemma":0.0014577792,"teacher_disagreement_score":0.003410955,"about_ca_system_score_codex":0.00068129605,"about_ca_system_score_gemma":0.0010287366,"threshold_uncertainty_score":0.011410832},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072085205,0.021132926,0.8162715,0.0014573477,0.0025978594,0.0000911747,0.00045453513,0.0009573657,0.15631644],"genre_scores_gemma":[0.032350924,0.04092136,0.5096424,0.0018951327,0.00295046,0.00035157942,0.0014925298,0.0028504306,0.40754512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954814,0.000083314095,0.000016597047,0.00009511375,0.00023053215,0.000026262136],"domain_scores_gemma":[0.99983525,0.00007304437,0.0000072765247,0.00002121852,0.000049191618,0.000013933612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000518888,0.0012158592,0.0011619821,0.00077198516,0.0005487794,0.0018154018,0.0011283144,0.0013718192,0.038787823],"category_scores_gemma":[0.0014287763,0.0005374293,0.00086627237,0.0011644651,0.0010665212,0.0016183178,0.0014560159,0.0028530618,0.027784098],"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.000040374343,0.000064610445,0.000096079326,0.00093552156,0.00004634896,0.000113239024,0.00014172897,0.036948204,0.0029100084,0.42159545,0.17666273,0.36044568],"study_design_scores_gemma":[0.00001589735,0.00003898781,0.00015923806,0.0003139659,0.000026048825,0.00029761903,0.000041652114,0.045998033,0.0021781896,0.28924778,0.6616473,0.00003521725],"about_ca_topic_score_codex":0.0014174154,"about_ca_topic_score_gemma":0.0016024566,"teacher_disagreement_score":0.038787823,"about_ca_system_score_codex":0.00069408584,"about_ca_system_score_gemma":0.0014146442,"threshold_uncertainty_score":0.12975818},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15969254,0.0010131199,0.6655883,0.0455707,0.0023421678,0.00042346132,0.0015040651,0.0021486208,0.121717036],"genre_scores_gemma":[0.89310277,0.00043690953,0.07466273,0.005901331,0.00078293757,0.00042162024,0.0005617083,0.00066082634,0.023469156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99421483,0.0022626428,0.0003006784,0.0011323572,0.0012236276,0.0008658443],"domain_scores_gemma":[0.9691571,0.023541488,0.0009265491,0.004193999,0.0014312861,0.0007495034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006524959,0.0010651904,0.002211604,0.0022516083,0.0038101461,0.004868436,0.003828433,0.006316725,0.016710673],"category_scores_gemma":[0.054425385,0.0011247558,0.0035764212,0.0019298263,0.007081144,0.012314008,0.007557878,0.0061545433,0.0015732925],"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.00019200827,0.0000648696,0.00068518275,0.000106739746,0.000050334336,0.00040643365,0.00041061203,0.0024952535,0.0006503223,0.9831903,0.007803879,0.0039440487],"study_design_scores_gemma":[0.00011616082,0.0000425387,0.00039335678,0.000051140043,0.000059189897,0.00038093538,0.00016962338,0.043751296,0.0015813195,0.94787836,0.0055178814,0.00005828191],"about_ca_topic_score_codex":0.0016054644,"about_ca_topic_score_gemma":0.0010979159,"teacher_disagreement_score":0.016710673,"about_ca_system_score_codex":0.0015117913,"about_ca_system_score_gemma":0.0021808667,"threshold_uncertainty_score":0.05590278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008495454,0.00016532386,0.99546057,0.000029583296,0.00009623612,0.000020636186,0.00001928055,0.00023419471,0.00312468],"genre_scores_gemma":[0.025851576,0.00034130688,0.96145904,0.00005879578,0.00008933997,0.00016331898,0.00009283528,0.0005079057,0.01143592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995821,0.00012429158,0.000013372893,0.00003781912,0.00022170942,0.000020628306],"domain_scores_gemma":[0.99967015,0.00016159116,0.000020637284,0.000043574997,0.0000898102,0.000014235319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046498387,0.0010453928,0.0013539734,0.00057987723,0.00043409158,0.00067158527,0.0012404314,0.0010115779,0.009612034],"category_scores_gemma":[0.0013268327,0.00059200707,0.0010526081,0.00084795384,0.0005750311,0.00081001595,0.001139128,0.0020485139,0.0033767247],"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.00017717484,0.0001745127,0.00019251122,0.00061462953,0.00010226041,0.00017924281,0.0001665828,0.40976694,0.024134392,0.11992693,0.019111194,0.42545354],"study_design_scores_gemma":[0.000018918303,0.000042744316,0.0000790877,0.000020922047,0.00001592133,0.000057671023,0.000008302651,0.96867406,0.0021384717,0.013080872,0.015847793,0.000015195746],"about_ca_topic_score_codex":0.0014348617,"about_ca_topic_score_gemma":0.0018302283,"teacher_disagreement_score":0.009612034,"about_ca_system_score_codex":0.00036897443,"about_ca_system_score_gemma":0.00063651084,"threshold_uncertainty_score":0.032155395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029562777,0.0008340044,0.97093797,0.0003768357,0.00029774857,0.000082710496,0.00035019792,0.0005300865,0.023634078],"genre_scores_gemma":[0.09596541,0.0016614408,0.85377914,0.0004523185,0.00032330552,0.00043752205,0.0019030193,0.0016678878,0.04380997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990784,0.000356314,0.000029617508,0.00010747102,0.00033584452,0.00009225135],"domain_scores_gemma":[0.9983652,0.0010337868,0.00006998731,0.0001952455,0.00026152187,0.00007432398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011701717,0.0012559533,0.0012462971,0.00089781405,0.000673143,0.00139265,0.0012793342,0.0013544648,0.020417964],"category_scores_gemma":[0.005463657,0.00091024424,0.00096032314,0.0015960672,0.0009320923,0.0019230584,0.0019160332,0.00307125,0.00502964],"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.00024331016,0.00024258844,0.00060158997,0.00068889937,0.000121834586,0.00005475019,0.00016067187,0.35556918,0.0028891554,0.24832128,0.06103329,0.33007348],"study_design_scores_gemma":[0.00004289416,0.00004407436,0.00031495208,0.00007916983,0.000015920577,0.000041114825,0.00003069855,0.86289394,0.0029435467,0.105879046,0.027694944,0.000019718473],"about_ca_topic_score_codex":0.0047012474,"about_ca_topic_score_gemma":0.0072818627,"teacher_disagreement_score":0.020417964,"about_ca_system_score_codex":0.0009442659,"about_ca_system_score_gemma":0.0015060481,"threshold_uncertainty_score":0.0683049},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003942657,0.000093385264,0.9943125,0.00005790454,0.00001891746,0.000020547599,0.000008311479,0.000074309435,0.0014714807],"genre_scores_gemma":[0.38860264,0.0005063019,0.6055126,0.00015642957,0.000079909056,0.00030196976,0.00016332258,0.00026106663,0.00441566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917763,0.00039123592,0.000036882622,0.00008444715,0.00021803404,0.00009163862],"domain_scores_gemma":[0.99837804,0.0010564757,0.00015607213,0.00013018136,0.00020735596,0.000071903596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021695534,0.0011997895,0.0010282134,0.00052817573,0.00043328753,0.0012672921,0.0010252915,0.00082237186,0.0020704523],"category_scores_gemma":[0.004404412,0.00045713765,0.00081234187,0.00048730287,0.0011431626,0.0012112994,0.0017544583,0.0022355618,0.00044394808],"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.00006665587,0.000041363935,0.00033447723,0.0001197677,0.000024233468,0.000080538695,0.000090768845,0.9099231,0.002195864,0.055561677,0.0007126721,0.03084886],"study_design_scores_gemma":[0.0000023162484,0.000013583236,0.000012834754,0.0000052656897,0.000001729766,0.000006582759,0.0000051681136,0.9951191,0.00033986973,0.0040641427,0.0004278186,0.0000016385173],"about_ca_topic_score_codex":0.0017167479,"about_ca_topic_score_gemma":0.0014149009,"teacher_disagreement_score":0.0021695534,"about_ca_system_score_codex":0.0006450336,"about_ca_system_score_gemma":0.0010192741,"threshold_uncertainty_score":0.0114738345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031470568,0.000032835247,0.99519664,0.000032456173,0.000039890532,0.000024260056,0.000010759915,0.00028489655,0.0012312585],"genre_scores_gemma":[0.07082339,0.00006615868,0.92615396,0.00007006147,0.00004096056,0.00008980332,0.000063355474,0.00029630985,0.0023959738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992505,0.00018958497,0.000050030387,0.000087947024,0.00035943708,0.00006251634],"domain_scores_gemma":[0.99869543,0.00051133585,0.000078651174,0.00025119603,0.0004056767,0.000057674722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011206842,0.0006042053,0.0006299462,0.00093936466,0.0005006617,0.0008365757,0.0012565007,0.0006075308,0.0040254137],"category_scores_gemma":[0.0050773383,0.00030382062,0.00066878134,0.0005004007,0.0008698062,0.0013400032,0.0011361067,0.001700125,0.0017548784],"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.0003087529,0.0001664395,0.0013296234,0.00028553288,0.000095153984,0.00024697243,0.00035097808,0.17805472,0.046916153,0.21710543,0.0055817417,0.5495586],"study_design_scores_gemma":[0.00004701862,0.00015543003,0.00033558995,0.000026689342,0.000020721633,0.00017136695,0.0000282492,0.9328637,0.020966094,0.036362816,0.008981765,0.000040465107],"about_ca_topic_score_codex":0.0008575954,"about_ca_topic_score_gemma":0.0012654817,"teacher_disagreement_score":0.0040254137,"about_ca_system_score_codex":0.0005016424,"about_ca_system_score_gemma":0.0010096475,"threshold_uncertainty_score":0.013466299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028694845,0.00006775661,0.9964264,0.000044863133,0.000027769072,0.00003175495,0.000012114864,0.0000989185,0.00042095105],"genre_scores_gemma":[0.09439209,0.00013163174,0.9031807,0.00014014986,0.000059206377,0.00021570348,0.00015227495,0.00014813014,0.0015801557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.00060106424,0.00010331211,0.00021853411,0.00047330215,0.00011951509],"domain_scores_gemma":[0.9977465,0.000990708,0.00016143841,0.00039630968,0.00055462844,0.00015038175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025259086,0.0009735479,0.0010040647,0.00073158566,0.00048360907,0.0010545709,0.0026424471,0.0015619566,0.0042120265],"category_scores_gemma":[0.0064427187,0.000508149,0.0009201664,0.00071386405,0.0013004581,0.0024094926,0.0030898857,0.0028293221,0.000946149],"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.00068023,0.00021734636,0.00094527536,0.0005332642,0.00016082027,0.00012640878,0.00035527308,0.5415879,0.021437217,0.14374743,0.0045041353,0.28570473],"study_design_scores_gemma":[0.000043775606,0.00009088761,0.00010022391,0.000013151369,0.000008477608,0.00004038567,0.000021071919,0.9839177,0.0028357059,0.01167815,0.0012326194,0.000017770075],"about_ca_topic_score_codex":0.001370505,"about_ca_topic_score_gemma":0.0011168193,"teacher_disagreement_score":0.0042120265,"about_ca_system_score_codex":0.00048342955,"about_ca_system_score_gemma":0.0013639033,"threshold_uncertainty_score":0.014090598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002963148,0.00034775876,0.99475163,0.00009004125,0.00003369014,0.000021409773,0.000017353213,0.000061370134,0.0017136943],"genre_scores_gemma":[0.24720599,0.00077844714,0.7445102,0.00019267229,0.00008864442,0.0002911195,0.00014264,0.00020098782,0.0065893857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991698,0.0004184339,0.000037556296,0.000069285015,0.00026820047,0.000036694768],"domain_scores_gemma":[0.9978968,0.0013652338,0.00013829474,0.00024338978,0.00028183914,0.0000744149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018451781,0.00095844065,0.0011172242,0.0006258258,0.00031192155,0.001328896,0.0012263814,0.0013972365,0.0030845087],"category_scores_gemma":[0.006413164,0.00048050078,0.0007031719,0.0006233996,0.0015866056,0.0010612169,0.0025013515,0.0024030805,0.0007613334],"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.00006429703,0.00004645177,0.0002723426,0.00023613969,0.000042121246,0.00006545348,0.00009081519,0.8679717,0.0018333638,0.08551264,0.001150448,0.04271422],"study_design_scores_gemma":[0.000008849611,0.000013963095,0.00002008179,0.000016158163,0.0000022625175,0.000010608379,0.0000055608557,0.98836726,0.00031421924,0.010144791,0.0010925509,0.0000036456465],"about_ca_topic_score_codex":0.0013984638,"about_ca_topic_score_gemma":0.0014678248,"teacher_disagreement_score":0.0030845087,"about_ca_system_score_codex":0.0006108505,"about_ca_system_score_gemma":0.00078709645,"threshold_uncertainty_score":0.0103186965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006702185,0.00002787407,0.9981577,0.000045928973,0.000015682936,0.000029636358,0.000011323574,0.00007077422,0.00097086903],"genre_scores_gemma":[0.071982384,0.0001321492,0.92280465,0.0001307386,0.000037621347,0.0004327893,0.00010768653,0.00017177401,0.004200212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957734,0.00018327443,0.000014829671,0.00005292296,0.00013900326,0.000032570697],"domain_scores_gemma":[0.99936146,0.00039735035,0.00003478515,0.000041165746,0.0001307318,0.00003461403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246385,0.00093017553,0.0009764829,0.00065864436,0.00043628202,0.00072396564,0.001401236,0.0012147017,0.005570287],"category_scores_gemma":[0.0027583595,0.0004557758,0.0007092529,0.0005741382,0.0008732982,0.0009446177,0.0014641582,0.0020716093,0.0014382087],"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.00006375561,0.0001180898,0.00034466907,0.00019081471,0.000037615806,0.00011147119,0.00008543493,0.8151008,0.0036638645,0.07975183,0.004820438,0.09571127],"study_design_scores_gemma":[0.000012064321,0.000013248283,0.000015569865,0.000006842256,0.0000018473343,0.000015415644,0.00000627664,0.9905371,0.00032266113,0.007770633,0.0012947461,0.0000036711415],"about_ca_topic_score_codex":0.0018615774,"about_ca_topic_score_gemma":0.002057401,"teacher_disagreement_score":0.005570287,"about_ca_system_score_codex":0.0005685686,"about_ca_system_score_gemma":0.0013565666,"threshold_uncertainty_score":0.018634498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054440282,0.00048756434,0.9336362,0.00047818918,0.00007924542,0.00005135368,0.0000773208,0.000296365,0.010453476],"genre_scores_gemma":[0.7053564,0.0006829109,0.2803641,0.00030327117,0.00012309202,0.00038760982,0.0005865496,0.00075981993,0.011436219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952527,0.0022769014,0.00022449782,0.00045714778,0.0014049278,0.00038381328],"domain_scores_gemma":[0.9550189,0.03840597,0.0011780648,0.0015549227,0.002956499,0.00088568724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071886647,0.0010985956,0.0015786197,0.0016471054,0.0012440189,0.0028532126,0.00178567,0.002078344,0.0046288283],"category_scores_gemma":[0.04312407,0.0009345267,0.0011679968,0.0011970064,0.004812328,0.0042695985,0.002856181,0.0058259442,0.00086629664],"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.0004979848,0.000107215674,0.00091314106,0.00029077448,0.000040108032,0.00019112167,0.0006117702,0.20582893,0.004853392,0.74593514,0.0018549012,0.03887556],"study_design_scores_gemma":[0.000029149485,0.000078321376,0.00011541056,0.00006438696,0.000010754293,0.000041556832,0.0000508898,0.5309831,0.0027678784,0.46479025,0.001051878,0.000016473718],"about_ca_topic_score_codex":0.0018971964,"about_ca_topic_score_gemma":0.0013815666,"teacher_disagreement_score":0.0071886647,"about_ca_system_score_codex":0.0019927032,"about_ca_system_score_gemma":0.0019683505,"threshold_uncertainty_score":0.03801775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012521006,0.0016890685,0.95608884,0.00084652717,0.00019308439,0.000063256004,0.00021414686,0.0001807083,0.028203292],"genre_scores_gemma":[0.5491221,0.006166148,0.40976965,0.0013756725,0.0007112448,0.00036907973,0.00088824076,0.00044243978,0.031155441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993374,0.00026255133,0.000038583847,0.00011905681,0.00018680531,0.000055583787],"domain_scores_gemma":[0.99930286,0.00037117957,0.00009353264,0.00009339769,0.00010769115,0.00003130493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257452,0.0008757798,0.00048494712,0.00052358926,0.0005631636,0.0011614829,0.0010295479,0.0006184384,0.0063769175],"category_scores_gemma":[0.0027280333,0.00045475288,0.0008116288,0.0007836471,0.0013118833,0.0024568255,0.0016314099,0.0027322061,0.001474779],"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.000080272875,0.00008636177,0.0004802974,0.00052281277,0.000037031088,0.00023705536,0.0004431276,0.23531279,0.004562208,0.6985839,0.0084375255,0.05121658],"study_design_scores_gemma":[0.000028350261,0.00010326877,0.00028903258,0.00012700204,0.00002266903,0.00019011361,0.0001471639,0.60575986,0.0022954461,0.3610755,0.029919697,0.000041864063],"about_ca_topic_score_codex":0.0022228602,"about_ca_topic_score_gemma":0.0016986472,"teacher_disagreement_score":0.0063769175,"about_ca_system_score_codex":0.00088902144,"about_ca_system_score_gemma":0.00088790857,"threshold_uncertainty_score":0.02133292},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011302359,0.00030975713,0.9857906,0.00018198606,0.0000328151,0.000024817144,0.000028687096,0.00008631524,0.0022426718],"genre_scores_gemma":[0.57089293,0.0011120087,0.41822952,0.00023568416,0.00018425289,0.00025379317,0.0001995428,0.00026244795,0.008629939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918634,0.0003758431,0.000044779285,0.000091491835,0.00025352987,0.000048111215],"domain_scores_gemma":[0.9967892,0.0021275938,0.0003230391,0.00031257575,0.00031711595,0.00013036671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020870315,0.0009881821,0.00088569056,0.00070482364,0.00044793964,0.0010723012,0.00087283447,0.00089239405,0.0016385838],"category_scores_gemma":[0.008708223,0.00035271322,0.00066870364,0.00055474346,0.0017869405,0.0016589313,0.0018658263,0.0023288159,0.0004984976],"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.000096533186,0.000057420224,0.0006662263,0.00022722468,0.00004121967,0.00016287838,0.00021603063,0.5497255,0.006235077,0.40801007,0.0013637479,0.033198174],"study_design_scores_gemma":[0.0000029857842,0.00002035011,0.00005885934,0.000008863883,0.0000025509603,0.000017235898,0.000007774891,0.95627755,0.0008706469,0.042197064,0.0005326009,0.000003493773],"about_ca_topic_score_codex":0.0011742646,"about_ca_topic_score_gemma":0.001254211,"teacher_disagreement_score":0.0020870315,"about_ca_system_score_codex":0.0010027078,"about_ca_system_score_gemma":0.0009059539,"threshold_uncertainty_score":0.011037409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042246263,0.000280276,0.9910836,0.00016591448,0.00014264742,0.000028208726,0.00003634009,0.00020188448,0.0038364618],"genre_scores_gemma":[0.17213348,0.00069422595,0.8152145,0.0003339103,0.0002927268,0.00026180944,0.0002585385,0.0005283463,0.010282486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985044,0.0006755557,0.00005977896,0.00021416224,0.0004231408,0.00012302701],"domain_scores_gemma":[0.9976044,0.0012346979,0.00012695756,0.0005888383,0.0003183987,0.00012664388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027548661,0.0017127605,0.0015217048,0.0012282114,0.0006661044,0.0018666079,0.0027042339,0.0014870125,0.0068058167],"category_scores_gemma":[0.009368091,0.00073819037,0.0012591028,0.0017909997,0.0012899393,0.0033109495,0.0035744198,0.0046455264,0.0018752614],"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.00023365549,0.00025125194,0.00059497205,0.00021466591,0.00012497688,0.000084556894,0.000118161435,0.5775818,0.0023796523,0.2478482,0.008360705,0.16220737],"study_design_scores_gemma":[0.000020498981,0.00002162732,0.00004132304,0.000017496208,0.000013342797,0.000020975154,0.000008009996,0.9494693,0.0005512353,0.047460422,0.0023687996,0.000006855077],"about_ca_topic_score_codex":0.0021620595,"about_ca_topic_score_gemma":0.0032555258,"teacher_disagreement_score":0.0068058167,"about_ca_system_score_codex":0.001220132,"about_ca_system_score_gemma":0.0016950252,"threshold_uncertainty_score":0.022767723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034430327,0.00004781741,0.9952662,0.000043631146,0.00001671962,0.000034571578,0.000017927545,0.00017502747,0.0009551875],"genre_scores_gemma":[0.19469355,0.00024481336,0.80089736,0.000112953436,0.00004112189,0.000248465,0.00019238304,0.0006666189,0.0029026791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993019,0.0002647718,0.000035698544,0.000087499866,0.00023022539,0.000079856276],"domain_scores_gemma":[0.99832696,0.0009965785,0.00013300168,0.00012764068,0.0003214118,0.00009430053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024440878,0.0016489454,0.0013168254,0.0008198028,0.0004098143,0.0014835728,0.0010017405,0.00087384717,0.0027569747],"category_scores_gemma":[0.0069815814,0.0006585126,0.0010741195,0.00045462284,0.0010307196,0.0013030538,0.0018328715,0.0023458514,0.000837145],"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.0000936853,0.00006125661,0.0005198511,0.00023037627,0.00005011462,0.00012755304,0.00017603963,0.8529625,0.009562446,0.05353681,0.0021740876,0.080505334],"study_design_scores_gemma":[0.000004828153,0.000016915206,0.00004587264,0.000010833405,0.0000028953632,0.00001051264,0.000009226418,0.99288577,0.001348679,0.004970596,0.0006892991,0.000004510926],"about_ca_topic_score_codex":0.0028628635,"about_ca_topic_score_gemma":0.0030422965,"teacher_disagreement_score":0.0028628635,"about_ca_system_score_codex":0.001001314,"about_ca_system_score_gemma":0.0017038179,"threshold_uncertainty_score":0.012925744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33869386,0.0008758178,0.5623104,0.0021858006,0.00038074222,0.00014419902,0.0010306014,0.0006295994,0.09374897],"genre_scores_gemma":[0.915765,0.0006522876,0.051621687,0.00040135664,0.00029439095,0.0002600703,0.0010636261,0.00048244483,0.029459162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988335,0.00021988725,0.000049851133,0.00017235888,0.0004920074,0.00023242956],"domain_scores_gemma":[0.9978613,0.0009936917,0.00022920959,0.00016951347,0.00026680832,0.0004794765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011304801,0.0010800636,0.0014350599,0.0029780522,0.0023234324,0.0054258704,0.0013503773,0.0016270183,0.019187387],"category_scores_gemma":[0.0044275015,0.0007979373,0.0013825203,0.0012795689,0.0027201585,0.0037038657,0.0034339728,0.0037001108,0.0020389783],"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.000036053294,0.000032481537,0.00014265855,0.000040928837,0.000009914939,0.0000528738,0.00006937614,0.004703245,0.0007724053,0.9898177,0.0014208632,0.002901538],"study_design_scores_gemma":[0.0000231053,0.000020020509,0.00015452447,0.000015141543,0.000005331468,0.00005128531,0.00006184679,0.03927748,0.00047987493,0.95857096,0.001321033,0.000019433766],"about_ca_topic_score_codex":0.0012374653,"about_ca_topic_score_gemma":0.0014254738,"teacher_disagreement_score":0.019187387,"about_ca_system_score_codex":0.0013931302,"about_ca_system_score_gemma":0.001185404,"threshold_uncertainty_score":0.06418824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015566378,0.0002531757,0.9805532,0.000081931554,0.00009519757,0.000016581884,0.000024765062,0.00013264756,0.0032761295],"genre_scores_gemma":[0.5055187,0.00075135916,0.47789982,0.00019501869,0.00025034137,0.00011508726,0.00014327622,0.00034678422,0.0147795975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974376,0.00009370751,0.000013573559,0.0000542842,0.00006779412,0.00002689416],"domain_scores_gemma":[0.99952006,0.0002468733,0.000055608845,0.000078485165,0.00006861546,0.000030291441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006577527,0.00091388804,0.0007238352,0.00036117595,0.00030022825,0.0009484049,0.0007646275,0.0008810083,0.0059114834],"category_scores_gemma":[0.00220594,0.0002878115,0.00054856314,0.00053127366,0.00066007714,0.0011429078,0.0009977862,0.0013507832,0.0008046412],"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.0005954618,0.00025429155,0.0004666211,0.00050156086,0.00011655286,0.00022459692,0.00021163447,0.34886324,0.14503354,0.20060395,0.004743141,0.29838535],"study_design_scores_gemma":[0.000021823766,0.00014370443,0.00016644919,0.000023045586,0.000019551151,0.0000794801,0.000020926373,0.9686193,0.009311659,0.018791722,0.0027811453,0.000021290321],"about_ca_topic_score_codex":0.0006843347,"about_ca_topic_score_gemma":0.0015001341,"teacher_disagreement_score":0.0059114834,"about_ca_system_score_codex":0.0003584462,"about_ca_system_score_gemma":0.00036591498,"threshold_uncertainty_score":0.019775808},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002204743,0.00072784006,0.99069124,0.00014978847,0.00004757433,0.000017126022,0.000026191585,0.000058894937,0.0060765394],"genre_scores_gemma":[0.30236816,0.0040703514,0.6834419,0.0003848419,0.00040960227,0.0004169318,0.00026225223,0.0005536995,0.00809224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869484,0.0006218936,0.00004773645,0.00017870782,0.00034846435,0.00010831664],"domain_scores_gemma":[0.99771416,0.0017421047,0.00015677424,0.000101897866,0.00020449594,0.00008064107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736958,0.0026455617,0.0029901552,0.001762025,0.00062987953,0.003270802,0.0022047018,0.0023501776,0.0051973746],"category_scores_gemma":[0.008576958,0.0012332181,0.0017350973,0.0026305167,0.0020977107,0.0031783823,0.0022506358,0.0041772625,0.00072382385],"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.000067885536,0.000055542787,0.00011171583,0.00021007696,0.00008421117,0.00004333596,0.000056641347,0.87967545,0.0006210387,0.08984192,0.0016695238,0.02756258],"study_design_scores_gemma":[0.00001184787,0.000029323228,0.000043551743,0.000046301117,0.000030058283,0.000013243663,0.000010356607,0.9561364,0.00018628911,0.04266873,0.0008163446,0.000007592448],"about_ca_topic_score_codex":0.0021874218,"about_ca_topic_score_gemma":0.0012571658,"teacher_disagreement_score":0.0051973746,"about_ca_system_score_codex":0.001569886,"about_ca_system_score_gemma":0.0012406087,"threshold_uncertainty_score":0.025051713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059663996,0.001213139,0.8720519,0.002491843,0.00062548666,0.00008495044,0.00051099923,0.00057929987,0.06277838],"genre_scores_gemma":[0.84941643,0.0011333779,0.12127161,0.0015926594,0.0011199663,0.00024180638,0.0007914271,0.0007566485,0.02367614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943336,0.001797172,0.00021639097,0.0007194713,0.0021471428,0.0007862075],"domain_scores_gemma":[0.98224866,0.012609308,0.0007249591,0.0014714393,0.002192136,0.000753592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00486918,0.0018452589,0.0013607356,0.0022217468,0.001508305,0.0028978842,0.0026243625,0.0012891816,0.0114817945],"category_scores_gemma":[0.025345076,0.00087536976,0.0020833565,0.00259382,0.0049287137,0.006044061,0.006130725,0.0073501603,0.0023708865],"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.00015090506,0.000070289025,0.0009963635,0.000137606,0.00007586167,0.0002921663,0.00022243486,0.01799105,0.002415151,0.95277095,0.006488799,0.018388359],"study_design_scores_gemma":[0.00001973488,0.000041193558,0.00025933306,0.000025648716,0.00001936837,0.00007110261,0.000040338244,0.12642333,0.001790383,0.868972,0.0023183601,0.000019223895],"about_ca_topic_score_codex":0.0030395223,"about_ca_topic_score_gemma":0.0024431834,"teacher_disagreement_score":0.0114817945,"about_ca_system_score_codex":0.0024161164,"about_ca_system_score_gemma":0.0012817663,"threshold_uncertainty_score":0.038410425},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016351766,0.00049505534,0.9923455,0.00009541016,0.00010078418,0.000044626122,0.000045175457,0.0003796564,0.004858606],"genre_scores_gemma":[0.037531357,0.00056003797,0.9565437,0.00014650678,0.000087858265,0.00031114733,0.00028599412,0.00037879052,0.0041545383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989643,0.00039530187,0.00005759899,0.00014303933,0.00029447698,0.00014521014],"domain_scores_gemma":[0.9979631,0.0013825209,0.00009467717,0.00019399315,0.00029347037,0.00007221078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017236796,0.0022348568,0.0015298504,0.001160119,0.0007371324,0.0019391729,0.002128588,0.0014868192,0.009988605],"category_scores_gemma":[0.005457059,0.0013367847,0.0017053037,0.002324906,0.00089586223,0.0025089493,0.0025604642,0.0043058125,0.0027895272],"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.00022365768,0.0002935407,0.000271056,0.00033985902,0.00010015877,0.000052190986,0.00012617777,0.4837302,0.0032070207,0.09845224,0.016589098,0.39661482],"study_design_scores_gemma":[0.000039052495,0.000024758592,0.000038540362,0.00003244938,0.000013111773,0.000018782946,0.000015546297,0.96046025,0.00059101847,0.03555875,0.0032008253,0.0000069474377],"about_ca_topic_score_codex":0.0027579346,"about_ca_topic_score_gemma":0.0037488102,"teacher_disagreement_score":0.009988605,"about_ca_system_score_codex":0.0011973743,"about_ca_system_score_gemma":0.0014038399,"threshold_uncertainty_score":0.0334152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018426365,0.00007581691,0.9959144,0.000037638765,0.000025407064,0.000048704373,0.000012905545,0.00044237808,0.0016000693],"genre_scores_gemma":[0.0328158,0.00013290076,0.9643966,0.0000598159,0.000021075113,0.00021905176,0.00007966349,0.00019786844,0.0020771776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989606,0.00039089294,0.00003415151,0.00009217874,0.00045801935,0.00006415468],"domain_scores_gemma":[0.9989091,0.0006245158,0.000065730324,0.00012654516,0.00023230644,0.000041741787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144316,0.0010974031,0.0010257185,0.0006968131,0.00042383588,0.0008775665,0.0015809836,0.0010201975,0.004680016],"category_scores_gemma":[0.0031712777,0.00054188736,0.0008635219,0.00076641876,0.0007011517,0.001054785,0.0013426547,0.0026298587,0.001868762],"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.00024402159,0.00037733885,0.00068071723,0.00051041844,0.00008439839,0.000204162,0.00015774342,0.63125455,0.017094335,0.04249002,0.004634293,0.302268],"study_design_scores_gemma":[0.00003670581,0.00006280452,0.00006284659,0.000024043555,0.0000064159112,0.000054614615,0.000010161834,0.9895271,0.0027885719,0.003826933,0.0035890108,0.000010785448],"about_ca_topic_score_codex":0.0021266292,"about_ca_topic_score_gemma":0.0023724164,"teacher_disagreement_score":0.004680016,"about_ca_system_score_codex":0.00038680388,"about_ca_system_score_gemma":0.0013778041,"threshold_uncertainty_score":0.015656173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012134672,0.000231999,0.9820826,0.00023799793,0.00009080248,0.000046759662,0.00002331787,0.000044322736,0.0051075085],"genre_scores_gemma":[0.7732824,0.00043645574,0.21797977,0.00025943233,0.00017564936,0.0005586804,0.000098827935,0.000080309925,0.007128428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995097,0.00021204643,0.000030736643,0.00011491115,0.00009839684,0.00003414953],"domain_scores_gemma":[0.9990828,0.0005899061,0.00008261914,0.000045453202,0.00014956042,0.000049641807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014085941,0.0011374495,0.001029183,0.00075425114,0.0007881243,0.0010832605,0.0012970077,0.0012477593,0.0028638917],"category_scores_gemma":[0.0032773349,0.00044441383,0.0012862742,0.00045984564,0.0015369356,0.0013913123,0.002774181,0.0014696291,0.00020253129],"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.00009823068,0.00007598661,0.0005816988,0.0003375553,0.0001367528,0.00016764589,0.0003345806,0.64505863,0.0077792397,0.31834593,0.0010976713,0.025986157],"study_design_scores_gemma":[0.0000054992893,0.00003164351,0.000032902848,0.000008875889,0.000008849975,0.0000091676275,0.000011417733,0.9792804,0.00023202729,0.019895984,0.00047772846,0.000005646073],"about_ca_topic_score_codex":0.0024689683,"about_ca_topic_score_gemma":0.0027374404,"teacher_disagreement_score":0.0028638917,"about_ca_system_score_codex":0.0007624134,"about_ca_system_score_gemma":0.00094906834,"threshold_uncertainty_score":0.009580672},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062365615,0.049460575,0.019507134,0.020990625,0.8733018,0.000115339695,0.0005182497,0.0003474082,0.03513517],"genre_scores_gemma":[0.004524069,0.028977685,0.006832554,0.0060551492,0.82165056,0.00015449408,0.0008243897,0.0008306696,0.1301505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978855,0.000408741,0.00015514622,0.00048641398,0.00091653975,0.00014761565],"domain_scores_gemma":[0.9943771,0.0027406223,0.00032104942,0.00029746097,0.0014109788,0.0008528875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021107432,0.0022876204,0.0027185886,0.0026332026,0.001576462,0.0058164764,0.0016485378,0.0031482845,0.06660185],"category_scores_gemma":[0.0074253185,0.0007361051,0.0021376854,0.0019921218,0.0011411286,0.0036281403,0.0018567822,0.0056355773,0.025715608],"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.000038395978,0.00004578262,0.0000841462,0.0003505182,0.00004326034,0.00006001746,0.000021995755,0.00047418603,0.00050860166,0.004548647,0.9581532,0.035671115],"study_design_scores_gemma":[0.000031954103,0.000100245365,0.00058440154,0.0002921431,0.000039649865,0.00029242045,0.000030633928,0.002325958,0.0003826746,0.012013697,0.9838749,0.000031272408],"about_ca_topic_score_codex":0.0006060864,"about_ca_topic_score_gemma":0.001293713,"teacher_disagreement_score":0.06660185,"about_ca_system_score_codex":0.0015335215,"about_ca_system_score_gemma":0.0018712014,"threshold_uncertainty_score":0.22280538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04872543,0.0002552169,0.9404769,0.00022828196,0.000083491126,0.00008144233,0.00003734043,0.00009601332,0.010015935],"genre_scores_gemma":[0.7315976,0.0005163142,0.2542581,0.00014002205,0.00012875581,0.00023757416,0.00010179596,0.00013311168,0.012886675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987006,0.00038042906,0.000073262614,0.0003399771,0.00039254784,0.00011322156],"domain_scores_gemma":[0.9974654,0.0011688884,0.00030614788,0.00025875683,0.00056634657,0.00023442613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022603301,0.0005753444,0.00060083723,0.0015386523,0.00093571923,0.0017355962,0.00081698556,0.0012338555,0.005733752],"category_scores_gemma":[0.00823067,0.00021385451,0.0007407721,0.0006616527,0.0029057402,0.0023819108,0.001931073,0.0015227441,0.0005786187],"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.00008367059,0.000026437214,0.00069070584,0.000069039204,0.00001771407,0.00009200606,0.00023712829,0.03554679,0.0073286644,0.9327635,0.0004754909,0.022668902],"study_design_scores_gemma":[0.000031874635,0.00022541957,0.00060186913,0.000038269118,0.000019403631,0.0002712216,0.00011388736,0.5816177,0.008946221,0.40192556,0.006157465,0.000051030915],"about_ca_topic_score_codex":0.00070180144,"about_ca_topic_score_gemma":0.00044940197,"teacher_disagreement_score":0.005733752,"about_ca_system_score_codex":0.0011786136,"about_ca_system_score_gemma":0.0011874321,"threshold_uncertainty_score":0.019181311},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011296882,0.00028915523,0.9611985,0.00020544339,0.00018485366,0.00006148426,0.001261634,0.021640329,0.014028888],"genre_scores_gemma":[0.032267023,0.00065208966,0.905113,0.00040719454,0.00017630676,0.0005401532,0.003917638,0.033122588,0.023803955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999456,0.000100244164,0.000035891782,0.00007477344,0.0002756033,0.000057532452],"domain_scores_gemma":[0.9986204,0.00084630284,0.00006626183,0.0001241012,0.00027647542,0.00006646125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010816173,0.0016233356,0.000980649,0.0007280185,0.0004467587,0.0016335283,0.0018773681,0.0014589403,0.079539575],"category_scores_gemma":[0.004953802,0.00083806005,0.0010268106,0.00064794,0.000636264,0.0013093513,0.002210387,0.0027938795,0.026829787],"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.0001965608,0.00015001021,0.0009115137,0.0018889506,0.0001681259,0.00035659867,0.0003841682,0.12529221,0.0137952315,0.1251447,0.3846377,0.34707424],"study_design_scores_gemma":[0.00018307002,0.00005505189,0.00035435645,0.00018876206,0.000034916673,0.0002652598,0.000065972985,0.72653335,0.0129492935,0.042139586,0.21714985,0.00008048127],"about_ca_topic_score_codex":0.0028388398,"about_ca_topic_score_gemma":0.0055342983,"teacher_disagreement_score":0.079539575,"about_ca_system_score_codex":0.00052770675,"about_ca_system_score_gemma":0.0013522897,"threshold_uncertainty_score":0.26608634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072870275,0.000022687334,0.99792695,0.00003177185,0.000030524487,0.0000120672985,0.0000070718165,0.000056374956,0.0011839293],"genre_scores_gemma":[0.0545767,0.00013834456,0.9414338,0.00008543799,0.00006416537,0.00015442933,0.00007089716,0.00018207957,0.0032942004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993765,0.00021766873,0.000027216363,0.00009608598,0.0002567023,0.000025866495],"domain_scores_gemma":[0.9993944,0.00029545208,0.00003841172,0.000076739634,0.00016056605,0.000034390763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010111646,0.0007297397,0.0010616214,0.0007903038,0.00044861954,0.001064883,0.0013301433,0.0009933913,0.005230159],"category_scores_gemma":[0.0028966847,0.0004150106,0.0007881428,0.0009318512,0.0012362112,0.0014729777,0.0018953506,0.002540149,0.0017319501],"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.00014996929,0.00020494033,0.0002648008,0.00025007292,0.000045520734,0.00008806627,0.00020682949,0.27216935,0.014355154,0.43261328,0.0048988927,0.27475312],"study_design_scores_gemma":[0.000028718718,0.00007666392,0.000043988923,0.000013643375,0.000009184965,0.000057936937,0.000014673054,0.9418097,0.0017040832,0.05025796,0.005969477,0.000013828878],"about_ca_topic_score_codex":0.00073452323,"about_ca_topic_score_gemma":0.00073249283,"teacher_disagreement_score":0.005230159,"about_ca_system_score_codex":0.00041977552,"about_ca_system_score_gemma":0.00086380244,"threshold_uncertainty_score":0.017496645},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015056632,0.017865265,0.6083697,0.006489585,0.004287683,0.00017120874,0.00070535735,0.0033123137,0.35729325],"genre_scores_gemma":[0.024277417,0.016591651,0.42396048,0.005341347,0.0022440788,0.0004111987,0.0018280238,0.0033040948,0.52204174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987072,0.00025963175,0.00006471596,0.00026112987,0.00063149724,0.0000758131],"domain_scores_gemma":[0.9987356,0.0005387866,0.000050668794,0.00029307583,0.0003181457,0.000063693915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012856335,0.0016536037,0.001013713,0.001349525,0.0007246462,0.0040583564,0.0015439638,0.0018012818,0.105978504],"category_scores_gemma":[0.0053502447,0.00070826104,0.0016677236,0.0015170303,0.0014056754,0.0057954313,0.0023877262,0.0040855836,0.050019067],"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.000031778538,0.00008081709,0.00019792684,0.00062952266,0.000044254302,0.000077855904,0.0003344403,0.009174845,0.0015551102,0.41770515,0.27364305,0.2965252],"study_design_scores_gemma":[0.000013794841,0.000032164604,0.00015102005,0.00027682388,0.0000120260165,0.0002116359,0.000060008584,0.007644825,0.0007155168,0.19727278,0.7935864,0.000023179404],"about_ca_topic_score_codex":0.0009935815,"about_ca_topic_score_gemma":0.0017162045,"teacher_disagreement_score":0.105978504,"about_ca_system_score_codex":0.0015646397,"about_ca_system_score_gemma":0.00134368,"threshold_uncertainty_score":0.35453343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017594552,0.00008240803,0.9967913,0.00011413279,0.000030748026,0.000026877155,0.00000937642,0.00012962848,0.0010560552],"genre_scores_gemma":[0.082977906,0.0002774296,0.91112447,0.00018492484,0.00006512009,0.00019079934,0.00008775978,0.0002087208,0.0048829587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889994,0.00026983416,0.00004954041,0.00016811668,0.00052232394,0.000090292655],"domain_scores_gemma":[0.9984303,0.000813999,0.00011232345,0.00024568022,0.0003010639,0.000096669326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615018,0.00078409904,0.000912445,0.000436008,0.00051689934,0.001043726,0.0014826653,0.0014886078,0.0043563573],"category_scores_gemma":[0.0048679993,0.0004710484,0.00075537927,0.00057515886,0.001378635,0.0017384074,0.002095883,0.0025822327,0.0011632711],"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.00015370428,0.0001235223,0.0006969362,0.00029227618,0.000048285467,0.0001774905,0.00014649426,0.65172374,0.01144794,0.1383436,0.0052774064,0.19156863],"study_design_scores_gemma":[0.0000064536307,0.000016170392,0.0000348576,0.000006830005,0.0000020158116,0.000027208114,0.0000047365047,0.99128824,0.0008398555,0.00628793,0.001479281,0.000006457916],"about_ca_topic_score_codex":0.0025522911,"about_ca_topic_score_gemma":0.0028155514,"teacher_disagreement_score":0.0043563573,"about_ca_system_score_codex":0.00074190495,"about_ca_system_score_gemma":0.001895246,"threshold_uncertainty_score":0.014573455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009805346,0.00030212922,0.996367,0.00016749937,0.00003874781,0.000027696882,0.000030620573,0.00018479394,0.0019009286],"genre_scores_gemma":[0.21829155,0.0014705936,0.76824677,0.00051897345,0.0002782746,0.0006102711,0.0004171727,0.00073741935,0.009428998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980787,0.00091011164,0.00007209253,0.00024661416,0.0005294649,0.00016298599],"domain_scores_gemma":[0.9936558,0.004911145,0.00036971617,0.0004168015,0.0004736654,0.00017289612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003396101,0.0023374143,0.001944484,0.00078971207,0.00059884886,0.0015907525,0.0019971137,0.0018086832,0.005697133],"category_scores_gemma":[0.011811735,0.0008769204,0.0013964124,0.001336091,0.001756973,0.0021238916,0.002555093,0.0058533754,0.0013057217],"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.00007714499,0.00007420158,0.00020685612,0.00020107797,0.000043203374,0.000074711774,0.00006508471,0.896715,0.0007798963,0.05830297,0.0031669547,0.04029295],"study_design_scores_gemma":[0.000007699343,0.00001115158,0.000015062051,0.0000096174535,0.000002647371,0.000007882296,0.0000039101815,0.9830651,0.00022655637,0.015959246,0.00068765035,0.0000034338623],"about_ca_topic_score_codex":0.0038049405,"about_ca_topic_score_gemma":0.0035008693,"teacher_disagreement_score":0.005697133,"about_ca_system_score_codex":0.0014616734,"about_ca_system_score_gemma":0.0023052425,"threshold_uncertainty_score":0.019058824},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033857875,0.0004027253,0.9603482,0.0013041074,0.00005073155,0.00006127768,0.00019358368,0.00007532727,0.0037061719],"genre_scores_gemma":[0.8522044,0.001206613,0.1344609,0.0004354288,0.00017773932,0.0004750345,0.0005004495,0.0002460567,0.010293407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978301,0.000909113,0.00013413114,0.0005150852,0.0003109163,0.000300597],"domain_scores_gemma":[0.95706046,0.03727366,0.0022318042,0.00092368235,0.0017726364,0.0007377059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062550413,0.0021420065,0.0040048286,0.0015240373,0.0009436358,0.003448817,0.0025102692,0.00413421,0.0036439728],"category_scores_gemma":[0.047129974,0.0020642409,0.0022313527,0.0013098832,0.0038289316,0.0053820526,0.0042430777,0.004229715,0.0002791907],"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.0001226437,0.000059740425,0.00056369364,0.0001978349,0.00008329149,0.00010953033,0.00017916325,0.88165355,0.00079173554,0.10907687,0.00075449614,0.0064074276],"study_design_scores_gemma":[0.0000110114515,0.000025589674,0.000110218476,0.00002390576,0.000011123659,0.000018217128,0.000027058619,0.9567989,0.0002540634,0.042530008,0.00017860768,0.000011346775],"about_ca_topic_score_codex":0.008163562,"about_ca_topic_score_gemma":0.004398893,"teacher_disagreement_score":0.008163562,"about_ca_system_score_codex":0.0032739989,"about_ca_system_score_gemma":0.0038103326,"threshold_uncertainty_score":0.03308022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012641886,0.029920874,0.16015926,0.0019168024,0.0016479034,0.000050391365,0.00054257206,0.00048990763,0.80400807],"genre_scores_gemma":[0.03862485,0.04483259,0.10126709,0.0017660923,0.0020602923,0.00022106397,0.0017752321,0.0009116528,0.80854106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997099,0.000045267705,0.0000112597945,0.00004687467,0.00017156919,0.00001514583],"domain_scores_gemma":[0.9998109,0.000088398316,0.000009480241,0.00003391791,0.000045229208,0.00001209647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037510696,0.0012545993,0.00086687016,0.0006867429,0.0003131399,0.0016857538,0.00080574607,0.0006469366,0.031147875],"category_scores_gemma":[0.0010558205,0.0004089686,0.00051978894,0.0014253088,0.00086217304,0.0013742168,0.0008940707,0.0028199165,0.012605176],"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.000018266615,0.000052978987,0.00008037572,0.00038168763,0.000022228614,0.00004494905,0.000056896944,0.006988967,0.001115476,0.56375206,0.1950722,0.23241396],"study_design_scores_gemma":[0.00000959439,0.00002553127,0.00031923206,0.0002259746,0.000011368158,0.00015389355,0.000019963441,0.010191245,0.0007479548,0.4787687,0.5095128,0.0000138206],"about_ca_topic_score_codex":0.0005381287,"about_ca_topic_score_gemma":0.0010732925,"teacher_disagreement_score":0.031147875,"about_ca_system_score_codex":0.00070313696,"about_ca_system_score_gemma":0.0008455132,"threshold_uncertainty_score":0.104200006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092793995,0.00008801362,0.99817586,0.000035890964,0.000032117485,0.000022900047,0.000008204486,0.00010966349,0.00059940247],"genre_scores_gemma":[0.051025547,0.00031074797,0.9453007,0.000092649876,0.000077432174,0.0003598481,0.0001047042,0.00019204001,0.0025363115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993242,0.00023218697,0.00003238926,0.000081669314,0.00029246096,0.000037101974],"domain_scores_gemma":[0.9993117,0.00031444748,0.00006958405,0.000069940186,0.00018832863,0.000046078207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010304257,0.0009923214,0.0013309307,0.00075844163,0.00043921027,0.0007862576,0.0013072061,0.0010031497,0.003271491],"category_scores_gemma":[0.0026469799,0.00038949653,0.0010201101,0.00073521544,0.0007361409,0.0012251053,0.0014513741,0.0022849534,0.0013551229],"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.0002769275,0.0002148263,0.00063846144,0.000629242,0.00012070413,0.00023596405,0.00023108012,0.5067971,0.036547758,0.13534312,0.0071984297,0.31176645],"study_design_scores_gemma":[0.000030258916,0.000109235705,0.00007572947,0.00001883011,0.00000988531,0.00010588639,0.00000744311,0.98580533,0.0028864725,0.0062718685,0.004662561,0.000016557653],"about_ca_topic_score_codex":0.0007373151,"about_ca_topic_score_gemma":0.0006087088,"teacher_disagreement_score":0.003271491,"about_ca_system_score_codex":0.0003784914,"about_ca_system_score_gemma":0.0010663084,"threshold_uncertainty_score":0.010944247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017910149,0.0029400568,0.942175,0.002731955,0.0007003068,0.000118415264,0.00022099183,0.000525517,0.03267755],"genre_scores_gemma":[0.4637043,0.0054372335,0.47391438,0.0013430992,0.0018229114,0.00032494974,0.000890074,0.0010319522,0.051531173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852633,0.00054185267,0.00005256822,0.00018262868,0.0004604373,0.0002361532],"domain_scores_gemma":[0.99766845,0.0014175472,0.00008888453,0.00048130276,0.00022127251,0.00012250924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015581442,0.0012767671,0.001283729,0.0014901487,0.0010675417,0.0017185637,0.0019379708,0.0007295113,0.006941734],"category_scores_gemma":[0.0063061602,0.000513826,0.0019177244,0.001539342,0.0018757926,0.0030464109,0.0033854255,0.0075602885,0.0021823852],"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.00025948815,0.00023514262,0.00056683883,0.00053059,0.00008998284,0.00013733258,0.00040168813,0.061879855,0.0057392623,0.66980255,0.027149929,0.23320733],"study_design_scores_gemma":[0.00007469598,0.00007292822,0.0002730455,0.00005881227,0.00004873245,0.00015617511,0.000073449264,0.17079483,0.002879722,0.80505013,0.020488968,0.000028472972],"about_ca_topic_score_codex":0.0015629877,"about_ca_topic_score_gemma":0.0024648365,"teacher_disagreement_score":0.006941734,"about_ca_system_score_codex":0.0011991708,"about_ca_system_score_gemma":0.00093331735,"threshold_uncertainty_score":0.023222446},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062338593,0.00033545255,0.9832397,0.0003954311,0.00011679365,0.00007044085,0.00012189244,0.0011414625,0.008345007],"genre_scores_gemma":[0.27807486,0.00051598635,0.7081082,0.0005660744,0.00023901586,0.00020996721,0.0004971102,0.0010116396,0.01077719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654645,0.0010538939,0.00018702999,0.00057698943,0.0010649136,0.0005707592],"domain_scores_gemma":[0.992292,0.004065747,0.00040286916,0.002225982,0.00074835034,0.00026507332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043651247,0.0013903262,0.0018869891,0.0014817577,0.001202157,0.0026548128,0.0036724776,0.0019109935,0.014660878],"category_scores_gemma":[0.018223615,0.0008465863,0.0013644795,0.0030388767,0.0019845162,0.0045790887,0.0045521776,0.0058613694,0.0037068673],"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.0007002517,0.00032417252,0.00045948403,0.00029620947,0.00007592966,0.000091072245,0.00020607673,0.43218064,0.0039059715,0.2738073,0.01598966,0.2719633],"study_design_scores_gemma":[0.000052708798,0.000040464685,0.000049044666,0.00002758857,0.000019018811,0.000023183546,0.000019268267,0.9226913,0.0014966247,0.072127506,0.003441403,0.000011943898],"about_ca_topic_score_codex":0.0059448723,"about_ca_topic_score_gemma":0.010239817,"teacher_disagreement_score":0.014660878,"about_ca_system_score_codex":0.0023041351,"about_ca_system_score_gemma":0.0035395038,"threshold_uncertainty_score":0.049045503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054809996,0.0010613244,0.98285043,0.00039038135,0.00072417874,0.00008357386,0.00016523812,0.00006721211,0.009176728],"genre_scores_gemma":[0.32918787,0.0028070277,0.63830423,0.0012012072,0.001782038,0.000991625,0.0011667118,0.00066301733,0.023896223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955155,0.0022009485,0.00040699166,0.0005376847,0.001107755,0.00023121406],"domain_scores_gemma":[0.9892798,0.007519607,0.0007353437,0.00051782024,0.0014784224,0.00046911146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010506185,0.0021758408,0.0020531202,0.004403766,0.001087951,0.0035834713,0.0039044265,0.0029099528,0.008370334],"category_scores_gemma":[0.028040135,0.0007953782,0.00210999,0.0032214383,0.0029139165,0.0077571957,0.0054825777,0.0059761023,0.0008706515],"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.000095763804,0.000067384026,0.0005167151,0.000231045,0.000090878995,0.00011965922,0.00016983338,0.029120669,0.0030616506,0.925163,0.0026235003,0.03873987],"study_design_scores_gemma":[0.0000316967,0.00015703724,0.00077441346,0.00011222751,0.00010257447,0.00011285324,0.00010756758,0.52444166,0.0013997938,0.46180472,0.010886004,0.00006944635],"about_ca_topic_score_codex":0.001677427,"about_ca_topic_score_gemma":0.0028859782,"teacher_disagreement_score":0.010506185,"about_ca_system_score_codex":0.00200188,"about_ca_system_score_gemma":0.0013506159,"threshold_uncertainty_score":0.055562675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006709752,0.00915757,0.89550185,0.00042584992,0.00085665385,0.000045358796,0.00029696245,0.00095074944,0.09209401],"genre_scores_gemma":[0.034151934,0.019654563,0.8116105,0.0006729523,0.0014937483,0.00049634586,0.0013698891,0.002376219,0.12817386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994653,0.00016247923,0.000024329518,0.00007469959,0.0002514268,0.000021807362],"domain_scores_gemma":[0.99935955,0.00039317674,0.000023665754,0.00008269106,0.000118586235,0.000022310804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065463263,0.001873414,0.0012677484,0.00067484623,0.00038623626,0.0018329882,0.0013354255,0.00093397166,0.027350638],"category_scores_gemma":[0.0019651158,0.00067574496,0.0008550969,0.0016785389,0.0011381237,0.0017008107,0.0010774302,0.004641961,0.0151817035],"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.000039103936,0.00011824019,0.00007734942,0.0008013876,0.000049535218,0.00007303648,0.00014934423,0.036102828,0.0031378227,0.5259332,0.12530373,0.3082144],"study_design_scores_gemma":[0.000033484936,0.000045768305,0.0001807791,0.00025451608,0.000022319204,0.00020637174,0.000047921018,0.15098874,0.0018416769,0.60034883,0.24599288,0.000036734327],"about_ca_topic_score_codex":0.0006125058,"about_ca_topic_score_gemma":0.0010762402,"teacher_disagreement_score":0.027350638,"about_ca_system_score_codex":0.00053874915,"about_ca_system_score_gemma":0.0006346581,"threshold_uncertainty_score":0.091497004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067969556,0.00030251849,0.98980576,0.00017029457,0.00020267813,0.00006841878,0.000056782646,0.00025672573,0.0023397962],"genre_scores_gemma":[0.2486791,0.00068678637,0.74152994,0.0004188173,0.00029133452,0.00041016535,0.00029465568,0.00040699012,0.007282301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993529,0.00019298478,0.000049231698,0.00012208529,0.00024078922,0.00004208854],"domain_scores_gemma":[0.99916744,0.00026058013,0.000082723906,0.00012855305,0.0003077367,0.000052883144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276748,0.00067936396,0.0008001743,0.000725919,0.00035923542,0.000980578,0.0015230008,0.0017578254,0.003854437],"category_scores_gemma":[0.0038406132,0.00028193888,0.0005294129,0.0006381877,0.0007175068,0.0016308562,0.00092880335,0.0015266198,0.0008809881],"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.00033805252,0.00019892937,0.0024439415,0.0004922633,0.0001512767,0.0003180225,0.00028812353,0.557477,0.033272687,0.08067333,0.010252328,0.314094],"study_design_scores_gemma":[0.00005695426,0.000060941155,0.00037998648,0.00002830783,0.000030356956,0.000095841264,0.000022503547,0.97223645,0.0070260614,0.006422671,0.013592555,0.00004724196],"about_ca_topic_score_codex":0.0016155127,"about_ca_topic_score_gemma":0.0013991458,"teacher_disagreement_score":0.003854437,"about_ca_system_score_codex":0.00044961044,"about_ca_system_score_gemma":0.00096184545,"threshold_uncertainty_score":0.012894332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017362811,0.00013739149,0.9975533,0.00002851903,0.000016054199,0.000021173364,0.0000064803494,0.000073677664,0.0004271567],"genre_scores_gemma":[0.2753763,0.00051622384,0.7196788,0.00013163524,0.00009123847,0.00049971254,0.0001334417,0.00021048657,0.0033621371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988067,0.00049839745,0.00006607213,0.00015056164,0.00040896618,0.000069274436],"domain_scores_gemma":[0.9978527,0.0011607675,0.00023956259,0.00011253641,0.0005577795,0.00007674726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019273197,0.0011001277,0.0014619721,0.0006419399,0.00034119238,0.0011985109,0.0018703991,0.0014471201,0.0021421176],"category_scores_gemma":[0.006372438,0.00059866364,0.00086785865,0.00069921225,0.00089534133,0.0016015291,0.0013355528,0.001721609,0.00072811113],"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.00016628619,0.000062479834,0.00048705164,0.00030745997,0.00009144246,0.00016044902,0.00014251712,0.88923717,0.0057963864,0.021540541,0.0015932707,0.08041496],"study_design_scores_gemma":[0.00000552405,0.000023422588,0.000015338672,0.000004746305,0.0000025661232,0.000012442846,0.0000025114118,0.9983966,0.0003717739,0.000866003,0.00029541558,0.0000035263909],"about_ca_topic_score_codex":0.0025046994,"about_ca_topic_score_gemma":0.0013769121,"teacher_disagreement_score":0.0025046994,"about_ca_system_score_codex":0.00066034705,"about_ca_system_score_gemma":0.0010459647,"threshold_uncertainty_score":0.010192752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040997732,0.0011279157,0.9518048,0.0007614404,0.00012600947,0.000087060165,0.00023836624,0.000230592,0.0046260706],"genre_scores_gemma":[0.8478977,0.00093622477,0.14415345,0.00027312894,0.00016499382,0.00027459153,0.0004305587,0.00017136741,0.00569799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978399,0.0007485672,0.00014815453,0.00041890162,0.00041990593,0.00042449337],"domain_scores_gemma":[0.9754132,0.020992437,0.0010541043,0.0010312898,0.0007531965,0.00075581705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004547059,0.0017712926,0.0037809378,0.001348675,0.0012053445,0.0040649823,0.00305956,0.002738188,0.005488007],"category_scores_gemma":[0.032439727,0.0017330231,0.0014187963,0.001249325,0.0027664576,0.004998887,0.004103412,0.00481861,0.00045314291],"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.0002307161,0.000067936715,0.00042683035,0.0001416871,0.00004465778,0.00006779627,0.000105638595,0.9253159,0.00027890893,0.063893065,0.0007733264,0.008653435],"study_design_scores_gemma":[0.000015267837,0.00001999301,0.00003219118,0.00001821977,0.0000069268367,0.000010660976,0.000019386725,0.9641431,0.00009462596,0.035493728,0.0001396639,0.0000062844174],"about_ca_topic_score_codex":0.009155423,"about_ca_topic_score_gemma":0.006885512,"teacher_disagreement_score":0.009155423,"about_ca_system_score_codex":0.003030398,"about_ca_system_score_gemma":0.0035290616,"threshold_uncertainty_score":0.024047434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049590442,0.004467574,0.92281663,0.0011774946,0.000116254334,0.000117998396,0.000075375705,0.000078749355,0.02155959],"genre_scores_gemma":[0.6639528,0.0076837554,0.3152048,0.00040564887,0.00046463741,0.00033854257,0.0002615316,0.00006960899,0.011618666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930656,0.0002783292,0.000046660356,0.00011454416,0.00020103778,0.0000527935],"domain_scores_gemma":[0.99813336,0.001335425,0.00009501935,0.00008983331,0.00026597016,0.00008042345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016315761,0.00055374496,0.0006692548,0.00056178763,0.0005376298,0.001130494,0.0007254736,0.0009922269,0.003498197],"category_scores_gemma":[0.004608522,0.00035006978,0.0007172416,0.0006559598,0.0011412166,0.0017583384,0.0012484798,0.0019128169,0.00022439925],"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.00009966917,0.0002962965,0.0018632493,0.0009872133,0.000076747296,0.00043553184,0.00077773485,0.36524463,0.008801635,0.5474045,0.0020282166,0.07198458],"study_design_scores_gemma":[0.000017307602,0.00017861527,0.00046319826,0.000061610044,0.000017259981,0.00012923783,0.00014929501,0.8875013,0.0022175198,0.09916036,0.010083192,0.000021090776],"about_ca_topic_score_codex":0.0022285075,"about_ca_topic_score_gemma":0.0017003105,"teacher_disagreement_score":0.003498197,"about_ca_system_score_codex":0.000630317,"about_ca_system_score_gemma":0.00056896295,"threshold_uncertainty_score":0.011702657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048654344,0.00074953935,0.93059164,0.0006288082,0.000058466583,0.000100657395,0.000099017685,0.00006758269,0.019049913],"genre_scores_gemma":[0.8519006,0.0016274682,0.12955981,0.00031864524,0.000117814445,0.0005186298,0.00033241184,0.00022773113,0.015396846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986168,0.0005936936,0.0000939048,0.00023914936,0.00032266864,0.00013377107],"domain_scores_gemma":[0.9972343,0.0014035982,0.00034762436,0.0001188152,0.0007813791,0.00011430575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035988002,0.0012001324,0.0008842528,0.0013045905,0.00081606826,0.0015704915,0.00070926815,0.0012069168,0.0044648177],"category_scores_gemma":[0.008513533,0.0005112538,0.0009008102,0.00067754445,0.0024129015,0.0024363606,0.0021875624,0.0016822001,0.00057173485],"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.00008691868,0.000031858654,0.000620826,0.00020279977,0.000042047523,0.00018638033,0.00037845987,0.13700598,0.011622357,0.8348772,0.0012405968,0.013704562],"study_design_scores_gemma":[0.000026373313,0.00013933438,0.00052035844,0.000099701516,0.000014859343,0.00016553533,0.00028565738,0.7634211,0.005389697,0.22524361,0.0046506403,0.000043064192],"about_ca_topic_score_codex":0.0014249234,"about_ca_topic_score_gemma":0.0009657058,"teacher_disagreement_score":0.0044648177,"about_ca_system_score_codex":0.0010722899,"about_ca_system_score_gemma":0.0012098206,"threshold_uncertainty_score":0.019032478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023625072,0.00030283508,0.99239254,0.000825843,0.00014658761,0.000014371364,0.00019258495,0.00046530442,0.0032974482],"genre_scores_gemma":[0.29748243,0.0019214586,0.64188325,0.0014539461,0.0013491093,0.0003152181,0.0021037408,0.0021178934,0.05137294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977168,0.0009971863,0.00006836514,0.00052854104,0.0005575249,0.00013149841],"domain_scores_gemma":[0.99465334,0.0026184223,0.00036598468,0.001241238,0.0009094966,0.0002115471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382153,0.001145131,0.001365775,0.00082395325,0.00056361244,0.0017881468,0.0024106896,0.0015082145,0.010596063],"category_scores_gemma":[0.016094318,0.00043416113,0.00066716346,0.0014584332,0.0023603118,0.0029994394,0.00267055,0.0030895332,0.0052396664],"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.0002649282,0.00011396772,0.0011290291,0.00050326204,0.0001093336,0.00013447725,0.00007896362,0.2011863,0.0069789696,0.49563602,0.0491357,0.24472913],"study_design_scores_gemma":[0.000016134438,0.000044859746,0.00031012838,0.00002306521,0.000017249675,0.00008007638,0.00002565984,0.8496202,0.0035655324,0.13383509,0.012438957,0.000023035445],"about_ca_topic_score_codex":0.0022638135,"about_ca_topic_score_gemma":0.003047545,"teacher_disagreement_score":0.010596063,"about_ca_system_score_codex":0.001141332,"about_ca_system_score_gemma":0.0015899575,"threshold_uncertainty_score":0.03544736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006247306,0.000041544037,0.9920922,0.00005053347,0.000036376725,0.000031001513,0.000022388447,0.00051301287,0.00096572057],"genre_scores_gemma":[0.17321007,0.000060508948,0.8229807,0.000064103384,0.000036174606,0.0001214952,0.00017999734,0.0002829553,0.003063916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996592,0.000070293354,0.0000199076,0.00006624087,0.0001350327,0.000049345424],"domain_scores_gemma":[0.9989134,0.0005269842,0.00006812763,0.00013366783,0.00027557294,0.00008226009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086810254,0.0009602165,0.0008914223,0.0007475171,0.00050842954,0.0011712131,0.0012970497,0.0010232013,0.007952393],"category_scores_gemma":[0.0042436155,0.00054044515,0.0005521454,0.00088178896,0.0006804441,0.0012285572,0.0018287706,0.0016608941,0.0016580328],"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.0005539851,0.00021571247,0.001060513,0.00016102188,0.00007284209,0.00015768607,0.00013439545,0.50421524,0.012967359,0.047773723,0.0053486456,0.4273388],"study_design_scores_gemma":[0.000026384494,0.000027917562,0.00007205512,0.0000033311753,0.000005494506,0.000016286747,0.000011044384,0.9938006,0.001418694,0.0040314607,0.0005812389,0.000005506812],"about_ca_topic_score_codex":0.004214467,"about_ca_topic_score_gemma":0.0061485497,"teacher_disagreement_score":0.007952393,"about_ca_system_score_codex":0.00094531954,"about_ca_system_score_gemma":0.0019480184,"threshold_uncertainty_score":0.0266034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043361075,0.0008644326,0.94859856,0.0002211619,0.00007870939,0.00005658293,0.000019308001,0.000056392008,0.0067437226],"genre_scores_gemma":[0.72464913,0.0014000556,0.2598509,0.0000831986,0.000084346066,0.00022334921,0.00007615426,0.00006621036,0.013566738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.0001403702,0.000017036326,0.000064104075,0.000116355564,0.000034874258],"domain_scores_gemma":[0.9993936,0.00031569862,0.0000706338,0.000036864778,0.00015283216,0.000030350177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011304477,0.0006497174,0.0005262117,0.0006184979,0.0005439314,0.0006785499,0.00057707634,0.0010344919,0.0014616618],"category_scores_gemma":[0.0033040787,0.00015997521,0.0007204078,0.00046339314,0.0011953304,0.00081376196,0.00095561263,0.001028987,0.00022184094],"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.00026613602,0.000059468613,0.0027155948,0.00038970486,0.000089447836,0.00041648376,0.0007381847,0.44247478,0.030202217,0.44035476,0.0016210935,0.08067206],"study_design_scores_gemma":[0.0000117071995,0.000108114946,0.00018446056,0.000020401818,0.000008446899,0.00012197566,0.000029059669,0.9701082,0.002861086,0.024597693,0.0019330943,0.000015789707],"about_ca_topic_score_codex":0.003925483,"about_ca_topic_score_gemma":0.0014033013,"teacher_disagreement_score":0.003925483,"about_ca_system_score_codex":0.00077953027,"about_ca_system_score_gemma":0.00081553304,"threshold_uncertainty_score":0.0078052282},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007881372,0.014803345,0.00030339486,0.019107297,0.96474683,0.000010874276,0.000028959405,0.000024499765,0.00089595775],"genre_scores_gemma":[0.0005198195,0.0054683783,0.000096423886,0.005285123,0.98680604,0.000007637535,0.000008868489,0.000015437889,0.0017923403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960354,0.00058488175,0.00040256954,0.0007821296,0.001843234,0.0003518578],"domain_scores_gemma":[0.9837679,0.006053614,0.0011038937,0.00045542393,0.0058894516,0.0027296941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005644014,0.0023509457,0.0027330648,0.0022648845,0.0013478993,0.006177692,0.0026286044,0.008425928,0.009982727],"category_scores_gemma":[0.015577269,0.0005983887,0.0016857618,0.00096127286,0.002108878,0.0034187946,0.0018339909,0.01342509,0.0053293235],"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.000096033575,0.000030285675,0.000052172138,0.00052939204,0.00003210115,0.00015343855,0.000012210884,0.00007112218,0.00020353842,0.0015868446,0.98178494,0.015447962],"study_design_scores_gemma":[0.00010220953,0.00011006605,0.00049527717,0.00049764256,0.00007460009,0.00057728373,0.000039983748,0.00047231562,0.00033421867,0.0037665265,0.9934977,0.0000320407],"about_ca_topic_score_codex":0.0002532107,"about_ca_topic_score_gemma":0.0005781893,"teacher_disagreement_score":0.009982727,"about_ca_system_score_codex":0.0014434479,"about_ca_system_score_gemma":0.0018344057,"threshold_uncertainty_score":0.03339559},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039085113,0.002085562,0.9448483,0.00077644625,0.0007466762,0.00005359633,0.0004914921,0.00023692235,0.011675777],"genre_scores_gemma":[0.6453608,0.0058909315,0.32616755,0.00066811615,0.0023490062,0.00024070713,0.0023721294,0.000520588,0.016430149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719775,0.0008231903,0.00019389762,0.0007020689,0.00095131615,0.00013168344],"domain_scores_gemma":[0.99519616,0.0017122658,0.0004982343,0.0009183314,0.001304272,0.00037063076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077581,0.0006462036,0.0011083278,0.0037895828,0.0006960638,0.003293593,0.0009825418,0.0012788445,0.0049443715],"category_scores_gemma":[0.0139137525,0.0002859312,0.0005892731,0.0032451255,0.0021305094,0.004685397,0.0020127946,0.0017658822,0.0017729627],"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.00038949624,0.00009122399,0.002640923,0.00045400174,0.00014265242,0.0001629765,0.00031662092,0.027718764,0.033034887,0.6708583,0.01106524,0.25312474],"study_design_scores_gemma":[0.000046250854,0.0003742771,0.006628848,0.00017000912,0.00009486937,0.0015902334,0.000500597,0.3291599,0.012554812,0.60377806,0.044945125,0.00015699583],"about_ca_topic_score_codex":0.0010524853,"about_ca_topic_score_gemma":0.0006335806,"teacher_disagreement_score":0.0049443715,"about_ca_system_score_codex":0.00064789364,"about_ca_system_score_gemma":0.0009475115,"threshold_uncertainty_score":0.016540587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004028453,0.00016419799,0.9935313,0.000037320075,0.00003684211,0.000022379245,0.000021602005,0.00013899281,0.0020190256],"genre_scores_gemma":[0.19086006,0.0005705884,0.79982764,0.0000736979,0.00005702861,0.00020303746,0.0001421605,0.0005357621,0.007730006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913824,0.00041570686,0.00003031512,0.00004930795,0.00032552745,0.000040806328],"domain_scores_gemma":[0.999038,0.00048137276,0.00005549019,0.00015448156,0.00022414539,0.00004652892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138482,0.0011057215,0.001022153,0.0011063194,0.0004648726,0.0011846405,0.0010423949,0.0007853175,0.0035549472],"category_scores_gemma":[0.004369419,0.00041140665,0.00084083254,0.0009363725,0.00089378026,0.0010751657,0.001450595,0.0013263829,0.0009694255],"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.00007365405,0.00002776518,0.00032060492,0.00015543301,0.0000687356,0.00008859034,0.00009052953,0.77798724,0.004736144,0.139738,0.0018239891,0.07488925],"study_design_scores_gemma":[0.000005123152,0.000009738244,0.000034371427,0.000008889669,0.0000030575986,0.000013180093,0.0000066304015,0.9785648,0.0006806341,0.019062864,0.0016048091,0.00000592536],"about_ca_topic_score_codex":0.004861171,"about_ca_topic_score_gemma":0.005531638,"teacher_disagreement_score":0.004861171,"about_ca_system_score_codex":0.00077893323,"about_ca_system_score_gemma":0.0009291237,"threshold_uncertainty_score":0.011892438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013042367,0.00040609884,0.9963084,0.000103410726,0.00009225538,0.000017177688,0.000022253931,0.000064374784,0.0016817922],"genre_scores_gemma":[0.16422354,0.0016316668,0.8125964,0.00028986682,0.00052345055,0.0003707119,0.0002664329,0.0004841699,0.01961378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987915,0.00068610645,0.00004346082,0.00011459928,0.00032918132,0.000035103767],"domain_scores_gemma":[0.99854493,0.0008061395,0.0001239571,0.00016349237,0.00030575696,0.000055712597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026336948,0.0012665078,0.0013113974,0.0010705328,0.00049808226,0.0014699153,0.0013542591,0.001830324,0.004267535],"category_scores_gemma":[0.005844162,0.000645768,0.0010680133,0.0010507236,0.0018892122,0.0017517088,0.002308201,0.0021796902,0.0015123298],"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.00017452688,0.00007855358,0.00030587596,0.0004599197,0.00020920669,0.00009404744,0.000085387415,0.59990144,0.0070985556,0.29699758,0.0051693697,0.08942548],"study_design_scores_gemma":[0.0000081051,0.000029992207,0.00009241317,0.0000148463705,0.000011785678,0.000021732116,0.0000047753238,0.96218216,0.00072777725,0.033340532,0.0035508643,0.000015072906],"about_ca_topic_score_codex":0.0012836735,"about_ca_topic_score_gemma":0.0012789518,"teacher_disagreement_score":0.004267535,"about_ca_system_score_codex":0.00054762204,"about_ca_system_score_gemma":0.0010623367,"threshold_uncertainty_score":0.014276326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028479872,0.0004113283,0.9493161,0.00073552225,0.000073560186,0.00006731786,0.00013962146,0.0006455957,0.02013103],"genre_scores_gemma":[0.5148077,0.0008329463,0.46888214,0.000605693,0.0002311134,0.00027290557,0.00041873584,0.00091359013,0.013035124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973029,0.00075933075,0.00016775938,0.00025562645,0.0012047626,0.00030956094],"domain_scores_gemma":[0.9950517,0.0026279557,0.00022029555,0.0008966496,0.0008992461,0.00030418998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002898405,0.0010105338,0.0013605348,0.0013125839,0.0011225438,0.0027936262,0.0017780691,0.0010067688,0.009057036],"category_scores_gemma":[0.011374957,0.0006147218,0.0011531442,0.0010776673,0.0028100302,0.0038803993,0.003363491,0.003752024,0.0024565076],"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.0000970349,0.000059126647,0.00037448536,0.00017243362,0.000021392576,0.00007627223,0.00024926363,0.1011424,0.0048395363,0.8572167,0.003550845,0.032200493],"study_design_scores_gemma":[0.000014163328,0.000032939955,0.00009674706,0.000024477777,0.0000051423326,0.000024124729,0.00003169083,0.6770958,0.0016282881,0.31834334,0.0026891555,0.000014130138],"about_ca_topic_score_codex":0.00279965,"about_ca_topic_score_gemma":0.003882901,"teacher_disagreement_score":0.009057036,"about_ca_system_score_codex":0.0020012504,"about_ca_system_score_gemma":0.0017232447,"threshold_uncertainty_score":0.03029883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037316948,0.0004042633,0.9917989,0.00025883364,0.0002545303,0.000031343745,0.000032893415,0.00006796235,0.0034196323],"genre_scores_gemma":[0.23735526,0.0026924075,0.73676604,0.00047783175,0.000760219,0.0006376497,0.0002690313,0.00039792072,0.020643685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996648,0.00016913214,0.000017366265,0.00003165524,0.000093654904,0.000023360684],"domain_scores_gemma":[0.99794143,0.001283603,0.00012513885,0.00009683389,0.00043059065,0.00012233504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023109314,0.0012779612,0.0013349099,0.0010271554,0.00070822326,0.0010659391,0.001603996,0.0019518222,0.0038193746],"category_scores_gemma":[0.0061642025,0.0005698047,0.0009944726,0.0012640794,0.0013573839,0.0012922474,0.0020416472,0.0023811248,0.0006308492],"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.00009256024,0.00017600179,0.0005782997,0.0001956416,0.00007048365,0.00017187587,0.00011630168,0.69998676,0.002884023,0.24409565,0.0032183158,0.048414],"study_design_scores_gemma":[0.000007098373,0.000012339282,0.000030802006,0.000008129823,0.0000046769105,0.000010855306,0.000004986771,0.9862229,0.00012527114,0.012578148,0.0009891941,0.000005666434],"about_ca_topic_score_codex":0.0043583144,"about_ca_topic_score_gemma":0.004553383,"teacher_disagreement_score":0.0043583144,"about_ca_system_score_codex":0.00057494483,"about_ca_system_score_gemma":0.0019823886,"threshold_uncertainty_score":0.01277709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06096413,0.000933711,0.90205204,0.00092958746,0.0001125647,0.00018067044,0.00027175935,0.0000710114,0.034484528],"genre_scores_gemma":[0.73339725,0.0014996707,0.253969,0.00043654558,0.00019609026,0.0006331211,0.00052400853,0.000111199806,0.009233045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997079,0.0011936004,0.00015706144,0.0004648339,0.000774462,0.00033111972],"domain_scores_gemma":[0.9960685,0.0021958083,0.00054400315,0.00023192434,0.00065065507,0.00030906603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036313806,0.0011648689,0.0011900493,0.001489884,0.0011637986,0.0034159576,0.0012779557,0.0014037116,0.004943255],"category_scores_gemma":[0.013481118,0.0007616974,0.0008275731,0.0015353105,0.0033083837,0.0031943773,0.0028520662,0.0039426587,0.0004622866],"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.00007497708,0.00009047706,0.0006317512,0.00022869847,0.000043178123,0.00034198197,0.00020995196,0.07546913,0.0017587909,0.898223,0.002276836,0.020651275],"study_design_scores_gemma":[0.00003039148,0.00010376182,0.0005425452,0.00011638663,0.000015679385,0.00036439183,0.00022846344,0.3052832,0.0016482405,0.6870848,0.004545898,0.000036233723],"about_ca_topic_score_codex":0.00094752153,"about_ca_topic_score_gemma":0.00079226843,"teacher_disagreement_score":0.004943255,"about_ca_system_score_codex":0.0011347715,"about_ca_system_score_gemma":0.001709495,"threshold_uncertainty_score":0.019204795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025854878,0.00007674887,0.97203887,0.000091895185,0.000015163854,0.00004298653,0.00002462029,0.00017104643,0.001683934],"genre_scores_gemma":[0.70785564,0.00011792221,0.28982487,0.00007097306,0.000017832886,0.00015287215,0.000101707075,0.00009343853,0.001764706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869627,0.0006520955,0.000047222864,0.00017441156,0.00028070225,0.00014930508],"domain_scores_gemma":[0.99732804,0.0018790022,0.00021696335,0.00020229594,0.0002643945,0.000109315464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023619325,0.0013731014,0.001394369,0.0009552854,0.00071617874,0.0016642158,0.0013596559,0.0010968711,0.0029404268],"category_scores_gemma":[0.0097496705,0.0006075575,0.000690276,0.00071487913,0.0013092534,0.0020531681,0.001799931,0.0019083149,0.00035756722],"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.000063280466,0.00003091806,0.00031400385,0.000026990627,0.000020978885,0.00003234924,0.00004461879,0.96010494,0.00048319728,0.030954348,0.00015382485,0.007770644],"study_design_scores_gemma":[0.0000038027838,0.000009257457,0.000013719723,0.0000025550219,0.000001649303,0.0000034501527,0.000007905647,0.98956746,0.00016967297,0.01013851,0.00008043069,0.0000015703876],"about_ca_topic_score_codex":0.0053959386,"about_ca_topic_score_gemma":0.0043577496,"teacher_disagreement_score":0.0053959386,"about_ca_system_score_codex":0.0018390503,"about_ca_system_score_gemma":0.001469501,"threshold_uncertainty_score":0.013343334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008011308,0.00020109273,0.98775804,0.00014690022,0.00007812056,0.000064885884,0.000052415417,0.00013699725,0.0035502713],"genre_scores_gemma":[0.27827102,0.00033074888,0.712604,0.00014821645,0.000104998115,0.00040832456,0.00027801466,0.0001818282,0.007672879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997168,0.00008025521,0.000015179613,0.000039100214,0.00011442934,0.00003427414],"domain_scores_gemma":[0.99958724,0.00017615572,0.000019360219,0.000035412435,0.00013589054,0.0000460526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009437105,0.0008258936,0.001174557,0.0004716442,0.00054734387,0.00081276963,0.0013329065,0.0013270463,0.0049036043],"category_scores_gemma":[0.0012763184,0.00047458502,0.0006743801,0.00046393147,0.00061812665,0.0008474479,0.0018217682,0.0015697837,0.0007262923],"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.0002499604,0.00022185849,0.00055314734,0.0004210821,0.000057250207,0.00022011939,0.00017602515,0.7949861,0.010858044,0.057555694,0.005400878,0.12929979],"study_design_scores_gemma":[0.000009319575,0.000017717655,0.000021447791,0.0000054430634,0.0000024665912,0.000017000679,0.0000059504373,0.99587303,0.0003755878,0.0031497153,0.00051983417,0.00000238649],"about_ca_topic_score_codex":0.0029427987,"about_ca_topic_score_gemma":0.0033405821,"teacher_disagreement_score":0.0049036043,"about_ca_system_score_codex":0.00048715636,"about_ca_system_score_gemma":0.0018861864,"threshold_uncertainty_score":0.016404212},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006663713,0.011963961,0.07832417,0.32097116,0.34388256,0.00016414966,0.0027252263,0.00088398997,0.23442103],"genre_scores_gemma":[0.2056855,0.017007874,0.093931325,0.06776927,0.16514958,0.0006108761,0.002861732,0.0018019498,0.44518185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984364,0.0003364196,0.00012654874,0.00032612288,0.00063912984,0.000135407],"domain_scores_gemma":[0.9918651,0.0040525477,0.00024774583,0.0007543592,0.002844581,0.00023562014],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003473893,0.0014185855,0.0008695414,0.0021548285,0.0017385017,0.0019512883,0.0023564054,0.00217422,0.036749594],"category_scores_gemma":[0.021256689,0.0004828184,0.002176253,0.0014475266,0.0025166448,0.0049162405,0.0024298618,0.008120936,0.012579397],"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.00010985594,0.000037071237,0.00022465133,0.000393549,0.00005721759,0.00043507497,0.00026657546,0.00033810723,0.0013043376,0.34936047,0.6131169,0.034356218],"study_design_scores_gemma":[0.000051557563,0.000042991855,0.0014240375,0.00019043901,0.00007302275,0.0006533241,0.00009952188,0.0015055768,0.0017558584,0.30728602,0.68684685,0.000070852926],"about_ca_topic_score_codex":0.003329954,"about_ca_topic_score_gemma":0.0020887165,"teacher_disagreement_score":0.9978258,"about_ca_system_score_codex":0.0019681484,"about_ca_system_score_gemma":0.0014297789,"threshold_uncertainty_score":0.122939646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071693334,0.000051320883,0.99784994,0.00006403265,0.00002420385,0.000029828285,0.000012593131,0.00006869235,0.0011823935],"genre_scores_gemma":[0.10608531,0.00027557265,0.8862702,0.00017839592,0.00006624335,0.0006257298,0.00011823219,0.00019128669,0.006189024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957114,0.00018746658,0.000013450626,0.000047192618,0.0001424296,0.000038312333],"domain_scores_gemma":[0.99929893,0.0004090558,0.000045603556,0.000045522775,0.00015364832,0.000047152913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012958976,0.00100046,0.0011957028,0.0007125322,0.0004520096,0.00083470246,0.001495132,0.0013692707,0.0055195247],"category_scores_gemma":[0.0028841621,0.000505485,0.0007893088,0.00060931017,0.0010587506,0.00091956905,0.0016385363,0.0023278687,0.0015336506],"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.000045063087,0.00009398863,0.00025608155,0.00016928879,0.0000348285,0.00008565707,0.00007357544,0.8485152,0.0024099508,0.075258344,0.0042455965,0.0688124],"study_design_scores_gemma":[0.000009311056,0.000012741131,0.000012352167,0.000007991253,0.0000018523419,0.000011683549,0.0000049027462,0.99122554,0.00022457608,0.0073139695,0.0011712622,0.0000037680927],"about_ca_topic_score_codex":0.0021220755,"about_ca_topic_score_gemma":0.0022144609,"teacher_disagreement_score":0.0055195247,"about_ca_system_score_codex":0.00066881574,"about_ca_system_score_gemma":0.0019974227,"threshold_uncertainty_score":0.018464684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040529333,0.00014795527,0.9793641,0.0006822316,0.000099838304,0.00008636931,0.000060394083,0.00027620868,0.01523003],"genre_scores_gemma":[0.122361645,0.00023558547,0.86264086,0.00062954257,0.000172571,0.00057275855,0.00027099717,0.00073341344,0.012382663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832326,0.00077777554,0.00006273831,0.00019091644,0.00050211215,0.0001432292],"domain_scores_gemma":[0.99496657,0.0035535183,0.00023264949,0.00045389158,0.00064093753,0.00015247024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031758468,0.00081530033,0.0011244338,0.00067533035,0.0007504455,0.0013119782,0.0013761047,0.0012714675,0.0112338355],"category_scores_gemma":[0.012030752,0.00060221547,0.0007312075,0.0005862969,0.002097458,0.0018052403,0.0024749471,0.0038404583,0.0020836936],"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.0001784003,0.00014521446,0.00073322,0.00042024488,0.000044990233,0.00019405915,0.00022730944,0.55398613,0.0021339324,0.31207156,0.023257349,0.1066076],"study_design_scores_gemma":[0.000021574055,0.000017167773,0.000057757406,0.000028554334,0.0000027419962,0.000021295193,0.000021436868,0.9424456,0.00065111235,0.051867507,0.004857784,0.0000075153957],"about_ca_topic_score_codex":0.004763421,"about_ca_topic_score_gemma":0.0040320507,"teacher_disagreement_score":0.0112338355,"about_ca_system_score_codex":0.0011922142,"about_ca_system_score_gemma":0.0021333294,"threshold_uncertainty_score":0.037580907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005080044,0.00038234988,0.98956126,0.00018334504,0.000034808356,0.000060494116,0.00004236021,0.0013117822,0.0033435342],"genre_scores_gemma":[0.15157755,0.00045689687,0.8406567,0.0002751183,0.000057775,0.0003534786,0.00029058437,0.0018435013,0.0044883657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979843,0.00087651575,0.00010259799,0.00017409118,0.0007652656,0.00009733163],"domain_scores_gemma":[0.99709976,0.0013630406,0.00023211555,0.000358202,0.0008493179,0.000097551514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041627954,0.001633809,0.001866529,0.0010225285,0.0007007429,0.0016016457,0.0015329754,0.0016621178,0.006436467],"category_scores_gemma":[0.010879701,0.00085568824,0.0010890301,0.00094000925,0.001041082,0.0018146416,0.0017597937,0.0023258198,0.0021500038],"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.00021887383,0.00010677786,0.00046212555,0.00022873448,0.00009665638,0.000070705544,0.00011664458,0.8464034,0.004324405,0.035007328,0.0040424084,0.10892182],"study_design_scores_gemma":[0.000013836246,0.000027763597,0.00008921939,0.000014144399,0.000007815198,0.000015648557,0.000007811375,0.9943012,0.0012595253,0.0030046962,0.0012458888,0.000012347722],"about_ca_topic_score_codex":0.0076338323,"about_ca_topic_score_gemma":0.008442612,"teacher_disagreement_score":0.0076338323,"about_ca_system_score_codex":0.0011238203,"about_ca_system_score_gemma":0.0029635513,"threshold_uncertainty_score":0.022015214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029482301,0.000090945345,0.9949121,0.00007168672,0.000034148732,0.000019857232,0.000017770515,0.00017946197,0.0017258436],"genre_scores_gemma":[0.20905514,0.0002501521,0.7838143,0.00016925106,0.000074344054,0.0004138444,0.00019831395,0.00042757962,0.005597083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950945,0.00021286373,0.00001994182,0.00008660762,0.00011772706,0.000053482225],"domain_scores_gemma":[0.9986645,0.00088439934,0.00008578364,0.00007865841,0.00023462536,0.00005200318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018622067,0.0016202804,0.0017037927,0.0008905478,0.00066030497,0.001352479,0.0013472723,0.0015235143,0.004903572],"category_scores_gemma":[0.0036644377,0.0007540632,0.0010067765,0.00089417933,0.0009964462,0.0015847937,0.0017322353,0.002087731,0.0008073678],"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.00008687512,0.00005196394,0.0001779143,0.00008659611,0.000036713955,0.000032869277,0.000046955047,0.926985,0.00085684593,0.024094675,0.001460599,0.04608288],"study_design_scores_gemma":[0.000009874739,0.000025824005,0.000017425222,0.0000064866185,0.0000043887726,0.00000620177,0.000005023362,0.99404705,0.00019415775,0.005341335,0.00033912063,0.0000031516686],"about_ca_topic_score_codex":0.0024768997,"about_ca_topic_score_gemma":0.0031905642,"teacher_disagreement_score":0.004903572,"about_ca_system_score_codex":0.00082477566,"about_ca_system_score_gemma":0.0016852748,"threshold_uncertainty_score":0.016404152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24074753,0.0005912888,0.7385408,0.0006943167,0.0001454329,0.000106375825,0.00013533903,0.0012181164,0.017820843],"genre_scores_gemma":[0.84041464,0.0002582536,0.15232876,0.00026646873,0.00006307988,0.00019552039,0.0002810169,0.0004176933,0.0057746083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997032,0.00012277786,0.000010294416,0.000052524934,0.00006548126,0.00004580777],"domain_scores_gemma":[0.9984609,0.00084367534,0.000096724114,0.00033621633,0.00014391138,0.000118610624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332057,0.00047985607,0.000791432,0.00033098724,0.00048471068,0.000688262,0.000980806,0.000707069,0.0066069183],"category_scores_gemma":[0.005408508,0.00027509467,0.00061569957,0.00026821063,0.0011730185,0.0014481222,0.0018571237,0.0012058509,0.0005491891],"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.0002024421,0.00016238067,0.001413844,0.00022133908,0.00004953356,0.00027529156,0.00020341885,0.6352477,0.00683106,0.28750485,0.0065864073,0.061301764],"study_design_scores_gemma":[0.000023504095,0.000034197834,0.00007859807,0.000011286363,0.000004226706,0.000022081824,0.000024927951,0.9385614,0.0009868523,0.05889195,0.0013566626,0.0000043556147],"about_ca_topic_score_codex":0.00134912,"about_ca_topic_score_gemma":0.0010591566,"teacher_disagreement_score":0.0066069183,"about_ca_system_score_codex":0.0003928435,"about_ca_system_score_gemma":0.0006414745,"threshold_uncertainty_score":0.022102296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007892172,0.00027296698,0.98627055,0.00015206133,0.000052386516,0.000034146407,0.000020937958,0.00013814928,0.0051666894],"genre_scores_gemma":[0.1671095,0.0007059536,0.8251157,0.00027574104,0.00011515905,0.0002626198,0.0001297287,0.00032906403,0.005956453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987208,0.0005015424,0.00004622688,0.00017264247,0.00041327617,0.00014549938],"domain_scores_gemma":[0.99834895,0.0007794395,0.00015830927,0.00030528006,0.00024920225,0.00015881324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035098337,0.0013240882,0.0013511928,0.0016932059,0.000757219,0.0016499237,0.0010709098,0.0009958295,0.0041431575],"category_scores_gemma":[0.007738203,0.0005996756,0.0014380285,0.0010979599,0.0022370643,0.003223235,0.0031828433,0.003362305,0.00093571877],"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.000104872255,0.00008677012,0.00069126405,0.0001234762,0.000044181324,0.00011542233,0.00025220006,0.23177758,0.005066003,0.6515973,0.0023184964,0.10782246],"study_design_scores_gemma":[0.000018284452,0.000058763337,0.00015302567,0.000054517,0.00001579241,0.000062212,0.000045054298,0.7980855,0.0024392442,0.19243096,0.0066170488,0.000019571766],"about_ca_topic_score_codex":0.0017382031,"about_ca_topic_score_gemma":0.0021585533,"teacher_disagreement_score":0.0041431575,"about_ca_system_score_codex":0.0011312336,"about_ca_system_score_gemma":0.001558309,"threshold_uncertainty_score":0.018562019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035834685,0.00046238088,0.99199414,0.00014044376,0.000036336794,0.00003224399,0.0000241878,0.00016790461,0.0035588334],"genre_scores_gemma":[0.4606189,0.0010687282,0.52655745,0.00022274832,0.00009969601,0.0004028089,0.00013357031,0.00033246362,0.01056361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946827,0.0002422158,0.000020153539,0.00007331005,0.00016196673,0.000034195953],"domain_scores_gemma":[0.9983494,0.0011823832,0.00012052121,0.00014792051,0.0001411182,0.00005859999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013493262,0.00074698793,0.00097247167,0.00046289008,0.00041753045,0.0010207259,0.00077963725,0.00108756,0.003576375],"category_scores_gemma":[0.004407311,0.0003891432,0.00045939718,0.0005532293,0.0010308714,0.0008886166,0.0014678745,0.0013888287,0.0008556328],"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.00006141013,0.000053573494,0.00025252264,0.00019159791,0.000039258506,0.00005823184,0.000062990715,0.83866984,0.0016769931,0.10231078,0.0025332721,0.054089554],"study_design_scores_gemma":[0.0000134187985,0.000013344258,0.000025655905,0.000009328792,0.0000028018633,0.000010663054,0.0000051933634,0.9695042,0.00029981905,0.02876301,0.0013492675,0.000003238325],"about_ca_topic_score_codex":0.001473059,"about_ca_topic_score_gemma":0.0019077483,"teacher_disagreement_score":0.003576375,"about_ca_system_score_codex":0.00068217935,"about_ca_system_score_gemma":0.001211224,"threshold_uncertainty_score":0.011964142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131353075,0.0006409771,0.98130095,0.0003403586,0.00004418263,0.0000540072,0.000027597596,0.000054211596,0.0044024233],"genre_scores_gemma":[0.44765866,0.0025230888,0.53422433,0.0005224751,0.00031815024,0.00055751594,0.00024261323,0.00045590327,0.013497213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988827,0.0004987673,0.000044525157,0.00015566185,0.00034020728,0.00007806788],"domain_scores_gemma":[0.9966905,0.0019739608,0.00026009828,0.00025853093,0.0005589675,0.0002578904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037858945,0.0012151796,0.0007373084,0.0018711452,0.0008114405,0.0014483684,0.0015914441,0.0016086655,0.003972445],"category_scores_gemma":[0.010335934,0.0004629962,0.0009563982,0.001033848,0.0033035856,0.003575833,0.0031126046,0.0034978911,0.0007038004],"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.000034199595,0.000031423806,0.0004200511,0.00012955765,0.000025219608,0.00006193515,0.00025438127,0.037814178,0.0032447304,0.9385015,0.0008798261,0.018602956],"study_design_scores_gemma":[0.000015233535,0.000079972546,0.00020292233,0.000070823364,0.000012073575,0.000068280504,0.00010612337,0.43260756,0.001567237,0.5618075,0.0034405147,0.000021781654],"about_ca_topic_score_codex":0.0011161015,"about_ca_topic_score_gemma":0.0010659954,"teacher_disagreement_score":0.003972445,"about_ca_system_score_codex":0.0012824617,"about_ca_system_score_gemma":0.0009154676,"threshold_uncertainty_score":0.020021975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009838727,0.016397057,0.3258433,0.002898538,0.0021915943,0.000060844995,0.0008529801,0.0011424611,0.64962924],"genre_scores_gemma":[0.020297496,0.019104775,0.12681574,0.0013039908,0.0025059471,0.00021998308,0.002094693,0.0020240017,0.82563335],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999508,0.00009293702,0.000015183697,0.00008948079,0.00026809148,0.000026338608],"domain_scores_gemma":[0.9993901,0.00026829774,0.000019069634,0.00014872417,0.00014337788,0.000030458807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057561864,0.0018114919,0.0010741804,0.0012185635,0.0006651537,0.002555098,0.00092183053,0.0008217809,0.07222354],"category_scores_gemma":[0.0019958748,0.00070927525,0.0006988931,0.0021559412,0.0011202855,0.0020509104,0.0015805538,0.0037100348,0.0441116],"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.00001541604,0.000031671025,0.00007869859,0.00020864877,0.000027081243,0.00002936472,0.00005418039,0.007773105,0.0006818838,0.24370691,0.48023883,0.2671543],"study_design_scores_gemma":[0.0000057435573,0.000013886248,0.00027822173,0.0001835867,0.000014352329,0.00010597101,0.00003185528,0.018377654,0.0009118578,0.31379616,0.6662629,0.000017761984],"about_ca_topic_score_codex":0.001413293,"about_ca_topic_score_gemma":0.0036200082,"teacher_disagreement_score":0.07222354,"about_ca_system_score_codex":0.0012185229,"about_ca_system_score_gemma":0.0009990229,"threshold_uncertainty_score":0.24161184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018691622,0.00003366003,0.99706393,0.000023798122,0.00001601025,0.000013646133,0.00001307606,0.00014984295,0.00081683893],"genre_scores_gemma":[0.17199843,0.0002466437,0.82213837,0.00015469198,0.000069962734,0.00022199913,0.00018239584,0.00068592624,0.004301622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889755,0.00025543425,0.00007173507,0.00023514184,0.00043686046,0.00010326778],"domain_scores_gemma":[0.9980813,0.0009806751,0.00024696314,0.00035132354,0.00022822415,0.00011150807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021505244,0.0010937132,0.0011691672,0.0010276977,0.00070148986,0.00121978,0.0017617013,0.0009701614,0.004107875],"category_scores_gemma":[0.006125527,0.0008527653,0.0018086926,0.00058204454,0.0016985759,0.0018385901,0.0033706243,0.0039164973,0.0010592293],"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.000116484945,0.000094307296,0.00061275833,0.00018432538,0.000062636325,0.00014202339,0.00046122234,0.67748445,0.017920068,0.2217382,0.0016306926,0.07955285],"study_design_scores_gemma":[0.000014926069,0.000057062596,0.0000932167,0.000025984671,0.000012969601,0.00003540436,0.000022031296,0.96414685,0.0034292638,0.027458316,0.004679829,0.000024132623],"about_ca_topic_score_codex":0.0019354396,"about_ca_topic_score_gemma":0.0019213213,"teacher_disagreement_score":0.004107875,"about_ca_system_score_codex":0.00083260733,"about_ca_system_score_gemma":0.0012086793,"threshold_uncertainty_score":0.013742149},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023381488,0.00032960228,0.96727854,0.0004321761,0.000049130947,0.000020714817,0.000034367626,0.00010826166,0.008365686],"genre_scores_gemma":[0.7418719,0.00064035796,0.24571198,0.00038037647,0.00012392372,0.00016985403,0.00016427436,0.00017689163,0.010760423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877983,0.0004989352,0.0000359319,0.00015985312,0.00044288972,0.000082452345],"domain_scores_gemma":[0.9987722,0.00066193397,0.00013685487,0.00017517178,0.00019338891,0.000060565068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014308986,0.00067952194,0.0008552888,0.0005996367,0.0004043398,0.0010392353,0.00063077675,0.0010609021,0.0021566665],"category_scores_gemma":[0.0053352485,0.00039801153,0.00055831653,0.0005714254,0.0017352146,0.0012585585,0.0017957108,0.0019162311,0.00034522457],"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.00005318381,0.000047017118,0.00034008903,0.000114133705,0.000028432623,0.00009515106,0.00010522073,0.677966,0.0040040505,0.28590858,0.0018654921,0.029472733],"study_design_scores_gemma":[0.0000053786403,0.00001420906,0.000051114457,0.000010506451,0.0000026364908,0.000022400192,0.000009685765,0.9344504,0.0005615761,0.063767195,0.0011008593,0.0000039408546],"about_ca_topic_score_codex":0.0010666893,"about_ca_topic_score_gemma":0.0008051052,"teacher_disagreement_score":0.0021566665,"about_ca_system_score_codex":0.0009076499,"about_ca_system_score_gemma":0.00082556385,"threshold_uncertainty_score":0.0075674057},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011249185,0.057885155,0.037681717,0.011624943,0.011046171,0.000050635503,0.0008915862,0.0008185576,0.8788763],"genre_scores_gemma":[0.014635374,0.034152605,0.019699868,0.0047875373,0.0060351496,0.000109079505,0.0010857236,0.0009861783,0.9185084],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996518,0.000043000797,0.0000108126815,0.00007136989,0.00018744254,0.00003556151],"domain_scores_gemma":[0.9996203,0.00016094316,0.000021894042,0.00004842392,0.00009120813,0.00005726218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043958722,0.0015186613,0.0008780563,0.0009075657,0.00081820635,0.0020745688,0.0007663074,0.00095422147,0.072191976],"category_scores_gemma":[0.0015649862,0.00043021492,0.00084606133,0.0012930699,0.001079051,0.0030725233,0.0014185571,0.0034816153,0.037088968],"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.0000137909865,0.00002388436,0.00006214404,0.00019631203,0.0000106214375,0.000047543912,0.00016535782,0.0016159611,0.0007539712,0.21673034,0.70738024,0.07299979],"study_design_scores_gemma":[0.0000036291572,0.000012401522,0.00016075425,0.00016103337,0.0000044742196,0.00010138073,0.000025249283,0.00062143663,0.00013552017,0.06828141,0.9304871,0.0000056063386],"about_ca_topic_score_codex":0.0008859843,"about_ca_topic_score_gemma":0.0015717144,"teacher_disagreement_score":0.072191976,"about_ca_system_score_codex":0.0014317742,"about_ca_system_score_gemma":0.0010858239,"threshold_uncertainty_score":0.24150622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051876634,0.005668923,0.8549022,0.006817537,0.0010503713,0.000117383235,0.00030854836,0.0009269375,0.07833145],"genre_scores_gemma":[0.765513,0.0050589764,0.17130537,0.002788842,0.0013826679,0.00051539263,0.00061384024,0.0021583615,0.05066355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732554,0.0012971167,0.00009666925,0.00022464702,0.00072724855,0.00032881164],"domain_scores_gemma":[0.96759117,0.025378823,0.0010275508,0.0018562941,0.0029982862,0.0011478653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075435457,0.0012505762,0.0013663156,0.0017201573,0.0010252753,0.0026315239,0.0022065886,0.0016137918,0.011345278],"category_scores_gemma":[0.044600166,0.0006678143,0.00095827447,0.0013302072,0.0037260358,0.0065809935,0.0036684163,0.0065695876,0.0025250341],"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.00060563354,0.00009532274,0.0009980068,0.00031060228,0.00003512213,0.00012864613,0.00023917924,0.056226056,0.0035278772,0.8999589,0.010657266,0.027217332],"study_design_scores_gemma":[0.000061383944,0.00008398172,0.00035766084,0.00007392993,0.000021851683,0.00009072037,0.000054740063,0.593713,0.0020397878,0.39869374,0.0047787293,0.000030481555],"about_ca_topic_score_codex":0.0023702856,"about_ca_topic_score_gemma":0.0016702454,"teacher_disagreement_score":0.011345278,"about_ca_system_score_codex":0.0018634514,"about_ca_system_score_gemma":0.0024500182,"threshold_uncertainty_score":0.03989458},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019491335,0.028856756,0.06444253,0.4429457,0.10497967,0.00027965032,0.0015750498,0.00092530565,0.35404626],"genre_scores_gemma":[0.039602797,0.018104427,0.038318645,0.19929473,0.07241835,0.00081622164,0.001345627,0.002364209,0.627735],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995139,0.0018046765,0.00024371406,0.0006150435,0.001922782,0.0002748164],"domain_scores_gemma":[0.98644376,0.008757361,0.0003180834,0.0007309701,0.003278867,0.00047096933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052704006,0.0014635817,0.00080261036,0.0018946698,0.0020409944,0.0026691838,0.0023791841,0.0041643432,0.13268253],"category_scores_gemma":[0.030722193,0.00048645173,0.0015766848,0.0018887455,0.0027031114,0.0064833406,0.0029081865,0.007591375,0.03765945],"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.000055193832,0.000032505715,0.00016660403,0.00018883157,0.0000138847345,0.00010803552,0.00035451702,0.00030432595,0.0001383421,0.13589269,0.8338505,0.028894572],"study_design_scores_gemma":[0.000026808304,0.000020635422,0.0002166309,0.00015872167,0.000006737746,0.00015679174,0.00015521221,0.0005989214,0.0001829541,0.045203235,0.9532511,0.000022296237],"about_ca_topic_score_codex":0.004613475,"about_ca_topic_score_gemma":0.0043090847,"teacher_disagreement_score":0.13268253,"about_ca_system_score_codex":0.0034416101,"about_ca_system_score_gemma":0.0016267473,"threshold_uncertainty_score":0.44386727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097569695,0.055108733,0.09335654,0.008146545,0.007106875,0.00015604713,0.0014152165,0.0022429347,0.8314915],"genre_scores_gemma":[0.010873526,0.05200197,0.06118786,0.0050823414,0.005594397,0.0002583683,0.0015897593,0.0017613828,0.8616505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995121,0.00006062034,0.000023580125,0.00009730044,0.00027303371,0.000033428438],"domain_scores_gemma":[0.99953425,0.00022315948,0.000024078296,0.000057354744,0.00012251933,0.000038688508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003397331,0.0015660609,0.0010663256,0.0013418742,0.00087196496,0.0028707967,0.001158062,0.0013199408,0.08555285],"category_scores_gemma":[0.0017073391,0.0007402555,0.00095004815,0.0019675826,0.0012267301,0.0030683314,0.0016451362,0.004077923,0.06780718],"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.000022066619,0.000046090012,0.00008685734,0.00052806316,0.00001459121,0.00011333208,0.00018405035,0.0026855983,0.0011667993,0.17387941,0.640952,0.18032104],"study_design_scores_gemma":[0.0000029013756,0.000014269676,0.00012216861,0.0001526649,0.0000027493968,0.00015422322,0.00002021279,0.0006284082,0.000109943314,0.039707202,0.9590782,0.0000069784687],"about_ca_topic_score_codex":0.0007060216,"about_ca_topic_score_gemma":0.0012113127,"teacher_disagreement_score":0.08555285,"about_ca_system_score_codex":0.00092155737,"about_ca_system_score_gemma":0.0010030312,"threshold_uncertainty_score":0.2862028},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040955273,0.00074484374,0.9832329,0.0007866214,0.00016584372,0.00004866881,0.00005903243,0.00021894336,0.010647515],"genre_scores_gemma":[0.3081357,0.0030897607,0.6657509,0.0010487813,0.0009309938,0.0007442702,0.00027858402,0.0010403135,0.018980658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961427,0.0020268469,0.00015105055,0.00044391272,0.001068756,0.00016677601],"domain_scores_gemma":[0.98327833,0.012260147,0.001188709,0.0010270275,0.0019479392,0.00029795538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054185675,0.0013837717,0.00097339955,0.0014969577,0.00096367684,0.0027449464,0.0015228384,0.0015447498,0.0070396024],"category_scores_gemma":[0.020921778,0.0006457068,0.0016912887,0.0013385301,0.003425065,0.0024032062,0.0033420366,0.0046952115,0.0018933277],"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.00007845511,0.00012425867,0.0011303303,0.0004581443,0.00008869779,0.00021708383,0.0004260203,0.36036342,0.006424812,0.5738811,0.006929945,0.04987778],"study_design_scores_gemma":[0.000010153703,0.00003325127,0.00009670726,0.00005344713,0.000008415308,0.00004135071,0.000026408785,0.88557345,0.0023548796,0.10744868,0.0043364614,0.000016793603],"about_ca_topic_score_codex":0.0013739052,"about_ca_topic_score_gemma":0.0008656597,"teacher_disagreement_score":0.0070396024,"about_ca_system_score_codex":0.0014412187,"about_ca_system_score_gemma":0.0012536627,"threshold_uncertainty_score":0.028656483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03866051,0.00015312336,0.95469445,0.0004635345,0.00006848264,0.00017295095,0.00009753342,0.00022063774,0.005468732],"genre_scores_gemma":[0.48916975,0.00021595934,0.4985536,0.00027230522,0.00011111377,0.0006747137,0.0004111718,0.00033501943,0.010256312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922454,0.00027926106,0.00004146117,0.00012900475,0.00024763492,0.00007813975],"domain_scores_gemma":[0.9919819,0.006718732,0.00024125591,0.00031288347,0.00053675345,0.00020847481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017226032,0.000762828,0.0013491889,0.0005592936,0.0010462179,0.0014593641,0.0021068277,0.0021010893,0.010188683],"category_scores_gemma":[0.0068669384,0.00058483914,0.0008364226,0.00047267415,0.0010909374,0.002058684,0.0029367441,0.0026188118,0.0005586905],"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.00046627218,0.00024057824,0.00097326736,0.00027624052,0.000060601542,0.00012903239,0.00018983957,0.84507805,0.0037588598,0.05805746,0.0028127562,0.087957144],"study_design_scores_gemma":[0.000016637046,0.000027340013,0.000048463433,0.0000032067906,0.000004116964,0.0000090707335,0.0000067378983,0.9927348,0.0001646281,0.0068014744,0.00017947529,0.0000040907616],"about_ca_topic_score_codex":0.006178266,"about_ca_topic_score_gemma":0.006287575,"teacher_disagreement_score":0.010188683,"about_ca_system_score_codex":0.0012330296,"about_ca_system_score_gemma":0.0026949584,"threshold_uncertainty_score":0.0340845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016614703,0.00013445382,0.9774779,0.00021805723,0.000050039645,0.000058953523,0.000026777192,0.00015706148,0.005261957],"genre_scores_gemma":[0.41085824,0.00024204596,0.5809348,0.0002621745,0.000045853496,0.00043012263,0.00015866818,0.00031605735,0.0067519685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989729,0.0005179793,0.00003456001,0.00015305936,0.00021773214,0.00010388802],"domain_scores_gemma":[0.9942378,0.004511186,0.00030030764,0.00024776006,0.0005481708,0.00015477439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037613646,0.0011801162,0.0009393624,0.00073672936,0.00097324885,0.0011902767,0.0014854947,0.0018972623,0.004030326],"category_scores_gemma":[0.013005871,0.0008436293,0.00081000477,0.00066989835,0.0021977539,0.001843776,0.0024637557,0.0027177085,0.0005118979],"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.00041796453,0.00008622003,0.0005244225,0.00016857269,0.000046132525,0.0000645911,0.00016707831,0.8936955,0.0021962943,0.053805854,0.0019810495,0.046846457],"study_design_scores_gemma":[0.000018453191,0.000045041215,0.000058250713,0.0000123999625,0.000004864414,0.000013328488,0.000009550674,0.99053335,0.00039549766,0.008621041,0.00028266737,0.000005542439],"about_ca_topic_score_codex":0.0036396526,"about_ca_topic_score_gemma":0.002956442,"teacher_disagreement_score":0.004030326,"about_ca_system_score_codex":0.0009812906,"about_ca_system_score_gemma":0.0022958345,"threshold_uncertainty_score":0.019892216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015898604,0.0026284975,0.8586976,0.0019730679,0.009660816,0.00037220927,0.011345015,0.0022429705,0.111490086],"genre_scores_gemma":[0.03732777,0.0038145431,0.70203364,0.0028456976,0.0041412557,0.0014933863,0.018536594,0.0035451064,0.226262],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994881,0.000097803466,0.000039874823,0.00008812193,0.00025920937,0.000026795644],"domain_scores_gemma":[0.9978066,0.0010343387,0.000070621994,0.00017944098,0.0008544842,0.000054446955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006297982,0.0009279334,0.00084343564,0.0012552621,0.0003611069,0.00066013756,0.0013811403,0.000955274,0.2039464],"category_scores_gemma":[0.006073232,0.00034946992,0.0006711688,0.0014004676,0.0002996132,0.001332232,0.00083671993,0.0016235589,0.04698561],"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.000114942355,0.00017016858,0.00021966618,0.0010808338,0.00004989277,0.00017750268,0.000061040184,0.015100595,0.0034365328,0.14591116,0.6621795,0.17149812],"study_design_scores_gemma":[0.00010665242,0.00007425379,0.0007611321,0.0002185752,0.000040281437,0.0007304102,0.000046090543,0.11025504,0.0037133289,0.14441289,0.73957616,0.000065165106],"about_ca_topic_score_codex":0.002071903,"about_ca_topic_score_gemma":0.0024170005,"teacher_disagreement_score":0.2039464,"about_ca_system_score_codex":0.0007105881,"about_ca_system_score_gemma":0.0007998305,"threshold_uncertainty_score":0.6822687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008272892,0.00005007322,0.000074089716,0.000060983777,0.000017780885,0.000008684922,0.99804604,0.00080049335,0.00085906486],"genre_scores_gemma":[0.0002051565,0.000040944793,0.0002987547,0.000057193316,0.0000038551975,0.000045211287,0.9987105,0.00015520016,0.0004831408],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896014,0.00014774685,0.00013612155,0.00035803858,0.00024536697,0.00015267805],"domain_scores_gemma":[0.9978788,0.00057161355,0.0001840431,0.00059989054,0.0005340617,0.00023153915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009161435,0.0023279816,0.0014501406,0.0041442476,0.0009818691,0.0023657547,0.003121915,0.0021104277,0.1121932],"category_scores_gemma":[0.0061113737,0.00081816467,0.0013530711,0.007897239,0.00046472772,0.0021797938,0.0023494319,0.0019653132,0.17399363],"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.00003063352,0.000014728628,0.00034237708,0.00040942014,0.000013909933,0.000014099557,0.000016496526,0.00016993769,0.0000990001,0.00040211415,0.9969489,0.0015383778],"study_design_scores_gemma":[0.00010914171,0.0000130823055,0.001676001,0.00016594831,0.000014675946,0.0000512341,0.00006837513,0.00037436138,0.00023755588,0.0011556876,0.9961151,0.000018827437],"about_ca_topic_score_codex":0.02194827,"about_ca_topic_score_gemma":0.03966973,"teacher_disagreement_score":0.8878068,"about_ca_system_score_codex":0.001708897,"about_ca_system_score_gemma":0.002326516,"threshold_uncertainty_score":0.37532365},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017044444,0.00017287867,0.9505088,0.00022856772,0.000063575775,0.00011188914,0.0062716794,0.03368799,0.007250202],"genre_scores_gemma":[0.03282868,0.0006928443,0.9197576,0.00026349747,0.00008647575,0.0010718991,0.011418672,0.0242971,0.0095832795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991517,0.00022119461,0.00008552849,0.0001602216,0.00029668488,0.000084695865],"domain_scores_gemma":[0.9982241,0.001049217,0.00017608721,0.00025072144,0.00021235412,0.00008746176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021186722,0.0016318508,0.0008573858,0.0019391405,0.0005590026,0.0025832707,0.0022504334,0.00087660376,0.031801548],"category_scores_gemma":[0.0067669363,0.0009821652,0.0021677022,0.0013591865,0.00085293275,0.0032177763,0.002714464,0.0025872062,0.012039002],"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.00022445903,0.00014508827,0.0033708436,0.0015184326,0.00027529502,0.00037482707,0.0008420349,0.10491971,0.006741221,0.43550533,0.22558628,0.22049634],"study_design_scores_gemma":[0.00012797149,0.00003752848,0.0010631158,0.00023417563,0.00006623611,0.0003849449,0.00009041367,0.42986062,0.006310198,0.32200366,0.23975082,0.000070395574],"about_ca_topic_score_codex":0.0022833343,"about_ca_topic_score_gemma":0.003429353,"teacher_disagreement_score":0.031801548,"about_ca_system_score_codex":0.0006988758,"about_ca_system_score_gemma":0.00148262,"threshold_uncertainty_score":0.10638678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036622274,0.00007910977,0.00005559563,0.00003472638,0.0000088977695,0.00001073454,0.99554425,0.00009823526,0.0005063944],"genre_scores_gemma":[0.0024320916,0.000056205317,0.00020004161,0.000010053214,0.0000034703307,0.000031853033,0.99658585,0.000012686487,0.00066769053],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968076,0.000022759588,0.000035786026,0.00008562129,0.00011403304,0.000061030794],"domain_scores_gemma":[0.9989742,0.00008480656,0.00014305302,0.00015476692,0.0005297209,0.00011355691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041870866,0.0011275467,0.0007195591,0.0026093854,0.0006245771,0.000794454,0.0014164298,0.00070618413,0.0078798],"category_scores_gemma":[0.0018012389,0.00036594516,0.0005970252,0.004876001,0.000279187,0.00043050828,0.00073667424,0.00068901933,0.008637083],"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.00019596312,0.000075388496,0.02709752,0.00065512187,0.000118998614,0.00017347831,0.00010808434,0.0022559015,0.0004797941,0.00045623316,0.95855117,0.009832298],"study_design_scores_gemma":[0.00027932567,0.000041335054,0.27398673,0.00045868722,0.00010825102,0.0002515964,0.00067283213,0.003937247,0.0013436829,0.0005827385,0.71825224,0.00008534304],"about_ca_topic_score_codex":0.5054986,"about_ca_topic_score_gemma":0.6907592,"teacher_disagreement_score":0.4945014,"about_ca_system_score_codex":0.0022614873,"about_ca_system_score_gemma":0.0035610655,"threshold_uncertainty_score":0.9948273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477802,0.0003349224,0.0063253073,0.00016005972,0.000021655407,0.00004178522,0.03869294,0.0005701744,0.00607303],"genre_scores_gemma":[0.93938357,0.00028712445,0.014303063,0.000030896703,0.000016261107,0.000045147477,0.044825234,0.000044694578,0.0010640711],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99991286,0.000009341972,0.000005920307,0.000027933473,0.000028028204,0.000015888927],"domain_scores_gemma":[0.9998536,0.000019009047,0.000036084155,0.000019279176,0.00005864352,0.000013282811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026236786,0.00028351415,0.00012082533,0.0014608435,0.000116983356,0.00025007967,0.00012545171,0.00013501967,0.0006767568],"category_scores_gemma":[0.00043813096,0.00005611193,0.00023535988,0.0018647547,0.00009128005,0.00033435252,0.0002044219,0.0001666968,0.00025076634],"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.00032490116,0.00018344876,0.5940395,0.00024047607,0.00022089097,0.00035795823,0.0003381342,0.10934211,0.009832612,0.0021903252,0.027465457,0.25546414],"study_design_scores_gemma":[0.000017921806,0.000046023426,0.8861255,0.000032129836,0.000057666224,0.00012970001,0.00025868646,0.0949424,0.0037608196,0.0011765372,0.013425995,0.000026551657],"about_ca_topic_score_codex":0.03946087,"about_ca_topic_score_gemma":0.07969045,"teacher_disagreement_score":0.03946087,"about_ca_system_score_codex":0.0005130779,"about_ca_system_score_gemma":0.0003668617,"threshold_uncertainty_score":0.07846236},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007219381,0.02919049,0.19732587,0.10458719,0.090104416,0.00064923515,0.009066461,0.0044679507,0.5573891],"genre_scores_gemma":[0.04541171,0.017331036,0.08520112,0.011271251,0.012757935,0.0009045363,0.01717349,0.0038505367,0.8060984],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970897,0.000732091,0.00011259855,0.0003861975,0.0013013276,0.00037817378],"domain_scores_gemma":[0.9971106,0.00042026522,0.000098317876,0.00035445867,0.0012932611,0.0007230936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073604826,0.0021818827,0.0016683565,0.00195286,0.0014264733,0.0064509106,0.002490817,0.0033638172,0.06597715],"category_scores_gemma":[0.0063070864,0.00058836956,0.0016322162,0.0014749026,0.00083992636,0.00266365,0.00352907,0.0040152255,0.036271427],"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.00012173123,0.00010021612,0.00012597509,0.00016687952,0.000033544642,0.00007603659,0.000044296245,0.005329539,0.0008605882,0.03151285,0.84663886,0.11498956],"study_design_scores_gemma":[0.000039508443,0.000048997023,0.00036250163,0.00017407935,0.00001721288,0.00005345028,0.000059178452,0.0055030365,0.0010182712,0.017124893,0.9755726,0.000026370602],"about_ca_topic_score_codex":0.0048100883,"about_ca_topic_score_gemma":0.008635573,"teacher_disagreement_score":0.06597715,"about_ca_system_score_codex":0.0027167911,"about_ca_system_score_gemma":0.005349453,"threshold_uncertainty_score":0.22071558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015898604,0.0026284975,0.8586976,0.0019730679,0.009660816,0.00037220927,0.011345015,0.0022429705,0.111490086],"genre_scores_gemma":[0.03732777,0.0038145431,0.70203364,0.0028456976,0.0041412557,0.0014933863,0.018536594,0.0035451064,0.226262],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994881,0.000097803466,0.000039874823,0.00008812193,0.00025920937,0.000026795644],"domain_scores_gemma":[0.9978066,0.0010343387,0.000070621994,0.00017944098,0.0008544842,0.000054446955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006297982,0.0009279334,0.00084343564,0.0012552621,0.0003611069,0.00066013756,0.0013811403,0.000955274,0.2039464],"category_scores_gemma":[0.006073232,0.00034946992,0.0006711688,0.0014004676,0.0002996132,0.001332232,0.00083671993,0.0016235589,0.04698561],"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.000114942355,0.00017016858,0.00021966618,0.0010808338,0.00004989277,0.00017750268,0.000061040184,0.015100595,0.0034365328,0.14591116,0.6621795,0.17149812],"study_design_scores_gemma":[0.00010665242,0.00007425379,0.0007611321,0.0002185752,0.000040281437,0.0007304102,0.000046090543,0.11025504,0.0037133289,0.14441289,0.73957616,0.000065165106],"about_ca_topic_score_codex":0.002071903,"about_ca_topic_score_gemma":0.0024170005,"teacher_disagreement_score":0.2039464,"about_ca_system_score_codex":0.0007105881,"about_ca_system_score_gemma":0.0007998305,"threshold_uncertainty_score":0.6822687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76675165,0.00029644198,0.17316404,0.0007100188,0.00014658523,0.00019103647,0.0046304204,0.0027148454,0.051394965],"genre_scores_gemma":[0.97554684,0.00017819263,0.016210806,0.00007014634,0.000022064676,0.00015776546,0.0009360868,0.00018556618,0.0066925334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998876,0.00001805881,0.000006412722,0.000030529005,0.000026224545,0.00003116559],"domain_scores_gemma":[0.9997447,0.00010333751,0.000030694304,0.000020238225,0.000059595535,0.000041378687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017754661,0.00050162256,0.00042238727,0.00055852864,0.00070323684,0.00095434475,0.0011448124,0.0012450591,0.002979361],"category_scores_gemma":[0.0008681017,0.00040844863,0.00067273417,0.00047820402,0.0005108672,0.0005217054,0.0007565608,0.00062176096,0.00034231908],"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.0000074047985,0.000020687548,0.0018309418,0.000009491695,0.00000722797,0.00004697424,0.000027412405,0.9944336,0.000718925,0.00117124,0.00035980222,0.0013664047],"study_design_scores_gemma":[0.0000040527025,0.0000026155237,0.00052918494,0.000001712749,0.000002114507,0.0000070207375,0.000008363357,0.998456,0.00012916517,0.00034328876,0.0005124169,0.000004147318],"about_ca_topic_score_codex":0.06888471,"about_ca_topic_score_gemma":0.04383901,"teacher_disagreement_score":0.06888471,"about_ca_system_score_codex":0.0011876622,"about_ca_system_score_gemma":0.0014854146,"threshold_uncertainty_score":0.13696748},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029905738,0.0022014477,0.84647185,0.0012773365,0.0005899058,0.00016146946,0.00042806112,0.0003836372,0.118580565],"genre_scores_gemma":[0.44189477,0.0066369534,0.40531826,0.0006595131,0.0009372198,0.0006715562,0.0016356516,0.0007515115,0.14149451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991498,0.00031832163,0.000034253426,0.00015391207,0.0002171558,0.00012647816],"domain_scores_gemma":[0.99930596,0.0003830796,0.00006840419,0.000081347804,0.00009663847,0.000064565575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401857,0.0007018449,0.00088458654,0.0011003526,0.00094589073,0.0022523883,0.00083712063,0.00064829044,0.018651672],"category_scores_gemma":[0.0032870984,0.0005303536,0.00089572783,0.002514087,0.0023158279,0.0027271062,0.0020039093,0.002310871,0.0037863443],"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.000089359506,0.00004998293,0.00045596474,0.0002658177,0.000018771345,0.000066301815,0.00031946105,0.058171164,0.00089772366,0.8277909,0.015624457,0.096249975],"study_design_scores_gemma":[0.00003088324,0.000067201705,0.0003250271,0.00008692873,0.0000085332085,0.00008664104,0.00018253297,0.08835492,0.00081731525,0.8730011,0.037019983,0.000018888739],"about_ca_topic_score_codex":0.0028347352,"about_ca_topic_score_gemma":0.0037235108,"teacher_disagreement_score":0.018651672,"about_ca_system_score_codex":0.0013176203,"about_ca_system_score_gemma":0.0013987975,"threshold_uncertainty_score":0.06239605},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013034823,0.00023145077,0.9820294,0.0005260511,0.000042635904,0.000040977808,0.00017700007,0.00022528361,0.0036924107],"genre_scores_gemma":[0.45657864,0.0009639087,0.5226923,0.0006241445,0.00025322274,0.00044344558,0.0015113621,0.00049856544,0.016434325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910223,0.0003684881,0.000024036464,0.00017405034,0.00022268003,0.000108513996],"domain_scores_gemma":[0.99683124,0.0021274593,0.00034405678,0.00022166382,0.0003047314,0.000170893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020130044,0.0018293138,0.0010938367,0.00062733184,0.00038619482,0.0014820774,0.0011004641,0.0012506018,0.0040783803],"category_scores_gemma":[0.0058710934,0.0006768358,0.00079967733,0.0008657788,0.0017941608,0.002129439,0.0014595323,0.0024009175,0.001015822],"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.0000925495,0.00012584151,0.00046097068,0.00025676368,0.000055249122,0.00017330259,0.00010451846,0.84661514,0.0027822698,0.10586099,0.0075752293,0.03589715],"study_design_scores_gemma":[0.000008565265,0.000022390042,0.000054036136,0.000008089972,0.0000026262865,0.000015912357,0.000016515396,0.96586686,0.00039637106,0.033000585,0.00060152175,0.000006429934],"about_ca_topic_score_codex":0.002471277,"about_ca_topic_score_gemma":0.0034093296,"teacher_disagreement_score":0.0040783803,"about_ca_system_score_codex":0.000818509,"about_ca_system_score_gemma":0.001170224,"threshold_uncertainty_score":0.013643563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1261638,0.00049940567,0.861045,0.0010415748,0.00008208941,0.0001401733,0.00031075755,0.0006530334,0.01006413],"genre_scores_gemma":[0.6888365,0.00033539778,0.3000584,0.00013269098,0.00008063327,0.00027764714,0.00070793804,0.000310251,0.009260419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993498,0.00028108183,0.000029984803,0.00015670332,0.00009001015,0.000092308976],"domain_scores_gemma":[0.995372,0.003743173,0.00024312337,0.00016951685,0.0002907559,0.00018144303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018163051,0.00082309986,0.0014435573,0.0007411064,0.0004708682,0.0014044698,0.0011046965,0.0016963604,0.0060733645],"category_scores_gemma":[0.00913707,0.0005380138,0.0006846475,0.0005767854,0.0010052526,0.0016638727,0.0012814422,0.0013141788,0.0010196693],"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.00017657827,0.00006847619,0.0009999081,0.00013949147,0.000048603502,0.00009413852,0.00007100584,0.96490896,0.0008006465,0.007142546,0.0023483974,0.023201171],"study_design_scores_gemma":[0.000014635069,0.00003488633,0.0001214498,0.000008926859,0.0000058954447,0.000011837111,0.00002681785,0.9949581,0.00026929966,0.0043094275,0.00023573652,0.0000030126523],"about_ca_topic_score_codex":0.008584739,"about_ca_topic_score_gemma":0.008669234,"teacher_disagreement_score":0.008584739,"about_ca_system_score_codex":0.001065927,"about_ca_system_score_gemma":0.0015567339,"threshold_uncertainty_score":0.020317376},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577157,0.0853194,0.0010253001,0.1303406,0.0012800837,0.00004392114,0.0011231214,0.00006207504,0.2036485],"genre_scores_gemma":[0.8941487,0.028644085,0.0009870245,0.0024322695,0.00043460095,0.000027542328,0.0004936568,0.000036119563,0.07279613],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99977154,0.000090199406,0.0000042214915,0.00002885873,0.00004967745,0.000055542903],"domain_scores_gemma":[0.9997819,0.000061531,0.000035424775,0.0000047779636,0.000035839068,0.000080566504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045841208,0.00012805592,0.0001407319,0.0004478844,0.0024898292,0.0014333806,0.00041126783,0.00049764215,0.0076423767],"category_scores_gemma":[0.00083204894,0.00013690248,0.00010096555,0.0011013079,0.0015913139,0.0008547242,0.0012502308,0.0009759797,0.0004546027],"study_design_candidate":"observational","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.00009826523,0.000102644764,0.0630057,0.00069187063,0.00007393366,0.0026945362,0.18303904,0.0014464364,0.0010256815,0.07607156,0.33717594,0.3345745],"study_design_scores_gemma":[0.000009719868,0.000050422623,0.12664142,0.00046705693,0.000016182601,0.0005942719,0.08380517,0.0002683336,0.00016443046,0.009724806,0.778228,0.000030203915],"about_ca_topic_score_codex":0.29790437,"about_ca_topic_score_gemma":0.64974016,"teacher_disagreement_score":0.7020956,"about_ca_system_score_codex":0.004589588,"about_ca_system_score_gemma":0.0035945673,"threshold_uncertainty_score":0.5923407},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015345199,0.01916305,0.49162793,0.013637501,0.00460056,0.00014515822,0.0011702867,0.001216189,0.4530941],"genre_scores_gemma":[0.3364818,0.018473573,0.15015607,0.0029702547,0.0028925128,0.00055431155,0.0017086052,0.00082705135,0.48593587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994742,0.00023881727,0.0000179731,0.000090985784,0.0001355891,0.000042403695],"domain_scores_gemma":[0.9993604,0.00030849996,0.000044244403,0.00010156381,0.000121105855,0.0000642555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698849,0.0006890955,0.00063681183,0.0007468765,0.00046933428,0.0019354776,0.0004703294,0.0012516315,0.04701169],"category_scores_gemma":[0.0031582145,0.00023819944,0.00037993072,0.0010961608,0.0011594533,0.001798416,0.0017481104,0.0023863849,0.0122051025],"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.00008000637,0.000033267595,0.00034952015,0.00023465628,0.00004393694,0.00006866856,0.000110145025,0.00762184,0.00093200087,0.85370225,0.055850938,0.08097277],"study_design_scores_gemma":[0.00005437724,0.00009897955,0.0008375061,0.00015153427,0.00001659586,0.00018347682,0.00009623566,0.06327897,0.00081177085,0.7656029,0.16884816,0.000019601326],"about_ca_topic_score_codex":0.0020854005,"about_ca_topic_score_gemma":0.0015262782,"teacher_disagreement_score":0.04701169,"about_ca_system_score_codex":0.0010994284,"about_ca_system_score_gemma":0.00097489945,"threshold_uncertainty_score":0.15726984},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002071358,0.0005032301,0.99177086,0.00016359006,0.00005376282,0.000050746166,0.000025736805,0.00014107536,0.005219535],"genre_scores_gemma":[0.07195544,0.0013976156,0.9123857,0.00022204538,0.00013391963,0.00025924752,0.00023195159,0.00022487048,0.0131892385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986576,0.00036408787,0.00007142162,0.0002449544,0.00055269117,0.00010918814],"domain_scores_gemma":[0.999042,0.00058251724,0.000054555036,0.000120783,0.00017065197,0.000029512697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921214,0.0012496886,0.0011118174,0.0011551594,0.0005705185,0.0017361384,0.0014908613,0.0010695792,0.005942469],"category_scores_gemma":[0.0037985675,0.0005963251,0.001063093,0.0013503432,0.0011039112,0.0021839214,0.001739853,0.0017626004,0.002075332],"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.00012695715,0.00010323759,0.0003692809,0.00043699183,0.000072711846,0.0001397508,0.00019653852,0.30539417,0.006865219,0.29552197,0.007784034,0.3829892],"study_design_scores_gemma":[0.000045842764,0.00008004199,0.00013950813,0.00005503504,0.00002844586,0.00017095322,0.00007534459,0.8436072,0.005374352,0.13177681,0.018612688,0.000033780678],"about_ca_topic_score_codex":0.0016569755,"about_ca_topic_score_gemma":0.0018582764,"teacher_disagreement_score":0.005942469,"about_ca_system_score_codex":0.0008737601,"about_ca_system_score_gemma":0.0010948401,"threshold_uncertainty_score":0.01987952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08967355,0.0035540385,0.77668893,0.011650121,0.000645214,0.00029503254,0.0006561946,0.0002928298,0.116544105],"genre_scores_gemma":[0.8257353,0.004690827,0.14224145,0.0012896034,0.0017019026,0.00065498275,0.00078161026,0.00017294216,0.022731345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964483,0.0017460887,0.00017778097,0.00050955656,0.00080369686,0.00031454887],"domain_scores_gemma":[0.9790643,0.017542843,0.00067571655,0.0010750111,0.001194331,0.00044772634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006082856,0.0014658121,0.001097651,0.0023592296,0.0016958273,0.0040775957,0.0015877638,0.0015686749,0.010029503],"category_scores_gemma":[0.020921657,0.00067969225,0.0026007388,0.0019524503,0.009795247,0.008007319,0.004725601,0.009137209,0.0013543661],"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.000014476805,0.000016389326,0.0001330837,0.00005252157,0.000008817632,0.00003433442,0.000120502,0.0031723063,0.00026621652,0.9921996,0.00064170785,0.0033399824],"study_design_scores_gemma":[0.000013756987,0.00001574223,0.000067093504,0.000019328365,0.000003860541,0.000023619063,0.000039626375,0.014901445,0.00035175003,0.9825637,0.0019891781,0.00001090579],"about_ca_topic_score_codex":0.0023027598,"about_ca_topic_score_gemma":0.0010140061,"teacher_disagreement_score":0.010029503,"about_ca_system_score_codex":0.0036192567,"about_ca_system_score_gemma":0.002518399,"threshold_uncertainty_score":0.03355199},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005543393,0.00066253287,0.9953375,0.000114100534,0.00018279944,0.00004593669,0.0000575565,0.00029619707,0.0027490389],"genre_scores_gemma":[0.0227045,0.0018403463,0.9592601,0.0002776812,0.00022544814,0.00034231908,0.0003221868,0.00051003566,0.01451732],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896526,0.0002882711,0.00004289617,0.00009930151,0.00055553054,0.000048776288],"domain_scores_gemma":[0.99945134,0.00025522365,0.000049077298,0.00006202254,0.00014434378,0.00003787719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600924,0.0009900272,0.0009469904,0.00082396815,0.00040840716,0.00096970063,0.0011770563,0.0008677978,0.006415698],"category_scores_gemma":[0.0021411963,0.0004952604,0.0010913444,0.0009075389,0.000902475,0.0013108524,0.0017263726,0.0019561956,0.0034531772],"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.00013586735,0.00013285561,0.0008336222,0.0010864885,0.00027132232,0.00039778196,0.00028343315,0.16385324,0.02200465,0.15818276,0.05555921,0.59725887],"study_design_scores_gemma":[0.00007290621,0.00012508141,0.00042590854,0.00011583451,0.000045560446,0.0005125683,0.000049642993,0.77212054,0.007573274,0.056192394,0.16268316,0.00008302988],"about_ca_topic_score_codex":0.0016254212,"about_ca_topic_score_gemma":0.0024575547,"teacher_disagreement_score":0.006415698,"about_ca_system_score_codex":0.00032016332,"about_ca_system_score_gemma":0.001576483,"threshold_uncertainty_score":0.02146262},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007732916,0.00016117925,0.99808,0.00005483294,0.00002285136,0.000014481212,0.000013159402,0.000056252877,0.00082391],"genre_scores_gemma":[0.059636235,0.000730364,0.9361016,0.000108407556,0.00008492363,0.0002834167,0.00011270646,0.00011965374,0.002822706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989021,0.0005158899,0.000055972003,0.00012030938,0.00035855218,0.00004722332],"domain_scores_gemma":[0.99684,0.0021652668,0.00025636452,0.00026677604,0.00041333944,0.000058347458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215232,0.00085760077,0.0009765299,0.0007735769,0.0004871777,0.0009883223,0.0009900526,0.0011148194,0.0038926662],"category_scores_gemma":[0.009029713,0.00040481362,0.0006619835,0.0011269018,0.00101285,0.0014534448,0.0014372981,0.0018854287,0.0012016068],"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.00007598622,0.000041571668,0.00076248456,0.0003322058,0.00005943757,0.0000785762,0.00015849505,0.7225001,0.0046230033,0.13728745,0.0028741776,0.1312065],"study_design_scores_gemma":[0.000007224213,0.000008059991,0.000046178975,0.000015305215,0.0000030587491,0.000013286588,0.0000079318015,0.9851075,0.00044129242,0.012397845,0.0019474085,0.000004903653],"about_ca_topic_score_codex":0.0023377324,"about_ca_topic_score_gemma":0.0024961827,"teacher_disagreement_score":0.0038926662,"about_ca_system_score_codex":0.00051570695,"about_ca_system_score_gemma":0.0014465441,"threshold_uncertainty_score":0.013022244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036549907,0.003557439,0.024768742,0.018978577,0.0020563053,0.00027969232,0.000489959,0.0009274671,0.91239184],"genre_scores_gemma":[0.30888617,0.004013115,0.026531583,0.0048086457,0.0005204401,0.00029206855,0.0007396106,0.0009172014,0.6532911],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9968118,0.00069301337,0.00015279758,0.0005984453,0.0012656853,0.0004783149],"domain_scores_gemma":[0.99639845,0.0012865443,0.00027542203,0.00046455735,0.0010883319,0.00048661983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028231486,0.0008402714,0.0005210685,0.0006958164,0.0023748905,0.00858708,0.0013958659,0.002143228,0.08908983],"category_scores_gemma":[0.005527773,0.00045847346,0.0007778751,0.0005799963,0.0020493611,0.0046747886,0.0045282124,0.003056259,0.022693876],"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.00090901763,0.0009029178,0.011261867,0.0020716104,0.00013807147,0.0013308877,0.022175334,0.002041114,0.034252703,0.29519534,0.15774854,0.4719726],"study_design_scores_gemma":[0.000028053253,0.00019096743,0.0048654666,0.00039263332,0.00005777961,0.00026534603,0.0074885627,0.0010429855,0.009732886,0.020858264,0.9550154,0.00006161163],"about_ca_topic_score_codex":0.005942697,"about_ca_topic_score_gemma":0.014786852,"teacher_disagreement_score":0.08908983,"about_ca_system_score_codex":0.0037190593,"about_ca_system_score_gemma":0.006127141,"threshold_uncertainty_score":0.2980352},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036452785,0.00039548494,0.93606037,0.0013967615,0.00012432731,0.0002558989,0.00040197544,0.00085843704,0.024053935],"genre_scores_gemma":[0.5163669,0.0010159909,0.4605958,0.0012532776,0.00036913104,0.00056022016,0.0014222289,0.0009470463,0.01746944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916692,0.001771827,0.00045468297,0.0018045672,0.0032625922,0.0010371666],"domain_scores_gemma":[0.9676586,0.021602757,0.0013244398,0.0042174323,0.003909839,0.0012869914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008705256,0.001610424,0.0023160966,0.0019613283,0.002199327,0.0060010892,0.0037207168,0.002345558,0.011215291],"category_scores_gemma":[0.048854552,0.0012563935,0.0037141687,0.0017608033,0.006100658,0.010742416,0.006346215,0.011755065,0.002510926],"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.0001382437,0.00007767055,0.0007392723,0.00026683512,0.000028929688,0.00024763297,0.0003826699,0.030794086,0.0036379946,0.925955,0.0053344793,0.03239721],"study_design_scores_gemma":[0.00004395797,0.00008138246,0.0002320713,0.00009840077,0.00002570475,0.00021113997,0.00007858387,0.18939772,0.0050195237,0.7999516,0.004803512,0.00005641683],"about_ca_topic_score_codex":0.0019546787,"about_ca_topic_score_gemma":0.0022648694,"teacher_disagreement_score":0.011215291,"about_ca_system_score_codex":0.004091727,"about_ca_system_score_gemma":0.004077784,"threshold_uncertainty_score":0.04603833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015070694,0.0021249587,0.0019284491,0.010819368,0.0011994597,0.00035923973,0.01083433,0.0004039896,0.95725954],"genre_scores_gemma":[0.0457368,0.0016608478,0.002400673,0.0014483498,0.000095923366,0.00026317226,0.0052205278,0.00011907269,0.94305456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875927,0.0001308514,0.000027449743,0.00010832725,0.00044273387,0.00053124817],"domain_scores_gemma":[0.9979367,0.00022139007,0.00007657971,0.00016525527,0.00091503083,0.00068496674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014013074,0.0004595827,0.0002699585,0.0014296365,0.002713643,0.0031922737,0.000936145,0.00085474213,0.08756662],"category_scores_gemma":[0.0035715085,0.00016129583,0.00026003394,0.00269736,0.0007602003,0.0012544343,0.00313008,0.0012986171,0.010620316],"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.00021562455,0.000106445055,0.006521841,0.00021798386,0.0000149665375,0.00033974208,0.0019632191,0.00062289194,0.000644274,0.25904983,0.53512514,0.19517805],"study_design_scores_gemma":[0.0000071772824,0.000006991571,0.0033180048,0.00003339802,0.0000011752526,0.000029551216,0.00030068282,0.00007471636,0.00008882896,0.0005337795,0.99560237,0.0000034348648],"about_ca_topic_score_codex":0.52041584,"about_ca_topic_score_gemma":0.47606295,"teacher_disagreement_score":0.52041584,"about_ca_system_score_codex":0.0108010005,"about_ca_system_score_gemma":0.041241337,"threshold_uncertainty_score":0.96481705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99959713,0.00007102102,0.000026240315,0.000012387827,3.4863297e-7,0.0000012773669,0.000028643793,0.0000010434377,0.0002619035],"genre_scores_gemma":[0.9981103,0.0002595744,0.00032376382,0.000019587209,0.0000017185474,0.0000072518446,0.000099854704,0.0000015059403,0.0011765216],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9999442,0.0000076477145,0.000004527398,0.000022686654,0.0000127843505,0.000008177817],"domain_scores_gemma":[0.99976677,0.00004171544,0.00010818872,0.00000827461,0.000035382876,0.000039606955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012146507,0.00014191007,0.00012360892,0.000550252,0.00037185292,0.00051535014,0.00016119298,0.0001722932,0.0011007782],"category_scores_gemma":[0.00036561824,0.00013687246,0.00006568719,0.00046530887,0.0002547996,0.00027816274,0.00027727123,0.00017784159,0.000092523245],"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.00028914574,0.00004389829,0.96855956,0.00004975324,0.00003089841,0.00015626205,0.00079046574,0.00006754338,0.018661425,0.000051377927,0.00009066334,0.011209008],"study_design_scores_gemma":[9.757287e-7,0.00008137396,0.9986687,0.0000043692858,0.0000042739616,0.00006874642,0.00041543005,0.00004569696,0.00049607037,0.00001408592,0.00019898964,0.0000012815821],"about_ca_topic_score_codex":0.010529076,"about_ca_topic_score_gemma":0.033293564,"teacher_disagreement_score":0.010529076,"about_ca_system_score_codex":0.00029092093,"about_ca_system_score_gemma":0.00019270941,"threshold_uncertainty_score":0.020935595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012606301,0.0006510622,0.00039506663,0.0053381086,0.0073764636,0.00016842289,0.0028111364,0.0026688597,0.97933036],"genre_scores_gemma":[0.0027744214,0.0002878266,0.00015319852,0.0015749843,0.0006536629,0.000061944804,0.0009922535,0.0006254479,0.9928762],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996412,0.000032757576,0.0000071109234,0.000046693433,0.00013995446,0.00013235578],"domain_scores_gemma":[0.9992022,0.000039785064,0.000019403325,0.000052066418,0.0002806466,0.00040595085],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00056341646,0.0009448243,0.00031469765,0.0006736298,0.0037376955,0.004418936,0.0005949402,0.0019745568,0.6988962],"category_scores_gemma":[0.0014736468,0.0004108646,0.00033355338,0.00051149237,0.00049485173,0.0024947643,0.0032165272,0.0033285378,0.5980267],"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.000019035484,0.000012788109,0.00008679733,0.00002120625,7.005017e-7,0.000038227972,0.00006384354,0.000004327175,0.00012042975,0.00033224936,0.99151015,0.0077903373],"study_design_scores_gemma":[0.0000051198913,0.00001481053,0.00043714803,0.0000374423,0.00000106611,0.000039256785,0.00023955815,0.0000139825615,0.000100993224,0.000112744005,0.99899393,0.0000038675726],"about_ca_topic_score_codex":0.0068617337,"about_ca_topic_score_gemma":0.019786999,"teacher_disagreement_score":0.30110377,"about_ca_system_score_codex":0.00082446844,"about_ca_system_score_gemma":0.0008965518,"threshold_uncertainty_score":0.42948794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.999721,0.000023666753,0.000109846755,0.0000075413923,6.461801e-7,8.0627836e-7,0.00001023921,0.0000028942861,0.0001233729],"genre_scores_gemma":[0.9998739,0.000015446898,0.000053607753,0.0000022162885,5.270662e-7,7.7129516e-7,0.0000103227385,6.6087927e-7,0.00004268101],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99991417,0.00001803578,0.000009168147,0.000017883278,0.000017998855,0.000022688893],"domain_scores_gemma":[0.9997758,0.00006464006,0.00008683567,0.00001136354,0.000029159073,0.00003206599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018110735,0.00016576354,0.00016864359,0.00027734315,0.0002451055,0.00041761124,0.00008197293,0.00015593832,0.00023596588],"category_scores_gemma":[0.00048354868,0.00017179271,0.00022233771,0.0001242917,0.00024541627,0.00020323406,0.00039203058,0.00019445979,0.000041895797],"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.0005318639,0.00007133906,0.73741615,0.000065402746,0.000073333154,0.00042914491,0.0006542262,0.009205696,0.2375934,0.00033046832,0.00008910268,0.013539926],"study_design_scores_gemma":[0.000006910519,0.00013044901,0.9905668,0.000005078411,0.000022557815,0.000051149942,0.00027557102,0.005485142,0.0033085113,0.000056316687,0.00007805648,0.000013439014],"about_ca_topic_score_codex":0.008467742,"about_ca_topic_score_gemma":0.009592635,"teacher_disagreement_score":0.008467742,"about_ca_system_score_codex":0.00044775422,"about_ca_system_score_gemma":0.0002690571,"threshold_uncertainty_score":0.016836882},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029144526,0.00015970568,0.99779,0.00014642395,0.000025215591,0.000013268537,0.00001900581,0.000027239426,0.0015277441],"genre_scores_gemma":[0.08882011,0.002093133,0.9021741,0.00041625928,0.00042067748,0.000477469,0.00023586256,0.00026361927,0.0050987466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968784,0.0014080771,0.00016152562,0.0006352102,0.0007509064,0.00016591098],"domain_scores_gemma":[0.99626875,0.0025266847,0.00030530564,0.00029659327,0.0005242129,0.00007835822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045229923,0.002539184,0.0018557665,0.0017364068,0.00081440463,0.0030320396,0.002500985,0.002594617,0.004252418],"category_scores_gemma":[0.011759166,0.0010374829,0.0024141932,0.0019692397,0.0031139955,0.0039029522,0.0036459502,0.0052608624,0.0012877948],"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.000025556797,0.000040081908,0.00022060529,0.00029078816,0.000053569933,0.00011265353,0.00012391713,0.5054628,0.0014287223,0.45964947,0.0030482693,0.029543586],"study_design_scores_gemma":[0.000008203998,0.000035818524,0.00006157184,0.000043227683,0.00001024444,0.000056942143,0.000025343896,0.8436881,0.0004612219,0.15082967,0.0047586337,0.000021084536],"about_ca_topic_score_codex":0.004970403,"about_ca_topic_score_gemma":0.0028669718,"teacher_disagreement_score":0.004970403,"about_ca_system_score_codex":0.0019156665,"about_ca_system_score_gemma":0.0026354967,"threshold_uncertainty_score":0.023920178},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041043453,0.010681141,0.0035159506,0.027147457,0.0060657435,0.00017184872,0.003017968,0.0018207213,0.9065358],"genre_scores_gemma":[0.07744502,0.004298707,0.0022264635,0.002854157,0.00066159584,0.00008877044,0.0015227534,0.0011667786,0.90973574],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9985649,0.00019285247,0.00007164255,0.00031517103,0.0005105837,0.00034487958],"domain_scores_gemma":[0.9990827,0.00018064013,0.000059645874,0.00008886312,0.00027167538,0.00031647598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328628,0.000730083,0.0006962363,0.0010141825,0.004033474,0.012421855,0.001092215,0.0024291754,0.21181394],"category_scores_gemma":[0.0021511507,0.00048809528,0.00067121704,0.0009933889,0.0011187844,0.0047635026,0.0047838893,0.004417632,0.115329556],"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.00072464976,0.00054128974,0.005853366,0.0010889897,0.000050596547,0.0015442485,0.028758487,0.0004419429,0.008256073,0.057947528,0.57723707,0.3175558],"study_design_scores_gemma":[0.000007964007,0.000026401216,0.0022475698,0.00017863096,0.000008314169,0.00009602337,0.0029544525,0.00005588508,0.0007099837,0.00088853395,0.99280715,0.000019093532],"about_ca_topic_score_codex":0.011097177,"about_ca_topic_score_gemma":0.025830619,"teacher_disagreement_score":0.21181394,"about_ca_system_score_codex":0.002838513,"about_ca_system_score_gemma":0.003554466,"threshold_uncertainty_score":0.70858824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9997795,0.000016130496,0.000021934942,0.000004057432,6.028857e-7,9.645596e-7,0.0000326043,0.0000022036158,0.00014199785],"genre_scores_gemma":[0.9997807,0.000017304756,0.000042394055,0.000001799471,8.999925e-7,0.0000014181085,0.000057189824,5.7853197e-7,0.000097616896],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9999356,0.00000833485,0.0000048761763,0.000016915867,0.000012095268,0.00002219333],"domain_scores_gemma":[0.9998585,0.000016146545,0.000060773928,0.0000058114756,0.000023613777,0.00003513761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017823187,0.00016118883,0.00012739871,0.00036753734,0.00029381958,0.0005328742,0.00014504594,0.0001459551,0.0003845805],"category_scores_gemma":[0.00021574157,0.00010405783,0.0001588104,0.0002659852,0.00021483796,0.00026063732,0.00017215165,0.00012207247,0.00005033013],"study_design_candidate":"observational","study_design_consensus":"observational","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.00014955287,0.00006642162,0.9842269,0.0000127443545,0.000028063114,0.000111527595,0.0005660043,0.0009089385,0.009917276,0.00007104143,0.00005911871,0.0038824538],"study_design_scores_gemma":[0.0000013224076,0.00001766915,0.9992059,0.0000012822874,0.0000025250567,0.000015433323,0.00020642806,0.00035643225,0.0001160591,0.0000075487287,0.0000680233,0.0000013591646],"about_ca_topic_score_codex":0.09279861,"about_ca_topic_score_gemma":0.23440076,"teacher_disagreement_score":0.9072014,"about_ca_system_score_codex":0.00072111626,"about_ca_system_score_gemma":0.00035632853,"threshold_uncertainty_score":0.18451697},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042318297,0.02188352,0.00058710994,0.5058413,0.33182946,0.00017747877,0.0019887667,0.0019701405,0.13149036],"genre_scores_gemma":[0.013031888,0.009591398,0.0011560231,0.32411572,0.079867005,0.00017955081,0.002963903,0.0009051966,0.56818926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919378,0.0009575177,0.0006333117,0.0009448086,0.0034432018,0.0020833367],"domain_scores_gemma":[0.9555168,0.0018512162,0.0023385326,0.0021691634,0.013116746,0.025007503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006261583,0.0017622296,0.0012415213,0.0030076613,0.012741553,0.03040956,0.0023414898,0.014231922,0.13139902],"category_scores_gemma":[0.021768415,0.0012803625,0.0014459478,0.0024780487,0.0028642768,0.010177441,0.006036863,0.011252357,0.09441775],"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.000033679837,0.000031131116,0.00036859896,0.00006292684,0.000008274571,0.00016091828,0.000120636985,0.0000055061055,0.0001878086,0.00042260002,0.99220145,0.006396445],"study_design_scores_gemma":[0.000013571908,0.000035009976,0.001093291,0.00007157479,0.0000038422727,0.0001273147,0.000529296,0.0000069862062,0.00007917478,0.00019152487,0.99783725,0.000011183651],"about_ca_topic_score_codex":0.0066629983,"about_ca_topic_score_gemma":0.020584743,"teacher_disagreement_score":0.13139902,"about_ca_system_score_codex":0.006459336,"about_ca_system_score_gemma":0.010249158,"threshold_uncertainty_score":0.43957353},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09401234,0.019379482,0.0016695365,0.05958811,0.011309628,0.0010383812,0.24551539,0.0009179453,0.5665692],"genre_scores_gemma":[0.018462412,0.00531951,0.0006459483,0.00072483346,0.00040831513,0.00023577767,0.01667617,0.00012100356,0.95740604],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991486,0.00008860224,0.000043041495,0.00009518896,0.00040535268,0.00021921612],"domain_scores_gemma":[0.9978339,0.00012540788,0.00015730318,0.00011348333,0.0011465829,0.00062340766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000979285,0.0005395382,0.00037252353,0.0017574321,0.0020446796,0.00231689,0.00077095994,0.0009531784,0.09773422],"category_scores_gemma":[0.0023431904,0.00058943516,0.00019565044,0.0031662544,0.00025833034,0.0009585872,0.0020901682,0.0010105545,0.025936762],"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.00005148513,0.00003890462,0.004844061,0.0001520822,0.0000066900843,0.00009352068,0.00047262383,0.000104684266,0.00024266627,0.0012065346,0.97173643,0.021050313],"study_design_scores_gemma":[0.000005193814,0.000015338523,0.022236133,0.000055800756,0.0000041096487,0.000026100739,0.0012455523,0.000044034015,0.00013938893,0.000083178966,0.9761376,0.0000076043366],"about_ca_topic_score_codex":0.1036173,"about_ca_topic_score_gemma":0.29163808,"teacher_disagreement_score":0.1036173,"about_ca_system_score_codex":0.0017914114,"about_ca_system_score_gemma":0.009558469,"threshold_uncertainty_score":0.32695353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5423358,0.0020431788,0.10616161,0.005635883,0.0010984048,0.00045490827,0.0601923,0.0065465514,0.27553132],"genre_scores_gemma":[0.7401116,0.0012624172,0.0715352,0.00061855995,0.00021979885,0.0004490677,0.043429792,0.0034911896,0.13888243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99707854,0.0010177077,0.00022702434,0.0006208042,0.0008109936,0.00024499826],"domain_scores_gemma":[0.9924446,0.004017708,0.00033602354,0.0004941559,0.002522034,0.00018553171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013693072,0.0013844557,0.00059082726,0.0036395108,0.0033252712,0.0032620837,0.0007220422,0.0010073757,0.03456068],"category_scores_gemma":[0.00801323,0.00042125373,0.0005304888,0.0042311316,0.0020892574,0.0021017732,0.000802246,0.0023035377,0.005251037],"study_design_candidate":"not_applicable","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.001555207,0.0002558253,0.044089336,0.0011199134,0.0002096779,0.0014968144,0.03145151,0.0059442464,0.031720914,0.36248195,0.1796914,0.33998328],"study_design_scores_gemma":[0.00012532609,0.00013052735,0.0936313,0.00042178886,0.00010526235,0.002028268,0.018853696,0.0144615285,0.019047674,0.019386187,0.8315606,0.0002478538],"about_ca_topic_score_codex":0.47785088,"about_ca_topic_score_gemma":0.45100588,"teacher_disagreement_score":0.5221491,"about_ca_system_score_codex":0.008830069,"about_ca_system_score_gemma":0.0066199284,"threshold_uncertainty_score":0.950139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012656787,0.028512297,0.82607085,0.008899877,0.0024406172,0.00008278356,0.0006675732,0.0004637406,0.12020556],"genre_scores_gemma":[0.39016163,0.044705786,0.4045734,0.0013184692,0.0019559674,0.00023775159,0.0012123897,0.0003448619,0.15548968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.00015040197,0.000016669072,0.0001008004,0.00026177193,0.00007331839],"domain_scores_gemma":[0.9991774,0.00039376883,0.00004480233,0.00004964305,0.00026823804,0.000066197455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009357794,0.001153948,0.00069182104,0.00064078183,0.0005402742,0.001514477,0.00083278894,0.0011605175,0.0075709256],"category_scores_gemma":[0.002057259,0.00031204472,0.00057598256,0.002569973,0.0012952745,0.00062584603,0.0012698802,0.00231305,0.0020596422],"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.0001415845,0.0000985056,0.0011569724,0.0006453,0.0000733818,0.00043896429,0.0003259288,0.38575575,0.0036339636,0.27586755,0.10189448,0.22996765],"study_design_scores_gemma":[0.000020232863,0.000064750966,0.00080891786,0.00013745637,0.000023858538,0.00013513946,0.00010184241,0.7841372,0.0011445477,0.113661155,0.099721014,0.000043906723],"about_ca_topic_score_codex":0.06536752,"about_ca_topic_score_gemma":0.06741678,"teacher_disagreement_score":0.06536752,"about_ca_system_score_codex":0.002136707,"about_ca_system_score_gemma":0.003352373,"threshold_uncertainty_score":0.12997407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020284816,0.0068026534,0.9150241,0.001505207,0.0006389295,0.00010958549,0.0003600974,0.00061382813,0.07291714],"genre_scores_gemma":[0.13248311,0.007993114,0.78225553,0.0004610705,0.00047141203,0.00051981705,0.0007703844,0.00067265896,0.07437296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920493,0.00020773464,0.000029870695,0.000098011755,0.0003937981,0.00006569651],"domain_scores_gemma":[0.9992605,0.00029709013,0.00004137269,0.00010000906,0.00024082436,0.000060239287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013970155,0.0018802143,0.0009914865,0.0011953999,0.0007019747,0.0020923316,0.0016508288,0.0010281007,0.014192239],"category_scores_gemma":[0.0026332764,0.0005025084,0.0009371212,0.0015446953,0.0010974638,0.00071331224,0.0020796699,0.0023816354,0.0039744894],"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.00007426996,0.00007609876,0.00048939564,0.00051894377,0.000107905114,0.00017541458,0.00014865266,0.21661045,0.002218105,0.55432194,0.040249623,0.18500918],"study_design_scores_gemma":[0.000048145022,0.00003998258,0.00033617165,0.00021252559,0.000045794815,0.000116004994,0.00005289537,0.5355438,0.0013999555,0.31683773,0.14533684,0.000030114195],"about_ca_topic_score_codex":0.025277657,"about_ca_topic_score_gemma":0.036827907,"teacher_disagreement_score":0.025277657,"about_ca_system_score_codex":0.003196645,"about_ca_system_score_gemma":0.0036626102,"threshold_uncertainty_score":0.05026102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006314329,0.00018048832,0.98421115,0.0006825982,0.000055169017,0.000047824466,0.000117864074,0.000098058146,0.008292418],"genre_scores_gemma":[0.30309674,0.00088742527,0.66831106,0.0010118365,0.00026058772,0.00051918346,0.0007860416,0.0002825973,0.024844611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839526,0.00091730535,0.00004707367,0.00027588295,0.00025164743,0.00011283322],"domain_scores_gemma":[0.9970278,0.002064047,0.00021844519,0.0003386806,0.0002181966,0.00013274995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00229682,0.0011610886,0.0009042684,0.0005498999,0.00045358308,0.0015019308,0.0011262756,0.0010275925,0.008515574],"category_scores_gemma":[0.00539249,0.0005671302,0.00080457184,0.0011524777,0.0010899942,0.0028579687,0.0014230831,0.0022486986,0.0010853698],"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.000120603356,0.00018142058,0.00044846005,0.00025989095,0.00006353932,0.0001550181,0.00015077964,0.3157025,0.0015615877,0.5917662,0.010392367,0.07919765],"study_design_scores_gemma":[0.000024109306,0.000056047422,0.00010947493,0.000025924186,0.000008770518,0.00009244968,0.00005401771,0.63621545,0.00076849805,0.3554501,0.007180898,0.0000143360685],"about_ca_topic_score_codex":0.0009326195,"about_ca_topic_score_gemma":0.001551689,"teacher_disagreement_score":0.008515574,"about_ca_system_score_codex":0.00094297575,"about_ca_system_score_gemma":0.0008960267,"threshold_uncertainty_score":0.028487384},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022234386,0.0053501255,0.0010326784,0.008294042,0.0012803043,0.00006245262,0.029884007,0.0005208345,0.9513522],"genre_scores_gemma":[0.00829622,0.0028646507,0.0009805121,0.001337991,0.000062797364,0.000027277943,0.005735449,0.00020808038,0.9804869],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994209,0.00003185846,0.000020100048,0.00015507433,0.0002502767,0.0001217788],"domain_scores_gemma":[0.9988985,0.00009837439,0.000049674793,0.00009273449,0.0006698699,0.00019091081],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029323608,0.00085511367,0.0006895662,0.0013225469,0.0032977972,0.0037157922,0.0013270318,0.0015748416,0.5412903],"category_scores_gemma":[0.0014010866,0.00041353895,0.00039058283,0.0028108682,0.00070984795,0.0016069096,0.0016318586,0.0014376875,0.23819818],"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.00025468032,0.000041402982,0.0022229452,0.00044914964,0.000029032679,0.00063100684,0.0003293808,0.00041519766,0.0010184147,0.055863556,0.75948536,0.1792598],"study_design_scores_gemma":[0.000013621314,0.0000048001634,0.0016325616,0.00007815445,0.0000043818336,0.00009291548,0.00020879424,0.000116343566,0.00023092513,0.002314745,0.9952923,0.00001038283],"about_ca_topic_score_codex":0.56674147,"about_ca_topic_score_gemma":0.75186527,"teacher_disagreement_score":0.56674147,"about_ca_system_score_codex":0.008287329,"about_ca_system_score_gemma":0.010040593,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6387663,0.0006258969,0.34810534,0.00049642066,0.000022568858,0.00006598654,0.00029911456,0.00027611307,0.011342324],"genre_scores_gemma":[0.9917361,0.00011593506,0.0073643704,0.000014934895,0.0000040179743,0.000046585523,0.00009357903,0.00004277844,0.0005816955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885607,0.00055315916,0.00003802135,0.0001582832,0.0002416677,0.00015276294],"domain_scores_gemma":[0.9825844,0.014523129,0.0010221465,0.0011838847,0.0005795025,0.00010698164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036378598,0.00070589554,0.00070589985,0.00086458016,0.00031361496,0.0012838049,0.001149893,0.0010375095,0.0016885832],"category_scores_gemma":[0.03107414,0.00069375127,0.00091297424,0.00096953847,0.0011035374,0.0020449385,0.0011558881,0.0019084703,0.00015880511],"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.00019393997,0.000107919754,0.0016054111,0.000100720725,0.00004388286,0.00009478923,0.0001284469,0.9669329,0.0035047329,0.008209613,0.00029515257,0.018782444],"study_design_scores_gemma":[0.000006674552,0.00008518619,0.0021893228,0.000022090402,0.000026848187,0.000055984183,0.000061178696,0.99043894,0.002303943,0.0045444923,0.00024174018,0.000023443772],"about_ca_topic_score_codex":0.0021416426,"about_ca_topic_score_gemma":0.0015413985,"teacher_disagreement_score":0.0036378598,"about_ca_system_score_codex":0.000392614,"about_ca_system_score_gemma":0.0009328573,"threshold_uncertainty_score":0.019239128},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035538582,0.0036712782,0.00019068448,0.014127478,0.98114806,0.000012029686,0.00005579759,0.000041556737,0.00071760133],"genre_scores_gemma":[0.0002619481,0.002282442,0.0000809575,0.0034981999,0.9908817,0.000008554555,0.00002396061,0.000028584942,0.0029336808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961578,0.0005146372,0.00050876575,0.0007595893,0.0017327686,0.00032638057],"domain_scores_gemma":[0.97735536,0.008272717,0.0017599533,0.00060040486,0.0088173235,0.0031941207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052331067,0.0051675057,0.0055844807,0.0043206536,0.0022690583,0.009304372,0.003421917,0.009785677,0.024881672],"category_scores_gemma":[0.024342857,0.0012625686,0.0034778505,0.0015435669,0.0020069813,0.0041109305,0.0012248678,0.014049557,0.01441542],"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.00006739503,0.000016984433,0.00003101491,0.00024902783,0.00003043427,0.000067682806,0.0000059985464,0.000055640387,0.000108498156,0.00038856053,0.9950771,0.0039018064],"study_design_scores_gemma":[0.00016887096,0.00011296286,0.0006438754,0.0005840598,0.00016070438,0.00048563688,0.0000410744,0.0007137093,0.00041174667,0.002851996,0.99378705,0.00003826095],"about_ca_topic_score_codex":0.0007732895,"about_ca_topic_score_gemma":0.0019663293,"teacher_disagreement_score":0.024881672,"about_ca_system_score_codex":0.0022345337,"about_ca_system_score_gemma":0.0021465672,"threshold_uncertainty_score":0.08323747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033989854,0.00009552464,0.9937144,0.000037300408,0.000015978194,0.0000317608,0.000011983183,0.00005781091,0.0026363044],"genre_scores_gemma":[0.384724,0.00070149056,0.6025746,0.0001140387,0.00008252775,0.00039043155,0.00013212053,0.00024150561,0.011039345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991798,0.00022381853,0.000036720485,0.00014295126,0.00034534495,0.000071445604],"domain_scores_gemma":[0.998784,0.00069866865,0.0000978614,0.00013315814,0.00023660959,0.000049698763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012175356,0.0008585905,0.0010693235,0.0009315415,0.0005475448,0.00089835655,0.001142078,0.0007302333,0.0047084596],"category_scores_gemma":[0.0035702495,0.0004219997,0.0012186301,0.00047712924,0.0015937863,0.0017265264,0.0023521765,0.0020551484,0.00064175273],"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.00008926542,0.000041745472,0.0003366879,0.00016775314,0.000030019572,0.000054391916,0.00027820433,0.68162805,0.0073318332,0.23612747,0.00092856406,0.07298608],"study_design_scores_gemma":[0.000011198603,0.000041215415,0.000045769342,0.000016599355,0.0000047148665,0.00001553493,0.000025350852,0.96102196,0.0010557296,0.035444014,0.0023082807,0.000009509398],"about_ca_topic_score_codex":0.0044706054,"about_ca_topic_score_gemma":0.0030058045,"teacher_disagreement_score":0.0047084596,"about_ca_system_score_codex":0.0011385091,"about_ca_system_score_gemma":0.0008863934,"threshold_uncertainty_score":0.015751421},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017589944,0.000941196,0.9626375,0.0016859442,0.00016711441,0.00006037057,0.00014828959,0.00030352274,0.032297187],"genre_scores_gemma":[0.29986396,0.006345127,0.6448471,0.0020014471,0.0012625436,0.00075680553,0.0014111205,0.00061882345,0.0428931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772733,0.00081652385,0.00010656707,0.00039195124,0.00081732863,0.00014025382],"domain_scores_gemma":[0.99624276,0.002204023,0.00019156617,0.0006980627,0.0005269219,0.00013671594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021313378,0.0012918635,0.0010825904,0.001154026,0.0008182821,0.003482645,0.0019835501,0.0016131295,0.013674087],"category_scores_gemma":[0.00758625,0.0004634572,0.001356108,0.0013389011,0.0033061774,0.0032180732,0.0033856444,0.003885019,0.0038066437],"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.000010360286,0.000026424046,0.0001928116,0.00017716587,0.000030822626,0.000042761276,0.00007248815,0.030009627,0.0003226484,0.9217501,0.0064372458,0.040927667],"study_design_scores_gemma":[0.000008370237,0.000018104713,0.000055293636,0.000048653343,0.000007435929,0.000032920816,0.000022461885,0.12117627,0.0003142616,0.8594681,0.018840378,0.000007776876],"about_ca_topic_score_codex":0.0009940781,"about_ca_topic_score_gemma":0.000877024,"teacher_disagreement_score":0.013674087,"about_ca_system_score_codex":0.0019315454,"about_ca_system_score_gemma":0.0020248313,"threshold_uncertainty_score":0.04574436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03668015,0.00045462715,0.9569243,0.00014720736,0.00004523139,0.00003860947,0.000028412938,0.0002608764,0.0054206285],"genre_scores_gemma":[0.6559062,0.00050585717,0.33990273,0.00014043823,0.000051214352,0.00010873401,0.000096719625,0.00028718653,0.0030009716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999579,0.00013622094,0.000020410385,0.000050250095,0.00016157597,0.000052583404],"domain_scores_gemma":[0.9994246,0.00026808295,0.0000694381,0.000087147986,0.000110049135,0.000040624203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890839,0.00060883677,0.00053666753,0.00042887637,0.00046690417,0.00090604497,0.00070698815,0.0005080282,0.0015067051],"category_scores_gemma":[0.0024694274,0.00021688707,0.00040461894,0.0005464486,0.0006759768,0.0010381172,0.0010400059,0.000708179,0.0004852081],"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.00019256194,0.00011459843,0.0013782863,0.00017121916,0.000043458927,0.00013383661,0.00024222989,0.8170401,0.019465558,0.062871866,0.0013054449,0.09704078],"study_design_scores_gemma":[0.000009700057,0.000051903167,0.0001173364,0.00001085692,0.000006085652,0.000018915078,0.000040124374,0.9861391,0.0036330912,0.008617703,0.0013476749,0.000007524063],"about_ca_topic_score_codex":0.0022637858,"about_ca_topic_score_gemma":0.0025108198,"teacher_disagreement_score":0.0022637858,"about_ca_system_score_codex":0.0005214546,"about_ca_system_score_gemma":0.0006594911,"threshold_uncertainty_score":0.005040467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013714671,0.000017271388,0.99755114,0.000028896642,0.000012505334,0.000025883324,0.000009737817,0.00010674292,0.00087633333],"genre_scores_gemma":[0.0720687,0.000075790216,0.9243973,0.000054584234,0.000023774464,0.00031648058,0.00009919131,0.00015009912,0.002814049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957293,0.00011870402,0.000017803844,0.00006640833,0.00017585728,0.000048277994],"domain_scores_gemma":[0.999471,0.00022398627,0.000058329202,0.00005249701,0.00016155867,0.000032605643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548723,0.0009180016,0.0013534263,0.00062725024,0.00051260076,0.00077917415,0.0015131788,0.0009986789,0.0053047678],"category_scores_gemma":[0.00211243,0.00047719068,0.00063012575,0.00069549325,0.0009352276,0.0007815213,0.0015676969,0.0020352374,0.0012830213],"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.00012553259,0.00010152887,0.00039819218,0.00021785178,0.00003590215,0.00015702083,0.00014498802,0.7193177,0.0070864256,0.104483224,0.0034397226,0.1644919],"study_design_scores_gemma":[0.00002128744,0.000026260821,0.000028291193,0.000008483125,0.0000038443322,0.00002607438,0.000008236835,0.98897344,0.0013212739,0.00812411,0.001451397,0.0000073671613],"about_ca_topic_score_codex":0.0025475044,"about_ca_topic_score_gemma":0.0023645982,"teacher_disagreement_score":0.0053047678,"about_ca_system_score_codex":0.0005763057,"about_ca_system_score_gemma":0.0022707172,"threshold_uncertainty_score":0.01774615},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012897353,0.0016787575,0.5621287,0.0004296498,0.0014174111,0.00016697386,0.0005395346,0.0015354798,0.4192062],"genre_scores_gemma":[0.22677757,0.003854867,0.43299735,0.0010227895,0.00078621734,0.0005069104,0.0019397995,0.0028016071,0.32931295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918383,0.00012897121,0.00005640926,0.0001503732,0.00038825738,0.00009206859],"domain_scores_gemma":[0.9993781,0.00014599167,0.00005458047,0.00019288568,0.00017839878,0.00005011003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010636,0.00082954735,0.0011679166,0.0020978595,0.0013186384,0.002117981,0.0012458895,0.0008197637,0.03780098],"category_scores_gemma":[0.002743053,0.00061280833,0.0008737589,0.001939605,0.0018210193,0.0025369448,0.0016964693,0.002556232,0.014985405],"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.000035732402,0.00002491856,0.00010435973,0.000110968256,0.000012841847,0.000059918293,0.00007119607,0.003165844,0.001011034,0.8722902,0.022450551,0.10066248],"study_design_scores_gemma":[0.000023858702,0.00003839318,0.00019980209,0.000055758384,0.000014363061,0.00025586804,0.000051467556,0.010146392,0.0034029775,0.89600325,0.08977679,0.000031104675],"about_ca_topic_score_codex":0.00044862277,"about_ca_topic_score_gemma":0.00080773945,"teacher_disagreement_score":0.03780098,"about_ca_system_score_codex":0.00053322833,"about_ca_system_score_gemma":0.0009124229,"threshold_uncertainty_score":0.12645686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012184365,0.105927706,0.27479815,0.0039268686,0.007186496,0.00014100257,0.0044559627,0.0031832154,0.59916216],"genre_scores_gemma":[0.023163447,0.16100486,0.23137996,0.0037294913,0.007981847,0.0006025833,0.008226901,0.0035877659,0.5603232],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950886,0.000046841244,0.00003123676,0.00006675769,0.00032351608,0.000022798293],"domain_scores_gemma":[0.9990067,0.00050345284,0.00004487742,0.00012665532,0.00026413755,0.00005418389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561904,0.0017443765,0.0016037937,0.0017384777,0.0005704108,0.0023087172,0.001286763,0.00092687394,0.064263366],"category_scores_gemma":[0.0018520084,0.0009092491,0.0006837418,0.0050595715,0.0008217393,0.002410387,0.0008163607,0.0042026825,0.035294443],"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.000018318351,0.000077955476,0.00005634319,0.00081624417,0.000018423963,0.000033201646,0.00004882006,0.007383198,0.00087906414,0.13076764,0.62521076,0.23468998],"study_design_scores_gemma":[0.000013418752,0.000024661687,0.00028305777,0.00025470523,0.000011933053,0.00023154735,0.000020162463,0.008382971,0.0004594201,0.12470052,0.8655884,0.00002922114],"about_ca_topic_score_codex":0.0011666329,"about_ca_topic_score_gemma":0.003468038,"teacher_disagreement_score":0.064263366,"about_ca_system_score_codex":0.0008523494,"about_ca_system_score_gemma":0.0018727784,"threshold_uncertainty_score":0.21498239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009274447,0.09269828,0.074646555,0.027348824,0.005129313,0.000065121625,0.0010063343,0.0015690136,0.788262],"genre_scores_gemma":[0.42610067,0.11768167,0.076424696,0.018206071,0.017313529,0.0006134456,0.0016441019,0.002730997,0.33928484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816567,0.00044607633,0.000082242426,0.00034957015,0.0007931819,0.00016324694],"domain_scores_gemma":[0.9954834,0.0030610305,0.00018812151,0.0006426063,0.00047493522,0.00015000631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013346588,0.0016891942,0.0010371958,0.0018220545,0.0015919063,0.005860411,0.0012090909,0.0011229562,0.031323373],"category_scores_gemma":[0.01248566,0.0006550052,0.00077385746,0.0030242126,0.004220491,0.014725335,0.002570054,0.006311433,0.013887554],"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.000042026022,0.000027827564,0.00015588079,0.00030874996,0.000013429096,0.00007822108,0.00024321905,0.0007737226,0.0002709015,0.88119626,0.0662091,0.050680585],"study_design_scores_gemma":[0.000018003882,0.000012042821,0.00021690014,0.00010916767,0.000009328255,0.00017756592,0.00005092489,0.00097316696,0.00025374984,0.876973,0.12119313,0.000013041727],"about_ca_topic_score_codex":0.0010761935,"about_ca_topic_score_gemma":0.0007800934,"teacher_disagreement_score":0.031323373,"about_ca_system_score_codex":0.0036120897,"about_ca_system_score_gemma":0.0009992269,"threshold_uncertainty_score":0.10478711},"labels":[],"label_agreement":null}]}