{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006579002,0.0000067844026,0.98336786,0.00009376421,0.00010159692,0.00028746412,0.00002814982,0.00011414828,0.009421253],"genre_scores_gemma":[0.11159599,0.00004858203,0.8606466,0.000033837106,0.00021056831,0.000086651664,0.0012341418,0.000088704845,0.026054943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.00004691166,0.00034986928,0.00016736818,0.00026015117,0.0001581564],"domain_scores_gemma":[0.99906063,0.000081271115,0.0002050642,0.00022402892,0.00039727587,0.000031746535],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014535268,0.000097711374,0.0001515453,0.00016407012,0.000093896924,0.000022891638,0.0000849466,0.000073081545,0.0009245041],"category_scores_gemma":[0.00014418905,0.00010174286,0.000038014252,0.0005340105,0.000053510477,0.00031015222,0.000026302308,0.000065199856,0.00001836781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002487008,0.00024592454,0.0004075846,0.000061336075,0.0000147709725,8.0800817e-7,0.00004610209,0.94720846,0.020003557,0.030546885,0.00078718376,0.00065251667],"study_design_scores_gemma":[0.0007345351,0.00005020829,0.0002867845,0.000029656281,0.00002666344,0.000004342072,0.00004366266,0.9677224,0.02167141,0.007495087,0.0017234951,0.0002117402],"about_ca_topic_score_codex":0.000012517343,"about_ca_topic_score_gemma":0.0000025658273,"teacher_disagreement_score":0.122721255,"about_ca_system_score_codex":0.00004560106,"about_ca_system_score_gemma":0.00004021761,"threshold_uncertainty_score":0.9999888},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021222318,0.00004574293,0.9961826,0.0018898713,0.00010334803,0.0002929868,0.000032308555,0.00020584279,0.0010350554],"genre_scores_gemma":[0.008666537,0.000040470055,0.98705065,0.0014091003,0.000223465,0.00010314079,0.00060511474,0.000022638747,0.0018788871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981502,0.00019086378,0.0004891624,0.00047738367,0.00040845003,0.00028389174],"domain_scores_gemma":[0.99889344,0.00037276093,0.00016293158,0.00030580562,0.00016752373,0.00009752572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008816509,0.00019066042,0.0002489052,0.00019999142,0.00037010145,0.00029912905,0.00037811347,0.00012732473,0.0005345462],"category_scores_gemma":[0.00018230724,0.00019807975,0.00017448113,0.00065216544,0.0000090144,0.0013251447,0.000047448702,0.000108024695,0.000036511636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011035673,0.00005487463,0.00007253194,0.000009027832,0.000062904895,0.0000011478813,0.0005674426,0.8974514,0.000007848715,0.0957851,0.0002140214,0.0057626497],"study_design_scores_gemma":[0.0006832656,0.00003296041,0.00004749241,0.00001681112,0.00004460232,0.0000042944453,0.000031678075,0.9934175,0.000039829145,0.004183027,0.0012615251,0.00023703619],"about_ca_topic_score_codex":0.00003949871,"about_ca_topic_score_gemma":4.960539e-7,"teacher_disagreement_score":0.09596606,"about_ca_system_score_codex":0.00008069853,"about_ca_system_score_gemma":0.000109248984,"threshold_uncertainty_score":0.8077458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030761832,0.00006906011,0.96043515,0.0005941591,0.00061986235,0.0001793889,0.0000040668365,0.00007527991,0.007261218],"genre_scores_gemma":[0.76495403,0.000026761609,0.23460947,0.00006298002,0.00011626463,0.000010926938,0.000007553387,0.000006315997,0.00020567038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992525,0.00009044958,0.00016906454,0.00017462714,0.00017125579,0.0001420883],"domain_scores_gemma":[0.9993524,0.00014526543,0.000110236644,0.00031703702,0.000047373047,0.000027687718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506808,0.00007990106,0.00009048362,0.00018026281,0.00008200693,0.00008933151,0.0004757061,0.000029622122,0.000047876998],"category_scores_gemma":[0.000037172806,0.0000592693,0.000034884157,0.0014222127,0.000023418059,0.00035406218,0.000047032903,0.00015339104,0.000013547038],"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.000011315465,0.00047096764,0.0016466305,0.00002696851,0.000020329688,0.000008917248,0.0013784259,0.3527273,0.002209832,0.6321578,0.0015391366,0.007802364],"study_design_scores_gemma":[0.0004957385,0.00006035315,0.00019167767,0.0000053835734,0.000011857428,0.000020843125,0.00006112373,0.9932483,0.0019241138,0.003126445,0.0007349718,0.000119208664],"about_ca_topic_score_codex":0.00006149857,"about_ca_topic_score_gemma":0.000017701721,"teacher_disagreement_score":0.7341922,"about_ca_system_score_codex":0.000012125376,"about_ca_system_score_gemma":0.000032601663,"threshold_uncertainty_score":0.24169318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058519403,0.000017285927,0.99094075,0.001035756,0.000052040563,0.00020813494,0.0000033128822,0.00017454253,0.0075096614],"genre_scores_gemma":[0.013233187,0.000079410114,0.9782319,0.00035638904,0.000056369787,0.000062773346,0.00006899033,0.000012508858,0.0078984685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989882,0.000048159774,0.00019099751,0.00033738822,0.0002792161,0.00015601679],"domain_scores_gemma":[0.99934787,0.000020207272,0.00007356482,0.0002792613,0.00021224217,0.00006688603],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001014037,0.0001180695,0.00010594751,0.0001219103,0.0002072314,0.00017089711,0.00026825827,0.000047143305,0.0016826482],"category_scores_gemma":[0.000010989221,0.0001002264,0.00003652104,0.0011948976,0.000028031183,0.0008688186,0.000020001991,0.000061400606,0.00008604743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046311793,0.000076701996,0.00010449238,0.000002860814,0.000023555755,0.0000018554742,0.00015229215,0.9664524,0.0000017976375,0.0037969812,0.0002498002,0.029132586],"study_design_scores_gemma":[0.00027096964,0.00006198152,0.00016940593,0.000009380741,0.000015076428,0.000019025718,0.000011785588,0.9972625,0.000084476516,0.00013975042,0.0018054274,0.00015022252],"about_ca_topic_score_codex":0.000034133398,"about_ca_topic_score_gemma":0.000006983096,"teacher_disagreement_score":0.03081005,"about_ca_system_score_codex":0.000037813643,"about_ca_system_score_gemma":0.000094217015,"threshold_uncertainty_score":0.99922997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36578584,0.00007391003,0.62023544,0.0002158373,0.00011127451,0.00054453016,0.0000014248302,0.00010205702,0.012929652],"genre_scores_gemma":[0.9922498,0.000031934345,0.0068782684,0.00030838815,0.00021486984,0.000022984754,0.000016797672,0.000030399453,0.00024654315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913466,0.000006575018,0.00016024841,0.00029166468,0.00017620693,0.00023064755],"domain_scores_gemma":[0.99964976,0.000009389288,0.00012413785,0.00013562957,0.00005926668,0.000021790574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017888873,0.0001675385,0.00013860622,0.00025012228,0.0002094899,0.00025120372,0.000080568345,0.00003911353,0.00018789599],"category_scores_gemma":[0.00003158826,0.00014340667,0.000012571496,0.000245075,0.000063833264,0.0010762756,0.0001734324,0.00006272786,0.000009869925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003538717,0.00028486305,0.07576396,0.00069823925,0.00015565203,0.00002301992,0.0016987106,0.86825836,0.000091871574,0.049714454,0.00034680692,0.0026101826],"study_design_scores_gemma":[0.0017890366,0.0000699644,0.023654927,0.00013018091,0.00015136134,0.000010313504,0.0009862668,0.97155863,0.000041006715,0.00031948043,0.00070725,0.0005816003],"about_ca_topic_score_codex":0.0005897905,"about_ca_topic_score_gemma":0.00007041232,"teacher_disagreement_score":0.62646395,"about_ca_system_score_codex":0.000029436043,"about_ca_system_score_gemma":0.00001230362,"threshold_uncertainty_score":0.5847954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016951785,0.0004094969,0.9843129,0.0021213877,0.00011181012,0.00054885185,0.00010677433,0.00007391163,0.012145363],"genre_scores_gemma":[0.92722404,0.000044863824,0.07044069,0.000532302,0.00015410864,0.0006434244,0.000031585096,0.000031302865,0.0008976828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.0000020579519,0.0003472358,0.00029998337,0.000028595838,0.00024386351],"domain_scores_gemma":[0.99948937,0.000022646629,0.00012660996,0.00020812642,0.000066828674,0.00008643669],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012142866,0.00009841849,0.00017226562,0.000116016134,0.00019764318,0.00005856938,0.00013706382,0.000061528735,0.00051298126],"category_scores_gemma":[0.0001889696,0.00011963566,0.000042938627,0.00043370712,0.000027085902,0.0001330686,0.00002521547,0.00005870863,0.0011376376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018081287,0.00006916162,0.00003481874,0.000006920413,0.000005168897,1.093402e-7,0.0001690704,0.58210635,0.0000023389634,0.41681042,0.0004751834,0.00031861564],"study_design_scores_gemma":[0.00037983138,0.00006822075,0.00022911755,0.000009015153,0.0000071086306,0.000002423706,0.0000130776825,0.9611955,0.0000012282986,0.028083846,0.009814249,0.00019634662],"about_ca_topic_score_codex":0.000026365404,"about_ca_topic_score_gemma":0.0000045855195,"teacher_disagreement_score":0.9270545,"about_ca_system_score_codex":0.00006451813,"about_ca_system_score_gemma":0.0000065501436,"threshold_uncertainty_score":0.9996401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004928199,0.00007932951,0.992656,0.0015640382,0.00008061729,0.00011378466,4.6766206e-7,0.00010508025,0.0049078567],"genre_scores_gemma":[0.5749199,0.00009930737,0.42424414,0.00016083244,0.00002208425,0.000014176895,0.000012521656,0.0000057815037,0.0005213159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991715,0.00002852962,0.00021184438,0.00023215209,0.00020695837,0.00014903797],"domain_scores_gemma":[0.9995268,0.000057289184,0.00010113556,0.00018163206,0.00008563239,0.000047507223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000150803,0.000081982485,0.000105452644,0.00037610525,0.00006453986,0.00025212177,0.00022916026,0.000050976,0.00047696292],"category_scores_gemma":[0.000096159405,0.00008078184,0.000036100428,0.0019576128,0.000011774741,0.0006474976,0.000034991448,0.00006330962,0.00007408631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.5310727e-7,0.0000843782,0.0024768445,0.0000029920734,0.0000056504227,0.0000022146335,0.00014291146,0.97824013,0.0000014309747,0.0072659045,0.0001289166,0.011648067],"study_design_scores_gemma":[0.00019677285,0.000011847534,0.0020431024,0.0000052424557,0.0000033856331,0.0000014544275,0.000012059578,0.99662435,0.000011841977,0.00008283749,0.0009077421,0.00009934512],"about_ca_topic_score_codex":0.000024042733,"about_ca_topic_score_gemma":0.0000050735953,"teacher_disagreement_score":0.574427,"about_ca_system_score_codex":0.00003965083,"about_ca_system_score_gemma":0.000010570432,"threshold_uncertainty_score":0.52224094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20828058,0.00000724222,0.78761506,0.0029626053,0.00037073714,0.00031270232,0.000010969365,0.000020200268,0.00041990133],"genre_scores_gemma":[0.98983127,0.000019665516,0.009791965,0.00009772651,0.000028481418,0.000011859528,0.000036370486,0.0000048380807,0.00017781166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909276,0.000111603615,0.0002970975,0.00015205044,0.0002650491,0.00008145339],"domain_scores_gemma":[0.9990849,0.0000749563,0.00035005863,0.0002393479,0.00023671103,0.000014016194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032941904,0.00007340759,0.00011888997,0.0001606558,0.000089672125,0.000051233743,0.00034537519,0.00006693724,0.00004301154],"category_scores_gemma":[0.00016837275,0.000047004458,0.00004935818,0.0018675928,0.00005313835,0.0003776393,0.000068534726,0.00009777242,8.4471884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003865693,0.00058795733,0.055519097,0.000037274353,0.00007078317,1.3602872e-7,0.0024096605,0.74804926,0.09420329,0.094649814,0.0001881949,0.0042458903],"study_design_scores_gemma":[0.00019409528,0.00001566323,0.02711766,0.0000053325475,0.000014583268,9.397307e-7,0.000014683957,0.9606031,0.011760604,0.00008594952,0.00012796506,0.000059435533],"about_ca_topic_score_codex":0.00017495693,"about_ca_topic_score_gemma":0.000108349144,"teacher_disagreement_score":0.7815507,"about_ca_system_score_codex":0.000016428365,"about_ca_system_score_gemma":0.000068692614,"threshold_uncertainty_score":0.19167861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83869326,0.002961873,0.039690614,0.0008623287,0.00040209605,0.00024514511,0.00019783956,0.000093185845,0.116853684],"genre_scores_gemma":[0.98640317,0.002410594,0.009437392,0.0002555785,0.00008635217,0.000008268131,0.00007149565,0.000016378013,0.0013108022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991725,0.00001758797,0.0003498555,0.00028570107,0.000013839506,0.00016053188],"domain_scores_gemma":[0.99959004,0.000030530347,0.0001481281,0.00014909438,0.000018383109,0.000063836946],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026793248,0.00011229693,0.00023493292,0.000039765982,0.00013674617,0.00009969065,0.00007167113,0.000094472525,0.0019359874],"category_scores_gemma":[0.00003528717,0.00013080522,0.000029895591,0.00009072535,0.00006195353,0.0003518961,0.00002442141,0.000041931187,0.00011283316],"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.00023948253,0.000083003535,0.06448395,0.000041667106,0.000057380574,0.0000027763188,0.00045217518,0.1884104,0.000012147301,0.720511,0.0006877439,0.025018238],"study_design_scores_gemma":[0.003662931,0.00016989357,0.013524809,0.00011577562,0.000033735265,0.00010614727,0.00029799127,0.7301272,0.000075704156,0.1404211,0.110234894,0.0012298039],"about_ca_topic_score_codex":0.00034660808,"about_ca_topic_score_gemma":0.000010920329,"teacher_disagreement_score":0.5800899,"about_ca_system_score_codex":0.00005351498,"about_ca_system_score_gemma":0.000009708747,"threshold_uncertainty_score":0.99897635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002529453,0.000011084303,0.9971446,0.000024875262,0.00015898723,0.00064623676,0.0000047118906,0.00016935077,0.0015872163],"genre_scores_gemma":[0.024744527,0.000003987813,0.9747078,0.00008526795,0.000035082634,0.00014957055,0.00012856268,0.00002144688,0.00012375845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987652,0.00013607778,0.00026761045,0.00045864366,0.00016613014,0.00020639558],"domain_scores_gemma":[0.9991165,0.000047906105,0.00013884644,0.0003671993,0.0002516042,0.00007796433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045408623,0.00014435737,0.00013021533,0.00014241498,0.00013020284,0.00012582874,0.00047563793,0.000069555645,0.000012571553],"category_scores_gemma":[0.00005932744,0.00013917162,0.000053024127,0.00032376644,0.000027057971,0.0014504717,0.0001031336,0.000056632598,0.0000034999632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016791984,0.0002220712,0.00010237197,0.000018802277,0.000006383279,3.9954614e-7,0.0011720011,0.97729707,0.00005173874,0.007643441,0.0000426332,0.013426324],"study_design_scores_gemma":[0.00039219865,0.0001193203,0.00037667475,0.0000071829013,0.000008442351,0.0000070871074,0.000029584999,0.99663705,0.00057838997,0.0015901248,0.00006787028,0.00018605562],"about_ca_topic_score_codex":0.000016343127,"about_ca_topic_score_gemma":0.000003168991,"teacher_disagreement_score":0.024491582,"about_ca_system_score_codex":0.00005044462,"about_ca_system_score_gemma":0.000073781855,"threshold_uncertainty_score":0.56752545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019308901,0.000020144886,0.9963373,0.002362436,0.000089672205,0.0004696255,0.000023497721,0.0001600196,0.000344221],"genre_scores_gemma":[0.1706966,0.000068709865,0.82837576,0.0001509508,0.000037625858,0.00008851647,0.000053317104,0.00001747773,0.00051106006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988075,0.00004813326,0.00026482582,0.00045935955,0.00020020458,0.00021999051],"domain_scores_gemma":[0.9989081,0.000113151014,0.00021252397,0.00024842928,0.00041826785,0.00009953217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023712525,0.00016077323,0.00017426875,0.00011353919,0.00012335616,0.00017083717,0.00022587224,0.000072045674,0.0001343961],"category_scores_gemma":[0.000094527255,0.000111380476,0.000036869224,0.00038870604,0.00010191117,0.001062732,0.00006959604,0.00002998527,0.000003288246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019396766,0.000037952283,0.00055551296,0.000023541128,0.000034779365,3.2887624e-7,0.00012397538,0.968576,0.00041451392,0.02764052,0.00008157429,0.0024918723],"study_design_scores_gemma":[0.00095319585,0.00007483282,0.00012084843,0.000040369316,0.00002523831,0.000007674332,0.000007353867,0.9977189,0.0004787382,0.00027413547,0.000095665964,0.00020306218],"about_ca_topic_score_codex":0.000003387,"about_ca_topic_score_gemma":0.0000022549084,"teacher_disagreement_score":0.17050351,"about_ca_system_score_codex":0.000042326148,"about_ca_system_score_gemma":0.00007577748,"threshold_uncertainty_score":0.4541964},"labels":[],"label_agreement":null},{"id":"W2883106675","doi":"10.1080/02331934.2018.1482297","title":"Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term","year":2018,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shiraz University of Technology; Shahrekord University; K.N.Toosi University of Technology; York University","keywords":"Mathematics; Kernel (algebra); Trigonometric functions; Mathematical optimization; Variable kernel density estimation; Simple (philosophy); Algorithm; Bounded function; Interior point method; Applied mathematics; Kernel method; Computer science; Discrete mathematics; Artificial intelligence; Support vector machine; Mathematical analysis","score_opus":0.0408754261256368,"score_gpt":0.3554681554258558,"score_spread":0.314592729300219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883106675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007410488,0.0000072230246,0.994491,0.0003225907,0.00021179853,0.0018575253,0.000040771265,0.00032283246,0.002672171],"genre_scores_gemma":[0.007908345,0.000016578397,0.98964024,0.0003024919,0.000379968,0.00038611933,0.00039257717,0.00017105948,0.000802644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973704,0.00020879674,0.0006069062,0.00073807716,0.0005914119,0.00048439734],"domain_scores_gemma":[0.9964983,0.00073329255,0.00044454582,0.0005340012,0.0016154269,0.00017442441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008591743,0.00038588681,0.0004139783,0.0010532797,0.00053556496,0.00011829645,0.00022108952,0.00021512549,0.0007873032],"category_scores_gemma":[0.0018075658,0.00033948154,0.00011342657,0.0019309976,0.00012276403,0.0005781921,0.00008218728,0.00021627921,0.000017452865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015321113,0.0002465385,0.00004280535,0.000104079125,0.00005109231,0.0000013767752,0.00016713775,0.99340636,0.000033364802,0.0015687397,0.00028180753,0.002564572],"study_design_scores_gemma":[0.0033113235,0.002153239,0.000017621509,0.00009750726,0.0000974064,0.0000077441355,0.000060262468,0.99162185,0.0014032109,0.0006718447,0.0001611081,0.00039685567],"about_ca_topic_score_codex":0.0000045126835,"about_ca_topic_score_gemma":0.000003307813,"teacher_disagreement_score":0.007834241,"about_ca_system_score_codex":0.00035228228,"about_ca_system_score_gemma":0.000184187,"threshold_uncertainty_score":0.9999057},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5221734,0.00019441122,0.44282696,0.0013158935,0.0018050836,0.0084413,0.000010559838,0.00056684366,0.022665545],"genre_scores_gemma":[0.97149384,0.000016585589,0.026419403,0.00017950228,0.0007043201,0.00014151014,0.00030376838,0.00004437778,0.0006966748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990251,0.000008138476,0.00018137025,0.00050251035,0.000091852846,0.00019104907],"domain_scores_gemma":[0.99947673,0.000008062244,0.00018771415,0.00021042037,0.000106158695,0.000010906411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003410594,0.00016613571,0.0001722783,0.00015375465,0.00015936983,0.0002508825,0.000092568276,0.00004329749,0.00006663846],"category_scores_gemma":[0.000043006345,0.00014661628,0.000029452754,0.000188141,0.000050902494,0.0010951955,0.000036026056,0.000056617555,0.000016703581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013767273,0.00008953923,0.014718962,0.00067727466,0.000037541507,2.0886458e-7,0.00005644446,0.98039377,0.000038625563,0.0024389226,0.0007060839,0.0007049481],"study_design_scores_gemma":[0.0013007517,0.000038353093,0.00063731475,0.00004428267,0.00006752751,0.0000029777189,0.0005151869,0.99593955,0.00005368966,0.0000498966,0.0010679736,0.00028248294],"about_ca_topic_score_codex":0.000057109068,"about_ca_topic_score_gemma":0.000017566552,"teacher_disagreement_score":0.44932047,"about_ca_system_score_codex":0.000040255705,"about_ca_system_score_gemma":0.000017669148,"threshold_uncertainty_score":0.5978838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013234572,0.00001287883,0.9914016,0.00047804604,0.00004594056,0.00026601335,0.0000034849588,0.00008216477,0.0063863974],"genre_scores_gemma":[0.33227322,0.000012190931,0.6671461,0.00031947944,0.00003143131,0.000032569642,0.000022775072,0.000004462603,0.00015780683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992196,0.000100741796,0.00019863341,0.0002172673,0.00013275346,0.00013100344],"domain_scores_gemma":[0.9994152,0.0000760142,0.00008619513,0.00029270866,0.000077395365,0.000052439496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043983952,0.00007544877,0.000100924684,0.00006258674,0.00008157265,0.000030994834,0.00036600552,0.000038574977,0.00012188937],"category_scores_gemma":[0.000023547984,0.000067783214,0.00002779613,0.00039728233,0.000026921814,0.00018123475,0.00013341963,0.00004783925,0.000023191968],"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.000019787267,0.00009551667,0.0012776307,0.000008268365,0.0000061221363,9.979257e-7,0.00023235049,0.19375953,0.0001782458,0.7544746,0.00006674357,0.04988022],"study_design_scores_gemma":[0.0004133075,0.00019428856,0.0017970919,0.000014689082,0.0000105563495,0.000014630203,0.000051913463,0.8872646,0.0011946564,0.10395923,0.0048538875,0.00023113324],"about_ca_topic_score_codex":0.000017509292,"about_ca_topic_score_gemma":0.0000038006458,"teacher_disagreement_score":0.6935051,"about_ca_system_score_codex":0.000021680455,"about_ca_system_score_gemma":0.000013208094,"threshold_uncertainty_score":0.27641192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002601681,0.00003973373,0.9971021,0.00028020135,0.00007062358,0.00011319578,0.0000014018693,0.00016462978,0.0019679763],"genre_scores_gemma":[0.13502117,0.0000118333,0.86465925,0.000111513626,0.0000181653,0.000008694567,0.00003446235,0.000009079165,0.00012581488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992598,0.000020043042,0.00014565418,0.00030199642,0.00013689185,0.00013559694],"domain_scores_gemma":[0.9991013,0.0000701771,0.00004717824,0.0006870025,0.00006335957,0.00003098662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012115057,0.00009563426,0.0000885766,0.00008257764,0.00007879946,0.0001409601,0.00042884858,0.00003259595,0.0000029962307],"category_scores_gemma":[0.00008231556,0.00008303714,0.0000070285896,0.00039167618,0.000010588707,0.0005900343,0.000098130295,0.00006619228,0.000004557752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003161408,0.00001796657,0.000001958144,0.0000125170245,0.000004886831,7.821347e-7,0.00002162533,0.9048437,0.00005991448,0.08527778,0.000022413931,0.009733328],"study_design_scores_gemma":[0.00015778116,0.000024501338,0.0000065916383,0.00008512912,0.0000056551203,8.9110745e-7,0.000003167461,0.99514216,0.0006236574,0.003814451,0.000046385052,0.00008961057],"about_ca_topic_score_codex":0.0000017493903,"about_ca_topic_score_gemma":9.208128e-7,"teacher_disagreement_score":0.134761,"about_ca_system_score_codex":0.000035972123,"about_ca_system_score_gemma":0.000060112052,"threshold_uncertainty_score":0.33861566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060376357,0.000068337795,0.99155796,0.00009605794,0.00029714312,0.0010604823,0.000110039786,0.0003235853,0.00044877472],"genre_scores_gemma":[0.98407835,0.0000017685993,0.014556804,0.000020858233,0.00008122684,0.0009803333,0.00021697134,0.000026070078,0.000037631875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922717,0.000063942054,0.00021436303,0.0001555783,0.00018325125,0.000155681],"domain_scores_gemma":[0.9994185,0.00019501858,0.00004568465,0.00015323689,0.00015136538,0.000036184265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023166866,0.00010840026,0.00017906028,0.0000653559,0.00030555285,0.000046855363,0.00008274968,0.000030281379,0.00014826469],"category_scores_gemma":[0.00007649814,0.00010866457,0.00006109582,0.00015191303,0.000017936693,0.00013552327,0.000009618079,0.00006640864,0.0000018282998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003444443,0.00002872979,0.000049556806,0.00005677578,0.00004789892,1.243054e-7,0.00011580917,0.9968026,0.000063834545,0.0014831984,0.000044051743,0.00096295204],"study_design_scores_gemma":[0.0046945596,0.00015380526,0.00005530654,0.0000062305758,0.000071457325,0.0000013098246,0.0004053418,0.9941516,0.00005307255,0.00002811019,0.00025070374,0.00012850203],"about_ca_topic_score_codex":0.000011235123,"about_ca_topic_score_gemma":0.0000063388006,"teacher_disagreement_score":0.9780407,"about_ca_system_score_codex":0.00017114246,"about_ca_system_score_gemma":0.000028957447,"threshold_uncertainty_score":0.44312125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025876028,0.000062018575,0.99355257,0.0037095244,0.00028450962,0.00041000807,0.000041958985,0.0004849653,0.0014285796],"genre_scores_gemma":[0.123260565,0.000031524625,0.8737632,0.00027056318,0.00011247085,0.00021755528,0.0010484502,0.000018823204,0.0012768473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879223,0.000037554484,0.00032854793,0.00041635087,0.00023071388,0.00019460356],"domain_scores_gemma":[0.9990999,0.0001108929,0.0000791273,0.0002793776,0.00035166214,0.00007902017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819167,0.00014074935,0.000134292,0.00025495162,0.00026686324,0.0005120841,0.00027280694,0.000081497215,0.00016422285],"category_scores_gemma":[0.00006968807,0.0001259567,0.000120825884,0.0010536099,0.000026277408,0.0011897302,0.000058484922,0.00005885708,0.000039973977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025492063,0.000042421907,0.000044710396,0.00002206311,0.000045130077,6.367731e-7,0.0001333424,0.7935101,0.000022256387,0.19872425,0.00068909815,0.0067634755],"study_design_scores_gemma":[0.00017350425,0.00002921899,0.00029927897,0.000015244695,0.000033095053,0.0000049253495,0.0000056920267,0.9867063,0.00008786796,0.008304585,0.0041693337,0.00017090977],"about_ca_topic_score_codex":0.000019681745,"about_ca_topic_score_gemma":0.000003808759,"teacher_disagreement_score":0.19319628,"about_ca_system_score_codex":0.00009520287,"about_ca_system_score_gemma":0.00012876016,"threshold_uncertainty_score":0.5136366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004355941,0.00018460111,0.985108,0.00013843128,0.00020128196,0.00009886368,0.0000015683179,0.00029707496,0.009614214],"genre_scores_gemma":[0.9925168,0.0000026115042,0.006871969,0.000068832,0.0003270802,0.000008816274,0.000018037335,0.00002137202,0.00016445474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944353,0.000009234835,0.00019029388,0.00015063566,0.000109311884,0.000096968455],"domain_scores_gemma":[0.99965304,0.00003800113,0.00009408517,0.00011610568,0.00009474381,0.000004024908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433121,0.00007908256,0.00013197096,0.00021794697,0.00005401339,0.00012145345,0.00007898733,0.00003342532,0.0001211526],"category_scores_gemma":[0.000056659628,0.00007410731,0.00006410378,0.00050928333,0.000019997824,0.00079098175,0.0000248181,0.000044486544,0.00006038877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014789566,0.000006073706,0.000052596224,0.0002450169,0.000032732514,0.0000049644927,0.000013892979,0.8797413,0.00015770305,0.11903875,0.00004843685,0.00064370816],"study_design_scores_gemma":[0.00013311933,0.0000024540454,0.0000049157807,0.0001601374,0.0001237551,0.0000010441015,0.00011035457,0.99775887,0.000049846967,0.00017699569,0.0014019217,0.00007658377],"about_ca_topic_score_codex":0.00002994239,"about_ca_topic_score_gemma":0.0000012542674,"teacher_disagreement_score":0.9881609,"about_ca_system_score_codex":0.000029421222,"about_ca_system_score_gemma":0.000008169522,"threshold_uncertainty_score":0.30220082},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42056307,0.000074366435,0.57532996,0.0010419122,0.00023663587,0.0008836134,0.000045577883,0.000019202793,0.0018056644],"genre_scores_gemma":[0.9875828,0.00005640015,0.008390302,0.00027242053,0.00002693747,0.000074465745,0.00060234976,0.0000139363165,0.0029803747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994245,0.00002710606,0.00015838441,0.00017536669,0.000118322096,0.00009630385],"domain_scores_gemma":[0.999432,0.00001784255,0.00008213662,0.0001909509,0.00025657413,0.000020439691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006295953,0.00007498533,0.00007978549,0.000043262895,0.00012401564,0.000012883637,0.00012697178,0.00009853914,0.000022577551],"category_scores_gemma":[0.00024572934,0.00005940812,0.000058370293,0.0001886417,0.000039996165,0.000004025127,0.00007148136,0.000029545534,1.7115525e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034291644,0.0004127043,0.002245565,0.0001252307,0.000047039834,8.658065e-8,0.00011276199,0.919663,0.07297524,0.00080472464,0.0024402032,0.0008305265],"study_design_scores_gemma":[0.0011829075,0.000080073434,0.0016194134,0.00008873072,0.000029471059,5.3087865e-7,0.000065212604,0.95975673,0.035669368,0.0002106543,0.001185177,0.000111758054],"about_ca_topic_score_codex":0.0000020766058,"about_ca_topic_score_gemma":0.000016018212,"teacher_disagreement_score":0.56701976,"about_ca_system_score_codex":0.000011679659,"about_ca_system_score_gemma":0.000086418775,"threshold_uncertainty_score":0.2422593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07233985,0.000071471935,0.879831,0.000548735,0.0022742604,0.00035573493,0.0000144149935,0.00008591872,0.04447858],"genre_scores_gemma":[0.9907115,0.000011993628,0.0063999193,0.00008209037,0.0006659722,0.000010958358,0.000023173538,0.000009319586,0.0020850622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.000019497314,0.00013526302,0.00010030159,0.000108612825,0.00009645221],"domain_scores_gemma":[0.99965864,0.000018544422,0.000014303768,0.00019867814,0.00009153515,0.000018280043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438613,0.00005692236,0.00008320954,0.000116777126,0.00010480607,0.000057850044,0.0001319938,0.000034323995,0.00042152125],"category_scores_gemma":[0.00003837641,0.00004368025,0.000033203392,0.00082559633,0.00004244758,0.00007418307,0.000019039338,0.000047589347,0.000011962222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022780482,0.0000029636815,0.00030101454,0.000015318326,0.000011285599,7.378812e-8,0.0002502291,0.9847017,0.00050965237,0.00016827178,0.009388447,0.004648772],"study_design_scores_gemma":[0.000106675565,0.000011982701,0.0014383369,0.000023444742,0.000055420347,2.0085298e-7,0.00029279746,0.9342642,0.019986462,0.00015123171,0.043558344,0.00011092508],"about_ca_topic_score_codex":0.000010059173,"about_ca_topic_score_gemma":0.000058310347,"teacher_disagreement_score":0.9183717,"about_ca_system_score_codex":0.000030505387,"about_ca_system_score_gemma":0.000020825559,"threshold_uncertainty_score":0.4615362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015517422,0.0015917064,0.96620166,0.0053088046,0.000549606,0.000994344,0.000015620877,0.00023603915,0.009584823],"genre_scores_gemma":[0.9073528,0.001734673,0.0782054,0.0032998694,0.00027924107,0.00013373508,0.000075801574,0.00003827505,0.008880203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778754,0.000624628,0.00044944722,0.0005727137,0.00026699578,0.00029867236],"domain_scores_gemma":[0.99858284,0.0002431226,0.00015882844,0.00077709847,0.00015075038,0.000087331166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015164018,0.00024221237,0.00035424496,0.000102293154,0.00053257705,0.0005780404,0.0006067396,0.00013653965,0.000055405573],"category_scores_gemma":[0.00017203024,0.000180779,0.000091741924,0.00072607695,0.00014878904,0.0005287441,0.0006211335,0.00021149062,0.000019178688],"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.00016855559,0.00022333275,0.00037915286,0.00020348992,0.00013501849,0.000016245336,0.0016533,0.18045992,0.0001390293,0.80328345,0.0030377433,0.010300756],"study_design_scores_gemma":[0.0020084577,0.00004876101,0.00033853317,0.000087052154,0.00004309327,0.00002753197,0.00007191176,0.98435694,0.0013514906,0.007803128,0.00352931,0.0003338138],"about_ca_topic_score_codex":0.00005505584,"about_ca_topic_score_gemma":0.000002997562,"teacher_disagreement_score":0.8918354,"about_ca_system_score_codex":0.00005308599,"about_ca_system_score_gemma":0.00009533903,"threshold_uncertainty_score":0.7371954},"labels":[],"label_agreement":null}]}