{"meta":{"query_hash":"29c566451c22","filters":{"venue":"Journal of Optimization Theory and Applications"},"cohort_total":119,"direct_labels_cover":0,"predictions_cover":119,"exported":119,"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/29c566451c22","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Optimization+Theory+and+Applications"},"results":[{"id":"W108851041","doi":"10.1023/a:1004622313930","title":"A Class of Learning/Estimation Algorithms Using Nominal Values: Asymptotic Analysis and Applications","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Control Systems and Identification","field":"Engineering","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","funders":"","keywords":"Convergence (economics); Stochastic approximation; Rate of convergence; Nonlinear system; Fault detection and isolation; Computer science; Algorithm; Kernel (algebra); Process (computing); Class (philosophy); Fault (geology); Mathematics; Applied mathematics; Artificial intelligence; Key (lock)","score_opus":0.005151857398619779,"score_gpt":0.2262133565244078,"score_spread":0.221061499125788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108851041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004909335,0.0006461316,0.992498,0.00013326076,0.000050549894,0.000035978297,0.000037346133,0.00013702753,0.001552319],"genre_scores_gemma":[0.44785994,0.0047251247,0.53903604,0.0004660227,0.00081646873,0.0004623626,0.00051349524,0.00028895197,0.0058315787],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974234,0.00082743994,0.00020072132,0.00051644316,0.00089784275,0.00013422755],"domain_scores_gemma":[0.98958147,0.0066166217,0.00090570166,0.001085822,0.0016214263,0.00018889921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005662488,0.0012660802,0.0016648546,0.0016885849,0.00069987687,0.0021137362,0.0020246133,0.0018884446,0.0021090354],"category_scores_gemma":[0.022767615,0.00058455043,0.0013804258,0.0017147583,0.0017775664,0.0030770132,0.0018693508,0.0026377474,0.0007945498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031049686,0.00024099986,0.0018865601,0.00055004534,0.00021546887,0.00014846545,0.00016047103,0.36204627,0.0041751387,0.17767687,0.0038677005,0.4487215],"study_design_scores_gemma":[0.00001967186,0.00012812944,0.00042494605,0.00004274834,0.000024782947,0.00012698692,0.000020747271,0.9421321,0.0012033721,0.053957157,0.0019001429,0.000019263998],"about_ca_topic_score_codex":0.0009973191,"about_ca_topic_score_gemma":0.00052722887,"teacher_disagreement_score":0.005662488,"about_ca_system_score_codex":0.00074775424,"about_ca_system_score_gemma":0.001224295,"threshold_uncertainty_score":0.029946446},"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":"W13220323","doi":"10.1023/a:1017543626630","title":"Some Predictor-Corrector Algorithms for Multivalued Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Theory of computation; Convergence (economics); Predictor–corrector method; Operator (biology); Class (philosophy); Algorithm; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.020403023285981526,"score_gpt":0.2790420760848995,"score_spread":0.25863905279891797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13220323","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.0032673408,0.00067231414,0.9931751,0.0004181917,0.00017161816,0.000039262344,0.000052377283,0.00015959422,0.0020442898],"genre_scores_gemma":[0.19664733,0.0019299224,0.7791367,0.00053099595,0.0006304807,0.00046447787,0.00038166557,0.00043105695,0.019847445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868125,0.0006313189,0.000080243524,0.0001696191,0.00031517318,0.00012245621],"domain_scores_gemma":[0.9947653,0.0038389047,0.00018641603,0.00029020148,0.00075901404,0.00016012025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057251737,0.0016713445,0.001903802,0.0010693229,0.0011329883,0.00209225,0.0026597802,0.0026765894,0.0078724595],"category_scores_gemma":[0.015959818,0.0013309092,0.0013453189,0.0013889703,0.002103501,0.0029939287,0.0026247692,0.00558754,0.0009919013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003808796,0.00021137658,0.0009572198,0.00037870818,0.00016619221,0.00011399916,0.00024447087,0.33810404,0.0024198222,0.44614673,0.007587654,0.20328896],"study_design_scores_gemma":[0.000026904128,0.00002760886,0.000071792594,0.000028295299,0.000019352332,0.000014888183,0.0000101968535,0.9385425,0.0006410119,0.059338644,0.0012653174,0.000013588643],"about_ca_topic_score_codex":0.006194868,"about_ca_topic_score_gemma":0.007536662,"teacher_disagreement_score":0.0078724595,"about_ca_system_score_codex":0.0015205931,"about_ca_system_score_gemma":0.0025868411,"threshold_uncertainty_score":0.030277967},"labels":[],"label_agreement":null},{"id":"W135291411","doi":"10.1023/a:1004603023018","title":"Unbiased Estimates of Circle Parameters","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Nonlinear system; Noise (video); Arc length; Theory of computation; Arc (geometry); Applied mathematics; Set (abstract data type); RADIUS; Unbiased Estimation; Unit circle; Algorithm; Mathematical analysis; Mathematical optimization; Statistics; Geometry; Computer science","score_opus":0.005505320253797789,"score_gpt":0.23601720153866404,"score_spread":0.23051188128486624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135291411","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.009735808,0.0005268717,0.98733085,0.00014291091,0.00004658845,0.000019465719,0.0001269668,0.00040997588,0.0016605235],"genre_scores_gemma":[0.3628894,0.0015194138,0.6257651,0.00024671212,0.0003129435,0.0002020233,0.0013969917,0.00052613247,0.007141272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746954,0.0008218167,0.00012005552,0.0006149079,0.0008028673,0.00017073374],"domain_scores_gemma":[0.9904882,0.0042366483,0.0008212644,0.0019359874,0.002321568,0.00019632284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024379778,0.0012326227,0.0014315587,0.0029354822,0.0007709761,0.0023849676,0.0011391699,0.0020512366,0.0032977862],"category_scores_gemma":[0.026661329,0.0016235149,0.00075726985,0.0015918866,0.0010988242,0.0033871718,0.0026911537,0.0021451693,0.0033238602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007282135,0.00013867456,0.006893765,0.00036936282,0.00041942555,0.00015569534,0.00029337252,0.26109654,0.045678694,0.13972922,0.011076528,0.53342044],"study_design_scores_gemma":[0.00005017437,0.000072278584,0.004382514,0.000088566274,0.00008254915,0.00029746545,0.0000634004,0.8831243,0.027090611,0.076223396,0.008444911,0.00007972003],"about_ca_topic_score_codex":0.0016212866,"about_ca_topic_score_gemma":0.0028342041,"teacher_disagreement_score":0.0032977862,"about_ca_system_score_codex":0.0007322043,"about_ca_system_score_gemma":0.001500044,"threshold_uncertainty_score":0.012893438},"labels":[],"label_agreement":null},{"id":"W140476297","doi":"10.1023/a:1020836221527","title":"Radial Solutions and Orthogonal Trajectories in Multiobjective Global Optimization","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Karush–Kuhn–Tucker conditions; Vector optimization; Theory of computation; Nonlinear programming; Mathematical optimization; Nonlinear system; Lagrange multiplier; Applied mathematics; Pareto principle; Set (abstract data type); Optimization problem; Multi-objective optimization; Computer science; Algorithm","score_opus":0.012555732355580673,"score_gpt":0.25020690630586456,"score_spread":0.2376511739502839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140476297","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.018862665,0.0011530895,0.97354174,0.00040180353,0.00008923842,0.000036321595,0.000024545083,0.000051018273,0.005839676],"genre_scores_gemma":[0.58379245,0.0031259076,0.39740893,0.00025387845,0.00018084896,0.00033067874,0.00014198708,0.00021078034,0.014554503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.0004964501,0.00003210369,0.00006527976,0.00014924812,0.000039441624],"domain_scores_gemma":[0.9971079,0.0019603588,0.00027751853,0.00009882025,0.00045419743,0.00010113563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035866858,0.0011485465,0.00094205077,0.0011304849,0.00065161375,0.0011688626,0.0010455258,0.0017185048,0.00220363],"category_scores_gemma":[0.011791392,0.0007008901,0.0006311481,0.001245495,0.0018202715,0.0026251127,0.0018947772,0.0015406257,0.00034138944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092164926,0.00003300274,0.00023397016,0.00012372459,0.000027420338,0.000050908504,0.00012751661,0.67684186,0.0007801534,0.29125404,0.0010332654,0.02940197],"study_design_scores_gemma":[0.000009580492,0.000035751455,0.00004728987,0.000018475248,0.000006007647,0.000013782941,0.00002928414,0.89787674,0.00015931939,0.10093331,0.00086138834,0.000009109829],"about_ca_topic_score_codex":0.0024090756,"about_ca_topic_score_gemma":0.0015582399,"teacher_disagreement_score":0.0035866858,"about_ca_system_score_codex":0.0009439528,"about_ca_system_score_gemma":0.0008841859,"threshold_uncertainty_score":0.018968403},"labels":[],"label_agreement":null},{"id":"W1504470592","doi":"10.1023/a:1004674330768","title":"Quasi-P*-Maps, P(τ, α, β)-Maps, Exceptional Family of Elements, and Complementarity Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Mathematics and Applications","field":"Mathematics","cited_by":34,"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; Mixed complementarity problem; Complementarity (molecular biology); Theory of computation; Complementarity theory; Nonlinear complementarity problem; Nonlinear system; Pure mathematics; Applied mathematics; Algorithm","score_opus":0.03204118252148728,"score_gpt":0.3056292706500901,"score_spread":0.2735880881286028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504470592","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.62132335,0.0030780795,0.29137915,0.0053166393,0.00029960804,0.000038085553,0.00014411163,0.0001326639,0.07828834],"genre_scores_gemma":[0.9669512,0.0011640369,0.02015273,0.00025157555,0.00024776097,0.00005717718,0.00009177356,0.000035506862,0.011048363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961334,0.00013145257,0.00001713939,0.00007465581,0.000086767504,0.00007662465],"domain_scores_gemma":[0.99761474,0.0013304914,0.00024281473,0.00010081533,0.0002718452,0.00043927852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016082037,0.00038426352,0.0006573284,0.0016614326,0.0023672972,0.0022784274,0.0006623315,0.0011737976,0.0027708113],"category_scores_gemma":[0.0042704684,0.00035312757,0.0005724639,0.0009484455,0.0037680028,0.00460885,0.0018291449,0.0020130523,0.00014196393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019057545,0.000014172902,0.00021820731,0.000013791507,0.000005981118,0.000046581998,0.00007326769,0.0008967585,0.00023448636,0.9961301,0.00039980627,0.0019477764],"study_design_scores_gemma":[0.0000054431116,0.000010208405,0.00016586059,0.000005648908,0.0000028736688,0.000066116816,0.00006188325,0.004850431,0.0001177058,0.9939786,0.00073041883,0.000004774104],"about_ca_topic_score_codex":0.0011118704,"about_ca_topic_score_gemma":0.0009298393,"teacher_disagreement_score":0.0027708113,"about_ca_system_score_codex":0.0011036099,"about_ca_system_score_gemma":0.0008793339,"threshold_uncertainty_score":0.009269297},"labels":[],"label_agreement":null},{"id":"W1571504332","doi":"10.1023/a:1015360805050","title":"Dynamical Systems with Multiple Time-Varying Delays: Stability and Stabilizability","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","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":"Robustness (evolution); Control theory (sociology); Mathematics; Bounded function; Norm (philosophy); Stability (learning theory); Class (philosophy); Dynamical systems theory; Applied mathematics; Computer science; Control (management); Mathematical analysis; Physics; Artificial intelligence","score_opus":0.00898347345075405,"score_gpt":0.19014555029254673,"score_spread":0.1811620768417927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571504332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12000697,0.002839437,0.8682466,0.0007413259,0.0002506037,0.000047537655,0.000123917,0.00015561435,0.007588115],"genre_scores_gemma":[0.98185873,0.0014033753,0.013218993,0.000044339053,0.00019946345,0.000059632748,0.00004405589,0.000017023589,0.0031544354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965835,0.00006145842,0.000025880378,0.00011128046,0.00011045376,0.000032608277],"domain_scores_gemma":[0.9981646,0.0010036152,0.00043578906,0.00009340027,0.000250597,0.000052087405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005457147,0.0008653257,0.0008263068,0.0004790974,0.0005829561,0.0014566081,0.00055140624,0.00096537085,0.0017210732],"category_scores_gemma":[0.003717037,0.0003441761,0.00038480165,0.00070618745,0.0010236538,0.001666507,0.0011743982,0.0010080525,0.00020001002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005459598,0.00012205174,0.001428342,0.00037834593,0.00016759004,0.00093158387,0.00031883415,0.6352551,0.023744334,0.27076232,0.0011056545,0.06523985],"study_design_scores_gemma":[0.00005892617,0.00019922815,0.00071680796,0.000019849636,0.0000489061,0.00020301309,0.000058203623,0.92670923,0.0028897724,0.06767686,0.0013894414,0.000029744882],"about_ca_topic_score_codex":0.0009752352,"about_ca_topic_score_gemma":0.0009138824,"teacher_disagreement_score":0.0017210732,"about_ca_system_score_codex":0.00042077733,"about_ca_system_score_gemma":0.0005215339,"threshold_uncertainty_score":0.0057575703},"labels":[],"label_agreement":null},{"id":"W1575435306","doi":"10.1023/a:1017547630113","title":"Cooperative Advertising in a Marketing Channel","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":155,"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":"Goodwill; Stackelberg competition; Business; Marginal cost; Channel (broadcasting); Promotion (chess); Microeconomics; Advertising; Stock (firearms); Marketing channel; Marketing; Industrial organization; Economics; Computer science; Finance; Telecommunications","score_opus":0.010973885275678927,"score_gpt":0.24323485580837695,"score_spread":0.232260970532698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575435306","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.6426917,0.0007840511,0.2634979,0.0032907017,0.0002743677,0.00013763903,0.00012908046,0.000543276,0.08865148],"genre_scores_gemma":[0.98036516,0.00018313462,0.0067701205,0.00009076444,0.00009520209,0.000022803028,0.00001617552,0.000027538406,0.012429074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986499,0.00050596386,0.00004043623,0.00023424097,0.00023995186,0.0003294003],"domain_scores_gemma":[0.99122095,0.0060555376,0.00047942248,0.0006064052,0.00092410925,0.0007134809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017512068,0.0005568274,0.0014222054,0.0014156266,0.0020317342,0.004011945,0.0012346931,0.0024440528,0.009298395],"category_scores_gemma":[0.008458726,0.0010490433,0.00083346176,0.0014132014,0.0023187404,0.0042596017,0.0018782013,0.0014361948,0.0009952855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006591169,0.0008634757,0.0031224142,0.00015759493,0.000083917184,0.0008987751,0.00092155905,0.14585271,0.007555851,0.7961679,0.0071215923,0.036595028],"study_design_scores_gemma":[0.00011991656,0.00019372007,0.0013103321,0.00002524297,0.00014666613,0.00037506875,0.0002978912,0.7526701,0.0013635391,0.23992907,0.0034975442,0.0000709834],"about_ca_topic_score_codex":0.0036910868,"about_ca_topic_score_gemma":0.003967569,"teacher_disagreement_score":0.009298395,"about_ca_system_score_codex":0.0015261314,"about_ca_system_score_gemma":0.0012421878,"threshold_uncertainty_score":0.031106174},"labels":[],"label_agreement":null},{"id":"W160223189","doi":"10.1023/a:1016087702231","title":"Estimation of Circle Parameters by Centroiding","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","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":"Royal Military College of Canada","funders":"","keywords":"Estimator; Theory of computation; Mathematics; Arc (geometry); Noise (video); RADIUS; Algorithm; Arc length; Set (abstract data type); Outlier; Applied mathematics; Mathematical optimization; Computer science; Statistics; Geometry; Artificial intelligence; Image (mathematics)","score_opus":0.006333910256015525,"score_gpt":0.22047353897596317,"score_spread":0.21413962871994766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160223189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011530062,0.00050229934,0.9859648,0.000062814615,0.000055081415,0.000027929798,0.000041401203,0.0011261605,0.00068946724],"genre_scores_gemma":[0.20480528,0.000624474,0.79178387,0.000043623488,0.000095850606,0.000082786224,0.0002909464,0.00046393846,0.0018092482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834514,0.00038590076,0.000081903716,0.0004590679,0.0005841809,0.00014380239],"domain_scores_gemma":[0.99683666,0.00096694456,0.00041638844,0.00068826927,0.0009710467,0.000120614684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012864353,0.0013060606,0.0023056495,0.0027927002,0.0011632706,0.0015307778,0.0017640801,0.0018694095,0.002947561],"category_scores_gemma":[0.00896061,0.0010071842,0.0008684505,0.0032508376,0.000886252,0.0028257915,0.0018755659,0.0015792518,0.0029521063],"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.00071370904,0.00010305573,0.0026963728,0.0002128878,0.00013597286,0.00012968956,0.000273817,0.07067144,0.06507766,0.008739549,0.00520099,0.8460449],"study_design_scores_gemma":[0.0000753714,0.00017646837,0.00483822,0.000047413316,0.00009460897,0.000565833,0.00013698082,0.89267,0.07877346,0.010913901,0.011584231,0.00012353442],"about_ca_topic_score_codex":0.0056076804,"about_ca_topic_score_gemma":0.0043585775,"teacher_disagreement_score":0.0056076804,"about_ca_system_score_codex":0.00071340124,"about_ca_system_score_gemma":0.0013403996,"threshold_uncertainty_score":0.011150122},"labels":[],"label_agreement":null},{"id":"W1964713924","doi":"10.1007/s10957-010-9668-3","title":"Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":72,"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":"Integer (computer science); Mathematics; Integer programming; Infimum and supremum; Polynomial; Parametric statistics; Bilevel optimization; Mathematical optimization; Theory of computation; Logarithm; Discrete mathematics; Algorithm; Optimization problem; Computer science; Statistics","score_opus":0.040927593523935275,"score_gpt":0.3582411616101763,"score_spread":0.317313568086241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964713924","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.0024745213,0.00007565664,0.99515116,0.00011210935,0.00001663908,0.000028086177,0.000028773122,0.00031259167,0.0018003632],"genre_scores_gemma":[0.13404587,0.00021010476,0.8627109,0.00011977849,0.000036809302,0.0002513795,0.00021145778,0.00017507194,0.0022386438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999035,0.00032948583,0.00005578195,0.000177434,0.0002502817,0.00015205609],"domain_scores_gemma":[0.9984743,0.0008941771,0.00014266041,0.00023979896,0.00018597164,0.00006310668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012432317,0.001109881,0.001260257,0.00067235314,0.0005461151,0.001807332,0.0017253944,0.0012581635,0.0047839778],"category_scores_gemma":[0.005885843,0.00051557843,0.000808461,0.0012274852,0.00074764993,0.0020178987,0.0019942713,0.0030281716,0.0014169322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014079358,0.00017444447,0.0005275182,0.0001720337,0.000060952374,0.0001448303,0.00017122121,0.658384,0.0022121535,0.114519976,0.0039013145,0.2195907],"study_design_scores_gemma":[0.000019866675,0.00003120597,0.000027304803,0.000012074387,0.0000063050566,0.000043987457,0.000018222585,0.9591542,0.0006319225,0.037654273,0.0023934871,0.00000717088],"about_ca_topic_score_codex":0.0009610526,"about_ca_topic_score_gemma":0.0011162327,"teacher_disagreement_score":0.0047839778,"about_ca_system_score_codex":0.0007241312,"about_ca_system_score_gemma":0.0014158834,"threshold_uncertainty_score":0.016004026},"labels":[],"label_agreement":null},{"id":"W1967756118","doi":"10.1007/s10957-004-0943-z","title":"Analysis of Random Restart and Iterated Improvement for Global Optimization with Application to the Traveling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Acadia University","funders":"","keywords":"Travelling salesman problem; Mathematics; Iterated function; Theory of computation; A priori and a posteriori; Convergence (economics); Speedup; Mathematical optimization; Combinatorics; Rate of convergence; Applied mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.007913086695719185,"score_gpt":0.2766126644019262,"score_spread":0.26869957770620706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967756118","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.05928116,0.0046111187,0.91701573,0.0005479911,0.00015671575,0.00015696151,0.000045306722,0.00046640603,0.01771854],"genre_scores_gemma":[0.8206485,0.0017405871,0.16881144,0.00021598059,0.00025855337,0.00025381983,0.000100416364,0.00053660735,0.007434041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979504,0.001058936,0.00006806961,0.00019601663,0.00049546664,0.0002311875],"domain_scores_gemma":[0.98196685,0.014918365,0.0008280771,0.0006566328,0.0013882414,0.0002419136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00669921,0.0016706215,0.002391674,0.0019233045,0.0008871112,0.0018303223,0.0027372842,0.0019170109,0.003836888],"category_scores_gemma":[0.021149961,0.00082268065,0.0019421135,0.0013583933,0.0020098027,0.0029842856,0.0015074628,0.0020783907,0.00029994643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017350008,0.00011201772,0.00058031484,0.00015548115,0.0001156975,0.000104479324,0.00008945809,0.9041658,0.00070720207,0.06735164,0.0012073157,0.025237134],"study_design_scores_gemma":[0.0000061842943,0.00003090694,0.00008747379,0.0000065058184,0.000018420524,0.000012047122,0.000006019567,0.9954217,0.00010634951,0.0041347565,0.00016505762,0.000004691666],"about_ca_topic_score_codex":0.0048472127,"about_ca_topic_score_gemma":0.0039303023,"teacher_disagreement_score":0.00669921,"about_ca_system_score_codex":0.0018161503,"about_ca_system_score_gemma":0.0019785753,"threshold_uncertainty_score":0.03542918},"labels":[],"label_agreement":null},{"id":"W1968081969","doi":"10.1007/s10957-006-9086-8","title":"Equilibrium Investment Strategies in Foreign Environmental Projects","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Theory of computation; Differential game; Joint (building); Time horizon; Kyoto Protocol; Operations research; Horizon; Investment (military); Mathematical economics; Computer science; Game theory; Mathematical optimization; Microeconomics; Business; Economics; Mathematics; Engineering; Climate change","score_opus":0.029048460622455644,"score_gpt":0.22712714585553212,"score_spread":0.19807868523307648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968081969","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.8354641,0.00063625304,0.08068533,0.0042203115,0.00007752006,0.00011357206,0.00046394905,0.00017316664,0.078165814],"genre_scores_gemma":[0.9746821,0.0004219741,0.005223521,0.00009614854,0.000022073895,0.0000743193,0.0001116033,0.000038116963,0.019330095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.00026084518,0.00002389058,0.000059792987,0.000048643586,0.00014773918],"domain_scores_gemma":[0.9973163,0.001765386,0.00031365769,0.00007672327,0.00024015304,0.00028779803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019102314,0.00063429895,0.001025828,0.00091408007,0.000750206,0.0037595495,0.0009422554,0.0028173926,0.013109484],"category_scores_gemma":[0.0089549925,0.0009368963,0.0008199965,0.0009887768,0.0010988263,0.0033838267,0.0010221623,0.0015580368,0.00076361204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003075372,0.00013604689,0.0037506386,0.0000920908,0.000076042576,0.00036884163,0.0002859122,0.49503338,0.0010917479,0.48315406,0.0030890554,0.0126145575],"study_design_scores_gemma":[0.00015729632,0.00015264071,0.0027645435,0.00007042701,0.00007236517,0.0001419626,0.00079486275,0.6419631,0.0009482401,0.34980154,0.0030821967,0.000050866438],"about_ca_topic_score_codex":0.0075659114,"about_ca_topic_score_gemma":0.007030346,"teacher_disagreement_score":0.013109484,"about_ca_system_score_codex":0.0027849264,"about_ca_system_score_gemma":0.0016612667,"threshold_uncertainty_score":0.043855548},"labels":[],"label_agreement":null},{"id":"W1969251391","doi":"10.1007/s10957-007-9252-7","title":"An Algorithm for Portfolio Optimization with Variable Transaction Costs, Part 1: Theory","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of Waterloo","funders":"","keywords":"Transaction cost; Mathematical optimization; Portfolio optimization; Portfolio; Optimization problem; Key (lock); Computer science; Function (biology); Variable (mathematics); Sequence (biology); Merton's portfolio problem; Heuristics; Reduction (mathematics); Mathematics; Economics; Replicating portfolio; Finance","score_opus":0.009780566260296204,"score_gpt":0.2266601281063399,"score_spread":0.2168795618460437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969251391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026493059,0.0002750286,0.99523515,0.00014635049,0.00005019033,0.000035327354,0.000021912527,0.00012132338,0.0014654504],"genre_scores_gemma":[0.06689386,0.0005065172,0.92865586,0.0001680222,0.00011720771,0.00030014903,0.00011835025,0.0001626354,0.00307733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989901,0.00042571305,0.00007139888,0.00016323818,0.00027108914,0.00007840347],"domain_scores_gemma":[0.9971301,0.001988827,0.00012665853,0.00030255993,0.0003682233,0.00008361883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973669,0.0010895883,0.0016069026,0.001016521,0.000803014,0.0017389421,0.002152188,0.002528867,0.0055097835],"category_scores_gemma":[0.008124263,0.00078596175,0.0009943983,0.0020999429,0.0010622233,0.003263493,0.0023367684,0.0024243838,0.0011778818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019625129,0.00016875466,0.00074796146,0.00018279841,0.00010851036,0.00007729199,0.00013140966,0.48167312,0.0017986547,0.16112904,0.006798988,0.34698713],"study_design_scores_gemma":[0.000055727443,0.00003509494,0.00008300285,0.000019576431,0.000015784713,0.000049999897,0.000006672931,0.9316337,0.0003380432,0.06612089,0.0016332966,0.000008190329],"about_ca_topic_score_codex":0.0014722042,"about_ca_topic_score_gemma":0.0014274842,"teacher_disagreement_score":0.0055097835,"about_ca_system_score_codex":0.00088920566,"about_ca_system_score_gemma":0.001606619,"threshold_uncertainty_score":0.01843208},"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":"W1973799058","doi":"10.1007/s10957-007-9263-4","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Mathematics; Branch and cut; Bilevel optimization; Linear programming; Algorithm; Integer programming; Theory of computation; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Optimization problem; Computer science","score_opus":0.011174452599283177,"score_gpt":0.2768035725164913,"score_spread":0.2656291199172081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973799058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025322915,0.00024033905,0.99456364,0.00013697203,0.00010212373,0.00005237653,0.000055046352,0.00047576652,0.0018415138],"genre_scores_gemma":[0.03781828,0.00022282281,0.95776993,0.00012785246,0.000092367925,0.00025060863,0.0002843589,0.0003318314,0.0031018588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.00027615146,0.000058003192,0.00013687096,0.00039311993,0.00009372429],"domain_scores_gemma":[0.9985051,0.0007542033,0.00007002623,0.00012880901,0.0004310315,0.00011085113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017340719,0.0017405289,0.003278204,0.0017588774,0.001101937,0.0022460844,0.0024663224,0.002894373,0.009772832],"category_scores_gemma":[0.004286913,0.0015511955,0.0011056666,0.00260859,0.00095009257,0.0026050678,0.0027267286,0.0041346415,0.0017198381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046033153,0.000458022,0.00055415253,0.00035030898,0.00017657901,0.00012666966,0.00011848003,0.37055394,0.0036693392,0.058670834,0.015098293,0.5497631],"study_design_scores_gemma":[0.00007211687,0.000038458664,0.000046112076,0.000018010229,0.000016145083,0.000028271661,0.000009559443,0.9813033,0.0005293069,0.015638271,0.002290407,0.000010078783],"about_ca_topic_score_codex":0.003200371,"about_ca_topic_score_gemma":0.0051524686,"teacher_disagreement_score":0.009772832,"about_ca_system_score_codex":0.00097130996,"about_ca_system_score_gemma":0.0023121212,"threshold_uncertainty_score":0.032693386},"labels":[],"label_agreement":null},{"id":"W1975919871","doi":"10.1007/s10957-005-6538-5","title":"On Stability and Stabilizability of Singular Stochastic Systems with Delays","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":105,"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; Impulse (physics); Theory of computation; Control theory (sociology); Stability (learning theory); Full state feedback; Class (philosophy); Applied mathematics; Control (management); Computer science; Algorithm","score_opus":0.006176934297306274,"score_gpt":0.1997355901681808,"score_spread":0.1935586558708745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975919871","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.16619898,0.0017690596,0.8178302,0.0010244165,0.00020250193,0.00007478995,0.00017648896,0.0001620025,0.012561593],"genre_scores_gemma":[0.989251,0.0010110866,0.006414382,0.00007248399,0.0001430496,0.000050184262,0.00008843915,0.0000347789,0.0029346251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993223,0.00017304883,0.000050878883,0.00015539567,0.00020584736,0.000092601986],"domain_scores_gemma":[0.9953576,0.0032769875,0.0005035139,0.0001657184,0.0005779085,0.00011837895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016400253,0.0011376912,0.0011766175,0.0010242772,0.000655433,0.0017837002,0.0007755417,0.00082433526,0.0023866983],"category_scores_gemma":[0.0081574675,0.00036466672,0.00073497026,0.00094082736,0.0024759055,0.0016157697,0.0014213976,0.0011236309,0.00016271112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035598103,0.000039089653,0.0005179271,0.00018971392,0.0001165591,0.00022076293,0.00025330906,0.76176304,0.008016108,0.21482894,0.0006175834,0.013080921],"study_design_scores_gemma":[0.000022277849,0.000087725166,0.00027260493,0.000014324167,0.00002479438,0.00003111398,0.000038298927,0.8979482,0.0011663995,0.099941,0.0004359847,0.000017214757],"about_ca_topic_score_codex":0.0040299296,"about_ca_topic_score_gemma":0.002127388,"teacher_disagreement_score":0.0040299296,"about_ca_system_score_codex":0.001229205,"about_ca_system_score_gemma":0.0010663733,"threshold_uncertainty_score":0.008918583},"labels":[],"label_agreement":null},{"id":"W1975965350","doi":"10.1007/s10957-013-0433-2","title":"Research and Development with Stock-Dependent Spillovers and Price Competition in a Duopoly","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","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":"HEC Montréal","funders":"","keywords":"Microeconomics; Economics; Stock (firearms); Duopoly; Observability; Industrial organization; Nash equilibrium; Converse; Cournot competition; Mathematics","score_opus":0.025649659467147565,"score_gpt":0.2486700278748607,"score_spread":0.22302036840771314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975965350","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.79196423,0.020930143,0.07435151,0.009144658,0.000243572,0.00006252405,0.00012256182,0.000038484588,0.10314229],"genre_scores_gemma":[0.9830951,0.0049013807,0.0051704403,0.00019122203,0.00011648817,0.0000073267247,0.000028612367,0.000004462161,0.006484941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972147,0.00010928955,0.000016829192,0.00006405634,0.00004081454,0.000047619156],"domain_scores_gemma":[0.9976495,0.0015195501,0.00025876262,0.00013027816,0.00024773384,0.00019418611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011032237,0.00031523005,0.0005647848,0.00056269864,0.00051488075,0.0025893657,0.00067836145,0.001016752,0.0032300963],"category_scores_gemma":[0.0037454257,0.00028292064,0.000695717,0.0009412456,0.0010726434,0.0032324076,0.00095924776,0.0010752344,0.00016547281],"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.000109411245,0.00036962732,0.011660115,0.00033904935,0.0001579566,0.0011535442,0.00038488433,0.058267422,0.0020570906,0.8805758,0.002649657,0.04227544],"study_design_scores_gemma":[0.00006352128,0.00026084637,0.011490821,0.00018876583,0.00018255046,0.00082160276,0.0013310176,0.31567395,0.0020185588,0.6511168,0.01679468,0.000056816752],"about_ca_topic_score_codex":0.0060186046,"about_ca_topic_score_gemma":0.004286781,"teacher_disagreement_score":0.0060186046,"about_ca_system_score_codex":0.00094837096,"about_ca_system_score_gemma":0.0013250319,"threshold_uncertainty_score":0.011967182},"labels":[],"label_agreement":null},{"id":"W1979042447","doi":"10.1007/s10957-009-9536-1","title":"Social Relationship and Transactional Marketing Policies—Maximizing Customer Lifetime Value","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Customer Service Quality and Loyalty","field":"Business, Management and Accounting","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":"Athabasca University","funders":"","keywords":"Customer lifetime value; Value (mathematics); Marketing; Mathematics; Relationship marketing; Theory of computation; Transactional leadership; Customer value; Social marketing; Business; Microeconomics; Loyalty business model; Economics; Marketing management; Statistics; Management; Algorithm","score_opus":0.017282108911749007,"score_gpt":0.26932700625420275,"score_spread":0.2520448973424537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979042447","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.5634241,0.0021750226,0.3886743,0.006073616,0.00017096444,0.00015805537,0.00015174136,0.0001714196,0.03900088],"genre_scores_gemma":[0.99184656,0.00034042817,0.005059651,0.00009494667,0.00006311754,0.000022964105,0.000015413341,0.000019823461,0.0025369858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890816,0.00068052625,0.000028098908,0.000102099235,0.00011206694,0.00016904071],"domain_scores_gemma":[0.9962069,0.0024321408,0.0004523749,0.00018705204,0.00035517034,0.00036631676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020604793,0.00066699914,0.0008656836,0.0006496118,0.0006200602,0.0020658623,0.0009768626,0.0017211443,0.004130385],"category_scores_gemma":[0.007618805,0.00037469968,0.0003451349,0.00084777054,0.0011738613,0.0033518632,0.00092514645,0.00095371803,0.0003182619],"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.00065792387,0.00062768994,0.005156655,0.00026057273,0.00019978159,0.0001670322,0.00027648848,0.46328115,0.004779788,0.4534956,0.004440514,0.066656716],"study_design_scores_gemma":[0.000057410245,0.00032627548,0.0020943247,0.0000517402,0.00007987242,0.00011008916,0.00027604765,0.7818666,0.0013265283,0.21148239,0.0022990636,0.00002964253],"about_ca_topic_score_codex":0.00088627514,"about_ca_topic_score_gemma":0.0010629836,"teacher_disagreement_score":0.004130385,"about_ca_system_score_codex":0.001761489,"about_ca_system_score_gemma":0.0012487402,"threshold_uncertainty_score":0.013817549},"labels":[],"label_agreement":null},{"id":"W1979589904","doi":"10.1007/s10957-006-9140-6","title":"Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Hausdorff space; Convexity; Saddle point; Lagrangian; Vector optimization; Applied mathematics; Mathematical optimization; Optimization problem; Pure mathematics","score_opus":0.006239397431636806,"score_gpt":0.21845180230667405,"score_spread":0.21221240487503723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979589904","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.06615396,0.009217179,0.7657149,0.010889069,0.0012911706,0.000107505286,0.0007172178,0.00016725832,0.14574184],"genre_scores_gemma":[0.7630847,0.009523273,0.15326086,0.0019860838,0.0029093095,0.0004664191,0.0005511369,0.00028262835,0.06793551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986052,0.000548883,0.00006122721,0.00013605371,0.0005245291,0.00012420304],"domain_scores_gemma":[0.9965612,0.002120577,0.0003138866,0.0002649656,0.00052667124,0.00021266071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037224744,0.001381293,0.0013688488,0.00276194,0.0013685126,0.0035883663,0.002103588,0.002029789,0.008405777],"category_scores_gemma":[0.01125372,0.00065929594,0.001701069,0.002001779,0.0037221138,0.005794681,0.0033348396,0.0049363244,0.00081613514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013713536,0.0000054659595,0.000042104202,0.000033584212,0.000011101769,0.000014149173,0.00003152151,0.0026911134,0.00014754524,0.99328893,0.0009816628,0.0027391273],"study_design_scores_gemma":[0.000014570353,0.000007066886,0.00011631237,0.000011833057,0.0000060356706,0.00003929395,0.00001779961,0.023943515,0.00007813454,0.9733132,0.0024427806,0.000009439177],"about_ca_topic_score_codex":0.0023065293,"about_ca_topic_score_gemma":0.0021343923,"teacher_disagreement_score":0.008405777,"about_ca_system_score_codex":0.0023243078,"about_ca_system_score_gemma":0.0017081471,"threshold_uncertainty_score":0.0281201},"labels":[],"label_agreement":null},{"id":"W1981779786","doi":"10.1007/s10957-009-9511-x","title":"Coordination of Advertising Strategies in a Fashion Licensing Contract","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Licensee; Business; Incentive; Product (mathematics); Renting; Advertising; Product line; Process (computing); Industrial organization; Computer science; Commerce; License; Microeconomics; Economics; Mathematics; Law","score_opus":0.01046858329820695,"score_gpt":0.23649766515874246,"score_spread":0.2260290818605355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981779786","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.6297826,0.00047835973,0.31237,0.0030363856,0.00011783629,0.0004471804,0.00036969394,0.00031720742,0.05308071],"genre_scores_gemma":[0.9816545,0.000120756355,0.009998517,0.000073262556,0.000033996836,0.00007795747,0.0000588985,0.000029603289,0.007952477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965575,0.0016250612,0.00023534054,0.00047104683,0.00045177518,0.00065932045],"domain_scores_gemma":[0.9728655,0.019835653,0.002677082,0.0013463295,0.0012416862,0.0020336763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061358963,0.0009121169,0.003126116,0.001386973,0.0012074773,0.0051775044,0.0028726454,0.0047845496,0.010249985],"category_scores_gemma":[0.030614128,0.0015644758,0.0011390971,0.0016160073,0.002173346,0.004711419,0.002224392,0.0023396048,0.0007417603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013633376,0.00074525457,0.0037611292,0.0001883431,0.00017171155,0.00078107335,0.0006456736,0.40836582,0.0061625885,0.54238576,0.0037545834,0.031674758],"study_design_scores_gemma":[0.00030998248,0.00027732775,0.0014925398,0.000026674252,0.00007350108,0.0001441265,0.0002821206,0.7827099,0.00079406076,0.21250176,0.0013267209,0.00006126703],"about_ca_topic_score_codex":0.0042526843,"about_ca_topic_score_gemma":0.0028049094,"teacher_disagreement_score":0.010249985,"about_ca_system_score_codex":0.0034670527,"about_ca_system_score_gemma":0.0038929232,"threshold_uncertainty_score":0.0342896},"labels":[],"label_agreement":null},{"id":"W1982355939","doi":"10.1007/s10957-015-0716-x","title":"On the Existence of Minimizers of Proximity Functions for Split Feasibility Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"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":"Dual polyhedron; Mathematics; Regular polygon; Mathematical optimization; Inverse problem; Convex function; Point (geometry); Function (biology); Inverse; Applied mathematics; Mathematical analysis; Combinatorics; Geometry","score_opus":0.04676003462394457,"score_gpt":0.27819052789319826,"score_spread":0.2314304932692537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982355939","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.17132275,0.0020581444,0.7977977,0.002419966,0.000090848436,0.00031085117,0.00026188875,0.00013882633,0.025599005],"genre_scores_gemma":[0.7258295,0.0036351308,0.25566444,0.00058922486,0.00036475525,0.0010091944,0.00072431745,0.00041301173,0.011770346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968725,0.0018268934,0.00015502803,0.00044887137,0.00045038885,0.00024633892],"domain_scores_gemma":[0.96541446,0.02894961,0.0016256168,0.00064062694,0.0020747406,0.0012949749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009064378,0.0023670034,0.0034109908,0.0030851394,0.0016063956,0.0043631196,0.0018441288,0.0027779606,0.006742907],"category_scores_gemma":[0.051445182,0.0020992456,0.0024691147,0.0018878145,0.004769232,0.0074724676,0.007362883,0.006943937,0.0005864808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005379654,0.00026181183,0.0014255581,0.0008040129,0.0001836052,0.00030847843,0.0017399851,0.09357656,0.006297342,0.8619958,0.0032998372,0.029569045],"study_design_scores_gemma":[0.00008790649,0.00034724188,0.0008369079,0.00021656047,0.00007904303,0.00024785177,0.0006141145,0.37190503,0.0018285669,0.62090373,0.0028636954,0.00006934426],"about_ca_topic_score_codex":0.00086216157,"about_ca_topic_score_gemma":0.00059409055,"teacher_disagreement_score":0.009064378,"about_ca_system_score_codex":0.001628348,"about_ca_system_score_gemma":0.0014727161,"threshold_uncertainty_score":0.047937572},"labels":[],"label_agreement":null},{"id":"W1983447810","doi":"10.1007/s10957-007-9289-7","title":"R&D Equilibrium Strategies with Surfers","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Subgame perfect equilibrium; Cournot competition; Competitor analysis; Nash equilibrium; Microeconomics; Mathematical economics; Game theory; Economics; Industrial organization; Business; Marketing","score_opus":0.01779247636883217,"score_gpt":0.23155545214493944,"score_spread":0.21376297577610728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983447810","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.31504363,0.000629958,0.59658426,0.002434718,0.00009178474,0.00023163315,0.00038098035,0.0006894769,0.08391355],"genre_scores_gemma":[0.9051515,0.00030434967,0.044810567,0.00019062571,0.000047408153,0.00013944106,0.000110638,0.00008271733,0.049162854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887615,0.0004275959,0.000066721856,0.00026171858,0.00014513834,0.00022262773],"domain_scores_gemma":[0.99705577,0.001745005,0.00034471796,0.00029859695,0.00026803018,0.0002878897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018394048,0.0008190782,0.0011943392,0.0010119173,0.00081678014,0.0040753195,0.0017402223,0.0031150915,0.017249713],"category_scores_gemma":[0.009361625,0.00069110136,0.0010288806,0.0010665801,0.0014021938,0.0050835568,0.002739558,0.0011560307,0.0025855077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005728089,0.00018434391,0.003067211,0.00017588945,0.00010889545,0.0007098793,0.00046002964,0.1509717,0.0054339212,0.749627,0.006267759,0.08242051],"study_design_scores_gemma":[0.00014340684,0.00025016177,0.00070412277,0.000040964795,0.000050851908,0.00029090876,0.00044626283,0.48437753,0.0023542338,0.50588495,0.0054086945,0.000048024827],"about_ca_topic_score_codex":0.0015443234,"about_ca_topic_score_gemma":0.0009304642,"teacher_disagreement_score":0.017249713,"about_ca_system_score_codex":0.0009458019,"about_ca_system_score_gemma":0.0009381674,"threshold_uncertainty_score":0.057706},"labels":[],"label_agreement":null},{"id":"W1983925543","doi":"10.1007/s10957-012-0159-6","title":"The Chebyshev–Shamanskii Method for Solving Systems of Nonlinear Equations","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Iterative Methods for Nonlinear Equations","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Chebyshev filter; Jacobian matrix and determinant; Chebyshev iteration; Chebyshev equation; Chebyshev nodes; Applied mathematics; Chebyshev polynomials; Nonlinear system; Convergence (economics); Mathematics; Equioscillation theorem; Quintic function; Chebyshev pseudospectral method; Process (computing); Focus (optics); Mathematical optimization; Computer science; Mathematical analysis; Orthogonal polynomials; Classical orthogonal polynomials; Physics; Gegenbauer polynomials","score_opus":0.06274660337622259,"score_gpt":0.4000703358602336,"score_spread":0.33732373248401104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983925543","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.006647288,0.0017068619,0.9816545,0.0004493364,0.0002850519,0.000070227565,0.000063085005,0.00007085691,0.009052843],"genre_scores_gemma":[0.24496016,0.0035347969,0.7205102,0.0005148416,0.00050625874,0.00054805883,0.00026754115,0.00029341507,0.028864818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994789,0.00021005259,0.000027772843,0.000045372588,0.0002033245,0.000034668843],"domain_scores_gemma":[0.9990206,0.0005725146,0.000060921375,0.00007490341,0.00022683268,0.00004413039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015324507,0.00082662655,0.001174202,0.00085299043,0.00086096796,0.00096424116,0.001295821,0.001844285,0.002812019],"category_scores_gemma":[0.0036873536,0.00044856136,0.0009097825,0.0011872624,0.0017950867,0.0012164522,0.0015705789,0.003120998,0.0008049694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015899456,0.00012517726,0.00069626246,0.0006637434,0.00015007255,0.0001376619,0.0002883992,0.42654598,0.00977788,0.45131737,0.0062303175,0.10390807],"study_design_scores_gemma":[0.000017226628,0.000017633145,0.00012102399,0.000023575803,0.000009944037,0.000031069532,0.000013636276,0.9474666,0.00068795774,0.04753074,0.0040588365,0.00002168341],"about_ca_topic_score_codex":0.0071553593,"about_ca_topic_score_gemma":0.0060934857,"teacher_disagreement_score":0.0071553593,"about_ca_system_score_codex":0.0009250578,"about_ca_system_score_gemma":0.0028746652,"threshold_uncertainty_score":0.01422739},"labels":[],"label_agreement":null},{"id":"W1987426864","doi":"10.1007/s10957-008-9431-1","title":"Quasiconvex Minimization on a Locally Finite Union of Convex Sets","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Victoria","funders":"","keywords":"Quasiconvex function; Mathematics; Theory of computation; Bilevel optimization; Banach space; Mathematical optimization; Subderivative; Convex optimization; Convex function; Regular polygon; Convex analysis; Finite set; Optimization problem; Pure mathematics; Mathematical analysis; Algorithm","score_opus":0.012378892796792258,"score_gpt":0.24132721737783436,"score_spread":0.2289483245810421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987426864","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.074572206,0.00063784193,0.9159615,0.0009295356,0.000062284795,0.000043139717,0.00016413929,0.00012048906,0.0075088916],"genre_scores_gemma":[0.62986684,0.0010694559,0.3418815,0.00034287595,0.00028551233,0.00039955767,0.0007665544,0.0004904305,0.024897294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973109,0.0010414778,0.0001568194,0.00062720315,0.0006991223,0.00016461058],"domain_scores_gemma":[0.9880642,0.008771102,0.0009748094,0.00057873403,0.00074811233,0.00086303026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004435725,0.0013248124,0.00311876,0.0021051883,0.0014740342,0.0046840957,0.0027045542,0.0023113778,0.0037889404],"category_scores_gemma":[0.014452361,0.0016581994,0.0018966356,0.0014283173,0.003692983,0.0061048716,0.004979866,0.004045917,0.00048470142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016612091,0.00012154662,0.0008602289,0.00032729714,0.00019064937,0.00036179653,0.00053265336,0.16735518,0.0065102074,0.8087507,0.0018089317,0.013014611],"study_design_scores_gemma":[0.00001843366,0.000075985175,0.00043953513,0.00004728581,0.000035136043,0.00017328792,0.00013589271,0.7251899,0.0014135877,0.27090964,0.001540652,0.000020650765],"about_ca_topic_score_codex":0.00151009,"about_ca_topic_score_gemma":0.0013477433,"teacher_disagreement_score":0.0046840957,"about_ca_system_score_codex":0.002034851,"about_ca_system_score_gemma":0.00095127313,"threshold_uncertainty_score":0.0234586},"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":"W1990402864","doi":"10.1007/s10957-013-0493-3","title":"Enhanced Karush–Kuhn–Tucker Conditions for Mathematical Programs with Equilibrium Constraints","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":40,"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","keywords":"Theory of computation; Normality; Mathematics; Constraint (computer-aided design); Mathematical optimization; Karush–Kuhn–Tucker conditions; Applied mathematics; Stationary point; Function (biology); Mathematical economics; Mathematical analysis; Algorithm; Statistics; Geometry","score_opus":0.008820990722988718,"score_gpt":0.24866347583770362,"score_spread":0.2398424851147149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990402864","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.0398398,0.0007719383,0.9212121,0.0012538958,0.00019653475,0.00016378459,0.00034579248,0.00018031946,0.0360358],"genre_scores_gemma":[0.7266133,0.0016964664,0.23177859,0.00064140145,0.0004594334,0.0009061671,0.0006460025,0.0005085731,0.03675015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980872,0.00079415727,0.00009730463,0.00026960252,0.00047191256,0.00027976697],"domain_scores_gemma":[0.9941439,0.0040474157,0.00047271996,0.0002769079,0.00077647634,0.0002825723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044630063,0.0017691919,0.0022808188,0.0022016303,0.0010841618,0.0030198263,0.0027630173,0.0025495212,0.01577686],"category_scores_gemma":[0.014213524,0.0011444417,0.0014335247,0.0016789105,0.0026983863,0.006512326,0.003073562,0.0044675106,0.0013036559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110737536,0.000099277364,0.00013688848,0.00016704359,0.000028457935,0.00013956868,0.000181964,0.10315103,0.0019505791,0.88172245,0.0026777158,0.009634202],"study_design_scores_gemma":[0.00006126144,0.00004786641,0.00016564521,0.000044874098,0.000019730007,0.000044697023,0.000047978243,0.5444847,0.0011880711,0.4516509,0.0022036112,0.000040718685],"about_ca_topic_score_codex":0.0029538316,"about_ca_topic_score_gemma":0.0031938644,"teacher_disagreement_score":0.01577686,"about_ca_system_score_codex":0.0022997952,"about_ca_system_score_gemma":0.0027315372,"threshold_uncertainty_score":0.0527789},"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":"W1994134237","doi":"10.1007/s10957-012-0190-7","title":"Study of Limit Cycles and Stability Analysis of Fractional Arneodo Oscillator","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Fractional Differential Equations Solutions","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":"Mathematics; Limit (mathematics); Stability (learning theory); Limit cycle; Reliability (semiconductor); Range (aeronautics); Oscillation (cell signaling); Theory of computation; Focus (optics); Parametric statistics; Describing function; Function (biology); Applied mathematics; Amplitude; Numerical analysis; Mathematical analysis; Nonlinear system; Statistics; Computer science; Physics; Algorithm; Power (physics)","score_opus":0.059066596651597934,"score_gpt":0.3435511104868124,"score_spread":0.2844845138352145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994134237","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.5929935,0.0053010597,0.349092,0.0017811453,0.00037163918,0.00007776886,0.00012152717,0.00009216153,0.050169315],"genre_scores_gemma":[0.9805951,0.00083768135,0.009498807,0.00007730337,0.000109308996,0.000045096633,0.000038530437,0.00003356117,0.008764592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986494,0.000047332036,0.000006405963,0.00003388386,0.000025435505,0.000022004264],"domain_scores_gemma":[0.99959844,0.00017341622,0.000068730806,0.000023639197,0.0000756792,0.00006012958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055873976,0.0005690866,0.0007936587,0.0012307778,0.0009134362,0.0013039501,0.00078649784,0.00086401164,0.0027397939],"category_scores_gemma":[0.0025017443,0.00028872368,0.00086827675,0.0004655154,0.0013058075,0.0011048939,0.0010421978,0.00072103867,0.00013735333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008228774,0.00004936198,0.001563297,0.00013730714,0.00008908583,0.00037408047,0.00035206115,0.08166893,0.007656548,0.89660484,0.0010159289,0.010406229],"study_design_scores_gemma":[0.000018149984,0.00005355875,0.00073408213,0.000026037336,0.000028921862,0.0001721512,0.00011507796,0.75668746,0.00082649046,0.23939712,0.0019151091,0.000025841242],"about_ca_topic_score_codex":0.0015881942,"about_ca_topic_score_gemma":0.0008844581,"teacher_disagreement_score":0.0027397939,"about_ca_system_score_codex":0.00068098446,"about_ca_system_score_gemma":0.0005825384,"threshold_uncertainty_score":0.009165525},"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":"W1997539213","doi":"10.1007/s10957-006-9029-4","title":"Optimization Techniques for State-Constrained Control and Obstacle Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"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":"Hamilton–Jacobi–Bellman equation; Minimax; Mathematical optimization; Reachability; Duality (order theory); Bellman equation; Mathematics; State (computer science); Variational inequality; Obstacle; Dynamic programming; Optimal control; Class (philosophy); Computer science; Law; Algorithm","score_opus":0.004767419257291239,"score_gpt":0.22288228959033604,"score_spread":0.2181148703330448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997539213","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.001337311,0.001197878,0.9937698,0.00020931836,0.000093205585,0.000020906129,0.000027051214,0.000057019406,0.0032874953],"genre_scores_gemma":[0.22783944,0.006885225,0.73439085,0.00051245635,0.0006924415,0.0006363503,0.00038416436,0.0006304614,0.02802865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.00022860507,0.00004057849,0.00008882144,0.0002277377,0.000049222715],"domain_scores_gemma":[0.9990915,0.0005710181,0.00008088388,0.0000561804,0.0001601944,0.00004025395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503366,0.0015663585,0.001991665,0.0016033296,0.0007394006,0.0014794349,0.0019041797,0.0016269857,0.0031852361],"category_scores_gemma":[0.003982896,0.00094088155,0.0014480567,0.0017895126,0.0015186121,0.0019866393,0.002744855,0.0031448577,0.000645425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080658014,0.00010460473,0.00023799707,0.00045617958,0.00014396409,0.000067508525,0.0001448666,0.47660044,0.0030860489,0.401125,0.0047791144,0.11317359],"study_design_scores_gemma":[0.000011816101,0.000017571334,0.00007500595,0.000026910368,0.000017230766,0.000015613668,0.000013415266,0.8992137,0.0003131276,0.09667166,0.0036137896,0.000010213526],"about_ca_topic_score_codex":0.005642211,"about_ca_topic_score_gemma":0.0048869057,"teacher_disagreement_score":0.005642211,"about_ca_system_score_codex":0.0009731227,"about_ca_system_score_gemma":0.001520129,"threshold_uncertainty_score":0.011218727},"labels":[],"label_agreement":null},{"id":"W2000277859","doi":"10.1007/s10957-014-0623-6","title":"S-adapted Equilibria in Games Played Over Event Trees with Coupled Constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"HEC Montréal","funders":"","keywords":"Mathematical economics; Uniqueness; Simple (philosophy); Event (particle physics); Constraint (computer-aided design); Class (philosophy); Mathematics; Node (physics); Game theory; Equilibrium selection; Sample (material); Best response; Mathematical optimization; Repeated game; Computer science; Artificial intelligence","score_opus":0.009688673372311603,"score_gpt":0.21168001357188934,"score_spread":0.20199134019957773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000277859","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.32530397,0.00038011718,0.6386321,0.0020662916,0.000115086266,0.00020325958,0.0003963041,0.00035988973,0.032542948],"genre_scores_gemma":[0.95948815,0.0002881995,0.027873514,0.00032025448,0.00006479181,0.00018706985,0.00018812594,0.00010185885,0.011488119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981553,0.0008835084,0.00012384601,0.00029254347,0.00020989709,0.00033486917],"domain_scores_gemma":[0.9872824,0.0091898525,0.001253888,0.00050011295,0.00060908747,0.0011646493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028365366,0.0010430083,0.0020703645,0.0012239798,0.0009804402,0.0034177355,0.0020433385,0.0029694468,0.009885809],"category_scores_gemma":[0.019164719,0.0010775534,0.0017087449,0.0011352737,0.0025507512,0.0041617537,0.0036249026,0.0027308215,0.0007341506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017818046,0.0000957643,0.0008096107,0.00008385394,0.00007894202,0.00026890822,0.00024363298,0.09157776,0.0013305228,0.8977088,0.0014181467,0.006205823],"study_design_scores_gemma":[0.00007266788,0.000071159266,0.00030332906,0.000022665612,0.00002033698,0.000060585968,0.00010214337,0.34833848,0.00019512362,0.65033185,0.00045759193,0.000024119368],"about_ca_topic_score_codex":0.002736536,"about_ca_topic_score_gemma":0.00274199,"teacher_disagreement_score":0.009885809,"about_ca_system_score_codex":0.0017224696,"about_ca_system_score_gemma":0.0014967888,"threshold_uncertainty_score":0.03307134},"labels":[],"label_agreement":null},{"id":"W2006609776","doi":"10.1007/s10957-005-2098-y","title":"Approximate Maximum Likelihood Estimation of Circle Parameters","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Estimator; Upper and lower bounds; Applied mathematics; Cramér–Rao bound; Maximum likelihood sequence estimation; Theory of computation; Estimation theory; Nonlinear system; Maximum likelihood; Algorithm; Mathematical optimization; Mathematical analysis; Statistics","score_opus":0.005287962378319345,"score_gpt":0.2358070412351026,"score_spread":0.23051907885678324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006609776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060184193,0.00015857905,0.99298733,0.00007092533,0.000010316332,0.0000090275635,0.000035329547,0.0002962299,0.00041383997],"genre_scores_gemma":[0.3495528,0.00044546762,0.64583206,0.00009282311,0.000085975815,0.00012811775,0.0006241068,0.00036558037,0.002873085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988361,0.0005401593,0.000048256163,0.00021114826,0.00028138192,0.00008300295],"domain_scores_gemma":[0.99351513,0.004256195,0.00042290092,0.0009639846,0.00071503065,0.00012679698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016964242,0.0008728664,0.0017867236,0.0013318165,0.0005283137,0.0020005181,0.0016499708,0.00207589,0.0024779143],"category_scores_gemma":[0.020792589,0.0013291282,0.0008521045,0.0014445295,0.0010109633,0.0027384078,0.001977109,0.0015658432,0.0019581516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059902325,0.0000998773,0.0018086623,0.000265198,0.00013666015,0.00016521093,0.00023263128,0.71185493,0.012619035,0.043323036,0.0038173732,0.22507834],"study_design_scores_gemma":[0.000013766819,0.000011710063,0.00027030153,0.000008416467,0.0000075253433,0.000047512043,0.000011604107,0.98388785,0.0018456561,0.013309462,0.0005752835,0.000010905522],"about_ca_topic_score_codex":0.0024762282,"about_ca_topic_score_gemma":0.0024436924,"teacher_disagreement_score":0.0024779143,"about_ca_system_score_codex":0.00072370487,"about_ca_system_score_gemma":0.0011163519,"threshold_uncertainty_score":0.0089716315},"labels":[],"label_agreement":null},{"id":"W2008340888","doi":"10.1007/s10957-009-9550-3","title":"Guaranteed Cost Control for Uncertain Neutral Stochastic Systems via Dynamic Output Feedback Controllers","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Theory of computation; Control theory (sociology); Bounded function; Linear matrix inequality; Bellman equation; Upper and lower bounds; Norm (philosophy); Mathematical optimization; Stochastic control; Output feedback; Control (management); Optimal control; Computer science","score_opus":0.007015884263474808,"score_gpt":0.22976114917180018,"score_spread":0.22274526490832539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008340888","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.04421492,0.0003546516,0.9495792,0.000300137,0.00011278724,0.000040932515,0.000056993296,0.00025623917,0.005084187],"genre_scores_gemma":[0.9861021,0.00014077476,0.011723095,0.000051762367,0.00004570405,0.00006420544,0.00003820414,0.000026781789,0.0018073606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929976,0.00020252044,0.00003921682,0.00011948262,0.00022836095,0.000110715904],"domain_scores_gemma":[0.99890804,0.00053072727,0.00021925385,0.000059048365,0.00023639921,0.000046622536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013112937,0.0013480071,0.0011874988,0.0004788716,0.00062212435,0.0016508838,0.0010123898,0.0009258624,0.0017618545],"category_scores_gemma":[0.0032576849,0.0004738229,0.0005818989,0.00045754266,0.0012729901,0.0011632339,0.00148433,0.00092906045,0.00022576026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016331766,0.000041466497,0.00016056208,0.000093996314,0.000042357355,0.000079006975,0.00008165467,0.9491351,0.0023464705,0.032630645,0.000653418,0.014571943],"study_design_scores_gemma":[0.000021012109,0.00004586517,0.00006372578,0.0000034764157,0.000005592005,0.000007609109,0.0000041750777,0.9936278,0.0002333054,0.005813122,0.00016824482,0.0000060807997],"about_ca_topic_score_codex":0.0056603216,"about_ca_topic_score_gemma":0.003403353,"teacher_disagreement_score":0.0056603216,"about_ca_system_score_codex":0.0010331785,"about_ca_system_score_gemma":0.0011374592,"threshold_uncertainty_score":0.011254728},"labels":[],"label_agreement":null},{"id":"W2012066853","doi":"10.1007/s10957-007-9344-4","title":"REFE-Acceptable Mappings: Necessary and Sufficient Condition for the Nonexistence of a Regular Exceptional Family of Elements","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Iterative Methods for Nonlinear Equations","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":"Royal Military College of Canada","funders":"","keywords":"Uniqueness; Mathematics; Complementarity (molecular biology); Mathematical analysis","score_opus":0.07403505187528658,"score_gpt":0.3638723416970181,"score_spread":0.2898372898217315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012066853","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.72060305,0.00030193702,0.24355654,0.0012204311,0.00018014945,0.000104415936,0.00020577891,0.00042752185,0.033400215],"genre_scores_gemma":[0.9627727,0.00015211564,0.031182105,0.00015952288,0.00007924159,0.000105740684,0.00024014595,0.00011070353,0.0051977895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985154,0.00022282788,0.0001510407,0.00042802785,0.00035706646,0.0003255213],"domain_scores_gemma":[0.9920954,0.0037855129,0.0006184066,0.00088153745,0.0016475052,0.0009716875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087699,0.000576334,0.0014173142,0.0018188572,0.0023717394,0.002615385,0.0011782253,0.0023899034,0.003872583],"category_scores_gemma":[0.014965673,0.000748014,0.0015670448,0.0005365898,0.0037268342,0.003699554,0.0037336352,0.0030705228,0.0005310094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003695083,0.00016767552,0.0076704663,0.0001493059,0.00007881491,0.0020045522,0.0016761805,0.0044186013,0.020998295,0.9486933,0.0011117577,0.01266151],"study_design_scores_gemma":[0.00013266772,0.00034758364,0.004631707,0.0001074951,0.00008677732,0.0059858654,0.0027877905,0.07682354,0.029004922,0.869907,0.010015719,0.00016895054],"about_ca_topic_score_codex":0.00048271648,"about_ca_topic_score_gemma":0.0003555389,"teacher_disagreement_score":0.003872583,"about_ca_system_score_codex":0.0005909903,"about_ca_system_score_gemma":0.0010769828,"threshold_uncertainty_score":0.01295507},"labels":[],"label_agreement":null},{"id":"W2012329717","doi":"10.1007/s10957-009-9558-8","title":"Stabilization of Singular Markovian Jump Systems with Discontinuities and Saturating Inputs","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","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","funders":"","keywords":"Classification of discontinuities; Mathematics; Theory of computation; Control theory (sociology); Linear matrix inequality; Stability (learning theory); Singular control; State (computer science); Matrix (chemical analysis); Markov process; Jump; Applied mathematics; Domain (mathematical analysis); Mathematical optimization; Optimal control; Control (management); Mathematical analysis; Computer science; Algorithm","score_opus":0.0029520827917513467,"score_gpt":0.18437186844186543,"score_spread":0.18141978565011407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012329717","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.6038553,0.00048495567,0.38732442,0.00042389304,0.00009675768,0.000041157044,0.00006254764,0.00031126325,0.0073996084],"genre_scores_gemma":[0.9980453,0.00004051088,0.0010528653,0.000011409772,0.0000066425036,0.000007701016,0.000008268574,0.0000049365954,0.0008222953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981457,0.000034350076,0.00000904208,0.00004137329,0.000045845612,0.00005474488],"domain_scores_gemma":[0.9992834,0.00033965634,0.0001714559,0.00004331898,0.00010931805,0.000052844814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056049327,0.0005381877,0.0008021188,0.0004639299,0.0004549222,0.00071110326,0.00087544357,0.00076868915,0.0015119936],"category_scores_gemma":[0.0018448848,0.00030235937,0.00041365056,0.00025137485,0.0011501701,0.0005096615,0.0012234692,0.0006365002,0.00008902429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074226595,0.000087520915,0.0011035461,0.0002095609,0.000101609156,0.00031295224,0.00022347164,0.90391,0.037462488,0.039505877,0.00041778872,0.015923059],"study_design_scores_gemma":[0.0000169419,0.00006865843,0.0002313806,0.0000048053807,0.000011825865,0.000011363304,0.00001488177,0.9930748,0.0015861283,0.0048754024,0.00009838271,0.0000055209575],"about_ca_topic_score_codex":0.0042117145,"about_ca_topic_score_gemma":0.0022191722,"teacher_disagreement_score":0.0042117145,"about_ca_system_score_codex":0.0008292972,"about_ca_system_score_gemma":0.00052814174,"threshold_uncertainty_score":0.008374393},"labels":[],"label_agreement":null},{"id":"W2012569716","doi":"10.1007/s10957-014-0576-9","title":"A Weighted Sequential Sampling Method Considering Influences of Sample Qualities in Input and Output Parameter Spaces for Global Optimization","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Metamodeling; Weighting; Sampling (signal processing); Adaptive sampling; Sample (material); Mathematics; Mathematical optimization; Sample space; Quality (philosophy); Process (computing); Algorithm; Computer science; Statistics; Monte Carlo method","score_opus":0.031821269869103566,"score_gpt":0.3417841240154184,"score_spread":0.30996285414631486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012569716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005000606,0.000092442424,0.9945739,0.000019597395,0.00002061812,0.000026089485,0.0000074964146,0.00004253688,0.0002167095],"genre_scores_gemma":[0.33090976,0.0003401823,0.66629153,0.000098371434,0.00012609862,0.00043965757,0.00015602705,0.0001313104,0.0015070059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982849,0.00077659084,0.00008609084,0.0002560473,0.0005218684,0.00007461413],"domain_scores_gemma":[0.9945372,0.0040341644,0.00023552198,0.00027840232,0.00080113095,0.00011351017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041532726,0.0012516148,0.0019720702,0.000843657,0.00048487034,0.0007054083,0.0015973076,0.0012490078,0.0019065766],"category_scores_gemma":[0.009302878,0.00088455033,0.0013154072,0.00092058815,0.0007970417,0.0017326955,0.0013128633,0.0010684625,0.00019549511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041609938,0.00018720991,0.00142802,0.00034840257,0.0002160493,0.00012134997,0.00011494807,0.8401389,0.010398056,0.01616581,0.0007955393,0.12966955],"study_design_scores_gemma":[0.000010282405,0.000048764254,0.000080436854,0.000004302513,0.000016108574,0.000010062085,0.000002960813,0.9981027,0.00051138294,0.0010568327,0.00015227609,0.0000039636834],"about_ca_topic_score_codex":0.0033284526,"about_ca_topic_score_gemma":0.00369092,"teacher_disagreement_score":0.0041532726,"about_ca_system_score_codex":0.0004973014,"about_ca_system_score_gemma":0.0011398428,"threshold_uncertainty_score":0.021964848},"labels":[],"label_agreement":null},{"id":"W2015033819","doi":"10.1007/s10957-004-1709-3","title":"On the Exact Controllability of the Wave Equation with Interior and Boundary Controls","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Controllability of Differential Equations","field":"Engineering","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 British Columbia","funders":"","keywords":"Controllability; Mathematics; Wave equation; Boundary (topology); Bounded function; Domain (mathematical analysis); Mathematical analysis; Theory of computation; Boundary value problem; Applied mathematics","score_opus":0.00826082663681671,"score_gpt":0.20238348130747633,"score_spread":0.19412265467065962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015033819","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.16069667,0.0010360613,0.8044334,0.0011545761,0.00025394643,0.000080404054,0.0002460012,0.00018156419,0.031917397],"genre_scores_gemma":[0.9657565,0.00096856075,0.023341456,0.0002499059,0.00024796723,0.00009600463,0.00019398649,0.00013364333,0.009012005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916565,0.00025372682,0.000034677745,0.0001624152,0.0002503789,0.00013323558],"domain_scores_gemma":[0.99613273,0.0024245584,0.0005271551,0.00021304499,0.00042911843,0.00027335674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001845691,0.0014702092,0.0015073969,0.0014429752,0.00064488297,0.0020293505,0.0012768977,0.0012923958,0.004000702],"category_scores_gemma":[0.008777234,0.0005446733,0.0011106568,0.0005924349,0.0032048468,0.0033709141,0.0030010855,0.0022310663,0.00020225764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025036675,0.00013719476,0.000660564,0.00018650817,0.00007557144,0.000246968,0.000222055,0.19267085,0.009447842,0.7711917,0.0015584553,0.023351865],"study_design_scores_gemma":[0.00004205729,0.000071015515,0.00030187238,0.000018629344,0.000014209093,0.00005559557,0.00004112576,0.7661808,0.0009788732,0.231654,0.0006145269,0.000027320575],"about_ca_topic_score_codex":0.0030101328,"about_ca_topic_score_gemma":0.0013976336,"teacher_disagreement_score":0.004000702,"about_ca_system_score_codex":0.00067451823,"about_ca_system_score_gemma":0.0009281651,"threshold_uncertainty_score":0.013383627},"labels":[],"label_agreement":null},{"id":"W2016711560","doi":"10.1007/s10957-005-6547-4","title":"Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Augmented Lagrangian method; Scaling; Mathematics; Separable space; Convergence (economics); Theory of computation; Mathematical optimization; Class (philosophy); Lagrangian; Regular polygon; Flow (mathematics); Applied mathematics; Lagrangian relaxation; Algorithm; Computer science; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.005935164888217662,"score_gpt":0.24406989569141335,"score_spread":0.2381347308031957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016711560","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.007964362,0.0001322508,0.9892565,0.00012971251,0.000058490437,0.000032906362,0.000032275377,0.00016550059,0.0022279834],"genre_scores_gemma":[0.17161867,0.00023800468,0.8218574,0.00011178622,0.0001024747,0.0002888072,0.00016024354,0.00026588765,0.0053566964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936396,0.00029777587,0.000031700114,0.0000631399,0.00019485124,0.000048523634],"domain_scores_gemma":[0.99895453,0.0005283294,0.00008285256,0.00015346741,0.0002021549,0.00007859486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013801615,0.0010293768,0.0013993398,0.0008745335,0.00072884245,0.00143561,0.0012745272,0.0010660691,0.0042929747],"category_scores_gemma":[0.0039872983,0.0007106616,0.00078260415,0.0010448741,0.0010485947,0.002213302,0.0024566292,0.0023722777,0.0007021032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002330189,0.0002597562,0.00048824295,0.0002776809,0.00010238981,0.0001559972,0.00021517291,0.523475,0.006147037,0.2815288,0.0068368413,0.18028003],"study_design_scores_gemma":[0.0000109178245,0.000027145494,0.000029342349,0.000005391649,0.0000042535935,0.000011172034,0.000006561296,0.98040384,0.00029712913,0.018357912,0.0008416635,0.0000046642594],"about_ca_topic_score_codex":0.0017629997,"about_ca_topic_score_gemma":0.002708561,"teacher_disagreement_score":0.0042929747,"about_ca_system_score_codex":0.0006760661,"about_ca_system_score_gemma":0.0016024009,"threshold_uncertainty_score":0.0143613815},"labels":[],"label_agreement":null},{"id":"W2017842236","doi":"10.1007/s10957-006-9033-8","title":"Dynamic Network-Based Discriminatory Pricing","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","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":"Dynamic pricing; Nash equilibrium; Computer science; Pricing strategies; Differential (mechanical device); Theory of computation; Microeconomics; Service provider; Scheme (mathematics); Service (business); Mathematical optimization; Economics; Business; Mathematics; Marketing","score_opus":0.007111410002167931,"score_gpt":0.20621788237360592,"score_spread":0.19910647237143797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017842236","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.16620196,0.0008556495,0.80954623,0.002648615,0.0002513897,0.00008138345,0.00028452274,0.0002620194,0.019868195],"genre_scores_gemma":[0.97422206,0.00032197693,0.019144826,0.000123628,0.00008962866,0.00003804389,0.00009749096,0.00005142589,0.005910936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.00067118986,0.000045447494,0.00025104394,0.00023616297,0.00021597855],"domain_scores_gemma":[0.9876462,0.009515974,0.0009058712,0.0006625423,0.0007283053,0.00054104574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003067472,0.0007107344,0.0022163824,0.0011577234,0.0007678958,0.0032373508,0.0030178677,0.0026757051,0.008234151],"category_scores_gemma":[0.019276166,0.0008574038,0.0008289337,0.0019107515,0.0024334397,0.0062960833,0.0023384544,0.0022064364,0.00040143414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013732226,0.00010033009,0.0008015167,0.00004087827,0.00004059788,0.000077474615,0.00006239674,0.60738784,0.0003262321,0.380254,0.0017139781,0.009057455],"study_design_scores_gemma":[0.000013396515,0.0000084513,0.000108073626,0.0000039617207,0.000006059609,0.00001644559,0.0000075100274,0.9248782,0.00003710782,0.07472824,0.00018498838,0.000007667548],"about_ca_topic_score_codex":0.003968427,"about_ca_topic_score_gemma":0.0028313473,"teacher_disagreement_score":0.008234151,"about_ca_system_score_codex":0.0026218698,"about_ca_system_score_gemma":0.001087862,"threshold_uncertainty_score":0.027545929},"labels":[],"label_agreement":null},{"id":"W2018020262","doi":"10.1007/s10957-005-4722-2","title":"Credibility of Incentive Equilibrium Strategies in Linear-State Differential Games","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Credibility; Incentive; Differential (mechanical device); Mathematical economics; Class (philosophy); State (computer science); Mathematics; Nonlinear system; Theory of computation; Mathematical optimization; Applied mathematics; Computer science; Economics; Microeconomics; Algorithm; Political science; Artificial intelligence; Physics","score_opus":0.01477998174083027,"score_gpt":0.2403004037157513,"score_spread":0.225520421974921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018020262","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.2691664,0.0016193443,0.6661574,0.012335385,0.00027933397,0.0003831137,0.00073797815,0.00038328549,0.048937805],"genre_scores_gemma":[0.9811934,0.0005905986,0.012241008,0.00030244878,0.0002058179,0.00019618541,0.00013434415,0.000061821505,0.0050743204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890752,0.0057795625,0.0007650476,0.0013632291,0.002014069,0.0010028478],"domain_scores_gemma":[0.636032,0.33131927,0.014459964,0.0055127894,0.008880792,0.0037952224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018367497,0.0015654847,0.005121741,0.0027012855,0.0017334413,0.008774947,0.004080488,0.008377759,0.009855163],"category_scores_gemma":[0.19274253,0.0021632975,0.0017868708,0.0021573429,0.008476422,0.013358485,0.0041941805,0.00810339,0.0005983607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034441316,0.000091839436,0.0010121351,0.00018065237,0.0000711204,0.00023497737,0.00055291486,0.06535708,0.00044499664,0.9248538,0.0011540216,0.0057020276],"study_design_scores_gemma":[0.00011221143,0.00004092011,0.00023250726,0.00003593751,0.000017127726,0.0000617464,0.000081817154,0.13992155,0.00015144968,0.8590007,0.00030922293,0.000034792094],"about_ca_topic_score_codex":0.003194113,"about_ca_topic_score_gemma":0.00157271,"teacher_disagreement_score":0.018367497,"about_ca_system_score_codex":0.005244769,"about_ca_system_score_gemma":0.0037366059,"threshold_uncertainty_score":0.09713781},"labels":[],"label_agreement":null},{"id":"W2018846914","doi":"10.1007/s10957-008-9440-0","title":"EP Theorem for Dual Linear Complementarity Problems","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Complementarity (molecular biology); Dual (grammatical number); Linear complementarity problem; Mathematics; Matrix (chemical analysis); Complementarity theory; Time complexity; Property (philosophy); Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Nonlinear system; Physics","score_opus":0.03453408348496048,"score_gpt":0.31512657208195927,"score_spread":0.2805924885969988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018846914","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.011139585,0.0036680782,0.86697865,0.0043695685,0.0008735221,0.00012064385,0.00047723466,0.00023819719,0.112134494],"genre_scores_gemma":[0.54113925,0.015240266,0.30984372,0.0058105607,0.0042379457,0.0017919726,0.0014312938,0.0012859595,0.119219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989856,0.00034450585,0.00004993338,0.00016408807,0.00032145056,0.00013450332],"domain_scores_gemma":[0.99346405,0.0050253817,0.000192007,0.0003234205,0.0007877476,0.00020736747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036983322,0.0024828871,0.002089317,0.0029631176,0.0014625208,0.0033483016,0.0034447224,0.0025392903,0.014236297],"category_scores_gemma":[0.017806057,0.001096047,0.0025048174,0.003143178,0.0031913787,0.0076945187,0.0041503487,0.008621138,0.0012379126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051285395,0.00005024359,0.00014645742,0.00026623328,0.00005504681,0.00011207081,0.00011483456,0.016103838,0.0005566069,0.95605457,0.007985855,0.018502949],"study_design_scores_gemma":[0.000031276028,0.000020466476,0.00014928417,0.00006743289,0.00003833408,0.000093985385,0.000028597764,0.08814703,0.0002898711,0.9056833,0.0054320702,0.000018285158],"about_ca_topic_score_codex":0.0033699917,"about_ca_topic_score_gemma":0.0018948365,"teacher_disagreement_score":0.014236297,"about_ca_system_score_codex":0.0019785443,"about_ca_system_score_gemma":0.0019207717,"threshold_uncertainty_score":0.047625184},"labels":[],"label_agreement":null},{"id":"W2027162300","doi":"10.1023/b:jota.0000042529.80440.04","title":"On Two-Point Boundary Conditions in Optimal Control Problems","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Differential Equations and Numerical Methods","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; Differentiable function; Boundary (topology); Combinatorics; Piecewise; Mathematical analysis; Boundary value problem","score_opus":0.019300351015327354,"score_gpt":0.3326374704938885,"score_spread":0.31333711947856113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027162300","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.07299845,0.0057778643,0.8545485,0.0048032193,0.0014085808,0.00022316314,0.00022445447,0.00013095683,0.059884783],"genre_scores_gemma":[0.8311584,0.003878048,0.12689908,0.0011681366,0.0010563298,0.00059241144,0.00044846282,0.00036670498,0.034432374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837744,0.00090102805,0.00007675943,0.00015670038,0.00032958624,0.00015849172],"domain_scores_gemma":[0.993487,0.0048457324,0.00031830044,0.0001766234,0.00076277263,0.00040941624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004425196,0.0015471943,0.0031706446,0.0022805126,0.00132912,0.0038165657,0.0019024025,0.005223026,0.00670871],"category_scores_gemma":[0.015577831,0.0009456091,0.0012435741,0.001562025,0.0047409344,0.004415122,0.0045292876,0.004267904,0.00049974484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031835004,0.00015658258,0.00033871335,0.00041958014,0.00004530506,0.00027549034,0.00032959552,0.14209989,0.0025360875,0.8315286,0.0031082958,0.018843431],"study_design_scores_gemma":[0.00010171322,0.00007573527,0.00031626743,0.00010834009,0.000019030213,0.00004243982,0.000101631085,0.52888495,0.0006174148,0.4665713,0.003112555,0.000048577098],"about_ca_topic_score_codex":0.004311657,"about_ca_topic_score_gemma":0.0021861389,"teacher_disagreement_score":0.00670871,"about_ca_system_score_codex":0.0014870585,"about_ca_system_score_gemma":0.0014779889,"threshold_uncertainty_score":0.023402989},"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":"W2033978783","doi":"10.1023/b:jota.0000005040.78280.a6","title":"Agreeability and Time Consistency in Linear-State Differential Games","year":2003,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":55,"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":"Consistency (knowledge bases); Theory of computation; Differential (mechanical device); State (computer science); Mathematics; Mathematical economics; Rationality; Time consistency; Applied mathematics; Mathematical optimization; Economics; Algorithm; Discrete mathematics; Actuarial science; Epistemology","score_opus":0.011273252807169397,"score_gpt":0.20980957584640722,"score_spread":0.19853632303923782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033978783","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.20920457,0.00047601978,0.766833,0.004063928,0.000191393,0.00021903339,0.0004999229,0.00024029631,0.018271752],"genre_scores_gemma":[0.9587819,0.00045413233,0.031420533,0.00046368962,0.00020433206,0.0003770611,0.000396166,0.000114765804,0.0077873915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922448,0.0034582308,0.0006838096,0.0015977299,0.00108032,0.00093518745],"domain_scores_gemma":[0.8799507,0.09853612,0.0087659275,0.004954889,0.0047361567,0.003056175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013240828,0.001133528,0.003728669,0.0014298775,0.0021306227,0.0054872497,0.0041386075,0.0041769627,0.007977007],"category_scores_gemma":[0.07662827,0.0012374788,0.0024157257,0.001964065,0.0066334857,0.010981482,0.00437331,0.0058469553,0.0005465348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020894744,0.00006762693,0.00097182975,0.00006173589,0.00007626455,0.00014933627,0.00044954373,0.02965842,0.0003328425,0.9638511,0.0006384861,0.003533844],"study_design_scores_gemma":[0.000073728945,0.000039410217,0.00026195453,0.000011761929,0.00001788554,0.000031085583,0.0000903072,0.07677902,0.00012245511,0.92225385,0.00029369877,0.000024782523],"about_ca_topic_score_codex":0.0049004806,"about_ca_topic_score_gemma":0.0022557105,"teacher_disagreement_score":0.013240828,"about_ca_system_score_codex":0.0023942103,"about_ca_system_score_gemma":0.0031542971,"threshold_uncertainty_score":0.07002503},"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":"W2036651327","doi":"10.1007/s10957-012-0228-x","title":"Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":61,"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; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Theory of computation; Mathematical optimization; Mathematics; Order (exchange); Mathematical economics; Independence (probability theory); Optimality criterion; Nonlinear system; Economics; Algorithm; Statistics","score_opus":0.014738101471121593,"score_gpt":0.275257527337355,"score_spread":0.2605194258662334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036651327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036123306,0.0010303372,0.89963186,0.0022060685,0.00037701483,0.00019841648,0.0007646231,0.00020449985,0.059463903],"genre_scores_gemma":[0.7220702,0.0026151447,0.21621193,0.0010728869,0.0009733116,0.0011618299,0.0019068433,0.0008495697,0.0531383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805546,0.00059424835,0.00013281369,0.00026539477,0.00057699945,0.0003751085],"domain_scores_gemma":[0.9893919,0.007350474,0.00061150786,0.00034369677,0.0018299499,0.00047245686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047772555,0.002258969,0.0022067819,0.0030329549,0.0014309278,0.0043245135,0.0019994427,0.0026885786,0.014400814],"category_scores_gemma":[0.013584559,0.0015907994,0.0022836407,0.0017163663,0.0027562878,0.006826806,0.002525809,0.006723403,0.0014598896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004634464,0.00008915776,0.00018598489,0.00013188343,0.000023277651,0.00011427151,0.00021944553,0.035933424,0.0016600945,0.9546223,0.0025996605,0.004374284],"study_design_scores_gemma":[0.00004783459,0.00006891814,0.00035490454,0.000073095514,0.000024313882,0.00007779166,0.00012355288,0.2966923,0.0015410302,0.696674,0.0042834384,0.00003885429],"about_ca_topic_score_codex":0.0042012087,"about_ca_topic_score_gemma":0.0057612406,"teacher_disagreement_score":0.014400814,"about_ca_system_score_codex":0.0028542464,"about_ca_system_score_gemma":0.00435049,"threshold_uncertainty_score":0.048175514},"labels":[],"label_agreement":null},{"id":"W2047707165","doi":"10.1007/s10957-007-9265-2","title":"Merit-Function Piecewise SQP Algorithm for Mathematical Programs with Equilibrium Constraints","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","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 Victoria","funders":"","keywords":"Piecewise; Theory of computation; Mathematics; Sequential quadratic programming; Mathematical optimization; Complementarity theory; Constraint (computer-aided design); Complementarity (molecular biology); Stationary point; Point (geometry); Function (biology); Independence (probability theory); Piecewise linear function; Algorithm; Quadratic programming; Nonlinear system; Mathematical analysis","score_opus":0.008362994103040132,"score_gpt":0.2365910185940447,"score_spread":0.22822802449100454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047707165","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.007408013,0.00016230902,0.9897579,0.00014857839,0.00002750991,0.00002084402,0.000027453088,0.00028618184,0.0021611254],"genre_scores_gemma":[0.21997409,0.00021067348,0.7751251,0.0000851975,0.00003398982,0.00016203424,0.000119521355,0.00026139707,0.0040281503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974066,0.00011381073,0.000010731516,0.000025451996,0.00007860954,0.000030738353],"domain_scores_gemma":[0.99895954,0.00069588586,0.00006525526,0.000057804304,0.00018286827,0.000038590155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012130695,0.0006628686,0.0011914342,0.0007314079,0.00051831064,0.00085470994,0.0012249337,0.0013492749,0.003933391],"category_scores_gemma":[0.004082442,0.0005622113,0.00049021235,0.0009923162,0.00055888994,0.00097617734,0.0009552352,0.0013930226,0.0005901778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013850129,0.00005448938,0.00033925782,0.00015849172,0.000031787833,0.000055415123,0.00006712505,0.8119074,0.0018564115,0.041777495,0.0025872055,0.14102629],"study_design_scores_gemma":[0.000010837179,0.0000142528015,0.00003385161,0.0000067289584,0.0000035825744,0.0000094081,0.0000040903515,0.9940211,0.00024244635,0.005078037,0.0005727297,0.0000029151745],"about_ca_topic_score_codex":0.0030378005,"about_ca_topic_score_gemma":0.0032215822,"teacher_disagreement_score":0.003933391,"about_ca_system_score_codex":0.0008582175,"about_ca_system_score_gemma":0.001389544,"threshold_uncertainty_score":0.01315856},"labels":[],"label_agreement":null},{"id":"W2052424630","doi":"10.1007/s10957-011-9886-3","title":"Optimal Keyword Bids in Search-Based Advertising with Stochastic Advertisement Positions","year":2011,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Advertising; Budget constraint; Probabilistic logic; Construct (python library); Constraint (computer-aided design); Process (computing); Search advertising; Keyword search; Operations research; Online advertising; Microeconomics; Economics; Business; Information retrieval; Mathematics; The Internet; World Wide Web; Artificial intelligence","score_opus":0.014921492264076896,"score_gpt":0.2335077405867891,"score_spread":0.2185862483227122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052424630","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.46121663,0.0017037756,0.5154515,0.0036912486,0.00025879365,0.00034274062,0.00041691263,0.0004749768,0.016443446],"genre_scores_gemma":[0.97142947,0.00037034726,0.020954292,0.00016050872,0.00015518289,0.0001128719,0.00011955418,0.00009697316,0.006600936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955812,0.0024751243,0.00023185731,0.0004122753,0.0005397439,0.000759691],"domain_scores_gemma":[0.9577668,0.03640761,0.0017547262,0.0008238017,0.0016464834,0.0016005458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007024473,0.001370794,0.0060115885,0.0016320857,0.0010638108,0.005531507,0.0036169738,0.0040846057,0.006182047],"category_scores_gemma":[0.038915727,0.0034081424,0.0012773442,0.0025449283,0.0031904837,0.006005787,0.0025056303,0.0022670613,0.00095362123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002443553,0.00060853624,0.0020978008,0.0004238527,0.0001762201,0.00033493183,0.00027271413,0.8730695,0.0024122419,0.09002991,0.003359815,0.024770971],"study_design_scores_gemma":[0.00017764882,0.00012563428,0.00038098995,0.000016429824,0.000046930745,0.000065481174,0.00006941295,0.96872354,0.00028233012,0.029896967,0.00018234461,0.000032329892],"about_ca_topic_score_codex":0.0041945805,"about_ca_topic_score_gemma":0.003200038,"teacher_disagreement_score":0.007024473,"about_ca_system_score_codex":0.002485079,"about_ca_system_score_gemma":0.0027650003,"threshold_uncertainty_score":0.03714937},"labels":[],"label_agreement":null},{"id":"W2056214914","doi":"10.1007/s10957-008-9454-7","title":"Advertising Strategies in a Differential Game with Negative Competitor’s Interference","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":43,"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":"Goodwill; Differential game; Nash equilibrium; Advertising; Stochastic game; Differential (mechanical device); Strategy; Stock (firearms); Mathematical economics; Economics; Microeconomics; Game theory; Mathematics; Business; Mathematical optimization","score_opus":0.011663429201388879,"score_gpt":0.2236923759240588,"score_spread":0.21202894672266992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056214914","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.5987179,0.0008125996,0.30408034,0.0036166979,0.00020025343,0.0002947369,0.00032549005,0.00023922209,0.09171275],"genre_scores_gemma":[0.98233515,0.00017446303,0.005985714,0.00015963842,0.000046512934,0.000058240952,0.00003356306,0.000015845435,0.011190824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973694,0.0011110303,0.000113233036,0.0003480872,0.00038239724,0.0006759297],"domain_scores_gemma":[0.98885405,0.008761353,0.0006349923,0.0002809781,0.00052219746,0.0009463588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033787538,0.0017902845,0.003053755,0.0015451639,0.0012746061,0.0050611245,0.0033565464,0.0043590097,0.006343038],"category_scores_gemma":[0.010354535,0.0014580319,0.0011738663,0.0010134522,0.0031349654,0.0045557376,0.0027724549,0.0025229694,0.0006384021],"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.0015260004,0.00075284595,0.0033461652,0.00041046194,0.00027992262,0.0021178136,0.00069939386,0.34812915,0.011032383,0.60862505,0.004048517,0.019032259],"study_design_scores_gemma":[0.0002987161,0.0002488088,0.00073031127,0.000025682157,0.00015305718,0.00038962415,0.00020866995,0.8584487,0.0007605287,0.1375272,0.0011189154,0.000089778216],"about_ca_topic_score_codex":0.0050769653,"about_ca_topic_score_gemma":0.0035129203,"teacher_disagreement_score":0.006343038,"about_ca_system_score_codex":0.0032102987,"about_ca_system_score_gemma":0.0018246043,"threshold_uncertainty_score":0.023292422},"labels":[],"label_agreement":null},{"id":"W2057756204","doi":"10.1007/s10957-013-0345-1","title":"The Shape of the Borwein–Affleck–Girgensohn Function Generated by Completely Monotone and Bernstein Functions","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Functional Equations Stability Results","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":"Western University","funders":"","keywords":"Convexity; Mathematics; Monotone polygon; Theory of computation; Reciprocal; Function (biology); Monotonic function; Pure mathematics; Combinatorics; Applied mathematics; Discrete mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.017223021333610238,"score_gpt":0.24990241541562913,"score_spread":0.2326793940820189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057756204","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.51490384,0.0020763874,0.39454213,0.0029629872,0.00042846205,0.00006903433,0.00034392008,0.00022675512,0.08444656],"genre_scores_gemma":[0.96516365,0.00087055,0.017580565,0.0002861262,0.00017532309,0.000065365915,0.00017492592,0.0001771517,0.015506332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992711,0.00029738498,0.000020624837,0.00011552787,0.00019277935,0.000102697755],"domain_scores_gemma":[0.9976069,0.0010502741,0.0002474522,0.00019834746,0.00046351447,0.0004334108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063573,0.0008568325,0.0008501857,0.0015464629,0.0009026844,0.0019822442,0.0019524465,0.0017753646,0.0060179257],"category_scores_gemma":[0.008741529,0.00051751337,0.00059799216,0.000623415,0.0031977147,0.0029987637,0.0020367554,0.0018534174,0.0008137499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005859166,0.00001046991,0.00018979987,0.000031571708,0.0000069256416,0.00004019357,0.00012223308,0.0040936703,0.0023422542,0.98889625,0.00058784336,0.003620201],"study_design_scores_gemma":[0.000038655253,0.000044369383,0.00051321235,0.000031472147,0.0000090937965,0.00022842831,0.00009230632,0.0715512,0.0015572326,0.9234403,0.0024382048,0.000055563854],"about_ca_topic_score_codex":0.00095934194,"about_ca_topic_score_gemma":0.000492838,"teacher_disagreement_score":0.0060179257,"about_ca_system_score_codex":0.0012046661,"about_ca_system_score_gemma":0.00087624136,"threshold_uncertainty_score":0.020131946},"labels":[],"label_agreement":null},{"id":"W2059083091","doi":"10.1007/s10957-014-0659-7","title":"On the Finite Convergence of a Projected Cutter Method","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Subgradient method; Convergence (economics); Regular polygon; Mathematics; Projection (relational algebra); Point (geometry); Limiting; Set (abstract data type); Mathematical optimization; Fixed point; Variational inequality; Applied mathematics; Finite set; Computer science; Algorithm; Mathematical analysis; Geometry; Engineering; Economics","score_opus":0.008663999138381527,"score_gpt":0.2577945133223376,"score_spread":0.24913051418395607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059083091","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.008530581,0.0007154283,0.98157525,0.00044520776,0.00021105711,0.000066744644,0.000062150764,0.00013848052,0.008255106],"genre_scores_gemma":[0.2283276,0.002007792,0.73983145,0.00089793245,0.00033569432,0.00057680794,0.00035754687,0.0009683287,0.026696874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782556,0.0011824279,0.00006880364,0.00022338881,0.00057658216,0.00012324307],"domain_scores_gemma":[0.98716044,0.009523106,0.00036851972,0.0007324791,0.0016243887,0.0005910097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007091102,0.0015097427,0.0017368227,0.0022571052,0.0010633953,0.002052832,0.002391178,0.0027354003,0.007272813],"category_scores_gemma":[0.02252868,0.00092621,0.001707917,0.0009797002,0.004109246,0.0031389943,0.0060602874,0.006000899,0.001032867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034742404,0.00011403447,0.00063855184,0.00045133915,0.00011847716,0.00017424919,0.00032911723,0.17817049,0.008321388,0.7529763,0.0046730665,0.053685553],"study_design_scores_gemma":[0.000025767016,0.000082283914,0.00014253947,0.00008022572,0.00002315541,0.00008484085,0.000026795451,0.8503836,0.001398545,0.1445598,0.0031627864,0.000029664474],"about_ca_topic_score_codex":0.0024850294,"about_ca_topic_score_gemma":0.0018693062,"teacher_disagreement_score":0.007272813,"about_ca_system_score_codex":0.0013120002,"about_ca_system_score_gemma":0.0015355174,"threshold_uncertainty_score":0.037501812},"labels":[],"label_agreement":null},{"id":"W2064437833","doi":"10.1007/s10957-013-0349-x","title":"Maximum Entropy Estimates for Risk-Neutral Probability Measures with Non-Strictly-Convex Data","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Bounded function; Mathematics; Probability measure; Mathematical economics; Probability density function; Convex analysis; Duality (order theory); Entropy (arrow of time); Convex optimization; Entropy maximization; Mathematical optimization; Econometrics; Principle of maximum entropy; Regular polygon; Economics; Financial economics; Statistics; Combinatorics; Mathematical analysis","score_opus":0.02520487302510333,"score_gpt":0.23136289879665495,"score_spread":0.20615802577155162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064437833","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.022774922,0.0006643771,0.9742853,0.0005409953,0.0000367776,0.00003615528,0.0001563602,0.000082766106,0.0014223752],"genre_scores_gemma":[0.7867157,0.0029853038,0.2004636,0.00043927933,0.0008327511,0.00031151308,0.0016620947,0.00028742134,0.006302331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965586,0.0019373456,0.00025105377,0.00041798982,0.00063345983,0.0002016214],"domain_scores_gemma":[0.93386245,0.05917601,0.002356326,0.0020903593,0.0017580605,0.00075687404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011057858,0.0017961056,0.0023726511,0.0028936204,0.0005839354,0.0033848656,0.0024739502,0.0019499321,0.0025427747],"category_scores_gemma":[0.06108995,0.0013072373,0.0016132594,0.001456454,0.002886677,0.008015708,0.004772488,0.003123037,0.00039514856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002577798,0.00012504304,0.0025647953,0.00048497165,0.0003408837,0.00027078492,0.00027720744,0.4545114,0.0025800965,0.50299853,0.0018723998,0.033716075],"study_design_scores_gemma":[0.000013444081,0.000036984464,0.00069853914,0.000047004265,0.000021483045,0.000059592552,0.000018940344,0.73784673,0.0006434731,0.26024505,0.00033517636,0.00003367108],"about_ca_topic_score_codex":0.0009885756,"about_ca_topic_score_gemma":0.0008045856,"teacher_disagreement_score":0.011057858,"about_ca_system_score_codex":0.0016553245,"about_ca_system_score_gemma":0.0013664796,"threshold_uncertainty_score":0.058480203},"labels":[],"label_agreement":null},{"id":"W2065752008","doi":"10.1007/s10957-012-0156-9","title":"Cooperating and Non-cooperating Firms in Inventive and Absorptive Research","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duopoly; Joint venture; Absorptive capacity; Industrial organization; Investment (military); Business; Microeconomics; Production (economics); Unit (ring theory); Computer science; Economics; Mathematics; Commerce; Cournot competition","score_opus":0.040221879095096405,"score_gpt":0.29345106196955145,"score_spread":0.25322918287445506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065752008","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.9340421,0.0061744647,0.04026719,0.0019630773,0.000031658114,0.00006367936,0.00006692456,0.00003059352,0.017360305],"genre_scores_gemma":[0.9935889,0.0009570146,0.0031286431,0.000038326278,0.000049219525,0.000027224462,0.000027472284,0.0000069275575,0.0021762338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744534,0.0012723473,0.00020779998,0.0003717698,0.0002757406,0.00042692028],"domain_scores_gemma":[0.8953741,0.09162392,0.005884089,0.0022584344,0.0014762552,0.0033831592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009429967,0.00040925894,0.0018519404,0.0019889646,0.0021221864,0.0053410847,0.0016109555,0.0024926614,0.0055490746],"category_scores_gemma":[0.029882437,0.0006008287,0.0011163466,0.00291321,0.005860005,0.008803899,0.0026085603,0.0017410243,0.00024582612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002883478,0.00027402682,0.037635434,0.00017149076,0.00013370038,0.00084515865,0.002525584,0.020562997,0.00082027295,0.90987784,0.0009618911,0.025903236],"study_design_scores_gemma":[0.00007889834,0.00011093805,0.014656776,0.000115676026,0.00016840782,0.00047875554,0.0039783684,0.063784406,0.00040537407,0.91398615,0.0021902886,0.000045966604],"about_ca_topic_score_codex":0.0028268031,"about_ca_topic_score_gemma":0.004032993,"teacher_disagreement_score":0.009429967,"about_ca_system_score_codex":0.0016262037,"about_ca_system_score_gemma":0.0015127115,"threshold_uncertainty_score":0.049871027},"labels":[],"label_agreement":null},{"id":"W2066559849","doi":"10.1007/s10957-011-9971-7","title":"Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Nonlinear complementarity problem; Uniqueness; Complementarity (molecular biology); Homogeneous; Complementarity theory; Mixed complementarity problem; Mathematics; Monotone polygon; Nonlinear system; Homogeneous function; Cone (formal languages); Mathematical analysis; Applied mathematics; Mathematical optimization; Geometry; Physics; Algorithm; Combinatorics","score_opus":0.03145824916363664,"score_gpt":0.2753879869377373,"score_spread":0.24392973777410065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066559849","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.2680775,0.0029264665,0.68425936,0.00320958,0.00020457452,0.00031809098,0.00035434417,0.0001138153,0.040536303],"genre_scores_gemma":[0.842244,0.0024977827,0.13487442,0.00037521645,0.00015892027,0.00037017863,0.00034336373,0.00013982198,0.018996257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993937,0.00019307477,0.000038647002,0.000112181624,0.00013211598,0.00013027589],"domain_scores_gemma":[0.99628806,0.0023540854,0.0003146018,0.000086812615,0.00066994247,0.00028648562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024185313,0.0011770227,0.0011472731,0.0018469907,0.0016188032,0.0033713388,0.0015158614,0.002461898,0.0035616101],"category_scores_gemma":[0.012020028,0.0012801943,0.0012113474,0.0012607949,0.0028771043,0.0031064348,0.003103371,0.0027133643,0.00029237516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033363863,0.0002326924,0.00090598327,0.0003346089,0.000081772974,0.00037412537,0.000709367,0.07854883,0.014047121,0.8776476,0.0029716052,0.02381272],"study_design_scores_gemma":[0.00010832255,0.00013004373,0.00061194686,0.00011687523,0.00003876674,0.000212062,0.0005804429,0.4955733,0.0053179213,0.49422485,0.0030188113,0.00006667572],"about_ca_topic_score_codex":0.0026376157,"about_ca_topic_score_gemma":0.001862783,"teacher_disagreement_score":0.0035616101,"about_ca_system_score_codex":0.0013908368,"about_ca_system_score_gemma":0.0023700702,"threshold_uncertainty_score":0.012790561},"labels":[],"label_agreement":null},{"id":"W2071414521","doi":"10.1023/b:jota.0000042599.46775.a9","title":"Robust H∞ Filtering for a Class of Nonlinear Discrete-Time Markovian Jump Systems","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":39,"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":"Mathematics; Nonlinear system; Control theory (sociology); Filtering problem; Lipschitz continuity; Theory of computation; Filter (signal processing); Discrete time and continuous time; Applied mathematics; Jump; Bounded function; Norm (philosophy); Markov process; Mathematical analysis; Kalman filter; Computer science; Algorithm; Extended Kalman filter","score_opus":0.00881651396054664,"score_gpt":0.211560146234998,"score_spread":0.20274363227445136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071414521","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.14987564,0.00089240033,0.84311974,0.00046609933,0.00009511141,0.00005102681,0.00013794148,0.0003385881,0.0050234636],"genre_scores_gemma":[0.9810296,0.00059448474,0.014596332,0.00007172835,0.00012733707,0.000048392398,0.0001614388,0.000025340465,0.00334535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995409,0.00005211716,0.00003322798,0.0001269363,0.00017582801,0.000070947506],"domain_scores_gemma":[0.9989058,0.00055903103,0.00025505613,0.000080002654,0.00015619112,0.000043910346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008642829,0.00076218386,0.001368935,0.0006339052,0.0005614362,0.001466964,0.0008640259,0.001276702,0.0013698615],"category_scores_gemma":[0.0021967555,0.00033145965,0.0009315494,0.0004317891,0.0008540872,0.0009998174,0.0006623757,0.00084818626,0.00016102906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005553264,0.00029939535,0.003372867,0.00049815874,0.00033099993,0.0006144354,0.00033103247,0.61221516,0.039563783,0.24662459,0.0021921336,0.093402095],"study_design_scores_gemma":[0.000014185733,0.0000396843,0.00049364014,0.000005360145,0.000016267792,0.000047786758,0.000009004249,0.98793787,0.00093753607,0.010100407,0.0003879464,0.000010350126],"about_ca_topic_score_codex":0.0030781208,"about_ca_topic_score_gemma":0.0018088338,"teacher_disagreement_score":0.0030781208,"about_ca_system_score_codex":0.00069512083,"about_ca_system_score_gemma":0.00060329837,"threshold_uncertainty_score":0.0061204433},"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":"W2074089254","doi":"10.1023/b:jota.0000026133.56615.cf","title":"Zero-Sum Stochastic Games with Partial Information","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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 Ottawa","funders":"","keywords":"Mathematics; Zero-sum game; Zero (linguistics); Theory of computation; Example of a game without a value; Mathematical economics; Space (punctuation); State (computer science); State space; Complete information; Mathematical optimization; Game theory; Repeated game; Combinatorial game theory; Computer science; Statistics; Algorithm","score_opus":0.020904524936494494,"score_gpt":0.3071967091041004,"score_spread":0.28629218416760593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074089254","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.10701518,0.0010633828,0.86413723,0.0032375474,0.00026685436,0.00024258422,0.00085158204,0.00019866748,0.022986874],"genre_scores_gemma":[0.9250876,0.0013627198,0.053081322,0.00058663473,0.00035732263,0.00060763006,0.00046774885,0.00007040164,0.01837868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99015594,0.005124222,0.00057087716,0.0012122545,0.0018649561,0.0010718462],"domain_scores_gemma":[0.97133,0.023935596,0.0015085987,0.00096917985,0.0011665894,0.0010899453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007523875,0.002641727,0.0054032784,0.001815923,0.0012001845,0.0070129414,0.0043476545,0.003361305,0.005486097],"category_scores_gemma":[0.028648231,0.0018654278,0.0019364929,0.0020979363,0.00457343,0.009270277,0.004447953,0.0035756207,0.0006316945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032024525,0.00013640815,0.00045592143,0.00024642565,0.00018700238,0.00023404296,0.00014781217,0.16142994,0.000671568,0.82532823,0.001754482,0.0090879435],"study_design_scores_gemma":[0.000101642814,0.000084772655,0.00014855251,0.000033759035,0.000060712686,0.00008068015,0.000050831364,0.34193763,0.00031360248,0.6563331,0.0008033488,0.000051444087],"about_ca_topic_score_codex":0.0021184818,"about_ca_topic_score_gemma":0.0019196622,"teacher_disagreement_score":0.007523875,"about_ca_system_score_codex":0.0028974065,"about_ca_system_score_gemma":0.0031576904,"threshold_uncertainty_score":0.03979057},"labels":[],"label_agreement":null},{"id":"W2074318081","doi":"10.1007/s10957-008-9413-3","title":"A Fast MPC Algorithm Using Nonfeasible Active Set Methods","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"University of Toronto; Ontario Tech University","funders":"","keywords":"Model predictive control; Quadratic programming; Theory of computation; Active set method; Mathematical optimization; Set (abstract data type); Mathematics; Minification; Quadratic equation; Algorithm; Computer science; Control (management); Nonlinear programming; Artificial intelligence","score_opus":0.01808822104082608,"score_gpt":0.30219349671273527,"score_spread":0.2841052756719092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074318081","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.0071457867,0.00015465383,0.9888969,0.00008228524,0.00009441168,0.000041724867,0.000022888365,0.00037968962,0.003181574],"genre_scores_gemma":[0.42114332,0.00015465988,0.5730341,0.00010331535,0.00008282374,0.00024824537,0.0000905837,0.00011520331,0.005027727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965394,0.00008351766,0.000020183923,0.0000490865,0.00016152736,0.000031905543],"domain_scores_gemma":[0.99919707,0.00047091665,0.00005617787,0.00009058235,0.00015229789,0.00003282096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081158016,0.0008528218,0.0013045303,0.00049123395,0.0007038289,0.00095904677,0.0010424738,0.0013457943,0.003493473],"category_scores_gemma":[0.0017503485,0.0006745845,0.0004900825,0.0005251747,0.0004815214,0.000805993,0.00092120847,0.0012768486,0.00057086715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019849458,0.00008810403,0.00024484127,0.000105027306,0.000058079797,0.000078721256,0.00004277683,0.7758926,0.004139601,0.013932143,0.0016617647,0.20355788],"study_design_scores_gemma":[0.000015413658,0.0000184182,0.000036024958,0.000002974106,0.0000040055415,0.000008201956,0.0000013107482,0.9978356,0.0004887664,0.0011801574,0.00040618645,0.0000030018493],"about_ca_topic_score_codex":0.0023468605,"about_ca_topic_score_gemma":0.0029996461,"teacher_disagreement_score":0.003493473,"about_ca_system_score_codex":0.00042284778,"about_ca_system_score_gemma":0.00074944395,"threshold_uncertainty_score":0.011686802},"labels":[],"label_agreement":null},{"id":"W2081400262","doi":"10.1007/s10957-013-0439-9","title":"Sensitivity Analysis of Merit Function in Solving Nonlinear Equations by Optimization","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Nanofluid Flow and Heat Transfer","field":"Engineering","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":"Hessian matrix; Scaling; Jacobian matrix and determinant; Nonlinear system; Mathematics; Norm (philosophy); Applied mathematics; Diagonal; Mathematical optimization; Mathematical analysis; Physics; Geometry","score_opus":0.004969220639500327,"score_gpt":0.2046621721091188,"score_spread":0.19969295146961846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081400262","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.07871227,0.0012236394,0.91137886,0.0006958038,0.00011751923,0.00010774569,0.00007435165,0.00020874004,0.007481131],"genre_scores_gemma":[0.923325,0.00048781314,0.0733192,0.00014807521,0.000091704846,0.00012442956,0.000091491886,0.00019018239,0.0022220805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729556,0.0018442613,0.00008105309,0.0002101249,0.00040866632,0.00016039517],"domain_scores_gemma":[0.9846044,0.013813125,0.00039557397,0.00028400158,0.00076633645,0.0001366289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007150791,0.0011639682,0.0019197069,0.0017649417,0.0006753638,0.0018367383,0.000804394,0.0015787263,0.0015608119],"category_scores_gemma":[0.021024933,0.00084817613,0.0014072104,0.0009490295,0.001741341,0.0015930011,0.0017160664,0.0014153558,0.00010584943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012649516,0.00004552302,0.0004743105,0.00010567383,0.00006773517,0.000061986386,0.000052538275,0.97309643,0.0019541953,0.01651609,0.00029009703,0.0072089043],"study_design_scores_gemma":[0.0000023870555,0.000011697264,0.000092202776,0.000004678577,0.000005780893,0.000007090393,0.000003965473,0.99722856,0.00033051314,0.0022423146,0.00006584071,0.0000049121495],"about_ca_topic_score_codex":0.00322136,"about_ca_topic_score_gemma":0.0013057379,"teacher_disagreement_score":0.007150791,"about_ca_system_score_codex":0.001496622,"about_ca_system_score_gemma":0.0010583416,"threshold_uncertainty_score":0.03781742},"labels":[],"label_agreement":null},{"id":"W2081691140","doi":"10.1007/s10957-006-9035-6","title":"Duality of Implicit Complementarity Problems by Using Inversions and Scalar Derivatives","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Iterative Methods for Nonlinear Equations","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Infinitesimal; Theory of computation; Complementarity (molecular biology); Duality (order theory); Scalar (mathematics); Hilbert space; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.05819998788388162,"score_gpt":0.367817745985324,"score_spread":0.3096177581014424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081691140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139120985,0.00047772675,0.96919113,0.00036625942,0.00020972332,0.00005132198,0.000034772118,0.000046539913,0.015710397],"genre_scores_gemma":[0.45425782,0.0019985614,0.5106495,0.0005723659,0.0005866571,0.0003631771,0.00016599818,0.00044883505,0.030957062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907243,0.00045863492,0.000042186304,0.000073742594,0.00028281423,0.0000701583],"domain_scores_gemma":[0.99789786,0.0013012253,0.00017983685,0.0001621355,0.00032825756,0.00013063512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023716493,0.0010419561,0.0012793835,0.0015570414,0.0007958251,0.0024827325,0.0013228869,0.0013181888,0.0037491107],"category_scores_gemma":[0.0076971767,0.00068689964,0.0011942812,0.0011398862,0.0028654835,0.004279714,0.0040943744,0.004103815,0.00052783574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004807254,0.00006584889,0.000117268064,0.000092683724,0.000015577813,0.000045618028,0.00012636207,0.0229006,0.001620354,0.95803016,0.0010587556,0.015878698],"study_design_scores_gemma":[0.000026501966,0.000054672044,0.000077813864,0.00003639738,0.000012107592,0.00008422653,0.000053738622,0.40729237,0.0011822525,0.58701164,0.0041495627,0.000018660017],"about_ca_topic_score_codex":0.0008057834,"about_ca_topic_score_gemma":0.001070616,"teacher_disagreement_score":0.0037491107,"about_ca_system_score_codex":0.0007346261,"about_ca_system_score_gemma":0.0015581079,"threshold_uncertainty_score":0.012542665},"labels":[],"label_agreement":null},{"id":"W2082889410","doi":"10.1023/b:jota.0000025708.31430.22","title":"Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Guelph","funders":"","keywords":"Mathematics; Orthant; Projection (relational algebra); Intersection (aeronautics); Cone (formal languages); Convex cone; Regular polygon; Conic optimization; Convex set; Reflection (computer programming); Convex optimization; Euclidean space; Dual cone and polar cone; Theory of computation; Set (abstract data type); Combinatorics; Algorithm; Computer science; Geometry","score_opus":0.026833206224986323,"score_gpt":0.32686238087547764,"score_spread":0.30002917465049134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082889410","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.0025304307,0.00009138233,0.995685,0.00008432765,0.000031566407,0.00003306831,0.00002016185,0.00003948579,0.0014845971],"genre_scores_gemma":[0.10375334,0.00048655568,0.8869361,0.0001331418,0.00010245418,0.00039243064,0.00018280602,0.0003213806,0.0076918066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930894,0.00032899933,0.00003102624,0.00009171589,0.00018699803,0.000052301213],"domain_scores_gemma":[0.99817204,0.0012454923,0.00008498482,0.000108436325,0.00025579482,0.00013324672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027903973,0.0015422358,0.0019908396,0.00088307075,0.0005661155,0.0015150756,0.0023514333,0.0016557628,0.005854008],"category_scores_gemma":[0.0054721306,0.0011066836,0.0017535682,0.00081874494,0.0018617086,0.002176171,0.0035160799,0.0048014354,0.0008279569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003704537,0.0003044771,0.00064618135,0.0008442571,0.00015575434,0.00032091266,0.0003357832,0.40150395,0.011262925,0.47118175,0.006214387,0.10685914],"study_design_scores_gemma":[0.00002846283,0.00006238989,0.000039351627,0.000024411855,0.000015400095,0.000045095443,0.000028361274,0.95757765,0.00072942296,0.040100776,0.0013353886,0.000013204119],"about_ca_topic_score_codex":0.0020560485,"about_ca_topic_score_gemma":0.0021817985,"teacher_disagreement_score":0.005854008,"about_ca_system_score_codex":0.00066240126,"about_ca_system_score_gemma":0.0020723243,"threshold_uncertainty_score":0.019583642},"labels":[],"label_agreement":null},{"id":"W2083045602","doi":"10.1007/s10957-012-0036-3","title":"Gradient-Constrained Minimum Networks. III. Fixed Topology","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"Steiner tree problem; Mathematics; Embedding; Topology (electrical circuits); Network topology; Theory of computation; Combinatorics; Heuristic; Discrete mathematics; Mathematical optimization; Algorithm; Computer science","score_opus":0.006527470420823994,"score_gpt":0.221985977791401,"score_spread":0.215458507370577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083045602","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.02079506,0.0034471701,0.92939985,0.0012476436,0.00020401574,0.0000545818,0.00022933053,0.00023700685,0.044385348],"genre_scores_gemma":[0.74920255,0.005991894,0.20591927,0.00062213326,0.00032143164,0.0002753936,0.0004243903,0.0002862494,0.036956754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984896,0.000041396343,0.000005638039,0.000032500913,0.000052170875,0.00001931875],"domain_scores_gemma":[0.9997291,0.00012187503,0.00003643494,0.00003285814,0.000060732113,0.000018900864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037258584,0.00044389392,0.0004901042,0.00059121393,0.00031661586,0.0010078273,0.0010911314,0.0010980666,0.005219051],"category_scores_gemma":[0.0027170973,0.00042775946,0.00029945842,0.00078257173,0.00078363396,0.0016657059,0.0006943627,0.00083710474,0.00087180425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012638007,0.000025109635,0.0003252493,0.00023019702,0.000048016747,0.0001055944,0.000047319365,0.5086325,0.0040094177,0.38256913,0.007416306,0.09646479],"study_design_scores_gemma":[0.000018327377,0.00005424012,0.00025278653,0.000050710813,0.000014765979,0.00012907354,0.00002048144,0.75838214,0.001497343,0.2303412,0.009222773,0.000016166021],"about_ca_topic_score_codex":0.0019687703,"about_ca_topic_score_gemma":0.0018714267,"teacher_disagreement_score":0.005219051,"about_ca_system_score_codex":0.0007448519,"about_ca_system_score_gemma":0.00043011302,"threshold_uncertainty_score":0.017459452},"labels":[],"label_agreement":null},{"id":"W2084284149","doi":"10.1023/b:jota.0000043989.95285.51","title":"Dynamic Model of R&D, Spillovers, and Efficiency of Bertrand and Cournot Equilibria","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Cournot competition; Bertrand competition; Duopoly; Economics; Differential game; Mathematical economics; Stackelberg competition; Bertrand paradox (economics); Productivity; Competition (biology); Theory of computation; Investment (military); Mathematics; Mathematical optimization; Oligopoly","score_opus":0.012865073583905335,"score_gpt":0.22540429254204022,"score_spread":0.21253921895813488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084284149","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.27544618,0.0023865828,0.54347736,0.0073026093,0.00017072029,0.00028179784,0.002739842,0.00046114132,0.16773373],"genre_scores_gemma":[0.9423272,0.0009455317,0.011397575,0.00018456906,0.00007943927,0.00013711966,0.00033209872,0.00004278044,0.04455364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922454,0.00025141684,0.00003129331,0.00017392778,0.00012836255,0.00019035525],"domain_scores_gemma":[0.99795157,0.0011781489,0.00032440186,0.00010874871,0.00022518433,0.00021193647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012931611,0.00075370114,0.0018523935,0.0012066638,0.0008284047,0.004553664,0.0029437337,0.0033968934,0.018835345],"category_scores_gemma":[0.0042256624,0.0010133538,0.00096042646,0.0015904489,0.001711375,0.0039027338,0.0013081508,0.001777332,0.0016535328],"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.00008968324,0.000104514795,0.00067706953,0.000057335066,0.000046543697,0.00016120078,0.00011534329,0.4734741,0.0007330851,0.5176583,0.0020290122,0.004853805],"study_design_scores_gemma":[0.00010944052,0.000035127385,0.0005285929,0.000015921672,0.000032017604,0.00007843913,0.000057447254,0.82764626,0.00014498307,0.16921829,0.002092737,0.00004068841],"about_ca_topic_score_codex":0.015942648,"about_ca_topic_score_gemma":0.010172063,"teacher_disagreement_score":0.018835345,"about_ca_system_score_codex":0.0026912815,"about_ca_system_score_gemma":0.002277192,"threshold_uncertainty_score":0.063010454},"labels":[],"label_agreement":null},{"id":"W2085259781","doi":"10.1007/s10957-006-9070-3","title":"Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Theory of computation; Mathematics; Game theory; Mathematical economics; Combinatorics; Mathematical optimization; Algorithm","score_opus":0.04046932685072907,"score_gpt":0.332936384393702,"score_spread":0.2924670575429729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085259781","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.17803842,0.0005130932,0.78352565,0.001537314,0.00008373972,0.00019792093,0.0005072309,0.00012716273,0.0354694],"genre_scores_gemma":[0.6411413,0.0008957385,0.33576566,0.00044153852,0.00017319481,0.0008959221,0.0012453852,0.00015995766,0.01928133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795973,0.001004952,0.00014400168,0.000284443,0.00034172015,0.00026530708],"domain_scores_gemma":[0.9946374,0.0035935054,0.00047235982,0.0003502412,0.0004960698,0.00045028253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391277,0.0013376838,0.002399737,0.0021495086,0.0019602645,0.0043814816,0.0024520666,0.0027340918,0.0092141135],"category_scores_gemma":[0.010443061,0.0009834259,0.0014849579,0.0027102395,0.0024059366,0.007825424,0.0037602065,0.003978168,0.0009251094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017530686,0.00015082794,0.0005982726,0.00015669406,0.000041605053,0.00007778127,0.00022535601,0.021672128,0.0009463091,0.9517437,0.0025044226,0.021707535],"study_design_scores_gemma":[0.000026027836,0.00003099365,0.00014347374,0.000024060842,0.000007944373,0.000053896376,0.000066425,0.04430722,0.0002875067,0.9542878,0.0007525941,0.000011984097],"about_ca_topic_score_codex":0.00055437314,"about_ca_topic_score_gemma":0.0006941791,"teacher_disagreement_score":0.0092141135,"about_ca_system_score_codex":0.00084457884,"about_ca_system_score_gemma":0.0014805088,"threshold_uncertainty_score":0.030824244},"labels":[],"label_agreement":null},{"id":"W2088134026","doi":"10.1007/s10957-010-9716-z","title":"Annealing a Genetic Algorithm for Constrained Optimization","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Acadia University","funders":"","keywords":"Mathematical optimization; Simulated annealing; Penalty method; Convergence (economics); Computer science; Optimization problem; Genetic algorithm; Forcing (mathematics); Algorithm; Mathematics","score_opus":0.01071977768036943,"score_gpt":0.28486966622273735,"score_spread":0.27414988854236794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088134026","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.004091067,0.0005462745,0.98961604,0.00016191135,0.000116013915,0.000038652113,0.000023700186,0.00024167045,0.005164666],"genre_scores_gemma":[0.15561938,0.0008423514,0.8355592,0.00019142195,0.00013145589,0.00024815678,0.000094668954,0.0002109911,0.007102462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953127,0.00020677687,0.00001826336,0.00005372468,0.00016705123,0.000022967715],"domain_scores_gemma":[0.9995016,0.00030584654,0.000025681464,0.000059060352,0.00009461654,0.000013170909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464454,0.0005935924,0.0010291116,0.00055948825,0.0006052277,0.0007880308,0.0009819734,0.0019379937,0.0029691064],"category_scores_gemma":[0.0023750644,0.00046848232,0.00081997266,0.0012350566,0.0009314114,0.0007600855,0.00084313186,0.0015397378,0.00064617407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053213473,0.000048361166,0.00020938429,0.00009046117,0.000072911425,0.000046439385,0.00007314802,0.8476739,0.0033383677,0.052760687,0.0026381738,0.092994906],"study_design_scores_gemma":[0.0000153379,0.000021579015,0.00007944926,0.000010059733,0.00001485876,0.0000137107545,0.000004236863,0.98540527,0.0003263495,0.011664126,0.0024385138,0.0000065687937],"about_ca_topic_score_codex":0.0047470783,"about_ca_topic_score_gemma":0.00398827,"teacher_disagreement_score":0.0047470783,"about_ca_system_score_codex":0.00048041256,"about_ca_system_score_gemma":0.0009814247,"threshold_uncertainty_score":0.009932697},"labels":[],"label_agreement":null},{"id":"W2090884848","doi":"10.1007/s10957-014-0668-6","title":"Optimal Control of a Multistate Failure-Prone Manufacturing System under a Conditional Value-at-Risk Cost Criterion","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"CVAR; Mathematical optimization; Expected shortfall; Control (management); Constant (computer programming); Computer science; Optimal control; Risk aversion (psychology); Value (mathematics); Point (geometry); Product (mathematics); Economics; Econometrics; Mathematics; Mathematical economics; Risk management; Expected utility hypothesis","score_opus":0.005414435977579333,"score_gpt":0.22217061612411113,"score_spread":0.21675618014653178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090884848","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.26389754,0.0008785982,0.72187316,0.0018111431,0.0002550763,0.00019720942,0.00036191437,0.0005168116,0.010208484],"genre_scores_gemma":[0.9935661,0.00010488275,0.0040515843,0.00004851026,0.000023883427,0.000049996426,0.000043230106,0.000017784525,0.0020940918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984012,0.000521573,0.00006605375,0.0003401886,0.00024132025,0.00042954434],"domain_scores_gemma":[0.9968245,0.001675059,0.00054154155,0.00010948495,0.0005838954,0.00026547778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003016859,0.0017155078,0.0024056528,0.0010067482,0.0009813532,0.003014746,0.0016389686,0.0025768138,0.0023250685],"category_scores_gemma":[0.0046349773,0.0009862595,0.0010610158,0.00083945075,0.0018600842,0.0013751934,0.002651832,0.0015425003,0.00022856811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011097206,0.000030952375,0.00024236423,0.00003970776,0.000035845136,0.000054213855,0.00003058754,0.99255836,0.0012062682,0.0037650308,0.00019199835,0.0017337542],"study_design_scores_gemma":[0.00000781744,0.000043707638,0.00015433185,0.0000038418193,0.000010845102,0.0000039321008,0.000006134247,0.99854773,0.00015755463,0.0010231803,0.00003453008,0.0000064127894],"about_ca_topic_score_codex":0.01729456,"about_ca_topic_score_gemma":0.008060303,"teacher_disagreement_score":0.01729456,"about_ca_system_score_codex":0.0022160618,"about_ca_system_score_gemma":0.002573169,"threshold_uncertainty_score":0.034387767},"labels":[],"label_agreement":null},{"id":"W2100939679","doi":"10.1007/s10957-007-9249-2","title":"An Algorithm for Portfolio Optimization with Variable Transaction Costs, Part 2: Computational Analysis","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Mathematical optimization; Transaction cost; Computer science; Variable (mathematics); Portfolio optimization; Portfolio; Optimization problem; Point (geometry); Sequence (biology); Algorithm; Mathematics; Economics; Financial economics","score_opus":0.01039593642916784,"score_gpt":0.2283072835997105,"score_spread":0.21791134717054267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100939679","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.0057892087,0.00028589158,0.99131846,0.00023127049,0.00007327236,0.000065714885,0.000046792004,0.00026089078,0.0019285007],"genre_scores_gemma":[0.081466086,0.00029061682,0.91431314,0.00015376335,0.000105692394,0.00043478204,0.00016003991,0.000198316,0.0028775788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923885,0.00032403687,0.000057505586,0.00011736353,0.00018882996,0.000073488365],"domain_scores_gemma":[0.99638534,0.0026590957,0.0001338718,0.00032718008,0.000391825,0.00010264591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018644434,0.0011253549,0.0015962868,0.0011109916,0.0007470015,0.0015312808,0.002085754,0.0025111565,0.008058023],"category_scores_gemma":[0.008964866,0.0007904868,0.0011029767,0.0018842788,0.00087791315,0.0026783021,0.0021912248,0.002110451,0.0012060055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020701831,0.00019402236,0.0007221494,0.00013922402,0.00009376477,0.000066828325,0.00007736793,0.69680077,0.0010589156,0.042497486,0.0056786994,0.25246373],"study_design_scores_gemma":[0.000039204762,0.00001856581,0.00005638996,0.000007502953,0.000008123907,0.000017305054,0.0000041394755,0.9831004,0.00015323967,0.016018203,0.00057322514,0.0000037410675],"about_ca_topic_score_codex":0.002884491,"about_ca_topic_score_gemma":0.0031199846,"teacher_disagreement_score":0.008058023,"about_ca_system_score_codex":0.0007978114,"about_ca_system_score_gemma":0.001957125,"threshold_uncertainty_score":0.026956737},"labels":[],"label_agreement":null},{"id":"W2108293203","doi":"10.1007/s10957-007-9297-7","title":"Measure-Valued Differentiation for Markov Chains","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"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":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Markov chain; Mathematics; Measure (data warehouse); Markov kernel; Estimator; Kernel (algebra); Applied mathematics; Generality; Markov model; Discrete mathematics; Combinatorics; Mathematical optimization; Variable-order Markov model; Computer science; Statistics","score_opus":0.03489857493065025,"score_gpt":0.3465355127841554,"score_spread":0.31163693785350516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108293203","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.017144978,0.0034846955,0.9683903,0.0019793042,0.00031413292,0.000041037467,0.000109532026,0.00010451339,0.008431576],"genre_scores_gemma":[0.6343929,0.009247062,0.32137817,0.0012987414,0.0013447544,0.00041677107,0.00045956837,0.00048612224,0.030975869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997623,0.0012740938,0.0001496881,0.0003023399,0.00047933366,0.00017147214],"domain_scores_gemma":[0.97704405,0.017331066,0.001643001,0.000895075,0.0018793246,0.0012075776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007951054,0.0017987501,0.0023380516,0.0031167783,0.0014110357,0.0036170545,0.0019794633,0.002577049,0.0042073973],"category_scores_gemma":[0.030533377,0.0011344813,0.0016176684,0.0026374338,0.0061725713,0.0061341687,0.0035760046,0.00501953,0.00051223225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109468265,0.000014991189,0.00018830756,0.000051486557,0.000020820074,0.000034767883,0.000096139665,0.015963223,0.00019952068,0.97938687,0.0005891892,0.0034437575],"study_design_scores_gemma":[0.0000074515215,0.0000064612072,0.00008097684,0.000026457697,0.0000067979704,0.000023314724,0.000015603491,0.13781688,0.000056472265,0.86099017,0.000958491,0.000010974272],"about_ca_topic_score_codex":0.0055222893,"about_ca_topic_score_gemma":0.0046267854,"teacher_disagreement_score":0.007951054,"about_ca_system_score_codex":0.005148076,"about_ca_system_score_gemma":0.003257123,"threshold_uncertainty_score":0.042049706},"labels":[],"label_agreement":null},{"id":"W2113793814","doi":"10.1023/a:1019672829007","title":"Suboptimal Regulators for Discrete-Time Jump Linear Systems with Time-Multiplied Performance Index","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Discrete time and continuous time; Control theory (sociology); Jump; Constant (computer programming); Index (typography); Mathematics; Linear regulator; Control (management); Linear system; Time constant; Computer science; State (computer science); Mathematical optimization; Applied mathematics; Regulator; Algorithm; Mathematical analysis; Statistics; Engineering; Physics","score_opus":0.005096351887693274,"score_gpt":0.18606585952141513,"score_spread":0.18096950763372185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113793814","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.02154048,0.0008696175,0.96848273,0.0003635564,0.00014358293,0.00006182478,0.000039562496,0.00034952414,0.008149069],"genre_scores_gemma":[0.95438975,0.0005839769,0.040236752,0.00015844683,0.000088702705,0.00012433979,0.00005754029,0.000051000578,0.004309398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988256,0.0003404684,0.00007826155,0.0002351099,0.00036083697,0.00015984017],"domain_scores_gemma":[0.99763167,0.0013913646,0.00029181642,0.00016402594,0.00047694886,0.000044183795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024255454,0.000831886,0.0014296046,0.00038044265,0.0006036639,0.0024561405,0.0009536675,0.0013216188,0.002235816],"category_scores_gemma":[0.0057697715,0.00045436464,0.00037069392,0.00051138975,0.0014748676,0.0012637477,0.0009749324,0.001247363,0.00035202794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043311677,0.00015284412,0.00041478613,0.00053884834,0.00010082879,0.00016517914,0.00038130945,0.7553242,0.020138172,0.15439883,0.0033956796,0.064556144],"study_design_scores_gemma":[0.000033741097,0.00008231919,0.00009400671,0.00001798048,0.000019028847,0.000017976176,0.00001944808,0.9821586,0.0020153793,0.01458616,0.0009424271,0.0000129587],"about_ca_topic_score_codex":0.0022907036,"about_ca_topic_score_gemma":0.0027991603,"teacher_disagreement_score":0.0024561405,"about_ca_system_score_codex":0.0012292536,"about_ca_system_score_gemma":0.0014312412,"threshold_uncertainty_score":0.012827694},"labels":[],"label_agreement":null},{"id":"W2137362083","doi":"10.1007/s10957-007-9340-8","title":"Pricing and Advertising of Private and National Brands in a Dynamic Marketing Channel","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":52,"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; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Castilla y León; Ministerio de Economía y Competitividad","keywords":"Goodwill; Brand equity; Advertising; Business; Brand management; National brand; Brand awareness; Purchasing; Private label; Brand extension; Marketing","score_opus":0.009195399602621276,"score_gpt":0.23329582636106694,"score_spread":0.22410042675844566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137362083","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.95903796,0.00052437815,0.014427706,0.0012414659,0.00005269255,0.000023921106,0.00010071355,0.00008143953,0.02450976],"genre_scores_gemma":[0.99631625,0.00010197445,0.0008192202,0.00002983335,0.000026670466,0.0000035918877,0.00001848049,0.000011609947,0.0026722879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992545,0.00028259345,0.000028104765,0.00009435197,0.00012143465,0.00021903164],"domain_scores_gemma":[0.9845397,0.013078491,0.00067178794,0.00036856259,0.0008048373,0.000536657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020606283,0.00030066166,0.0008113605,0.00086714735,0.00076191296,0.004076585,0.0005644326,0.0011890245,0.0078060217],"category_scores_gemma":[0.012466935,0.00047141852,0.0005232403,0.00080856925,0.0014115188,0.0037726022,0.00089507643,0.0010403839,0.00038680056],"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.0039834585,0.0018433429,0.04306823,0.00023486353,0.00019470166,0.00088857644,0.0019993342,0.21592312,0.016918901,0.5926983,0.007474216,0.11477304],"study_design_scores_gemma":[0.00014459617,0.00023425797,0.035874516,0.000047137706,0.00026660136,0.00037616614,0.0013617777,0.77519244,0.002943926,0.18041807,0.0030067489,0.0001337273],"about_ca_topic_score_codex":0.0036188406,"about_ca_topic_score_gemma":0.004888051,"teacher_disagreement_score":0.0078060217,"about_ca_system_score_codex":0.002056701,"about_ca_system_score_gemma":0.0008006518,"threshold_uncertainty_score":0.026113808},"labels":[],"label_agreement":null},{"id":"W2161105844","doi":"10.1023/a:1017555931930","title":"Random-Direction Optimization Algorithms with Applications to Threshold Controls","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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","funders":"","keywords":"Convergence (economics); Mathematical optimization; Stochastic optimization; Computer science; Rate of convergence; Class (philosophy); Algorithm; Stochastic approximation; Mathematics; Key (lock); Artificial intelligence","score_opus":0.035395414333277087,"score_gpt":0.35788658585160116,"score_spread":0.32249117151832407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161105844","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.0021915261,0.00038701325,0.99562114,0.00014841217,0.00006489154,0.000020211917,0.00000976801,0.00010252855,0.0014546338],"genre_scores_gemma":[0.2755958,0.0017891814,0.71125346,0.00029661698,0.00024119401,0.00048797257,0.00010146675,0.00030207646,0.009932208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988662,0.0005921066,0.000059812024,0.00015236044,0.00026155432,0.00006799272],"domain_scores_gemma":[0.993321,0.0051197065,0.00040348372,0.00033225672,0.0006254781,0.00019810084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036866004,0.0012890183,0.002107648,0.0013985983,0.0006724505,0.001741757,0.0019123753,0.0024543982,0.004479398],"category_scores_gemma":[0.014739869,0.0008381463,0.0011074165,0.002067724,0.0019158619,0.002731863,0.0024308274,0.0025565336,0.0006040084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106222375,0.000091762515,0.00024889995,0.00012948194,0.000043379783,0.000050262057,0.000072258044,0.60597795,0.00083682453,0.32887775,0.0021412435,0.061423965],"study_design_scores_gemma":[0.00002123819,0.000020423517,0.000023618082,0.000010755758,0.0000066132857,0.0000125053075,0.000004406457,0.9476517,0.00017265629,0.051425576,0.00064234814,0.000008173876],"about_ca_topic_score_codex":0.0019589225,"about_ca_topic_score_gemma":0.0017265979,"teacher_disagreement_score":0.004479398,"about_ca_system_score_codex":0.0009237886,"about_ca_system_score_gemma":0.0012879372,"threshold_uncertainty_score":0.019496858},"labels":[],"label_agreement":null},{"id":"W2163580726","doi":"10.1007/s10957-005-4713-3","title":"Sensitivity of Pareto Solutions in Multiobjective Optimization","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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é du Québec à Montréal","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Sensitivity (control systems); Mathematical optimization; Mathematics; Pareto principle; Theory of computation; Multi-objective optimization; Scalar (mathematics); Applied mathematics; Nonlinear system; Computation; Pareto interpolation; Algorithm","score_opus":0.009415201946547677,"score_gpt":0.2469129794044059,"score_spread":0.23749777745785822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163580726","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.13283047,0.0030078262,0.84562904,0.0011944628,0.0002077187,0.00015995145,0.00013863003,0.00019927477,0.01663268],"genre_scores_gemma":[0.9516438,0.0010847035,0.043787677,0.00019768863,0.00011563926,0.00014929195,0.000084833424,0.00011632615,0.0028200978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938024,0.0035393029,0.00023941601,0.00043916155,0.0016516068,0.00032806],"domain_scores_gemma":[0.96506983,0.03081037,0.0014168995,0.0008692795,0.0012871253,0.0005464601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011297519,0.0016662729,0.0022218693,0.004517583,0.0011410585,0.003031917,0.0014901274,0.0024830597,0.0016816187],"category_scores_gemma":[0.050795183,0.0018567364,0.0021706293,0.0022677255,0.0036516923,0.0034008618,0.0046457932,0.0024818776,0.00017365206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010548324,0.000053308562,0.0009930519,0.00013601594,0.0001653188,0.00016916628,0.00018677721,0.91139144,0.0018088485,0.071319595,0.0005310719,0.013139945],"study_design_scores_gemma":[0.000009280013,0.000051687744,0.00056913676,0.000040071063,0.000027430897,0.00006773691,0.00004154411,0.88572365,0.0006151092,0.11248691,0.00033747806,0.00003004105],"about_ca_topic_score_codex":0.0016907429,"about_ca_topic_score_gemma":0.00075652514,"teacher_disagreement_score":0.011297519,"about_ca_system_score_codex":0.0026408564,"about_ca_system_score_gemma":0.000982087,"threshold_uncertainty_score":0.059747756},"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":"W2283656494","doi":"10.1023/a:1004661928043","title":"H∞-Control for Linear Time-Delay Systems with Markovian Jumping Parameters","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","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":"Jumping; Mathematics; Control theory (sociology); Theory of computation; Bounded function; Markov process; Norm (philosophy); Attenuation; Control (management); Applied mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.004192982776474372,"score_gpt":0.19417058201199813,"score_spread":0.18997759923552376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283656494","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.07272329,0.0010022945,0.91656077,0.00055214216,0.00018474783,0.0000612589,0.00011415029,0.00029528528,0.008505981],"genre_scores_gemma":[0.9887999,0.0002892689,0.0072738742,0.00008151458,0.00005358137,0.000060247523,0.000052789823,0.00002518751,0.0033635546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995858,0.00012648375,0.00002545852,0.000087873574,0.000098553384,0.00007581303],"domain_scores_gemma":[0.9987373,0.00076607015,0.00015636654,0.00005121308,0.00024997556,0.000039092236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011907757,0.00094098196,0.0008322032,0.00034043033,0.00054491137,0.0014563306,0.0009484487,0.0010949825,0.0019853606],"category_scores_gemma":[0.002508128,0.0003463383,0.00047125164,0.0004488777,0.0011606645,0.00086958735,0.0011950743,0.0010284749,0.000250001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032080314,0.000110978304,0.00033164895,0.0002676819,0.00009507997,0.00010469586,0.00016147032,0.9208327,0.0068831714,0.033569336,0.0010428918,0.036279507],"study_design_scores_gemma":[0.00001884863,0.00007164829,0.00013857431,0.000007210244,0.000011461267,0.0000076237684,0.000011290099,0.9932708,0.0006756775,0.0055563236,0.00022217027,0.000008364492],"about_ca_topic_score_codex":0.0079996865,"about_ca_topic_score_gemma":0.0043023364,"teacher_disagreement_score":0.0079996865,"about_ca_system_score_codex":0.000979,"about_ca_system_score_gemma":0.0010274383,"threshold_uncertainty_score":0.015906274},"labels":[],"label_agreement":null},{"id":"W2481787546","doi":"10.1007/s10957-016-0988-9","title":"Generalized Derivatives of Differential–Algebraic Equations","year":2016,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":28,"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; Novartis-MIT Center for Continuous Manufacturing","keywords":"Mathematics; Differential algebraic geometry; Differential algebraic equation; Parametric statistics; Lipschitz continuity; Differential equation; Applied mathematics; Algebraic number; Algebraic differential equation; Mathematical analysis; Ordinary differential equation","score_opus":0.039793036554293594,"score_gpt":0.33783470303083696,"score_spread":0.29804166647654334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481787546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07020992,0.018052718,0.8545888,0.0038919344,0.0027331205,0.000060024464,0.00028613687,0.00023710742,0.049940255],"genre_scores_gemma":[0.78789127,0.015631521,0.14256142,0.0012322775,0.003260448,0.00013067873,0.00039109075,0.00042772113,0.04847351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993774,0.00029258477,0.000042631185,0.00008498251,0.00015920823,0.000043239394],"domain_scores_gemma":[0.9986607,0.00047135045,0.00022209181,0.00013381957,0.00035592008,0.00015597718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014773231,0.0013776958,0.0016650748,0.0020705194,0.0007213376,0.0025735935,0.0009831828,0.0012420742,0.00299724],"category_scores_gemma":[0.0038702844,0.00053895154,0.0011022141,0.0016952432,0.0030125566,0.0029566372,0.0020150295,0.002254244,0.00042757925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015234293,0.000016757676,0.000227664,0.00009025664,0.0000394865,0.00006439067,0.0001090617,0.020501686,0.0009413019,0.9666794,0.0016202446,0.009694618],"study_design_scores_gemma":[0.000010866317,0.000014554046,0.00029387517,0.000024578147,0.000017002183,0.00006899826,0.000037901867,0.12104713,0.00019677797,0.8715914,0.0066742096,0.000022670776],"about_ca_topic_score_codex":0.0029248595,"about_ca_topic_score_gemma":0.003361893,"teacher_disagreement_score":0.00299724,"about_ca_system_score_codex":0.0013212438,"about_ca_system_score_gemma":0.0013068776,"threshold_uncertainty_score":0.010026813},"labels":[],"label_agreement":null},{"id":"W252470463","doi":"10.1023/a:1022170404978","title":"Guaranteed Cost Control of a Markov Jump Linear Uncertain System Using a Time-Multiplied Cost Function","year":2003,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":23,"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; Quadratic growth; Control theory (sociology); Theory of computation; Linear system; Constant (computer programming); Jump; Norm (philosophy); Bounded function; Jump process; Mathematical optimization; Average cost; Cost control; Function (biology); Control (management); Computer science; Statistics; Algorithm; Mathematical analysis; Law; Economics","score_opus":0.008841609008711667,"score_gpt":0.2217040934708908,"score_spread":0.21286248446217912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W252470463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08272067,0.00038655454,0.91160315,0.00051208545,0.00015637277,0.00004412076,0.00006253405,0.00021417942,0.004300397],"genre_scores_gemma":[0.98474926,0.00010930241,0.012648964,0.000043496657,0.000042446896,0.000051737563,0.000027701311,0.000017760178,0.002309309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993563,0.00017730886,0.000033982447,0.00013632848,0.00018442461,0.00011170163],"domain_scores_gemma":[0.99867684,0.0006820939,0.00022970492,0.00006462753,0.00028207613,0.00006467531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866938,0.0009739487,0.0013603689,0.00041664598,0.0006533549,0.0014605708,0.0010793036,0.0014766431,0.001974338],"category_scores_gemma":[0.0028349159,0.00045963132,0.00064518146,0.00044835234,0.0010941244,0.0011529356,0.0014857458,0.0009026255,0.00018678434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020651567,0.00003548793,0.00022554435,0.000086748354,0.000045127417,0.000077150944,0.000054500124,0.9688109,0.0034607402,0.015937818,0.00035168455,0.010707749],"study_design_scores_gemma":[0.000010517587,0.000034523844,0.000060246843,0.0000024624853,0.0000067953156,0.000005489973,0.0000017446206,0.998516,0.00026094698,0.0010231375,0.000073589574,0.0000044327317],"about_ca_topic_score_codex":0.009004045,"about_ca_topic_score_gemma":0.005618968,"teacher_disagreement_score":0.009004045,"about_ca_system_score_codex":0.00091407483,"about_ca_system_score_gemma":0.0011967329,"threshold_uncertainty_score":0.017903268},"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":"W2738359971","doi":"10.1007/s10957-017-1139-7","title":"Optimal Timing to Initiate Medical Treatment for a Disease Evolving as a Semi-Markov Process","year":2017,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Statistical Methods in Clinical Trials","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":"Theory of computation; Mathematics; Process (computing); Markov process; Markov decision process; Mathematical optimization; Markov chain; Calculus (dental); Applied mathematics; Computer science; Medicine; Algorithm; Statistics","score_opus":0.2880180947609726,"score_gpt":0.5617737587265674,"score_spread":0.2737556639655948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738359971","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.31758562,0.0023753894,0.65587807,0.015012537,0.00057638134,0.0004721031,0.0015037635,0.0004785981,0.006117508],"genre_scores_gemma":[0.9496077,0.0011652985,0.041927464,0.00071988173,0.00040936732,0.00036352078,0.0005509743,0.000054489883,0.0052013835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977718,0.0010773632,0.00013449117,0.00046569726,0.00023144258,0.00031912618],"domain_scores_gemma":[0.9649017,0.03064558,0.0021541284,0.0005018489,0.0006218686,0.0011750099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062252115,0.00084818987,0.002707089,0.0009595009,0.00041990363,0.0017222244,0.001416348,0.002360441,0.0063110744],"category_scores_gemma":[0.027719796,0.0009002523,0.0012036756,0.0006539,0.0014059988,0.0018730216,0.0011416211,0.003410122,0.00057843287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003637925,0.00065449154,0.013967493,0.00047424049,0.00050945487,0.0005351921,0.00022108332,0.687555,0.0034480386,0.23019508,0.0056075077,0.053194437],"study_design_scores_gemma":[0.0005128458,0.00070284406,0.003135774,0.00010257268,0.0003097068,0.00021311114,0.000071107905,0.8908663,0.001076167,0.101887144,0.0010616268,0.000060885017],"about_ca_topic_score_codex":0.002650081,"about_ca_topic_score_gemma":0.0017960903,"teacher_disagreement_score":0.0063110744,"about_ca_system_score_codex":0.0013155142,"about_ca_system_score_gemma":0.0038026352,"threshold_uncertainty_score":0.032922447},"labels":[],"label_agreement":null},{"id":"W2803334141","doi":"10.1007/s10957-018-1309-2","title":"Generalized Derivatives of Lexicographic Linear Programs","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Process Optimization and Integration","field":"Engineering","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":"McMaster University","funders":"","keywords":"Mathematics; Lexicographical order; Theory of computation; Applied mathematics; Mathematical optimization; Algebra over a field; Combinatorics; Pure mathematics; Algorithm","score_opus":0.01094717925663567,"score_gpt":0.2521632804427691,"score_spread":0.24121610118613343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803334141","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058761194,0.0013589025,0.90094876,0.0009773751,0.00026471564,0.000043902528,0.0001932522,0.0002350268,0.037216883],"genre_scores_gemma":[0.68483454,0.0025659553,0.26176217,0.00057300384,0.00038938108,0.00019913241,0.00040208633,0.00060277525,0.04867089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936897,0.00029525696,0.000035206693,0.00007126898,0.00016903419,0.000060207632],"domain_scores_gemma":[0.9986778,0.0008362168,0.00012000967,0.000107146036,0.0001768522,0.00008195609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012178371,0.0007897049,0.00085113687,0.0012221099,0.00047949626,0.002184679,0.00067870936,0.00070900825,0.0074241515],"category_scores_gemma":[0.0045985323,0.00044914478,0.0006233337,0.0013794033,0.0018497504,0.0028773984,0.001462426,0.0017323748,0.0006622747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047221667,0.000028370137,0.00016586161,0.00009575881,0.000017929444,0.00005549843,0.000107006126,0.03962423,0.001238631,0.93099153,0.0018353754,0.025792513],"study_design_scores_gemma":[0.000015984717,0.000045258617,0.00012060288,0.000032053893,0.000011564398,0.00006370289,0.000053067215,0.16792765,0.0008790668,0.8263668,0.0044683823,0.000015849799],"about_ca_topic_score_codex":0.0010954442,"about_ca_topic_score_gemma":0.0018194407,"teacher_disagreement_score":0.0074241515,"about_ca_system_score_codex":0.0010711867,"about_ca_system_score_gemma":0.0011799689,"threshold_uncertainty_score":0.024836242},"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":"W2897088789","doi":"10.1007/s10957-018-1411-5","title":"The Valuation of American Passport Options: A Viscosity Solution Approach","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Viscosity solution; Uniqueness; Variational inequality; Convexity; Theory of computation; Mathematics; Valuation of options; Valuation (finance); Mathematical economics; Viscosity; Put option; Mathematical optimization; Applied mathematics; Actuarial science; Mathematical analysis; Econometrics; Economics; Finance","score_opus":0.024412122416141598,"score_gpt":0.24706060888106768,"score_spread":0.22264848646492608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897088789","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.15231809,0.0033169405,0.8000703,0.006181779,0.0005281057,0.00007817303,0.000103927916,0.00007920026,0.037323404],"genre_scores_gemma":[0.93010676,0.0014843774,0.049678404,0.0003092869,0.00052163604,0.00007751827,0.0000621246,0.00006910159,0.017690824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999368,0.00038904182,0.000023051029,0.00007246667,0.000091581984,0.000055930755],"domain_scores_gemma":[0.9981401,0.0012076728,0.000189721,0.00007008138,0.0001564344,0.00023603144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018905965,0.0012793362,0.0013680585,0.0013497563,0.0008316939,0.0047441614,0.0014103464,0.0042424533,0.003313468],"category_scores_gemma":[0.009533961,0.0009130712,0.0011527411,0.0009933729,0.0029371756,0.0061909887,0.002013127,0.0030491203,0.00016121773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006733882,0.000048101665,0.00036598268,0.000057328212,0.00004588322,0.0002471097,0.00016609934,0.143024,0.001299587,0.8453918,0.0012974365,0.007989393],"study_design_scores_gemma":[0.000019458363,0.000023473325,0.00014995768,0.000028605762,0.00001594606,0.00006930802,0.000053621232,0.7254898,0.00020322968,0.27263668,0.0012870635,0.000022845119],"about_ca_topic_score_codex":0.0023424479,"about_ca_topic_score_gemma":0.0013221968,"teacher_disagreement_score":0.0047441614,"about_ca_system_score_codex":0.0013480772,"about_ca_system_score_gemma":0.0012758601,"threshold_uncertainty_score":0.011084676},"labels":[],"label_agreement":null},{"id":"W2898479565","doi":"10.1007/s10957-018-1414-2","title":"Variational Analysis on the Signed Distance Functions","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"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; National Natural Science Foundation of China","keywords":"Signed distance function; Mathematics; Set function; Subderivative; Hausdorff distance; Complement (music); Function (biology); Boundary (topology); Distance transform; Minkowski distance; Closed set; Theory of computation; Level set (data structures); Set (abstract data type); Discrete mathematics; Mathematical analysis; Algorithm; Regular polygon; Euclidean distance; Convex optimization; Artificial intelligence; Geometry; Computer science","score_opus":0.007556437567237859,"score_gpt":0.23437614908123358,"score_spread":0.22681971151399571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898479565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01602288,0.0016273916,0.97288066,0.0014036419,0.00024738992,0.000026062049,0.00011605231,0.000060956478,0.007614948],"genre_scores_gemma":[0.67208993,0.006266849,0.26330194,0.0010400105,0.0016104148,0.0002781482,0.000929065,0.0007700446,0.053713553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862933,0.00069023663,0.00005901849,0.00019402977,0.00032567084,0.00010161232],"domain_scores_gemma":[0.9948279,0.0030603162,0.00041741118,0.00030139566,0.00094050396,0.00045236218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030182148,0.0012003067,0.0013674266,0.0022632603,0.0006691588,0.002983904,0.0020072295,0.0021200418,0.0038592827],"category_scores_gemma":[0.011806671,0.00072359346,0.0010923945,0.0015009571,0.0032775528,0.003847104,0.0033218896,0.003742139,0.0006135368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022502905,0.000017528291,0.00021940275,0.00006231993,0.000029745397,0.00003262895,0.00005476366,0.03456193,0.0010935711,0.95077866,0.0014866012,0.011640353],"study_design_scores_gemma":[0.000007780008,0.000023266362,0.00021167191,0.000024586578,0.000010017815,0.000044582102,0.000029387495,0.32353747,0.00032916406,0.6725506,0.0032111197,0.000020386662],"about_ca_topic_score_codex":0.0029694834,"about_ca_topic_score_gemma":0.0026301288,"teacher_disagreement_score":0.0038592827,"about_ca_system_score_codex":0.0022375176,"about_ca_system_score_gemma":0.0016497658,"threshold_uncertainty_score":0.016234398},"labels":[],"label_agreement":null},{"id":"W3007500615","doi":"10.1007/s10957-020-01633-w","title":"Connectedness of Solution Sets for Weak Generalized Symmetric Ky Fan Inequality Problems via Addition-Invariant Sets","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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 British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Social connectedness; Mathematics; Invariant (physics); Solution set; Inequality; Equivalence (formal languages); Pure mathematics; Combinatorics; Mathematical analysis; Set (abstract data type)","score_opus":0.02784079282427759,"score_gpt":0.2731701944249676,"score_spread":0.24532940160069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007500615","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.54814804,0.0013714106,0.40377262,0.0014908316,0.00013796084,0.00021573371,0.0005911524,0.0001660305,0.044106286],"genre_scores_gemma":[0.94205743,0.0012341221,0.042383384,0.00028526856,0.00021451441,0.00039459116,0.00083832705,0.00014770916,0.012444772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989837,0.0003299708,0.000061062325,0.00026222802,0.00025380353,0.00010925473],"domain_scores_gemma":[0.99111205,0.0060421703,0.0010025954,0.00023765654,0.000820477,0.0007850995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020619566,0.0017515279,0.0020284469,0.005202984,0.0019458575,0.005112136,0.0025648326,0.0018010606,0.006440317],"category_scores_gemma":[0.010392619,0.0012957489,0.0019507757,0.0019976774,0.0037989444,0.00532198,0.004716876,0.003858049,0.0003430085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014543373,0.00011348491,0.0010150496,0.00015174813,0.00007847627,0.00014664221,0.00041760912,0.02474768,0.002887613,0.9623317,0.00081141025,0.007153204],"study_design_scores_gemma":[0.000043486867,0.00008082978,0.0010764089,0.00006691049,0.000044886332,0.000107465596,0.00023592035,0.22727937,0.0010411766,0.7688744,0.0011077656,0.000041433177],"about_ca_topic_score_codex":0.0018287766,"about_ca_topic_score_gemma":0.0014155869,"teacher_disagreement_score":0.006440317,"about_ca_system_score_codex":0.0021289487,"about_ca_system_score_gemma":0.0011350682,"threshold_uncertainty_score":0.021544993},"labels":[],"label_agreement":null},{"id":"W3016379773","doi":"10.1007/s10957-020-01760-4","title":"Optimal Dividend and Capital Structure with Debt Covenants","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","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; Université du Québec à Montréal","funders":"","keywords":"Dividend; Capital structure; Debt; Creditor; Bankruptcy; Capital (architecture); Economics; Covenant; Variational inequality; Mathematics; Mathematical economics; Finance; Mathematical optimization","score_opus":0.009743008380331772,"score_gpt":0.19768367126598352,"score_spread":0.18794066288565175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016379773","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.6536644,0.0018508339,0.30158404,0.00737569,0.0002770151,0.00019070388,0.0005764132,0.0002454343,0.034235407],"genre_scores_gemma":[0.98131096,0.00033630608,0.011170418,0.00014172416,0.00008667522,0.000045404504,0.000094717325,0.0000353558,0.0067783776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901915,0.00047514075,0.00004854188,0.00018676007,0.00009695057,0.00017338664],"domain_scores_gemma":[0.990448,0.007006401,0.0010941871,0.00028291967,0.00041486343,0.000753632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035289794,0.000992748,0.0030671703,0.0008372543,0.0006402401,0.0043252218,0.0014274932,0.0032915026,0.004857053],"category_scores_gemma":[0.02319376,0.0017152792,0.0006737242,0.0009165298,0.002253083,0.0044403495,0.0016661389,0.0024044022,0.00028027108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005908821,0.00042999026,0.0026382622,0.00014769347,0.00010784494,0.0003280877,0.0001437175,0.69337845,0.0016949055,0.28665322,0.003049663,0.010837324],"study_design_scores_gemma":[0.0002172194,0.00010430911,0.0013141005,0.000033866734,0.000040999115,0.000040651244,0.000089739326,0.80302787,0.00048234165,0.19390242,0.00071183033,0.00003468216],"about_ca_topic_score_codex":0.00514918,"about_ca_topic_score_gemma":0.0035498096,"teacher_disagreement_score":0.00514918,"about_ca_system_score_codex":0.002629146,"about_ca_system_score_gemma":0.0032896695,"threshold_uncertainty_score":0.01907587},"labels":[],"label_agreement":null},{"id":"W3021784020","doi":"10.1023/a:1017515721760","title":"Robust Stability and Stabilizability of Markov Jump Linear Uncertain Systems with Mode-Dependent Time Delays","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":75,"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":"Control theory (sociology); Mathematics; Theory of computation; Stability (learning theory); Class (philosophy); State (computer science); Jump; Linear system; Mode (computer interface); Controller (irrigation); Computer science; Control (management); Algorithm; Mathematical analysis","score_opus":0.012484941336952519,"score_gpt":0.21361769179469,"score_spread":0.20113275045773749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021784020","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.19086492,0.00086908566,0.801098,0.00059955555,0.0001251269,0.00005602231,0.00014803247,0.00036102574,0.0058782147],"genre_scores_gemma":[0.99311465,0.00019963004,0.005239543,0.00003483813,0.000041534255,0.000045080542,0.000046035697,0.000014825873,0.0012637947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925727,0.00015652154,0.000048300273,0.000174746,0.00024991136,0.00011324146],"domain_scores_gemma":[0.9968065,0.0018209162,0.0007623107,0.00016683656,0.0003835197,0.000059905673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011968048,0.00095956365,0.0009841176,0.00047472666,0.0005547405,0.001452394,0.0009548982,0.0009625889,0.0019147971],"category_scores_gemma":[0.0061131464,0.00044382096,0.00061969954,0.00044953695,0.0011237517,0.001100363,0.0012572434,0.00091133255,0.00024030285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065343897,0.00008101298,0.0007652097,0.00023004858,0.00016305577,0.0002773606,0.00024653604,0.88386744,0.016962787,0.07353314,0.0006017053,0.022618232],"study_design_scores_gemma":[0.000034207544,0.00009382986,0.00030604796,0.000008161044,0.000023137969,0.000027384936,0.000012466664,0.98182386,0.0018372477,0.015601571,0.00021896492,0.00001314025],"about_ca_topic_score_codex":0.0038941659,"about_ca_topic_score_gemma":0.0025001087,"teacher_disagreement_score":0.0038941659,"about_ca_system_score_codex":0.00072711613,"about_ca_system_score_gemma":0.0010946216,"threshold_uncertainty_score":0.007743001},"labels":[],"label_agreement":null},{"id":"W3036623140","doi":"10.1007/s10957-023-02297-y","title":"Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":21,"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":"Global Collaborative Research, King Abdullah University of Science and Technology; Institut de Valorisation des Données; King Abdullah University of Science and Technology","keywords":"Mathematics; Convexity; Stochastic gradient descent; Convex function; Theory of computation; Convergence (economics); Mathematical optimization; Convex optimization; Applied mathematics; Variance (accounting); Regular polygon; Algorithm; Computer science; Artificial intelligence; Artificial neural network","score_opus":0.019978886667379847,"score_gpt":0.32969155642016446,"score_spread":0.3097126697527846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036623140","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.0017409363,0.0005263142,0.9950891,0.00022707864,0.00009075893,0.000027681099,0.000022453552,0.000042559444,0.0022331818],"genre_scores_gemma":[0.28089568,0.0038849986,0.6830576,0.00066942285,0.0013947116,0.0008065276,0.00048130672,0.0011040339,0.027705729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726355,0.0013945994,0.00012688318,0.00023764023,0.00080181746,0.00017554672],"domain_scores_gemma":[0.9920351,0.0051516453,0.0004591999,0.000399808,0.0015669053,0.0003872944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008879001,0.0028264578,0.0027783753,0.0029376643,0.0008404596,0.0030010499,0.0027899211,0.002733356,0.0052595045],"category_scores_gemma":[0.019278016,0.0014261684,0.0029562227,0.0018752267,0.0030958343,0.004769214,0.0049456246,0.0047333017,0.00081276655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006773246,0.000070002716,0.00028551248,0.00025013747,0.000121740064,0.00008100996,0.00010155306,0.24057458,0.0013957749,0.7370613,0.00281642,0.017174179],"study_design_scores_gemma":[0.000005647581,0.000020579673,0.00006623532,0.000016610076,0.000013991568,0.000013294295,0.000008334176,0.93380433,0.00017029264,0.06500157,0.00086824235,0.000010932712],"about_ca_topic_score_codex":0.0034909905,"about_ca_topic_score_gemma":0.0041570333,"teacher_disagreement_score":0.008879001,"about_ca_system_score_codex":0.0020793779,"about_ca_system_score_gemma":0.0031937456,"threshold_uncertainty_score":0.046957254},"labels":[],"label_agreement":null},{"id":"W3040442494","doi":"10.1007/s10957-020-01706-w","title":"On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Guelph; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Conseil Régional de Bretagne; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Stationary point; Mathematics; Theory of computation; Complementarity (molecular biology); Stationary sequence; Sequence (biology); Stationary solution; Applied mathematics; Regularization (linguistics); Convergence (economics); Stationary state; Mathematical optimization; Weak convergence; Constraint (computer-aided design); Stationary process; Mathematical analysis; Stochastic process; Algorithm; Computer science; Geometry","score_opus":0.01314037019398161,"score_gpt":0.2549632184526553,"score_spread":0.24182284825867367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040442494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06472614,0.00059059705,0.9188471,0.0011498657,0.00009213107,0.000113925096,0.00015393278,0.00010894109,0.014217448],"genre_scores_gemma":[0.73388624,0.0014204622,0.24351773,0.00042795073,0.00019672148,0.00056207995,0.00070320326,0.00044138002,0.018844223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992447,0.00041918538,0.000026427393,0.00010107658,0.0001305857,0.0000780792],"domain_scores_gemma":[0.9939521,0.0047356947,0.000400859,0.00015807658,0.0005614849,0.00019176802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030974257,0.0013270646,0.0019875122,0.0019633248,0.0008170712,0.0024790673,0.0015529874,0.0022417349,0.0054409937],"category_scores_gemma":[0.015483151,0.0011096954,0.0012492922,0.0014310477,0.00269751,0.0026075544,0.002365083,0.0026071377,0.0004803158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000989393,0.000110360656,0.0005216349,0.00018959034,0.00006877229,0.000104769155,0.00017567666,0.5849396,0.00095240603,0.39947924,0.0020708714,0.011288148],"study_design_scores_gemma":[0.0000072352395,0.000023119252,0.00005911483,0.000022586344,0.000005760026,0.000011127014,0.000026990043,0.92964786,0.00015274154,0.069702245,0.00033508436,0.0000060832544],"about_ca_topic_score_codex":0.0044644447,"about_ca_topic_score_gemma":0.0034051037,"teacher_disagreement_score":0.0054409937,"about_ca_system_score_codex":0.0018467763,"about_ca_system_score_gemma":0.0023319863,"threshold_uncertainty_score":0.018201888},"labels":[],"label_agreement":null},{"id":"W3096467617","doi":"10.1007/s10957-020-01769-9","title":"Measure-Driven Nonlinear Dynamic Systems with Applications to Optimal Impulsive Controls","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Wireless Communication Networks Research","field":"Computer Science","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 Ottawa","funders":"","keywords":"Theory of computation; Mathematics; Nonlinear system; Optimal control; Class (philosophy); Impulse (physics); Measure (data warehouse); Mathematical optimization; Control theory (sociology); Control (management); Applied mathematics; Computer science; Algorithm","score_opus":0.013305504361725133,"score_gpt":0.27358812244913294,"score_spread":0.2602826180874078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096467617","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.038419716,0.0035956998,0.92002887,0.0023993803,0.0007943409,0.00006681718,0.00013811476,0.00013972471,0.034417327],"genre_scores_gemma":[0.94432116,0.0028617328,0.03161685,0.00047297895,0.00055161025,0.00015061695,0.000090876056,0.00006762409,0.019866414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997111,0.00010732033,0.000018421679,0.00005065771,0.000083971456,0.000028353328],"domain_scores_gemma":[0.9986879,0.0007207757,0.00023267024,0.000039773422,0.00022254014,0.00009641655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081352895,0.0011707982,0.0012162587,0.0011830521,0.00069340155,0.0020558448,0.0009441111,0.0020413275,0.0032482166],"category_scores_gemma":[0.0034084306,0.00047451217,0.0008820506,0.0011547634,0.0018439523,0.0010752057,0.002478711,0.0013590384,0.000237018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047785677,0.00006577704,0.00050844194,0.00017666133,0.00007861002,0.00025175174,0.00018759698,0.41905445,0.0025552928,0.5614332,0.0015877095,0.014052667],"study_design_scores_gemma":[0.000008461954,0.000031259457,0.00015504725,0.00001606143,0.000010787309,0.00004994313,0.00003149309,0.90106833,0.00016475694,0.09724254,0.0012034476,0.000017903609],"about_ca_topic_score_codex":0.0029566528,"about_ca_topic_score_gemma":0.0026337088,"teacher_disagreement_score":0.0032482166,"about_ca_system_score_codex":0.00096424343,"about_ca_system_score_gemma":0.0009850754,"threshold_uncertainty_score":0.010866344},"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":"W3129421534","doi":"10.1007/s10957-021-01920-0","title":"Sampled-Data Nash Equilibria in Differential Games with Impulse Controls","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Air Force Office of Scientific Research; Fonds de recherche du Québec – Nature et technologies; Science and Engineering Research Board; University of Illinois at Urbana-Champaign","keywords":"Mathematics; Nash equilibrium; Differential game; Piecewise; Equilibrium point; Nonlinear system; Impulse (physics); Impulse control; Applied mathematics; Initial value problem; Control theory (sociology); Differential equation; Mathematical optimization; Computer science; Mathematical analysis; Control (management)","score_opus":0.007673408380927536,"score_gpt":0.23303954369394975,"score_spread":0.22536613531302221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129421534","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.24211948,0.00037695823,0.7441025,0.0009980468,0.00011924505,0.00018086386,0.00038627256,0.0002502817,0.0114663355],"genre_scores_gemma":[0.9828587,0.00016832352,0.011247802,0.00007774873,0.000029738645,0.00010328362,0.000106127714,0.000031795622,0.005376432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826604,0.000951139,0.000067991736,0.00024248366,0.00025707376,0.00021536338],"domain_scores_gemma":[0.9769949,0.019468784,0.0012132584,0.00057758,0.0010388055,0.0007067256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042914813,0.0013242168,0.0020673925,0.0012892485,0.00057854154,0.002535713,0.0021551924,0.0022765386,0.0046631144],"category_scores_gemma":[0.027476724,0.0011570486,0.0010382506,0.0007615947,0.0032645185,0.0034394749,0.002767797,0.00223861,0.0002928109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047263867,0.0002298686,0.0017726943,0.00019603997,0.000120389646,0.0002120846,0.00021352248,0.7240233,0.0009577,0.26394057,0.000806297,0.0070549534],"study_design_scores_gemma":[0.000043870183,0.000042219446,0.00020435578,0.000015005175,0.000011545237,0.000014482117,0.00004180696,0.9262376,0.00021408907,0.073052995,0.00010613451,0.000015906797],"about_ca_topic_score_codex":0.0054176087,"about_ca_topic_score_gemma":0.004708721,"teacher_disagreement_score":0.0054176087,"about_ca_system_score_codex":0.00221474,"about_ca_system_score_gemma":0.0015508396,"threshold_uncertainty_score":0.02269578},"labels":[],"label_agreement":null},{"id":"W3184722921","doi":"10.1007/s10957-021-01892-1","title":"Nonlinear Optimal Approach to Spacecraft Formation Flying Using Lorentz and Impulsive Actuation","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Spacecraft Dynamics and Control","field":"Engineering","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 Toronto","funders":"","keywords":"Control theory (sociology); Optimal control; Nonlinear system; Lorentz force; Lorentz transformation; Hamilton–Jacobi–Bellman equation; Spacecraft; Hybrid system; Mathematics; Nonlinear control; Computer science; Mathematical optimization; Control (management); Classical mechanics; Physics; Engineering; Aerospace engineering","score_opus":0.006652974233293743,"score_gpt":0.22347874411267651,"score_spread":0.21682576987938276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184722921","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.041279472,0.00038067528,0.9404031,0.00037754374,0.00018344418,0.0000341927,0.000028389517,0.00005219874,0.017261025],"genre_scores_gemma":[0.9157554,0.00042304452,0.06628386,0.00013283128,0.00016863567,0.000072097384,0.000040097482,0.000035854857,0.017088199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998975,0.000031724237,0.000004374362,0.000015005706,0.000039742263,0.000011635621],"domain_scores_gemma":[0.99982387,0.000079809346,0.000027864073,0.0000099416775,0.000040671763,0.000017930704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030293528,0.00048406498,0.0004972488,0.00046969703,0.00039338577,0.00052276667,0.00055127905,0.00063585234,0.001426518],"category_scores_gemma":[0.0007748628,0.00029781304,0.0004819749,0.00028052452,0.00087018753,0.00056068297,0.0010459712,0.00063851103,0.00013485666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005088506,0.00004100229,0.00026649842,0.000053291602,0.000030308944,0.00006290685,0.00007763301,0.91109794,0.0025257505,0.07462723,0.00041449134,0.010752175],"study_design_scores_gemma":[0.0000045961456,0.000016086706,0.00003861135,0.0000012322059,0.0000018968504,0.0000045150523,0.0000072250577,0.9934889,0.000090625,0.0061516277,0.0001917666,0.000002965975],"about_ca_topic_score_codex":0.0043041673,"about_ca_topic_score_gemma":0.004570835,"teacher_disagreement_score":0.0043041673,"about_ca_system_score_codex":0.0005682557,"about_ca_system_score_gemma":0.0006315049,"threshold_uncertainty_score":0.008558214},"labels":[],"label_agreement":null},{"id":"W3190397611","doi":"10.1007/s10957-021-01909-9","title":"Optimal Replenishment Strategy for Inventory Mechanism with Step-Shaped Demand","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Fredericton; University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Counterintuitive; Mathematical optimization; Time horizon; Economic order quantity; Mathematics; Minification; Order (exchange); Economics","score_opus":0.018154689552088748,"score_gpt":0.24044607024125275,"score_spread":0.22229138068916401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190397611","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.12608235,0.0010196493,0.86345154,0.00077326235,0.00014178688,0.00034809802,0.00027108015,0.00043444458,0.0074777645],"genre_scores_gemma":[0.9479786,0.0005351419,0.04590283,0.00013477512,0.000046792702,0.00015767467,0.00014352758,0.000042139684,0.0050584218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987735,0.0004388886,0.00007497021,0.00024132001,0.00019460914,0.00027663968],"domain_scores_gemma":[0.9971967,0.001500783,0.00033880354,0.00018422696,0.0005288447,0.00025060194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029238919,0.0013325315,0.0026850086,0.0011688053,0.000681973,0.0030333844,0.003907562,0.00258551,0.004418246],"category_scores_gemma":[0.0059899413,0.0012181741,0.0013892904,0.0013530382,0.00097431435,0.0027662169,0.0012854548,0.0015622445,0.00042731623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042375617,0.00019923333,0.0007498046,0.00031747224,0.00012411093,0.00032473195,0.00014911417,0.92571926,0.0043616383,0.044423148,0.001799042,0.021408696],"study_design_scores_gemma":[0.00003258443,0.00009440512,0.000118521835,0.000011994655,0.00002488951,0.000043781245,0.000022297496,0.99324954,0.00025425048,0.005971258,0.00016097109,0.000015420725],"about_ca_topic_score_codex":0.0044581294,"about_ca_topic_score_gemma":0.0023659226,"teacher_disagreement_score":0.0044581294,"about_ca_system_score_codex":0.002203396,"about_ca_system_score_gemma":0.00231108,"threshold_uncertainty_score":0.0159868},"labels":[],"label_agreement":null},{"id":"W3205428754","doi":"10.1007/s10957-023-02219-y","title":"Calculus Rules of the Generalized Concave Kurdyka–Łojasiewicz Property","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Approximation Theory and Sequence Spaces","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Property (philosophy); Differentiable function; Mathematics; Concave function; Theory of computation; Function (biology); Class (philosophy); Calculus (dental); Applied mathematics; Computer science; Pure mathematics; Algorithm; Geometry; Regular polygon","score_opus":0.034540673689496496,"score_gpt":0.3066063765173234,"score_spread":0.27206570282782694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205428754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12682344,0.0015861585,0.7300437,0.0030259076,0.0008917893,0.00015104293,0.00042286445,0.00044972968,0.13660547],"genre_scores_gemma":[0.80918056,0.0016539275,0.14167842,0.0014704865,0.0010237885,0.0003585117,0.00041650914,0.0006794068,0.04353843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982318,0.00038131542,0.00014524988,0.00044525287,0.00052570336,0.00027061638],"domain_scores_gemma":[0.9968755,0.0016378654,0.0002110367,0.00039791514,0.0006121254,0.00026548936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026999637,0.0007008667,0.0015395574,0.0021867862,0.0025084955,0.00464217,0.0016379171,0.001694588,0.0075989733],"category_scores_gemma":[0.0068856655,0.00084313034,0.0028611815,0.0017288876,0.0049206493,0.0079098465,0.0033038335,0.004915061,0.0014421586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057223274,0.000006743527,0.00006450045,0.000008029955,0.0000048179018,0.000050600724,0.00007594316,0.00023497941,0.00019668908,0.9973882,0.0004530321,0.0015106931],"study_design_scores_gemma":[0.000007118592,0.0000040945743,0.00008601352,0.000004976417,0.000006099687,0.00006631769,0.000020442749,0.0037573588,0.00022281015,0.9943036,0.001510053,0.000011046213],"about_ca_topic_score_codex":0.0015614711,"about_ca_topic_score_gemma":0.0012188142,"teacher_disagreement_score":0.0075989733,"about_ca_system_score_codex":0.0015903322,"about_ca_system_score_gemma":0.0009793064,"threshold_uncertainty_score":0.025421083},"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":"W4321454809","doi":"10.1007/s10957-023-02167-7","title":"Uniqueness in Nuclear Norm Minimization: Flatness of the Nuclear Norm Sphere and Simultaneous Polarization","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Mathematics; Norm (philosophy); Subderivative; Operator norm; Convex hull; Pure mathematics; Matrix norm; Dual norm; Affine transformation; Subspace topology; Theory of computation; Regular polygon; Applied mathematics; Mathematical analysis; Convex optimization; Operator theory; Geometry; Banach space; Algorithm; Physics","score_opus":0.005006997611517314,"score_gpt":0.2045037808553128,"score_spread":0.19949678324379547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321454809","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.023631198,0.0007227729,0.96619684,0.0012280165,0.00012718354,0.000029559707,0.00012724978,0.00006183457,0.0078753345],"genre_scores_gemma":[0.72506326,0.0035575444,0.2536291,0.0011024218,0.00096313335,0.00028638513,0.0006307585,0.00051536004,0.014252039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971987,0.0013170812,0.000110748435,0.0006412208,0.00053781207,0.00019442591],"domain_scores_gemma":[0.9909642,0.0059562693,0.00058883225,0.0008211029,0.0011814572,0.00048805203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005087847,0.0011817046,0.0014839767,0.0016254089,0.0011198386,0.0030510458,0.0017228567,0.001767453,0.002532159],"category_scores_gemma":[0.022434097,0.0011000978,0.0012362206,0.0013880004,0.006337973,0.0067900154,0.0055142483,0.0040797517,0.0005121007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010363936,0.000032793894,0.00050522,0.00012762689,0.00003989025,0.00013601717,0.00024391641,0.03222789,0.0030671887,0.9445639,0.002125615,0.016826294],"study_design_scores_gemma":[0.000012642209,0.000049250368,0.00041423854,0.000030802814,0.000013047474,0.00020644238,0.0001398616,0.18311433,0.0019238004,0.81229967,0.0017549492,0.000040916446],"about_ca_topic_score_codex":0.0015709619,"about_ca_topic_score_gemma":0.00091585505,"teacher_disagreement_score":0.005087847,"about_ca_system_score_codex":0.0008041564,"about_ca_system_score_gemma":0.0013885848,"threshold_uncertainty_score":0.026907444},"labels":[],"label_agreement":null},{"id":"W4379653531","doi":"10.1007/s10957-023-02246-9","title":"Optimal Contraception Control Problems in a Nonlinear Size-Structured Vermin Model","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Nonlinear Partial Differential Equations","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":"Wilfrid Laurier University","funders":"Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Mathematics; Theory of computation; Optimal control; Control variable; Applied mathematics; Nonlinear system; Separable space; Mathematical analysis; Mathematical optimization; Statistics; Physics; Algorithm","score_opus":0.023392923190000768,"score_gpt":0.3088603105648445,"score_spread":0.28546738737484373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379653531","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.38376665,0.0014272941,0.56264836,0.0056288494,0.00031726525,0.00012379236,0.0006151838,0.00023190513,0.045240723],"genre_scores_gemma":[0.9713551,0.00033460485,0.0070848116,0.00019458182,0.00007516544,0.000077906734,0.000117642274,0.00004324756,0.02071708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968696,0.00012283934,0.000010359593,0.00008218934,0.00004223637,0.000055423283],"domain_scores_gemma":[0.99819475,0.0009784673,0.0003585567,0.000067019704,0.00018332628,0.00021787276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009415635,0.0008216118,0.0021646412,0.0007395596,0.00081924605,0.0022317413,0.0016059825,0.0029642927,0.0038362355],"category_scores_gemma":[0.003797765,0.00068764307,0.0006569135,0.0005607458,0.0025974496,0.0023840917,0.002304329,0.0014102289,0.00025583318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088889174,0.000057588928,0.00048358433,0.000072961586,0.00004553991,0.0001834359,0.000053168533,0.78983045,0.0009794725,0.20488065,0.0012078395,0.0021164822],"study_design_scores_gemma":[0.000018802362,0.000022723603,0.00014455542,0.0000064967644,0.000007383207,0.000013885125,0.000025294372,0.964698,0.00010213893,0.034670305,0.00027938455,0.000010966348],"about_ca_topic_score_codex":0.008315012,"about_ca_topic_score_gemma":0.004154744,"teacher_disagreement_score":0.008315012,"about_ca_system_score_codex":0.0016842898,"about_ca_system_score_gemma":0.0011736389,"threshold_uncertainty_score":0.016533256},"labels":[],"label_agreement":null},{"id":"W4391956260","doi":"10.1007/s10957-024-02383-9","title":"A Mirror Inertial Forward–Reflected–Backward Splitting: Convergence Analysis Beyond Convexity and Lipschitz Smoothness","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Smoothness; Inertial frame of reference; Mathematics; Lipschitz continuity; Theory of computation; Applied mathematics; Rate of convergence; Function (biology); Convergence (economics); Mathematical optimization; Mathematical analysis; Computer science; Key (lock); Algorithm; Classical mechanics","score_opus":0.00657811400616399,"score_gpt":0.2477912233952005,"score_spread":0.2412131093890365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391956260","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.010852757,0.00021765429,0.98124987,0.0004204819,0.00014842903,0.000045766756,0.00004008346,0.0000788006,0.0069461055],"genre_scores_gemma":[0.4027621,0.00080840976,0.5628521,0.00076273654,0.0004177616,0.0002458789,0.00026219568,0.00056706014,0.03132175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947375,0.00017692141,0.000029566987,0.000105821266,0.00016362431,0.00005038213],"domain_scores_gemma":[0.9982809,0.0006767408,0.00011514668,0.00033542782,0.0004014754,0.00019024841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027754796,0.0013531845,0.00085623714,0.0007803934,0.0005769504,0.0013329606,0.0013868753,0.0017417156,0.0046197306],"category_scores_gemma":[0.0067383293,0.00048476356,0.0009809872,0.00046040484,0.0021383637,0.0032084147,0.0043801693,0.0029440834,0.0010576069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046086343,0.00016826404,0.00093536696,0.00027224133,0.00010565656,0.00031865196,0.00038573277,0.13043685,0.040235236,0.73075354,0.0070627965,0.0888647],"study_design_scores_gemma":[0.000023340357,0.0001380461,0.00019079926,0.0000365343,0.000024281451,0.00019154165,0.000051358264,0.8489962,0.0049632946,0.1417256,0.0036377297,0.00002121472],"about_ca_topic_score_codex":0.0009273699,"about_ca_topic_score_gemma":0.0007031109,"teacher_disagreement_score":0.0046197306,"about_ca_system_score_codex":0.0007197597,"about_ca_system_score_gemma":0.0009550947,"threshold_uncertainty_score":0.015454471},"labels":[],"label_agreement":null},{"id":"W4394678881","doi":"10.1007/s10957-024-02419-0","title":"Infeasible and Critically Feasible Optimal Control","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","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","funders":"University of South Australia","keywords":"Mathematics; Theory of computation; Mathematical optimization; Optimal control; Algorithm","score_opus":0.003623036416750435,"score_gpt":0.228363450566542,"score_spread":0.22474041414979157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394678881","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.21206744,0.00032240016,0.7616163,0.0009806892,0.000074570795,0.00011969637,0.00011166722,0.000081273414,0.024626013],"genre_scores_gemma":[0.96057606,0.00009972741,0.036885623,0.00011468663,0.000025681142,0.0001256189,0.00006586088,0.00002258473,0.002084145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988471,0.00043615067,0.00005191338,0.00020696076,0.00027519118,0.00018266852],"domain_scores_gemma":[0.9975556,0.0016151523,0.000319811,0.00017375969,0.00019715352,0.0001385481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015083532,0.0008683789,0.001090541,0.00049590756,0.0005188089,0.0016119212,0.0009032277,0.0016659081,0.003680834],"category_scores_gemma":[0.0070131905,0.00055127696,0.00050009484,0.00031859736,0.0025588123,0.0014335798,0.002112585,0.0019032385,0.00019207946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021947915,0.00011026615,0.0007696662,0.00016507665,0.000039670496,0.00047717843,0.0001799485,0.7102867,0.0077624186,0.2681458,0.0010873018,0.010756525],"study_design_scores_gemma":[0.000066003166,0.00013522852,0.00038979235,0.000060424085,0.0000114476115,0.000100233716,0.0001289282,0.8937856,0.0033766981,0.10025961,0.0016580558,0.000027974886],"about_ca_topic_score_codex":0.0017697874,"about_ca_topic_score_gemma":0.00056139764,"teacher_disagreement_score":0.003680834,"about_ca_system_score_codex":0.0009092262,"about_ca_system_score_gemma":0.001162674,"threshold_uncertainty_score":0.012313604},"labels":[],"label_agreement":null},{"id":"W4396781416","doi":"10.1007/s10957-024-02438-x","title":"Robust Risk Management via Multi-marginal Optimal Transport","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Toxic Organic Pollutants Impact","field":"Environmental Science","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Université Paris-Sud; Agence Nationale de la Recherche","keywords":"Mathematics; Marginal distribution; Equivalence (formal languages); Joint probability distribution; Lipschitz continuity; Function (biology); Stability (learning theory); Mathematical optimization; Equivalence class (music); Random variable; Bellman equation; Applied mathematics; Theory of computation; Mathematical analysis; Statistics; Computer science; Discrete mathematics","score_opus":0.008078527203957053,"score_gpt":0.22992667189589994,"score_spread":0.2218481446919429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396781416","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.01234544,0.00037630662,0.98404294,0.00045577527,0.00006938908,0.00003569746,0.00008116359,0.00015020165,0.0024430943],"genre_scores_gemma":[0.86630404,0.0005947252,0.12237591,0.00017500688,0.00017097598,0.00020242573,0.00021367923,0.0002143726,0.009748908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984486,0.00070058275,0.00007820441,0.0003281266,0.00023885086,0.00020560053],"domain_scores_gemma":[0.99567956,0.0030025681,0.00045605286,0.00024337576,0.00042897108,0.00018954992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037623544,0.0020149702,0.003558846,0.0014384736,0.00088958524,0.0029568358,0.002458938,0.003222351,0.0034610874],"category_scores_gemma":[0.0102080135,0.0016592875,0.0024983636,0.0011238556,0.0026142858,0.0036526618,0.0043488913,0.0021795905,0.0003213731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056119734,0.000018188923,0.00010694435,0.000035021672,0.00005624066,0.000025747744,0.000016676391,0.97150606,0.0002671105,0.024413513,0.00024133861,0.0032570788],"study_design_scores_gemma":[0.000004069332,0.000010935837,0.000025988385,0.0000030146005,0.0000075606567,0.0000038315543,0.0000024800077,0.9903391,0.00006182783,0.009451691,0.00008419466,0.0000052419805],"about_ca_topic_score_codex":0.009109569,"about_ca_topic_score_gemma":0.0031784032,"teacher_disagreement_score":0.009109569,"about_ca_system_score_codex":0.0027499017,"about_ca_system_score_gemma":0.0022924424,"threshold_uncertainty_score":0.019952059},"labels":[],"label_agreement":null},{"id":"W4399525519","doi":"10.1007/s10957-024-02469-4","title":"Directional Derivative of the Value Function for Parametric Set-Constrained Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Directional derivative; Parametric statistics; Mathematical optimization; Set (abstract data type); Function (biology); Derivative (finance); Value (mathematics); Parametric programming; Bellman equation; Applied mathematics; Algorithm; Mathematical analysis; Computer science; Statistics","score_opus":0.011051055988377318,"score_gpt":0.24836058291853402,"score_spread":0.2373095269301567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399525519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013450773,0.00083339686,0.98005015,0.00054349116,0.00009294939,0.00002225036,0.000060663093,0.00004818161,0.0048981733],"genre_scores_gemma":[0.61948866,0.0037265606,0.3539809,0.00045240656,0.00026411552,0.00022311948,0.00038589328,0.0005167089,0.020961674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990128,0.00047817433,0.00004572112,0.00011999441,0.00028696767,0.000056221797],"domain_scores_gemma":[0.99770075,0.0014607733,0.00018899584,0.00013801383,0.0003734273,0.0001380549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037680762,0.0010195631,0.0012616412,0.0011195281,0.00045934902,0.002721125,0.0009619688,0.0014954305,0.0020793325],"category_scores_gemma":[0.008735849,0.0006698374,0.0008135708,0.00096508575,0.0017633715,0.0025327166,0.0020542596,0.0024950635,0.00033341223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012292144,0.00008927387,0.0007641714,0.00032090466,0.00006685271,0.00011281734,0.00017826793,0.19223092,0.008551318,0.73976356,0.0034151438,0.054383952],"study_design_scores_gemma":[0.000012834828,0.0000573396,0.00023267142,0.000045259883,0.000020138421,0.00008272397,0.000037042664,0.79370284,0.0013245231,0.2007016,0.0037600014,0.00002301486],"about_ca_topic_score_codex":0.0014087537,"about_ca_topic_score_gemma":0.0012879506,"teacher_disagreement_score":0.0037680762,"about_ca_system_score_codex":0.001235695,"about_ca_system_score_gemma":0.0016292506,"threshold_uncertainty_score":0.01992768},"labels":[],"label_agreement":null},{"id":"W4400259585","doi":"10.1007/s10957-024-02485-4","title":"State-Dependent Sweeping Processes: Asymptotic Behavior and Algorithmic Approaches","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"","keywords":"Theory of computation; Mathematics; State (computer science); State dependent; Applied mathematics; Mathematical optimization; Mathematical economics; Algorithm","score_opus":0.01581851546151451,"score_gpt":0.24916689482874468,"score_spread":0.23334837936723019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400259585","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.09043998,0.0013418866,0.8893869,0.0016138762,0.00010367457,0.000075390904,0.00014616847,0.00028810414,0.016604023],"genre_scores_gemma":[0.89491916,0.0022990338,0.08382294,0.0003906166,0.0002933585,0.00026259242,0.00036700896,0.0002461214,0.017399171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989895,0.00045752313,0.000044656947,0.00018132261,0.000191562,0.00013536164],"domain_scores_gemma":[0.97903216,0.01743144,0.0011655255,0.00088558276,0.0009399617,0.00054526195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004156749,0.0011467143,0.0016802129,0.0024033801,0.001165863,0.0030310769,0.0026578861,0.002783023,0.0064436197],"category_scores_gemma":[0.029762106,0.0010732245,0.0017924603,0.0016367268,0.004303908,0.005031951,0.0034336466,0.003645966,0.00041712425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055439046,0.000106197855,0.0013903602,0.00013467546,0.00007113716,0.00013877597,0.00020012233,0.16106099,0.0013513122,0.8240167,0.0014379014,0.010036379],"study_design_scores_gemma":[0.000009318481,0.000015115077,0.0003012462,0.00002358321,0.000018790399,0.000040263767,0.000041938223,0.79383373,0.00023942636,0.20509872,0.00036021043,0.00001771914],"about_ca_topic_score_codex":0.0028165958,"about_ca_topic_score_gemma":0.0022915832,"teacher_disagreement_score":0.0064436197,"about_ca_system_score_codex":0.0014864341,"about_ca_system_score_gemma":0.0015544151,"threshold_uncertainty_score":0.021983266},"labels":[],"label_agreement":null},{"id":"W4401893304","doi":"10.1007/s10957-024-02518-y","title":"An Adaptive Distributionally Robust Optimization Approach for Optimal Sizing of Hybrid Renewable Energy Systems","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Electric Power System Optimization","field":"Engineering","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sizing; Mathematical optimization; Renewable energy; Robust optimization; Theory of computation; Stochastic programming; Mathematics; Computer science; Engineering; Algorithm","score_opus":0.008154231816268995,"score_gpt":0.21059023431970939,"score_spread":0.2024360025034404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401893304","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.0045504407,0.00008896937,0.99334913,0.000082845094,0.000036233305,0.000021241915,0.000016956184,0.00008480818,0.0017693175],"genre_scores_gemma":[0.7776874,0.00028151664,0.2155498,0.00019997674,0.0002055546,0.00028422914,0.00014421159,0.00023302899,0.0054143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942124,0.000251785,0.000029004676,0.00008667269,0.00016621259,0.000045233668],"domain_scores_gemma":[0.9984913,0.0009901889,0.00013997301,0.00007511532,0.00026444957,0.00003888141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019098059,0.0011480269,0.0016395382,0.00066619297,0.0003181985,0.0010785516,0.0011971485,0.0009997155,0.0030362643],"category_scores_gemma":[0.00422684,0.0008476865,0.0008412573,0.00064176985,0.0008667781,0.0010628459,0.0013310056,0.001203007,0.0003749777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002528093,0.00001646325,0.000045445566,0.000026655805,0.000026767304,0.000014272709,0.00001138344,0.98337376,0.00062303245,0.0051554167,0.0002506242,0.010430901],"study_design_scores_gemma":[0.0000020639343,0.0000073777255,0.000008604583,0.0000010723461,0.0000013649957,0.0000012372633,8.519358e-7,0.9989802,0.000039418836,0.0009108942,0.000045686982,0.0000011318339],"about_ca_topic_score_codex":0.002895284,"about_ca_topic_score_gemma":0.0029699958,"teacher_disagreement_score":0.0030362643,"about_ca_system_score_codex":0.0006540699,"about_ca_system_score_gemma":0.00081656413,"threshold_uncertainty_score":0.010157287},"labels":[],"label_agreement":null},{"id":"W4403829686","doi":"10.1007/s10957-024-02556-6","title":"The “Black-Box” Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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":"Artificial Intelligence in Medicine (Canada)","funders":"Analytical Center for the Government of the Russian Federation","keywords":"Mathematics; Theory of computation; Zero order; Applied mathematics; Zero (linguistics); Mathematical optimization; Kernel (algebra); Order (exchange); Stochastic optimization; First order; Algorithm; Combinatorics","score_opus":0.01322407823589315,"score_gpt":0.28370880503282225,"score_spread":0.2704847267969291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403829686","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.009845194,0.00018109361,0.9872613,0.00041191845,0.000090476846,0.00002070774,0.000022928372,0.00009182832,0.002074568],"genre_scores_gemma":[0.4850312,0.0007731048,0.49287763,0.00050374767,0.00031687666,0.0002512071,0.00021500287,0.00049239973,0.019538848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930036,0.00036676053,0.000021403443,0.00010735474,0.00015406922,0.000050009985],"domain_scores_gemma":[0.99754757,0.0015525668,0.00017087691,0.00020269236,0.0003700101,0.00015618045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026294584,0.00071419403,0.0014187408,0.00045834915,0.00038802892,0.0012752212,0.0016649211,0.002353093,0.0030523515],"category_scores_gemma":[0.0077632354,0.0006000235,0.0006346962,0.0005031737,0.002188766,0.0024985955,0.0022201196,0.0023494062,0.00049916666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018664089,0.000096999,0.00043761168,0.00025282367,0.0000549634,0.0001099434,0.00008939597,0.65315866,0.0034453012,0.31851476,0.0033808576,0.020272022],"study_design_scores_gemma":[0.0000051861557,0.0000056847043,0.000020899393,0.0000035165492,0.000002299386,0.000006124327,0.0000022163586,0.98939157,0.00017653829,0.010144841,0.00023767266,0.0000034809473],"about_ca_topic_score_codex":0.0025740026,"about_ca_topic_score_gemma":0.0019162474,"teacher_disagreement_score":0.0030523515,"about_ca_system_score_codex":0.0007373305,"about_ca_system_score_gemma":0.0019684096,"threshold_uncertainty_score":0.013906062},"labels":[],"label_agreement":null},{"id":"W4405839059","doi":"10.1007/s10957-024-02598-w","title":"Optimality of Vaccination for an SIR Epidemic with an ICU Constraint","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"COVID-19 epidemiological studies","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; Actua","funders":"","keywords":"Theory of computation; Mathematics; Vaccination; Constraint (computer-aided design); Epidemic model; Mathematical optimization; Mathematical economics; Medicine; Virology; Algorithm","score_opus":0.14500561164266992,"score_gpt":0.4394207211698556,"score_spread":0.29441510952718564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405839059","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.25304085,0.0032643103,0.6099478,0.029691048,0.0010372162,0.0005950372,0.00463914,0.0006838315,0.097100765],"genre_scores_gemma":[0.9010207,0.002110848,0.046443317,0.002819447,0.0010480004,0.00044495982,0.0015187868,0.00052418286,0.04406983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670863,0.0015431928,0.00009947105,0.00044076997,0.00021180902,0.0009960904],"domain_scores_gemma":[0.97447896,0.021892186,0.0012038631,0.0004267013,0.0010278603,0.0009705328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00646187,0.0022766688,0.0056596184,0.0019450356,0.000879512,0.0036792203,0.0029153852,0.005780811,0.014834137],"category_scores_gemma":[0.027082292,0.0020924408,0.001990202,0.0010681648,0.0030472744,0.0037225361,0.0035328683,0.003698872,0.0012942923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073860644,0.0002638234,0.0021804606,0.00055353966,0.0001880042,0.00034067046,0.00020778713,0.79909337,0.0019146119,0.17259477,0.011973323,0.009951005],"study_design_scores_gemma":[0.00017318134,0.00022475328,0.0012320651,0.0001188094,0.00006905754,0.0001354922,0.00014551406,0.8925349,0.0003920821,0.103170395,0.0017595881,0.00004423228],"about_ca_topic_score_codex":0.015786976,"about_ca_topic_score_gemma":0.0055625057,"teacher_disagreement_score":0.015786976,"about_ca_system_score_codex":0.0051703523,"about_ca_system_score_gemma":0.0053392663,"threshold_uncertainty_score":0.0496251},"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":"W4408965248","doi":"10.1007/s10957-025-02647-y","title":"Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Bilevel optimization; Theory of computation; Mathematics; Gaussian; Smoothing; Mathematical optimization; Order (exchange); Applied mathematics; Zeroth law of thermodynamics; Calculus (dental); Algorithm; Optimization problem; Statistics; Physics","score_opus":0.005682910952490658,"score_gpt":0.2516350456607874,"score_spread":0.24595213470829677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408965248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007694882,0.000110726,0.98992693,0.00015803361,0.000024078012,0.000011682861,0.00003737767,0.00015873721,0.0018775327],"genre_scores_gemma":[0.514104,0.0004637719,0.469599,0.00028844076,0.00009871928,0.00016607525,0.00034907658,0.0007028827,0.014227955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991215,0.00034636506,0.000040143866,0.00014077645,0.0002209438,0.000130264],"domain_scores_gemma":[0.9978502,0.0012777072,0.00012724656,0.00027148702,0.00032307254,0.00015025803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021761514,0.0010655732,0.0024098195,0.0008131182,0.00069483765,0.002667141,0.0019263935,0.0018277473,0.00369406],"category_scores_gemma":[0.0076528993,0.0011292025,0.0010526553,0.0012904358,0.0021711043,0.003083868,0.0037835808,0.0032780624,0.0007764402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001049064,0.000097399134,0.00038341945,0.0001334041,0.0000631091,0.0000663086,0.00011922807,0.6810771,0.0010879568,0.2765491,0.0021599072,0.03815825],"study_design_scores_gemma":[0.000004468554,0.000012868839,0.00001653596,0.000006790507,0.0000032343848,0.000006306528,0.0000078996645,0.92915547,0.00016281991,0.07031266,0.00030544493,0.0000055124888],"about_ca_topic_score_codex":0.0039944025,"about_ca_topic_score_gemma":0.0052787443,"teacher_disagreement_score":0.0039944025,"about_ca_system_score_codex":0.0010992462,"about_ca_system_score_gemma":0.002371164,"threshold_uncertainty_score":0.012357831},"labels":[],"label_agreement":null},{"id":"W4409575416","doi":"10.1007/s10957-025-02633-4","title":"On Further Notions of Strong Nonexpansiveness and Corresponding Notions of Monotonicity","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Mathematics; Monotonic function; Theory of computation; Mathematical economics; Pure mathematics; Calculus (dental); Mathematical analysis; Algorithm","score_opus":0.0060534767553237084,"score_gpt":0.26060178471429657,"score_spread":0.2545483079589729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409575416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08574545,0.003213601,0.7646014,0.008944475,0.0011737137,0.0002355906,0.00041087825,0.0001551881,0.13551968],"genre_scores_gemma":[0.7385831,0.003527141,0.22704393,0.0037470798,0.0020556168,0.0007457879,0.00046339852,0.00026849261,0.023565514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954997,0.0018661781,0.00035742397,0.0010607572,0.0008207351,0.00039524003],"domain_scores_gemma":[0.97819006,0.015317984,0.0010841074,0.0020035964,0.00236937,0.0010348316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009759243,0.0014233739,0.0019037186,0.0028439495,0.0033526404,0.0041825953,0.0032280535,0.0028442228,0.009349364],"category_scores_gemma":[0.02452253,0.0012365344,0.0034243325,0.002701937,0.010041271,0.023337692,0.0076709436,0.009890319,0.00075975416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023480401,0.000035480763,0.00015942751,0.000053608394,0.000014677134,0.0000948159,0.00027850884,0.00069614465,0.0006103334,0.99444723,0.00054950727,0.003036772],"study_design_scores_gemma":[0.000009524705,0.000040577837,0.00029681,0.00003407527,0.000016557873,0.00015927522,0.00016383403,0.0053772135,0.00032751326,0.9902603,0.0032981564,0.000016081442],"about_ca_topic_score_codex":0.0006159264,"about_ca_topic_score_gemma":0.00074849074,"teacher_disagreement_score":0.009759243,"about_ca_system_score_codex":0.0014615817,"about_ca_system_score_gemma":0.00107507,"threshold_uncertainty_score":0.051612437},"labels":[],"label_agreement":null},{"id":"W4410460921","doi":"10.1007/s10957-025-02691-8","title":"Adaptive Generalized Conditional Gradient Method for Multiobjective Optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"Perimeter Institute","funders":"","keywords":"Mathematics; Theory of computation; Mathematical optimization; Multi-objective optimization; Gradient method; Applied mathematics; Algorithm","score_opus":0.010650661419480616,"score_gpt":0.312289075429338,"score_spread":0.30163841400985736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410460921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001490079,0.0001982448,0.997122,0.00008480001,0.00005162857,0.00002209878,0.000017309705,0.00010376419,0.0009100773],"genre_scores_gemma":[0.1934838,0.0006135502,0.7978236,0.0002823482,0.00016130132,0.0005550169,0.00022058758,0.00035974116,0.0065001114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923646,0.00042126307,0.00002329327,0.000071871735,0.00020452923,0.000042539203],"domain_scores_gemma":[0.99801505,0.0013365955,0.00009673109,0.00009777561,0.0003932802,0.000060501032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020695156,0.0011974599,0.0016353148,0.0009106294,0.00049349066,0.00093100505,0.0018880374,0.0017722077,0.0037883897],"category_scores_gemma":[0.0053102374,0.0007055686,0.0009276125,0.0011066013,0.0012608411,0.0011197824,0.0019556643,0.0022552395,0.00064173155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067435125,0.000059380887,0.00022931688,0.00020758883,0.00009992045,0.00005215541,0.000041538595,0.898976,0.0015837193,0.04576968,0.0028916774,0.050021555],"study_design_scores_gemma":[0.000005202632,0.0000070443048,0.000026714572,0.00000463876,0.0000033815998,0.000003927898,0.0000012265062,0.99617237,0.00007559985,0.003368502,0.0003283851,0.0000031374045],"about_ca_topic_score_codex":0.0059081274,"about_ca_topic_score_gemma":0.0046826024,"teacher_disagreement_score":0.0059081274,"about_ca_system_score_codex":0.0007900267,"about_ca_system_score_gemma":0.0019928273,"threshold_uncertainty_score":0.012673378},"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":"W4410884354","doi":"10.1007/s10957-025-02719-z","title":"A Consensus-based Algorithm for Non-convex Multiplayer Games","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","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 Calgary","funders":"H2020 Marie Skłodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; Karl-Franzens-Universität Graz","keywords":"Theory of computation; Mathematics; Regular polygon; Algorithm; Mathematical optimization; Geometry","score_opus":0.007126461853934904,"score_gpt":0.26190901638560365,"score_spread":0.25478255453166876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410884354","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.0081966,0.000048147216,0.9897474,0.00010430889,0.000032166663,0.000048123165,0.000011171128,0.00016526532,0.0016467142],"genre_scores_gemma":[0.5513149,0.000089616864,0.4420246,0.00015558684,0.00003538335,0.00029196902,0.0000895662,0.00009243595,0.0059059095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946374,0.00015634217,0.000025542588,0.00012766618,0.0001559031,0.00007078754],"domain_scores_gemma":[0.999185,0.00038314358,0.00009180287,0.00006133168,0.00020699127,0.00007163538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096454256,0.0006926017,0.0009658916,0.0004995443,0.00064571475,0.0007890234,0.0018717999,0.0011147233,0.0027599523],"category_scores_gemma":[0.0021328197,0.00034523002,0.000418717,0.00041413013,0.0008747448,0.00093152496,0.0014708674,0.0013528707,0.0004940279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008786323,0.000060932856,0.00026976707,0.000058743306,0.000037009635,0.00006284309,0.00011105141,0.92172843,0.0031405957,0.025671389,0.001103251,0.047668096],"study_design_scores_gemma":[0.000014108295,0.000019647407,0.000014769497,0.0000020292039,0.0000020099994,0.00000654769,0.0000048646234,0.9971558,0.00032363008,0.0021948807,0.0002587762,0.000003022127],"about_ca_topic_score_codex":0.004099682,"about_ca_topic_score_gemma":0.0035180084,"teacher_disagreement_score":0.004099682,"about_ca_system_score_codex":0.0008601217,"about_ca_system_score_gemma":0.0018014335,"threshold_uncertainty_score":0.009232998},"labels":[],"label_agreement":null},{"id":"W4411140844","doi":"10.1007/s10957-025-02713-5","title":"Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Air Force Office of Scientific Research","keywords":"Mathematics; Theory of computation; Regular polygon; Convex optimization; Proximal Gradient Methods; Convex analysis; Proper convex function; Convex function; Mathematical optimization; Subderivative; Conic optimization; Applied mathematics; Combinatorics; Geometry; Algorithm","score_opus":0.016976661332291414,"score_gpt":0.308990695650776,"score_spread":0.2920140343184846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411140844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003029483,0.00019787677,0.9948144,0.00010498037,0.000063539446,0.000036500584,0.000035773,0.00046704395,0.0012504271],"genre_scores_gemma":[0.14035453,0.00033724707,0.84925663,0.00018966947,0.0001492036,0.00037717004,0.0003290699,0.00083540095,0.00817115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989342,0.00040501033,0.000055673016,0.00010331648,0.0004219449,0.0000798154],"domain_scores_gemma":[0.9978168,0.0012274653,0.00011448744,0.00030067758,0.0004343044,0.000106303465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015365903,0.0018443264,0.0016665404,0.00064286595,0.00046414445,0.0012444835,0.0023501497,0.0019702774,0.0061031883],"category_scores_gemma":[0.008826155,0.00086590555,0.000995092,0.0007758426,0.0012506775,0.0016986091,0.0030024997,0.003179996,0.0028300511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054767396,0.00019067149,0.00048061647,0.000350265,0.00012347267,0.00021328406,0.000247896,0.6538564,0.009297525,0.070971034,0.013735561,0.24998564],"study_design_scores_gemma":[0.000016821163,0.000022445198,0.000028725617,0.0000065638405,0.0000036340696,0.000017210592,0.000005154239,0.99353844,0.0005974502,0.0048884857,0.0008684476,0.0000065550644],"about_ca_topic_score_codex":0.003852528,"about_ca_topic_score_gemma":0.0065830178,"teacher_disagreement_score":0.0061031883,"about_ca_system_score_codex":0.00074362213,"about_ca_system_score_gemma":0.0019203365,"threshold_uncertainty_score":0.020417213},"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":"W4412962796","doi":"10.1007/s10957-025-02775-5","title":"On second-order weak sharp minima of general nonconvex set-constrained optimization problems","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Mathematics; Theory of computation; Order (exchange); Set (abstract data type); Mathematical optimization; Applied mathematics; Optimization problem; Mathematical analysis; Algorithm; Computer science","score_opus":0.007202094939164196,"score_gpt":0.24986896311350723,"score_spread":0.24266686817434305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412962796","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.067098245,0.0025050922,0.9080285,0.002329118,0.00025251025,0.00016994239,0.00016901208,0.00012064968,0.01932702],"genre_scores_gemma":[0.8086887,0.0034579842,0.15726069,0.0012553537,0.00052108295,0.000524666,0.00050042284,0.00052843464,0.027262643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823135,0.00094847823,0.00007446292,0.00027176793,0.0002933679,0.0001805506],"domain_scores_gemma":[0.9886828,0.008473523,0.00089879165,0.00032395957,0.0009676675,0.0006532678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008085986,0.0028464834,0.0032529226,0.0028262576,0.0011942618,0.003664151,0.002249056,0.0034108954,0.0044757635],"category_scores_gemma":[0.03312461,0.0015309586,0.0020502312,0.0017137905,0.004345036,0.004537697,0.0050447346,0.005232469,0.0003795106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025243027,0.0001302007,0.00084160443,0.0005474735,0.00017299382,0.0003374965,0.00039374374,0.2818245,0.0040351287,0.69345754,0.0038047084,0.014202197],"study_design_scores_gemma":[0.000031229614,0.00011231693,0.0004637525,0.00008331479,0.000026961074,0.000090596965,0.00009600721,0.7471419,0.00064512924,0.25007316,0.0012012816,0.000034382632],"about_ca_topic_score_codex":0.0019522235,"about_ca_topic_score_gemma":0.0018112184,"teacher_disagreement_score":0.008085986,"about_ca_system_score_codex":0.0020651862,"about_ca_system_score_gemma":0.0018992434,"threshold_uncertainty_score":0.042763293},"labels":[],"label_agreement":null},{"id":"W4413802952","doi":"10.1007/s10957-025-02790-6","title":"Generalized Robust Optimization using the Notion of Set-Valued Probability","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Fuzzy Systems and Optimization","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":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Robust optimization; Mathematical optimization; Set (abstract data type); Applied mathematics; Mathematical economics; Algorithm; Computer science","score_opus":0.046525044797828555,"score_gpt":0.31492513625104224,"score_spread":0.2684000914532137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413802952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019300277,0.00023278213,0.9955937,0.000196406,0.000039085764,0.00001111107,0.000033242402,0.00004426666,0.0019193495],"genre_scores_gemma":[0.6243473,0.0024820657,0.36524355,0.0005546851,0.00066299445,0.00034970956,0.00028185998,0.0002332549,0.0058444706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749607,0.0011240573,0.00011568506,0.00044372297,0.0006760262,0.00014440292],"domain_scores_gemma":[0.9957913,0.0027085748,0.0005915222,0.0004393138,0.00033088768,0.00013839596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035490186,0.0015781245,0.0014665751,0.0015052389,0.00045298744,0.0029269503,0.001574906,0.0013052294,0.0021211344],"category_scores_gemma":[0.009684982,0.0004972865,0.001792428,0.0013007369,0.0027959703,0.003705145,0.0033067365,0.002508603,0.00042479913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025114594,0.000016329665,0.00020961878,0.00012018467,0.000105983316,0.0001076937,0.000075808704,0.40815642,0.0018779876,0.5748065,0.00076903775,0.013729265],"study_design_scores_gemma":[0.0000081346325,0.000044278695,0.000113374655,0.000029245675,0.000020211282,0.000044341028,0.000014190082,0.67684394,0.0005159427,0.3205898,0.0017518771,0.000024687244],"about_ca_topic_score_codex":0.0009431882,"about_ca_topic_score_gemma":0.00048181592,"teacher_disagreement_score":0.0035490186,"about_ca_system_score_codex":0.0013203048,"about_ca_system_score_gemma":0.0011497122,"threshold_uncertainty_score":0.018769264},"labels":[],"label_agreement":null},{"id":"W4416161692","doi":"10.1007/s10957-025-02878-z","title":"Dynamic Pricing in the Presence of Heterogeneous Social Influence","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Revenue; Product (mathematics); Revenue management; Maximization; Quality (philosophy); Market segmentation; Dynamic pricing; Theory of computation","score_opus":0.006760906397671258,"score_gpt":0.2451998407714772,"score_spread":0.23843893437380592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416161692","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.72519505,0.0014235907,0.22653002,0.009806844,0.0005474069,0.00014460702,0.00046555884,0.00027774135,0.03560919],"genre_scores_gemma":[0.99317956,0.00025349224,0.0018824697,0.0001234797,0.00023109515,0.000027260154,0.000041024483,0.000024663694,0.0042369487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632436,0.0018044955,0.00010784417,0.0005264474,0.00040008107,0.0008366452],"domain_scores_gemma":[0.95356363,0.036716305,0.0039006383,0.0015625216,0.0017375348,0.002519448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054805037,0.0012521382,0.0041299122,0.0018259932,0.0018328173,0.006713574,0.0032681185,0.0047766543,0.007070019],"category_scores_gemma":[0.031486887,0.0018588275,0.0013594824,0.0016310875,0.004727853,0.0074600363,0.003184372,0.003837338,0.0004974401],"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.00055061275,0.00039704298,0.003809365,0.00013210397,0.00026841866,0.0012934607,0.0004229349,0.46007136,0.0012292401,0.5217447,0.0038460325,0.006234716],"study_design_scores_gemma":[0.00009127219,0.00004485102,0.00081312284,0.000008340014,0.000040497926,0.00007623604,0.000110856265,0.8989822,0.0000725284,0.09939069,0.0003234828,0.000045906356],"about_ca_topic_score_codex":0.009650309,"about_ca_topic_score_gemma":0.005686778,"teacher_disagreement_score":0.009650309,"about_ca_system_score_codex":0.0023929293,"about_ca_system_score_gemma":0.0015740779,"threshold_uncertainty_score":0.02898401},"labels":[],"label_agreement":null},{"id":"W48523452","doi":"10.1023/a:1004649211111","title":"Convergence Properties of Two-Stage Stochastic Programming","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Mathematics; Proofs of convergence of random variables; Convergence (economics); Mathematical optimization; Stochastic programming; Exponential function; Rate of convergence; Theory of computation; Convergence tests; Compact convergence; Applied mathematics; Stochastic optimization; Normal convergence; Convergence of random variables; Quadratic programming; Random variable; Computer science; Algorithm; Statistics; Algebra of random variables; Mathematical analysis","score_opus":0.04315506297365662,"score_gpt":0.3381747733330435,"score_spread":0.2950197103593869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48523452","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.0666108,0.0012257718,0.90882397,0.0019080474,0.0001381829,0.00014286274,0.00021807746,0.00023675877,0.020695489],"genre_scores_gemma":[0.83249944,0.0020742102,0.13191408,0.000557282,0.00031859893,0.0006462661,0.00055583986,0.0005069878,0.03092732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661607,0.0019246812,0.00015097021,0.00035222666,0.0006021662,0.0003539779],"domain_scores_gemma":[0.944959,0.045483522,0.0016156184,0.0013917753,0.0050597466,0.0014903616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014402899,0.0018064411,0.0021381513,0.0019033435,0.00089398294,0.002951942,0.0026857443,0.00260844,0.007512337],"category_scores_gemma":[0.0541275,0.0012232844,0.0020528836,0.001195212,0.0030937763,0.005002683,0.0037931204,0.0047091837,0.0006413614],"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.00038278138,0.00017663486,0.0020844475,0.0003094739,0.00015154413,0.00024493076,0.00034462678,0.23852281,0.0034365468,0.7327442,0.0026915858,0.018910415],"study_design_scores_gemma":[0.0000361147,0.00006151091,0.00034394942,0.000032112715,0.000026005173,0.000055818353,0.000030837673,0.8749162,0.0006560794,0.1232366,0.00057805673,0.000026686408],"about_ca_topic_score_codex":0.0032131453,"about_ca_topic_score_gemma":0.0014448529,"teacher_disagreement_score":0.014402899,"about_ca_system_score_codex":0.0020799134,"about_ca_system_score_gemma":0.0029738857,"threshold_uncertainty_score":0.07617068},"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":"W77613094","doi":"10.1023/a:1004608800846","title":"Universal Near-Optimal Feedbacks","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Guidance and Control Systems","field":"Engineering","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":"Concordia University; McGill University","funders":"","keywords":"Mathematics; Theory of computation; Construct (python library); Bounded function; Saddle; Optimal control; Set (abstract data type); Mathematical optimization; Differential inclusion; Saddle point; Type (biology); Applied mathematics; Mathematical analysis; Computer science; Algorithm; Geometry","score_opus":0.0025295168831400393,"score_gpt":0.18352260701908038,"score_spread":0.18099309013594034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77613094","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.12490336,0.0019890456,0.8114479,0.001264637,0.0004570442,0.000087542925,0.00026734793,0.0012764288,0.058306683],"genre_scores_gemma":[0.9632638,0.00092424505,0.02122307,0.0004114346,0.0001839881,0.00011257429,0.00012016774,0.00016394748,0.013596812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919134,0.00016406599,0.000047156427,0.00017934246,0.00024938016,0.00016860475],"domain_scores_gemma":[0.99749386,0.00113046,0.00026213826,0.00037222906,0.000441258,0.00030005843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705784,0.0010805689,0.0017527556,0.0012800815,0.001025374,0.001545927,0.0010116873,0.0015119532,0.00557415],"category_scores_gemma":[0.008528373,0.0007172057,0.0007010344,0.00059659546,0.0026015579,0.003120584,0.0045033772,0.0016667743,0.0007183011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016928265,0.00004775674,0.00026970587,0.00016648072,0.000047189515,0.00009497698,0.000189595,0.09497002,0.00522824,0.8636282,0.003114566,0.03207398],"study_design_scores_gemma":[0.000030439223,0.000077018536,0.00027491822,0.000051520605,0.000019429724,0.00009821508,0.00006967867,0.37553337,0.0019443387,0.618737,0.0031229912,0.000041045972],"about_ca_topic_score_codex":0.0011048928,"about_ca_topic_score_gemma":0.000807895,"teacher_disagreement_score":0.00557415,"about_ca_system_score_codex":0.0011251894,"about_ca_system_score_gemma":0.0010445118,"threshold_uncertainty_score":0.018647373},"labels":[],"label_agreement":null},{"id":"W81936770","doi":"10.1023/a:1021246912554","title":"Optimal Transient Response Shaping of the Servomechanism Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Control Systems in Engineering","field":"Engineering","cited_by":23,"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 Waterloo","funders":"","keywords":"Servomechanism; Theory of computation; Mathematics; Transient response; Control theory (sociology); Diagonal; Transient (computer programming); Controller (irrigation); Linear system; LTI system theory; Optimal control; Mathematical optimization; Computer science; Algorithm; Control (management); Mathematical analysis; Engineering; Control engineering","score_opus":0.008088129491491423,"score_gpt":0.19049803841900995,"score_spread":0.18240990892751852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81936770","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.064168945,0.0002094516,0.9244688,0.00054448703,0.000044543132,0.0000476796,0.00003338609,0.00022992288,0.010252717],"genre_scores_gemma":[0.9726729,0.00012449396,0.022300337,0.00008896172,0.000023336153,0.00006610797,0.00003977461,0.00007860988,0.0046055634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.00010605516,0.000010690036,0.000049198934,0.000052100942,0.000049784194],"domain_scores_gemma":[0.999027,0.0007049793,0.00008117322,0.000048506536,0.00009757801,0.00004073278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076241884,0.00048107753,0.0006105644,0.0002384869,0.00024953927,0.0007472674,0.00043630402,0.0010643085,0.0032087774],"category_scores_gemma":[0.0034659524,0.00033393395,0.00034020303,0.00019020699,0.00066153414,0.00056430616,0.0008338463,0.0007139665,0.0003195638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036153954,0.00008565727,0.00034838569,0.00016153166,0.000025461,0.00010022518,0.00018797691,0.88316697,0.011265989,0.052559357,0.0015118867,0.050225038],"study_design_scores_gemma":[0.000023676232,0.000054266442,0.000097515695,0.000010458729,0.000005117967,0.000015592663,0.000020273788,0.9833454,0.0012814688,0.014740294,0.00039909166,0.000006791089],"about_ca_topic_score_codex":0.0015447711,"about_ca_topic_score_gemma":0.0006032248,"teacher_disagreement_score":0.0032087774,"about_ca_system_score_codex":0.00045095477,"about_ca_system_score_gemma":0.00075163826,"threshold_uncertainty_score":0.010734439},"labels":[],"label_agreement":null}]}