{"meta":{"query_hash":"cdfd28327e2f","filters":{"venue":"Optimization"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/cdfd28327e2f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Optimization"},"results":[{"id":"W1967710355","doi":"10.1080/02331930600711968","title":"Characterization of convexifiable functions","year":2006,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Convex function; Concave function; Class (philosophy); Function (biology); Convex analysis; Transformation (genetics); Linear programming; Analytic function; Pure mathematics; Regular polygon; Characterization (materials science); Convex optimization; Discrete mathematics; Applied mathematics; Mathematical optimization; Computer science","score_opus":0.02564100181370066,"score_gpt":0.2985124660899341,"score_spread":0.27287146427623343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967710355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18620911,0.0005598135,0.77896285,0.0008278104,0.00005000827,0.000072533185,0.00016762379,0.00016760269,0.032982744],"genre_scores_gemma":[0.94411135,0.0004314859,0.048395548,0.00010099742,0.00008317128,0.00012745445,0.00029348332,0.00009711021,0.0063593094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864966,0.0003234125,0.00008044556,0.00028257165,0.00043760086,0.00022627214],"domain_scores_gemma":[0.9969036,0.0014430311,0.00041357792,0.00031884422,0.0006918568,0.0002290772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021259382,0.00082809693,0.00074844476,0.00171023,0.0006591741,0.0031431003,0.000914849,0.00097072264,0.0057476405],"category_scores_gemma":[0.0076295557,0.0004245595,0.0007871088,0.0009608068,0.0035337834,0.00386412,0.0021433074,0.0023419345,0.0005159004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003201646,0.000023473118,0.0006821166,0.00005863019,0.000014317678,0.00012288624,0.00018411624,0.02330136,0.004975462,0.95667416,0.0006857862,0.013245584],"study_design_scores_gemma":[0.000015157758,0.00007068329,0.0011732518,0.00005508354,0.000015362093,0.00018652123,0.00017592542,0.28061703,0.007226292,0.70506847,0.0053697373,0.000026496604],"about_ca_topic_score_codex":0.00066433806,"about_ca_topic_score_gemma":0.00036487362,"teacher_disagreement_score":0.0057476405,"about_ca_system_score_codex":0.0017955047,"about_ca_system_score_gemma":0.00080250483,"threshold_uncertainty_score":0.019227803},"labels":[],"label_agreement":null},{"id":"W1983155329","doi":"10.1080/02331930008844509","title":"A path-following cutting plane method for some monotone variational inequalities<sup>∗</sup>","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Monotone polygon; Variational inequality; Cutting-plane method; Path (computing); Affine transformation; Operator (biology); Plane (geometry); Set (abstract data type); Strongly monotone; Regular polygon; Point (geometry); Combinatorics; Applied mathematics; Mathematical optimization; Pure mathematics; Geometry; Computer science","score_opus":0.016332408866664313,"score_gpt":0.2697094271933224,"score_spread":0.2533770183266581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983155329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011065836,0.000060321607,0.9981213,0.00003683446,0.000010483333,0.00003350245,0.000014752814,0.000046561476,0.0005696128],"genre_scores_gemma":[0.027005177,0.00015011996,0.970648,0.000046145375,0.000024666038,0.0001704489,0.000117955424,0.00006791851,0.0017696503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994087,0.00014290767,0.000032045536,0.00013102795,0.00023823022,0.000047061276],"domain_scores_gemma":[0.99944645,0.0002845876,0.000039144998,0.00005460097,0.00014101712,0.000034085486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015063738,0.0010941478,0.00083914207,0.0008411386,0.0006090721,0.0008891222,0.0012869469,0.0012750019,0.006820611],"category_scores_gemma":[0.0019392755,0.0005818307,0.0010100569,0.00083181116,0.0008284927,0.0014963157,0.0013361966,0.0030760658,0.0009634923],"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.00016289213,0.00020615479,0.0006887983,0.00043728895,0.00009522451,0.00020809252,0.00021740214,0.18351887,0.021729266,0.23521085,0.0055589275,0.55196625],"study_design_scores_gemma":[0.000041075506,0.00012868019,0.00019457609,0.00003523558,0.00002343684,0.00015696853,0.000020469051,0.9353724,0.0052512703,0.050013006,0.008739598,0.00002331543],"about_ca_topic_score_codex":0.0018612808,"about_ca_topic_score_gemma":0.0017709032,"teacher_disagreement_score":0.006820611,"about_ca_system_score_codex":0.0007868839,"about_ca_system_score_gemma":0.0011847566,"threshold_uncertainty_score":0.022817254},"labels":[],"label_agreement":null},{"id":"W2005391161","doi":"10.1080/02331930903349466","title":"Spectral self-concordant functions in the space of two-by-two symmetric matrices","year":2010,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Space (punctuation); Function (biology); Pure mathematics; Computer science","score_opus":0.005073224888707355,"score_gpt":0.22717383568744726,"score_spread":0.2221006107987399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005391161","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.67782795,0.00024759283,0.30379558,0.00037793725,0.00004983477,0.00003572818,0.00009975165,0.0001352953,0.017430324],"genre_scores_gemma":[0.97814333,0.00011369536,0.015777476,0.000054072363,0.000036269626,0.000036897825,0.000077796576,0.00003817681,0.0057222694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.0002747623,0.000020673016,0.00008027189,0.0002043898,0.000110022855],"domain_scores_gemma":[0.99764293,0.0009473263,0.00036760056,0.00021692985,0.00046971272,0.00035537343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012027795,0.0006778467,0.0004023663,0.0015569571,0.000676702,0.0013075523,0.0006666216,0.00053960795,0.0032237957],"category_scores_gemma":[0.0044054994,0.00021536832,0.00033785184,0.00047355902,0.0020050416,0.0013519304,0.0010758333,0.000659581,0.0004899459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019238105,0.000075317315,0.0015603366,0.000059085003,0.000024809482,0.0001998107,0.00025242183,0.043396175,0.0063507794,0.93247837,0.0015253728,0.013884996],"study_design_scores_gemma":[0.00003160076,0.00009411312,0.0015424867,0.000023403718,0.000009185783,0.00028509228,0.0001526152,0.49250326,0.005759459,0.49749845,0.0020658998,0.000034489636],"about_ca_topic_score_codex":0.0006918415,"about_ca_topic_score_gemma":0.00043542983,"teacher_disagreement_score":0.0032237957,"about_ca_system_score_codex":0.0007141972,"about_ca_system_score_gemma":0.0004993125,"threshold_uncertainty_score":0.010784686},"labels":[],"label_agreement":null},{"id":"W2027711030","doi":"10.1080/02331930008844513","title":"Dykstras algorithm with bregman projections: A convergence proof","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Bregman divergence; Mathematics; Convergence (economics); Algorithm; Regular polygon; Constraint (computer-aided design); Legendre polynomials; Mathematical optimization; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.005520435647381991,"score_gpt":0.2031312555329953,"score_spread":0.1976108198856133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027711030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026493212,0.00028649162,0.9923707,0.00037755887,0.000060231137,0.00005608878,0.00003493939,0.0002456206,0.003918977],"genre_scores_gemma":[0.06957828,0.0006723064,0.9182022,0.00035776175,0.00009607068,0.0003788102,0.00016786724,0.00036966722,0.010176985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977603,0.00072839175,0.00011877272,0.00031204798,0.000870958,0.00020943099],"domain_scores_gemma":[0.9969572,0.0013653042,0.00015341448,0.00058810314,0.00077667413,0.00015934471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003859539,0.0011013787,0.0012713433,0.0015378204,0.0010111579,0.0019060775,0.0020521025,0.0026429547,0.007490873],"category_scores_gemma":[0.011391625,0.00074369967,0.0009492782,0.0017993777,0.0025482993,0.0033408995,0.004495159,0.00414724,0.0033515352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021344633,0.00011433662,0.00066887407,0.00021169744,0.00007276382,0.00013206506,0.0003322898,0.13099481,0.005417937,0.62500805,0.00898194,0.2278517],"study_design_scores_gemma":[0.0000906744,0.00011269685,0.000259237,0.000080533435,0.000018104382,0.00026579367,0.000076630306,0.77882665,0.0061203716,0.19765103,0.016432462,0.00006576057],"about_ca_topic_score_codex":0.002987667,"about_ca_topic_score_gemma":0.0032246355,"teacher_disagreement_score":0.007490873,"about_ca_system_score_codex":0.0011596439,"about_ca_system_score_gemma":0.0035299724,"threshold_uncertainty_score":0.025059462},"labels":[],"label_agreement":null},{"id":"W2065496492","doi":"10.1080/02331934.2011.590485","title":"Optimal ordering and pricing policy with supplier quantity discounts and price-dependent stochastic demand","year":2011,"lang":"en","type":"article","venue":"Optimization","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; University of Hong Kong; City University of Hong Kong","keywords":"Mathematical optimization; Profit (economics); Nonlinear pricing; Integer programming; Dynamic programming; Economic order quantity; Product (mathematics); Mathematics; Computer science; Supply chain; Microeconomics; Economics; Business; Marketing","score_opus":0.01665522622321815,"score_gpt":0.20778129489089706,"score_spread":0.1911260686676789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065496492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1556839,0.0009914858,0.8308358,0.00090315123,0.00010020243,0.00017784686,0.00028774617,0.00016827672,0.010851611],"genre_scores_gemma":[0.9021321,0.0007886253,0.0912228,0.00007094054,0.00008033274,0.00012317683,0.00017332655,0.0000699551,0.005338699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855274,0.0006553819,0.0000542681,0.00020936638,0.00025269776,0.0002755515],"domain_scores_gemma":[0.9973773,0.0018427782,0.00030237902,0.00010152771,0.0001947913,0.00018134931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023315784,0.0012573788,0.0020138542,0.00079464825,0.0006792561,0.0022537392,0.0016578087,0.0024088407,0.0032016705],"category_scores_gemma":[0.006239674,0.0015866434,0.0010180717,0.001820093,0.0013653551,0.0031843432,0.0012226222,0.0018565137,0.00030455756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777079,0.000050220235,0.00031973128,0.000058322814,0.000025841082,0.0001341149,0.00003375472,0.97841096,0.0005192761,0.01631702,0.00030975766,0.0037531725],"study_design_scores_gemma":[0.00001967258,0.000030504669,0.00010346331,0.0000034423888,0.000011775164,0.000017561499,0.000018229957,0.99399275,0.00017521928,0.005407291,0.00021156028,0.000008467182],"about_ca_topic_score_codex":0.011308688,"about_ca_topic_score_gemma":0.00747999,"teacher_disagreement_score":0.011308688,"about_ca_system_score_codex":0.0028370423,"about_ca_system_score_gemma":0.0023306257,"threshold_uncertainty_score":0.022485733},"labels":[],"label_agreement":null},{"id":"W2067721388","doi":"10.1080/02331930211987","title":"Probabilistic Solutions to Optimal Control Problems","year":2002,"lang":"en","type":"article","venue":"Optimization","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Converse; Probabilistic logic; Optimal control; Brownian motion; Dynamic programming; Diffusion process; Continuation; Section (typography); Nonlinear system; Wiener process; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry; Computer science","score_opus":0.032883836648305034,"score_gpt":0.1973789015388059,"score_spread":0.16449506489050086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067721388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013201623,0.0017834416,0.9607149,0.0025396415,0.00017141298,0.000076803764,0.0001573751,0.00009222095,0.021262622],"genre_scores_gemma":[0.675991,0.0060109193,0.28674105,0.0008406334,0.00116125,0.0011716774,0.00051145075,0.00017785442,0.027394243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981419,0.00083566044,0.00010442136,0.00031332427,0.00039656807,0.00020804288],"domain_scores_gemma":[0.99663687,0.0025013448,0.00033538791,0.00011761362,0.0002551738,0.00015350185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354555,0.0017996108,0.0016059574,0.00097626017,0.00088459195,0.002473222,0.0015670022,0.0029416727,0.0060021896],"category_scores_gemma":[0.011769987,0.00082837313,0.0013318539,0.0011478673,0.0024315557,0.0021096114,0.0028940153,0.0025853615,0.000455133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023481376,0.000023567687,0.00012175631,0.00011341018,0.000032803415,0.00004011813,0.00007777526,0.23349221,0.00026849832,0.7578084,0.0013594077,0.0066385274],"study_design_scores_gemma":[0.000046090998,0.000036309,0.000089740504,0.000029125058,0.000010626072,0.000017397406,0.000032341293,0.40559736,0.00012429756,0.59142303,0.0025797987,0.000013976968],"about_ca_topic_score_codex":0.001922577,"about_ca_topic_score_gemma":0.0015703606,"teacher_disagreement_score":0.0060021896,"about_ca_system_score_codex":0.0020884464,"about_ca_system_score_gemma":0.0022473265,"threshold_uncertainty_score":0.020079315},"labels":[],"label_agreement":null},{"id":"W2073464705","doi":"10.1080/0233193021000015659","title":"Convex Parametric Programming in Abstract Spaces","year":2002,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Parametric statistics; Saddle point; Convex analysis; Mathematical optimization; Stability (learning theory); Metric space; Regular polygon; Measure (data warehouse); Subderivative; Space (punctuation); Applied mathematics; Convex optimization; Pure mathematics; Computer science","score_opus":0.022203960841922544,"score_gpt":0.23140203226561656,"score_spread":0.209198071423694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073464705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03404663,0.004239127,0.935228,0.0018262826,0.00012161441,0.000045736553,0.00014636171,0.00010921946,0.024237039],"genre_scores_gemma":[0.85112906,0.0044019027,0.12975965,0.00024951927,0.00044218058,0.0002400773,0.00027069388,0.00012479088,0.013382132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978841,0.0011899127,0.00009324801,0.00025552357,0.00045178508,0.00012542639],"domain_scores_gemma":[0.9969081,0.0022082266,0.00031179542,0.00016597925,0.00027317792,0.00013257487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024224736,0.001393318,0.0011166013,0.0010365562,0.0006427722,0.0028777362,0.00068862573,0.0013422946,0.002537046],"category_scores_gemma":[0.006702349,0.0005767222,0.0008552831,0.0017303333,0.0028004635,0.0033461654,0.002304556,0.0024926055,0.00040964695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023692875,0.00002368086,0.00016038076,0.000078270605,0.000030052888,0.00006695607,0.00012964221,0.13241543,0.00074816623,0.8550168,0.00096373016,0.0103432415],"study_design_scores_gemma":[0.000008313735,0.000028178483,0.0000859376,0.00001932098,0.000006615372,0.000023824576,0.000034324934,0.33872342,0.00018510068,0.6586301,0.0022477892,0.000007164078],"about_ca_topic_score_codex":0.0021386386,"about_ca_topic_score_gemma":0.0014160055,"teacher_disagreement_score":0.0028777362,"about_ca_system_score_codex":0.001988726,"about_ca_system_score_gemma":0.0010227219,"threshold_uncertainty_score":0.014429271},"labels":[],"label_agreement":null},{"id":"W2088396524","doi":"10.1080/02331930902968365","title":"Characterization of subdual latticial cones in Hilbert spaces by the isotonicity of the metric projection","year":2010,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Cone (formal languages); Projection (relational algebra); Hilbert space; Dual cone and polar cone; Combinatorics; Regular polygon; Pure mathematics; Geometry","score_opus":0.006904141839578624,"score_gpt":0.21835937324312724,"score_spread":0.2114552314035486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088396524","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.49081346,0.00070322404,0.4683346,0.0006157838,0.00006873355,0.00013750323,0.00040337857,0.00012779873,0.038795587],"genre_scores_gemma":[0.9447803,0.00047079663,0.04705391,0.00014480142,0.00011728457,0.00012669072,0.0005801806,0.000080451144,0.0066456283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986273,0.00031469695,0.000097586424,0.00021708447,0.0005598124,0.0001834988],"domain_scores_gemma":[0.9958306,0.0012089811,0.0006907866,0.00038401783,0.0011785973,0.0007070036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015951418,0.00067379675,0.0005798388,0.0019610054,0.0010234368,0.0030357924,0.0007629087,0.00048634343,0.003112961],"category_scores_gemma":[0.004510148,0.00037123237,0.0009249604,0.001121483,0.0035407618,0.0034832058,0.0019492991,0.0025901909,0.00033410083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034506596,0.000022253396,0.0010289582,0.00002442189,0.000007087005,0.00015084214,0.00022137286,0.0026356333,0.0014727168,0.9895085,0.00041503002,0.0044785766],"study_design_scores_gemma":[0.000013793438,0.00004625992,0.001172865,0.00002187706,0.000006559989,0.00028689372,0.00020596832,0.04548275,0.0013588615,0.94917774,0.002195252,0.00003123337],"about_ca_topic_score_codex":0.0010340549,"about_ca_topic_score_gemma":0.0010183918,"teacher_disagreement_score":0.003112961,"about_ca_system_score_codex":0.0010263617,"about_ca_system_score_gemma":0.00077511586,"threshold_uncertainty_score":0.010413945},"labels":[],"label_agreement":null},{"id":"W2122679316","doi":"10.1080/02331930008844477","title":"Increasing cones, recession cones and global cones","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cone (formal languages); Closure (psychology); Recession; Arbitrage; Mathematics; Dual cone and polar cone; Mathematical economics; Economics; Geometry; Keynesian economics; Algorithm; Financial economics; Market economy","score_opus":0.014307111846293151,"score_gpt":0.20258276570822312,"score_spread":0.18827565386192996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122679316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27980316,0.004612745,0.5974593,0.0010912432,0.00012773953,0.0001453015,0.0003616518,0.00021580249,0.11618297],"genre_scores_gemma":[0.92371464,0.00312705,0.060915943,0.0002440897,0.00016736807,0.00016519809,0.00033321892,0.00014725173,0.011185247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990182,0.00026011787,0.000043868073,0.00014274099,0.00033287803,0.00020223644],"domain_scores_gemma":[0.9963003,0.0014821856,0.0008546683,0.00030904185,0.00053338223,0.0005204784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032682354,0.0011489546,0.00083552406,0.0019893926,0.0012879426,0.0027372257,0.0010039054,0.0007050682,0.0059524905],"category_scores_gemma":[0.0051975227,0.0003012935,0.0012248188,0.0015715903,0.0039985324,0.005582643,0.002342701,0.0029459933,0.00037250432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024898049,0.000017995428,0.0007144546,0.000043542357,0.000007312589,0.00010095488,0.00016419585,0.008850035,0.00035366332,0.9838435,0.00065462163,0.0052248836],"study_design_scores_gemma":[0.000016918764,0.000056478766,0.0010734517,0.00006130151,0.00001222144,0.00017955233,0.00030557212,0.044715676,0.00045191048,0.9471567,0.0059508947,0.00001934835],"about_ca_topic_score_codex":0.001974303,"about_ca_topic_score_gemma":0.0015775551,"teacher_disagreement_score":0.0059524905,"about_ca_system_score_codex":0.0011733153,"about_ca_system_score_gemma":0.0010380915,"threshold_uncertainty_score":0.019913018},"labels":[],"label_agreement":null},{"id":"W2162816032","doi":"10.1080/02331934.2011.568617","title":"Multi-start approach for an integer determinant maximization problem","year":2011,"lang":"en","type":"article","venue":"Optimization","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Integer (computer science); Maximization; Mathematics; Mathematical optimization; TRACE (psycholinguistics); Conic section; Variable (mathematics); Nonlinear system; Matrix (chemical analysis); Constant (computer programming); Term (time); Computer science","score_opus":0.1090572466309671,"score_gpt":0.3099000564566249,"score_spread":0.20084280982565778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162816032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037015085,0.000087438326,0.99358624,0.000111934336,0.000018931372,0.000029454048,0.000016279135,0.0001161859,0.0023320457],"genre_scores_gemma":[0.25463223,0.00018831,0.7368879,0.00021580624,0.000057571964,0.0002990856,0.00013849942,0.0003906474,0.0071899523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927443,0.00032297536,0.000024838866,0.00011655257,0.00019024662,0.00007086902],"domain_scores_gemma":[0.99788046,0.0014564851,0.00013263965,0.00012772629,0.00028381884,0.00011884323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016837439,0.0010193882,0.001130282,0.0005064879,0.0006609065,0.0010585968,0.0013770432,0.0014844489,0.0063034594],"category_scores_gemma":[0.0039650165,0.0006348115,0.00080778875,0.0004901946,0.0012599672,0.0011937193,0.0019164891,0.002017725,0.0012434348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013371404,0.00007133599,0.00031242846,0.00014277114,0.000045526725,0.00019644086,0.00013872684,0.88513637,0.0032889387,0.08305286,0.0021895487,0.025291367],"study_design_scores_gemma":[0.0000131924735,0.000023574019,0.000021623082,0.000005215031,0.000003510166,0.000014890949,0.000008633267,0.98789704,0.00062823266,0.010632866,0.00074531726,0.000005938272],"about_ca_topic_score_codex":0.0025346219,"about_ca_topic_score_gemma":0.0029502697,"teacher_disagreement_score":0.0063034594,"about_ca_system_score_codex":0.0010070762,"about_ca_system_score_gemma":0.0014552494,"threshold_uncertainty_score":0.02108717},"labels":[],"label_agreement":null},{"id":"W2320499430","doi":"10.1080/02331934.2016.1149711","title":"Semicontinuity and convergence for vector optimization problems with approximate equilibrium constraints","year":2016,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Convergence (economics); Constraint (computer-aided design); Vector optimization; Mathematical optimization; Variational inequality; Solution set; Set (abstract data type); Optimization problem; Feasible region; Applied mathematics; Function (biology); Computer science; Multi-swarm optimization","score_opus":0.010400511503371195,"score_gpt":0.21135661900868197,"score_spread":0.20095610750531076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320499430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016792668,0.0020055668,0.9701351,0.00074832316,0.00009399597,0.00006894537,0.000114722316,0.0000814499,0.009959253],"genre_scores_gemma":[0.67273283,0.010088874,0.29181802,0.0011884851,0.00052233355,0.0013496729,0.0010375209,0.00060921843,0.020652946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974509,0.0012039075,0.00018442232,0.00033698248,0.0006306593,0.00019310342],"domain_scores_gemma":[0.9911164,0.0060647028,0.00052913727,0.0004781396,0.0015550978,0.00025647186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072821216,0.0022445815,0.0019603923,0.0025590323,0.0012487973,0.002578926,0.001892386,0.0018368572,0.003429262],"category_scores_gemma":[0.021515565,0.0007563337,0.0023431904,0.0019580706,0.003310559,0.004560337,0.003706638,0.0048244623,0.0004981423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093991046,0.00007806085,0.00089686754,0.00057275995,0.00011591952,0.00029111683,0.00043987078,0.22678126,0.006043669,0.73631465,0.002608416,0.025763422],"study_design_scores_gemma":[0.000009789022,0.00007929544,0.000344021,0.00009559002,0.000023366569,0.00011459954,0.00007997522,0.75029474,0.0015640658,0.24462599,0.0027429014,0.000025664916],"about_ca_topic_score_codex":0.002461728,"about_ca_topic_score_gemma":0.0013224183,"teacher_disagreement_score":0.0072821216,"about_ca_system_score_codex":0.0020726605,"about_ca_system_score_gemma":0.0019134487,"threshold_uncertainty_score":0.03851199},"labels":[],"label_agreement":null},{"id":"W2883106675","doi":"10.1080/02331934.2018.1482297","title":"Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term","year":2018,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shiraz University of Technology; Shahrekord University; K.N.Toosi University of Technology; York University","keywords":"Mathematics; Kernel (algebra); Trigonometric functions; Mathematical optimization; Variable kernel density estimation; Simple (philosophy); Algorithm; Bounded function; Interior point method; Applied mathematics; Kernel method; Computer science; Discrete mathematics; Artificial intelligence; Support vector machine; Mathematical analysis","score_opus":0.0408754261256368,"score_gpt":0.3554681554258558,"score_spread":0.314592729300219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883106675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016418145,0.0001388219,0.9974976,0.000057024954,0.000028477461,0.000014376345,0.0000056234126,0.00006792981,0.0005482998],"genre_scores_gemma":[0.14072236,0.0004932843,0.8548634,0.00012711722,0.000104003266,0.00027461012,0.000102193786,0.00020009068,0.0031128789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00026505665,0.000030775405,0.0000899773,0.00022598296,0.000054429907],"domain_scores_gemma":[0.999138,0.00045151962,0.00006711893,0.00008792638,0.0002028545,0.000052536805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017089369,0.0012324513,0.0019145282,0.0006745745,0.0005194628,0.0010162488,0.0017133655,0.001480186,0.0023010734],"category_scores_gemma":[0.0029431416,0.0005255816,0.00089473586,0.0008826838,0.0012509539,0.0015757348,0.001617094,0.0030202286,0.0009786087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013857959,0.00015380846,0.00048275935,0.00035404382,0.000068733694,0.00013220077,0.00012503991,0.8123974,0.005751894,0.08387239,0.0028679997,0.093655154],"study_design_scores_gemma":[0.000008355576,0.00001477318,0.000016919583,0.0000043033306,0.0000031142542,0.000015404707,0.0000034099655,0.9955485,0.00035629573,0.0035076719,0.0005174071,0.0000038527746],"about_ca_topic_score_codex":0.0014559895,"about_ca_topic_score_gemma":0.0009993798,"teacher_disagreement_score":0.0023010734,"about_ca_system_score_codex":0.00076412194,"about_ca_system_score_gemma":0.0014141714,"threshold_uncertainty_score":0.009037852},"labels":[],"label_agreement":null},{"id":"W2955869862","doi":"10.1080/02331934.2019.1630625","title":"A robust fuzzy approach for constrained multi-product economic production quantity with imperfect items and rework process","year":2019,"lang":"en","type":"article","venue":"Optimization","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Rework; Fuzzy logic; Computer science; Mathematics; Robust optimization; Artificial intelligence","score_opus":0.027107951665124398,"score_gpt":0.2197076757366503,"score_spread":0.1925997240715259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955869862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024422999,0.00019200004,0.9957489,0.000053249303,0.00001590503,0.000022855918,0.000027813992,0.00003281123,0.001464189],"genre_scores_gemma":[0.5180904,0.0011162377,0.47263315,0.00015190202,0.00013020729,0.00038630943,0.00023951616,0.00014689482,0.007105386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991955,0.00021816982,0.000048099453,0.00017753868,0.00028254633,0.00007814679],"domain_scores_gemma":[0.99927765,0.00040466723,0.000091822236,0.00004357002,0.00015497302,0.000027340957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018436752,0.0011955935,0.0013981069,0.0010128774,0.00038043378,0.0016862979,0.0018041432,0.0014654247,0.0029561159],"category_scores_gemma":[0.002430353,0.0007676215,0.00165182,0.0010344529,0.00070515723,0.0015025552,0.00094460335,0.0013163151,0.00032439287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017468456,0.000013856851,0.00008609411,0.000096304844,0.000031284188,0.0000682511,0.00002401496,0.97044367,0.0010497204,0.016378002,0.00028893288,0.011502392],"study_design_scores_gemma":[0.000003195141,0.000020070172,0.000034293458,0.0000073019582,0.000006459085,0.000011310744,0.0000044568046,0.9955096,0.00023243284,0.0037186914,0.0004471768,0.000004951285],"about_ca_topic_score_codex":0.005804609,"about_ca_topic_score_gemma":0.0033952312,"teacher_disagreement_score":0.005804609,"about_ca_system_score_codex":0.0012086694,"about_ca_system_score_gemma":0.0014577501,"threshold_uncertainty_score":0.011541605},"labels":[],"label_agreement":null},{"id":"W4236363547","doi":"10.1080/02331930108844541","title":"Application of topological degree theory to semi-definite complementarity problem","year":2001,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Complementarity theory; Degree (music); Complementarity (molecular biology); Existential quantification; Positive-definite matrix; Mixed complementarity problem; Topology (electrical circuits); Discrete mathematics; Combinatorics; Eigenvalues and eigenvectors; Nonlinear system","score_opus":0.026746375495248637,"score_gpt":0.26535763986386823,"score_spread":0.2386112643686196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236363547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1509211,0.0015268101,0.80819046,0.0016788195,0.00011932962,0.00003400728,0.000062612526,0.000063050786,0.037403822],"genre_scores_gemma":[0.9523718,0.0011523159,0.04151271,0.00009096359,0.00016459744,0.000051967436,0.00005561654,0.000023238925,0.004576821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960405,0.00016300175,0.000016157823,0.000046998524,0.00011581649,0.000053911313],"domain_scores_gemma":[0.99878913,0.0007144547,0.00014319195,0.000067883746,0.00015758415,0.00012770854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078796403,0.00036475484,0.00044185587,0.0011839422,0.00077553955,0.0012950815,0.00047664714,0.00054231804,0.0014809734],"category_scores_gemma":[0.002693677,0.00017866628,0.00054958364,0.0007871497,0.0020885644,0.0019468812,0.0020336804,0.0008896548,0.00011229898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013293954,0.0000069279804,0.00024751457,0.000038669004,0.00001048034,0.00006153309,0.000091489346,0.023452867,0.00099946,0.9694697,0.0002900502,0.0053180717],"study_design_scores_gemma":[0.0000069513226,0.000029605355,0.00023325755,0.000014032459,0.0000063137877,0.00009079278,0.00007976206,0.1834698,0.00056469947,0.8131864,0.0023062741,0.000012138708],"about_ca_topic_score_codex":0.00064627966,"about_ca_topic_score_gemma":0.00047986044,"teacher_disagreement_score":0.0014809734,"about_ca_system_score_codex":0.0008519925,"about_ca_system_score_gemma":0.0005039051,"threshold_uncertainty_score":0.0061816573},"labels":[],"label_agreement":null},{"id":"W4297630972","doi":"10.1080/02331934.2025.2466032","title":"Stackelberg strategy on a degenerate parabolic equation with missing data","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stackelberg competition; Degenerate energy levels; Missing data; Applied mathematics; Mathematics; Computer science; Mathematical optimization; Environmental science; Mathematical economics; Physics; Statistics","score_opus":0.05148200405240271,"score_gpt":0.29199965903812897,"score_spread":0.24051765498572625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297630972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14409679,0.00041964167,0.8413398,0.0012402342,0.00009080512,0.00008259578,0.00017817905,0.0000970669,0.012454887],"genre_scores_gemma":[0.96181875,0.00025301447,0.02933961,0.00020607277,0.0000585314,0.00014819654,0.000109052366,0.000016474167,0.00805036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.00028154373,0.000035562047,0.00014305014,0.00013263225,0.00011195416],"domain_scores_gemma":[0.9990964,0.00042342013,0.00015099188,0.000056924557,0.00011685298,0.00015547467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016446211,0.00096029794,0.0013062367,0.00055144145,0.00070068374,0.0012951808,0.0011429448,0.0014584963,0.0019076992],"category_scores_gemma":[0.002573776,0.00041897656,0.0009096006,0.0004312402,0.001853789,0.0011203666,0.0025320782,0.0015658537,0.00016041652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025330108,0.00009920478,0.0013517989,0.00016041491,0.00013397186,0.0006238036,0.00025448308,0.51190203,0.0073293257,0.46277928,0.0012980722,0.013814303],"study_design_scores_gemma":[0.00003628405,0.0001359541,0.00016762287,0.000009859732,0.000016010656,0.00002835726,0.000043307424,0.93516314,0.00048007155,0.06340455,0.0004968991,0.000017918486],"about_ca_topic_score_codex":0.0041151633,"about_ca_topic_score_gemma":0.0016848206,"teacher_disagreement_score":0.0041151633,"about_ca_system_score_codex":0.0013957815,"about_ca_system_score_gemma":0.0013095576,"threshold_uncertainty_score":0.010127127},"labels":[],"label_agreement":null},{"id":"W4311815018","doi":"10.1080/02331934.2022.2154607","title":"HJB equation for optimal control system with random impulses","year":2022,"lang":"en","type":"article","venue":"Optimization","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Mathematics; Impulse control; Impulse (physics); Random function; Bellman equation; Stochastic process; Applied mathematics; Stochastic control; Viscosity solution; Stochastic differential equation; Optimal control; Mathematical optimization; Random variable; Statistics","score_opus":0.007511859385783469,"score_gpt":0.18289659064274047,"score_spread":0.175384731256957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311815018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028736418,0.0019292162,0.9458121,0.0019473523,0.00035787758,0.00005539373,0.0002180584,0.00013745257,0.020806188],"genre_scores_gemma":[0.93014485,0.0023247176,0.038854785,0.00072200585,0.0003881593,0.00029587856,0.0002597432,0.000099560486,0.026910394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924505,0.00017832551,0.00003338482,0.00014320893,0.00029716914,0.0001028619],"domain_scores_gemma":[0.99930763,0.00033205707,0.0001238108,0.000029846657,0.00016992971,0.000036830403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165031,0.00062154146,0.00107336,0.00063462154,0.00039543494,0.0012887021,0.000928488,0.0016533816,0.00296845],"category_scores_gemma":[0.0025784944,0.00031467187,0.00072432513,0.0005975227,0.0013577129,0.0014041053,0.0010106696,0.0016665339,0.00027422974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050629194,0.000028963921,0.00083226897,0.0001807399,0.000084267835,0.0003634867,0.00018108787,0.40330872,0.004496171,0.579196,0.0027192098,0.008558536],"study_design_scores_gemma":[0.000025732412,0.000029984845,0.00043483122,0.000017745891,0.000017459757,0.00006180967,0.000026350479,0.9203013,0.0003227109,0.07733622,0.001400396,0.000025428983],"about_ca_topic_score_codex":0.0053231413,"about_ca_topic_score_gemma":0.002137958,"teacher_disagreement_score":0.0053231413,"about_ca_system_score_codex":0.00094585697,"about_ca_system_score_gemma":0.0010550955,"threshold_uncertainty_score":0.010584295},"labels":[],"label_agreement":null},{"id":"W4399041129","doi":"10.1080/02331934.2024.2358086","title":"Optimality conditions for bilevel programmes via Moreau envelope reformulation*","year":2024,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bilevel optimization; Mathematics; Envelope (radar); Mathematical optimization; Applied mathematics; Mathematical economics; Optimization problem; Computer science","score_opus":0.019653196089471827,"score_gpt":0.2972087012561994,"score_spread":0.2775555051667276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399041129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024766779,0.00043765086,0.90835416,0.001276952,0.00009553646,0.00013482966,0.000306415,0.0000980714,0.0645296],"genre_scores_gemma":[0.5851703,0.0015416822,0.37467715,0.0010809912,0.00026513071,0.0009019861,0.00081465545,0.00045926616,0.035088833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924576,0.0002566854,0.000037233043,0.00014767906,0.00016203108,0.00015063342],"domain_scores_gemma":[0.99905175,0.0004893224,0.00011443493,0.000085586835,0.00017390268,0.00008495287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024340474,0.00093238766,0.00091177365,0.00083340897,0.00064232846,0.0022005842,0.00088023924,0.001577957,0.012945991],"category_scores_gemma":[0.0053783963,0.00052479515,0.0013437996,0.00081317173,0.0022701467,0.00408364,0.0020982819,0.0031309682,0.001487004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008744961,0.000021852346,0.000064708394,0.00004088813,0.0000043794307,0.000024770667,0.000063607506,0.022570573,0.00040755866,0.9710271,0.0011321544,0.0046336497],"study_design_scores_gemma":[0.000028802915,0.00005315825,0.00012555618,0.000070808725,0.000007399642,0.00003213314,0.0000613127,0.24187605,0.0007599417,0.7498819,0.0070855264,0.00001746309],"about_ca_topic_score_codex":0.0016847502,"about_ca_topic_score_gemma":0.0016024252,"teacher_disagreement_score":0.012945991,"about_ca_system_score_codex":0.001713311,"about_ca_system_score_gemma":0.001427319,"threshold_uncertainty_score":0.043308616},"labels":[],"label_agreement":null},{"id":"W4403922183","doi":"10.1080/02331934.2024.2422040","title":"Optimal control of a queueing system","year":2024,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Mathematics; Layered queueing network; Queueing system; Mathematical optimization; Control (management); Applied mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.005509324901175521,"score_gpt":0.20698902113128992,"score_spread":0.20147969623011439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403922183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12793307,0.0010892921,0.8471383,0.0015982251,0.00021604142,0.000112959984,0.0001777739,0.00030987733,0.021424456],"genre_scores_gemma":[0.9819797,0.0003176205,0.013091225,0.000082908744,0.00006919065,0.00006616028,0.000043788536,0.000018911362,0.0043305466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906677,0.0003421619,0.00002927845,0.00021524403,0.00014041719,0.00020608009],"domain_scores_gemma":[0.9991173,0.0004744713,0.00012598433,0.000032489894,0.00015844106,0.00009135666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011788836,0.0012103451,0.001127538,0.00046322265,0.0006116579,0.001874718,0.0010525981,0.0012797175,0.0021096868],"category_scores_gemma":[0.0023358925,0.00041984295,0.00046351354,0.0004380193,0.0018233218,0.0008982089,0.0012817095,0.0010968049,0.0001910615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072354655,0.00005388933,0.00021127965,0.000051686315,0.000020279893,0.00006567992,0.00004665971,0.96087015,0.0017783286,0.03242014,0.00050063134,0.003908879],"study_design_scores_gemma":[0.000017301858,0.000033538607,0.00005780501,0.0000032160801,0.0000050194876,0.0000028443912,0.000007358311,0.99506,0.00011315016,0.004517723,0.00017713029,0.000004794752],"about_ca_topic_score_codex":0.020062314,"about_ca_topic_score_gemma":0.0062285014,"teacher_disagreement_score":0.020062314,"about_ca_system_score_codex":0.0027712001,"about_ca_system_score_gemma":0.0021914335,"threshold_uncertainty_score":0.039891124},"labels":[],"label_agreement":null},{"id":"W4412146863","doi":"10.1080/02331934.2025.2531054","title":"Minimization of the expected first-passage area for a one-dimensional diffusion process","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diffusion process; Minification; Diffusion; Process (computing); Mathematical optimization; Computer science; Innovation diffusion; Thermodynamics","score_opus":0.008937221805970157,"score_gpt":0.25365257782342654,"score_spread":0.2447153560174564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412146863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079431,0.0009643418,0.91433775,0.00076131383,0.00005044186,0.000043840406,0.000090469155,0.00012113097,0.00419963],"genre_scores_gemma":[0.8026128,0.0013041139,0.18329911,0.00017413036,0.00010112426,0.00029903834,0.00024535457,0.00028717594,0.011677144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.00020673485,0.000031145748,0.00016260405,0.00010453479,0.00006297635],"domain_scores_gemma":[0.9970528,0.0020807558,0.00031879797,0.000102389866,0.00023518462,0.00021007695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021876476,0.0008909909,0.0015355189,0.000896296,0.00048414958,0.0014287982,0.0013122695,0.0015972378,0.002015042],"category_scores_gemma":[0.0060713007,0.00051494996,0.0007962688,0.0006664504,0.0016309362,0.0019571278,0.0012361205,0.0011108869,0.00025732053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104312465,0.00005392361,0.0005738343,0.00020514101,0.00007699437,0.000112628186,0.00007518922,0.88431484,0.0062709725,0.09870262,0.00056256447,0.008947029],"study_design_scores_gemma":[0.000014010353,0.00007422504,0.00025428005,0.000016162583,0.000015880278,0.00004040359,0.000016448184,0.95772904,0.0012360639,0.04017655,0.00040672955,0.000020123507],"about_ca_topic_score_codex":0.0012698083,"about_ca_topic_score_gemma":0.00071349985,"teacher_disagreement_score":0.0021876476,"about_ca_system_score_codex":0.0018522287,"about_ca_system_score_gemma":0.0013032791,"threshold_uncertainty_score":0.01343894},"labels":[],"label_agreement":null},{"id":"W4414207739","doi":"10.1080/02331934.2025.2548732","title":"Special issue to celebrate the scientific career of Stephan Dempe","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Southampton","keywords":"","score_opus":0.004465767575514629,"score_gpt":0.21268354912109164,"score_spread":0.20821778154557702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414207739","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.000290037,0.010002026,0.0050586006,0.089941904,0.87432843,0.000028486817,0.00032702528,0.0003720865,0.01965126],"genre_scores_gemma":[0.0057346397,0.009749426,0.0025219242,0.026440304,0.871812,0.000065548564,0.00029969504,0.00093397393,0.08244253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828845,0.00029720477,0.00009913549,0.00039223244,0.0007463187,0.00017672492],"domain_scores_gemma":[0.9937888,0.0017886548,0.0003654565,0.00038103515,0.0021897217,0.0014862986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021197733,0.00212565,0.0016583595,0.001267958,0.0015840317,0.0056835916,0.001265496,0.0035319368,0.04770833],"category_scores_gemma":[0.009604747,0.00045621936,0.0014013221,0.0006767555,0.0013721328,0.0032392903,0.002024862,0.008506058,0.03326976],"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.000015075261,0.000011438026,0.000026537025,0.00005025552,0.000008354969,0.000030788542,0.000006777931,0.00018270256,0.000096206066,0.002757707,0.9897529,0.007061278],"study_design_scores_gemma":[0.000012417382,0.00003855127,0.00014587915,0.00010711229,0.000012064287,0.00013634218,0.000020437357,0.00090752303,0.00020093306,0.0072974158,0.9911032,0.000018112332],"about_ca_topic_score_codex":0.0006020755,"about_ca_topic_score_gemma":0.0012201059,"teacher_disagreement_score":0.04770833,"about_ca_system_score_codex":0.0016431302,"about_ca_system_score_gemma":0.002033631,"threshold_uncertainty_score":0.15960026},"labels":[],"label_agreement":null},{"id":"W4415504824","doi":"10.1080/02331934.2025.2577413","title":"Eckstein-Ferris-Pennanen-Robinson duality revisited: paramonotonicity, total Fenchel-Rockafellar duality, and the Chambolle-Pock operator","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Operator (biology); Quasinormal operator; Algebra over a field; Compact operator; Strictly singular operator; Finite-rank operator","score_opus":0.006124928500828608,"score_gpt":0.23907057850195493,"score_spread":0.23294565000112633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415504824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07249681,0.0019543853,0.86788255,0.0028171423,0.00021114225,0.00004964191,0.00014625842,0.00009917314,0.054342892],"genre_scores_gemma":[0.8462306,0.001892125,0.13677476,0.00090040354,0.0003851788,0.00014886336,0.00014079,0.00015009388,0.01337718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.00037470937,0.00004206673,0.00018073837,0.00025421946,0.00009979883],"domain_scores_gemma":[0.9980052,0.0011098319,0.00019659092,0.00021415541,0.00030892127,0.00016526316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030354864,0.00073978584,0.0010482221,0.0013653731,0.00106553,0.0028840592,0.0013423606,0.0012893976,0.0044013956],"category_scores_gemma":[0.009012329,0.00033862834,0.0010893652,0.001302516,0.0041545155,0.0045869304,0.0028008178,0.0027423354,0.0006693218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076675315,0.0000043946643,0.000057395264,0.000013391144,0.0000035959756,0.000021685142,0.00003748894,0.0021987874,0.00016520939,0.9946537,0.00040001213,0.0024367026],"study_design_scores_gemma":[0.0000069827433,0.000014717761,0.000069744216,0.000013492233,0.0000039509546,0.000074428994,0.00003596008,0.03190281,0.00036383932,0.9659462,0.0015601498,0.000007757358],"about_ca_topic_score_codex":0.00053208525,"about_ca_topic_score_gemma":0.00040463728,"teacher_disagreement_score":0.0044013956,"about_ca_system_score_codex":0.0013020086,"about_ca_system_score_gemma":0.0010041901,"threshold_uncertainty_score":0.016053379},"labels":[],"label_agreement":null}]}