{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":36,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":36,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"cbbb0b300fe6","filters":{"venue":"Encyclopedia of Optimization"}},"results":[{"id":"W4404910912","doi":"10.1007/978-3-030-54621-2_445-1","title":"Nondifferentiable Optimization","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02878496451378674,"gpt":0.3089569060354497,"spread":0.2801719415216629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002657965,0.0005982876,0.0007764708,0.0008034355,0.0001050782,0.00007402786,0.00040809,0.0006577238,0.008742126],"category_scores_gemma":[0.0003252502,0.0006135916,0.0002586014,0.0002580109,0.0001581044,0.0003360387,0.0002427077,0.0006102823,0.0001469212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002195876,"about_ca_system_score_gemma":0.0002149657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002578043,"about_ca_topic_score_gemma":0.000002306935,"domain_scores_codex":[0.9967825,0.00003121762,0.001114062,0.0007228583,0.0009723231,0.0003770001],"domain_scores_gemma":[0.99741,0.0003140842,0.0006620301,0.0007493247,0.0007057261,0.0001588611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001922945,0.00004768708,0.000001093985,0.0004682271,0.00012701,0.00001142827,0.0001050016,0.8255357,7.497072e-7,0.1676442,0.005302207,0.000737434],"study_design_scores_gemma":[0.0004990541,0.0001117073,2.008757e-7,0.0006918149,0.0003648121,0.00001209961,0.0000199778,0.8374999,0.00003733959,0.1154827,0.0445075,0.0007729154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[3.094948e-7,0.0003825881,0.4865121,0.00005271306,0.0004100691,0.0005459012,0.00006501746,0.0001937075,0.5118376],"genre_scores_gemma":[0.000004378449,0.004986601,0.4173788,0.00000969027,0.0002228286,0.00003120802,0.0005096995,0.0002469327,0.5766098],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.06913328,"threshold_uncertainty_score":0.9996315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4362725787","doi":"10.1007/978-3-030-54621-2_712-1","title":"Decision Diagrams for Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital","funders":"","keywords":"Computer science; Influence diagram; Artificial intelligence; Decision tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01993996292632648,"gpt":0.2671341508412789,"spread":0.2471941879149524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006961257,0.0003428257,0.0004273825,0.0004132283,0.000201788,0.00006490653,0.001085237,0.0003184951,0.0006545529],"category_scores_gemma":[0.0004233909,0.0003826305,0.0002094387,0.0002052581,0.00005740245,0.0008502871,0.0003292283,0.000238277,0.000007980179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001876916,"about_ca_system_score_gemma":0.0001728363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000290903,"about_ca_topic_score_gemma":8.192043e-7,"domain_scores_codex":[0.9975725,0.00005360269,0.0008344519,0.0006692238,0.0006377859,0.000232391],"domain_scores_gemma":[0.9972373,0.0003445811,0.0009560335,0.0009815933,0.0003982414,0.00008221728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002068034,0.00002140269,0.000001592413,0.00003509061,0.00001478617,6.060023e-7,0.00008909494,0.6864036,4.349964e-7,0.2741788,0.0008931982,0.03834073],"study_design_scores_gemma":[0.0003361769,0.0002043564,0.000003166914,0.00005648927,0.00004343198,0.000004157731,0.000002981021,0.8197997,0.00001677853,0.00923379,0.1699379,0.0003611039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[3.449692e-7,0.0002110268,0.7294744,0.00005074672,0.001529321,0.0008177474,0.00003089844,0.0001290462,0.2677564],"genre_scores_gemma":[0.00000662617,0.003670132,0.949542,0.00004835107,0.0001634399,0.0001539138,0.0004947233,0.00007645761,0.04584434],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.264945,"threshold_uncertainty_score":0.9998626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2277950237","doi":"10.1007/978-0-387-74759-0_40","title":"Bilevel Programming: Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Computer science; Programming language; Algorithm; Optimization problem","retraction":null,"screen_n_in":null,"score":{"opus":0.02553414972291377,"gpt":0.2010308837178451,"spread":0.1754967339949313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001306138,0.0002418307,0.0005352626,0.0002493693,0.00007994733,0.00001735914,0.0002356046,0.0003083656,0.001180316],"category_scores_gemma":[0.00001967155,0.0003112744,0.0001751959,0.00004534953,0.0001117628,0.0001439259,0.00005978275,0.00015445,0.0002845966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008017145,"about_ca_system_score_gemma":0.00005132447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001579721,"about_ca_topic_score_gemma":0.00000199436,"domain_scores_codex":[0.9984475,0.0000023737,0.0008998261,0.000442797,0.00003273456,0.0001748082],"domain_scores_gemma":[0.998418,0.00003241586,0.0009554803,0.0004564694,0.00006768092,0.00006998989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000616484,0.00003559314,0.00006423979,0.00004910411,0.00006164848,8.440375e-7,0.0001888036,0.02616778,4.015337e-8,0.9633817,0.002811213,0.007232854],"study_design_scores_gemma":[0.0001923424,0.00003462384,0.000008357272,0.0000204603,0.00001393762,0.000003502589,0.000004081284,0.002328087,8.889658e-7,0.05408753,0.9429878,0.0003183963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000003580686,0.002366408,0.1914746,0.00005734396,0.0002282261,0.0005390428,0.0002340352,0.00004518649,0.8050516],"genre_scores_gemma":[0.0007410788,0.04346967,0.08301604,0.00005849751,0.0005383804,0.0001953163,0.0007181916,0.0001594042,0.8711034],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9401766,"threshold_uncertainty_score":0.999934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4327521332","doi":"10.1007/978-3-030-54621-2_723-1","title":"Blackbox Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03340248210910603,"gpt":0.3083465401588456,"spread":0.2749440580497396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004487611,0.0005749128,0.0008045065,0.0007312272,0.0002327986,0.00003424756,0.0005627659,0.0004602594,0.04061715],"category_scores_gemma":[0.000766034,0.000661362,0.0002567,0.0002852898,0.0001801386,0.0004501585,0.0003639423,0.0007216295,0.00003388435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003719873,"about_ca_system_score_gemma":0.0003295367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003712247,"about_ca_topic_score_gemma":0.000001615816,"domain_scores_codex":[0.9962075,0.00009603401,0.001220063,0.0007153575,0.001372757,0.0003883318],"domain_scores_gemma":[0.9965087,0.0004983222,0.001225083,0.000905618,0.0006990578,0.0001631761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003790587,0.00007073452,0.000002105654,0.0001395146,0.00008023646,0.00001088682,0.000160865,0.8802394,3.056565e-7,0.1130015,0.004801339,0.00145521],"study_design_scores_gemma":[0.00115512,0.0002615767,5.537943e-7,0.0001772886,0.0002661866,0.00002055411,0.00005899965,0.7256843,0.00001280503,0.03767753,0.2335344,0.001150597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[3.109668e-7,0.0001623919,0.470951,0.00008327487,0.0002857975,0.0006939566,0.00008385646,0.0001488871,0.5275906],"genre_scores_gemma":[0.000003092075,0.00805784,0.549322,0.00002801286,0.0001939419,0.00006688329,0.0009088126,0.0002661608,0.4411532],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2287331,"threshold_uncertainty_score":0.9995838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229698747","doi":"10.1007/978-0-387-74759-0_667","title":"Stochastic Vehicle Routing Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Environmental science; Routing (electronic design automation); Mathematical optimization; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01485353100572149,"gpt":0.221305328580533,"spread":0.2064517975748115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002182062,0.00043961,0.0005374508,0.0002876747,0.00008972056,0.0000198849,0.0002388111,0.0004727859,0.0003986513],"category_scores_gemma":[0.0001219249,0.0005232043,0.0001383309,0.000130268,0.00008012552,0.0001843357,0.00005964857,0.0004167694,0.00004135875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345767,"about_ca_system_score_gemma":0.00007447923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003093809,"about_ca_topic_score_gemma":0.000001019208,"domain_scores_codex":[0.998119,0.00002832919,0.0008202409,0.0003436699,0.0003958966,0.000292864],"domain_scores_gemma":[0.9987989,0.0001392508,0.00033325,0.0004119194,0.000214132,0.0001025576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000316457,0.000008320671,0.000008764016,0.0001087186,0.00005315973,0.000002857978,0.0003490777,0.9941281,0.000007784321,0.0005496428,0.001114661,0.003665742],"study_design_scores_gemma":[0.0003148748,0.00003467659,0.000009672741,0.0003077598,0.00007759654,0.0000119803,0.000005496733,0.9908237,0.00001836508,0.0001318315,0.007744524,0.0005195529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001640004,0.0005636813,0.5333537,0.000009723304,0.0004082069,0.000339175,0.00001703137,0.0004086999,0.4648833],"genre_scores_gemma":[0.007540598,0.01811783,0.6471233,0.00004843398,0.001192554,0.00007550812,0.0007852014,0.001165765,0.3239509],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1409325,"threshold_uncertainty_score":0.9997219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253175148","doi":"10.1007/0-306-48332-7_372","title":"Optimizing Facility Location with Rectilinear Distances","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island; McMaster University","funders":"","keywords":"Facility location problem; Computer science; Geography; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009022575624135465,"gpt":0.1984343935736914,"spread":0.1894118179495559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008311312,0.0003976677,0.0004062734,0.0001760235,0.00007041533,0.00002340081,0.0001430515,0.0002940088,0.0002348233],"category_scores_gemma":[0.00004119196,0.0003934176,0.00005609493,0.0001046056,0.0001026881,0.000234075,0.00002012063,0.0002869546,0.00001184727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001409702,"about_ca_system_score_gemma":0.0000478543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004686685,"about_ca_topic_score_gemma":0.00001329858,"domain_scores_codex":[0.9986712,0.000009854386,0.0004886754,0.0003427341,0.0002840508,0.0002034335],"domain_scores_gemma":[0.9989781,0.0000631052,0.0002510358,0.0003752197,0.0002619063,0.00007064347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003286284,0.000009997159,0.000005841986,0.0001956972,0.00004572224,0.000003626639,0.0001199786,0.9935791,5.56182e-7,0.0009782359,0.0002074223,0.004820901],"study_design_scores_gemma":[0.0008487969,0.0002242396,0.00001390766,0.0006841302,0.0003060295,0.00001549971,0.00006331543,0.8294626,0.0002380993,0.001868337,0.1647548,0.001520162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004324712,0.0005343482,0.5789433,0.000005635352,0.0001874617,0.0002096013,0.00003549465,0.0002314313,0.4198484],"genre_scores_gemma":[0.01378195,0.0565767,0.6760935,0.00002429794,0.000654013,0.00008873214,0.004112868,0.0004543016,0.2482136],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1716348,"threshold_uncertainty_score":0.9998518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770061147","doi":"10.1007/978-0-387-74759-0_610","title":"Signal Processing with Higher Order Statistics","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Higher-order statistics; Statistics; Signal processing; SIGNAL (programming language); Computer science; Order statistic; Order (exchange); Mathematics; Digital signal processing; Computer hardware; Economics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01257321603035024,"gpt":0.2279365445735584,"spread":0.2153633285432081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000944135,0.0002684466,0.0002918523,0.0002153834,0.00008019088,0.00006125762,0.000397247,0.0002274083,0.0002343247],"category_scores_gemma":[0.000007976771,0.0002451474,0.00003100933,0.0001391142,0.000105371,0.0004666533,0.00008258194,0.0002324901,0.000009806571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004084979,"about_ca_system_score_gemma":0.0004255861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004192085,"about_ca_topic_score_gemma":0.000002389927,"domain_scores_codex":[0.998557,0.00002327774,0.0003960976,0.0003743295,0.0005057832,0.0001434877],"domain_scores_gemma":[0.9983725,0.00004920226,0.0005390205,0.0003373696,0.0006435664,0.00005832174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005146673,0.0001491023,0.00003737725,0.0002465951,0.0001072509,0.00008276381,0.002906302,0.3994471,0.00000290906,0.4249584,0.05215263,0.1198581],"study_design_scores_gemma":[0.0008106249,0.0006766742,0.00005423273,0.0005377837,0.0001008433,0.00005358401,0.000005301696,0.3514818,0.0000887701,0.008720041,0.6359763,0.001494062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[2.166187e-7,0.0001215277,0.6193959,0.00007229324,0.00003839309,0.0001699195,0.00001062508,0.0001519013,0.3800393],"genre_scores_gemma":[0.00008160459,0.001263226,0.8168928,0.0001208344,0.00007200941,0.00001156624,0.0001372089,0.00004868182,0.1813721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5838237,"threshold_uncertainty_score":0.9996823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4301361476","doi":"10.1007/0-306-48332-7_238","title":"Jaynes’ Maximum Entropy Principle","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Principle of maximum entropy; Statistical physics; Mathematics; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.009252950400803825,"gpt":0.2353395966854464,"spread":0.2260866462846425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005704395,0.0002920616,0.0003791472,0.00009510981,0.00005631741,0.00002088677,0.000168739,0.0001413797,0.01653887],"category_scores_gemma":[0.00001272742,0.0002950199,0.0001439697,0.00004174673,0.0000372483,0.00006720636,0.0000716183,0.0002017192,0.0001157697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003236337,"about_ca_system_score_gemma":0.00006724184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001799319,"about_ca_topic_score_gemma":2.293073e-7,"domain_scores_codex":[0.9987294,0.00001076772,0.0004522769,0.0003160377,0.0002695878,0.000221948],"domain_scores_gemma":[0.9990436,0.00005451428,0.0003510102,0.0003057811,0.0001409644,0.0001040821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001503846,0.00003959803,0.0001146115,0.00001905451,0.0000682317,0.000003598666,0.00002328966,0.009391422,0.000001154262,0.9735993,0.001962838,0.01476183],"study_design_scores_gemma":[0.0006078172,0.0001064989,0.00001546297,0.0001130114,0.0001883399,0.000001238515,0.00001134429,0.05289309,0.00001740048,0.1919022,0.7536076,0.0005359301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000006890279,0.00004325648,0.3841143,0.00002296616,0.000319125,0.0001823781,0.0001036451,0.00001883989,0.6151886],"genre_scores_gemma":[0.00172849,0.001522455,0.05435671,0.0000450884,0.002410928,0.00004169009,0.00208416,0.0002173065,0.9375932],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7816971,"threshold_uncertainty_score":0.9999502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234387703","doi":"10.1007/0-306-48332-7_31","title":"Bilevel Programming","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05661161189794757,"gpt":0.3237241621159535,"spread":0.2671125502180059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001107744,0.0004061576,0.0006851634,0.0008644294,0.0001218508,0.000129575,0.000683755,0.0005388626,0.004174123],"category_scores_gemma":[0.0008729437,0.0003480183,0.0002755948,0.0004000743,0.0001424724,0.000447375,0.0001274386,0.0002630913,0.0002637281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005575167,"about_ca_system_score_gemma":0.0002242468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001234668,"about_ca_topic_score_gemma":0.000008198835,"domain_scores_codex":[0.9955962,0.00005673443,0.001598952,0.0007228467,0.00175187,0.0002733573],"domain_scores_gemma":[0.9959324,0.0003877896,0.001617521,0.0008766268,0.001039966,0.00014568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003148462,0.00004286249,0.0004750809,0.00000919112,0.00003824015,0.00001516651,0.0002343137,0.5254318,3.441967e-7,0.02013064,0.01764603,0.4359449],"study_design_scores_gemma":[0.000247925,0.00008567647,0.00004505203,0.00006851088,0.00007259011,0.00001168922,0.00002185838,0.0228842,0.000003057702,0.01790176,0.9582519,0.0004057666],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000005100328,0.0004041557,0.2531979,0.0000910515,0.0006510079,0.000430475,0.00002553509,0.00006503331,0.7451297],"genre_scores_gemma":[0.0001521761,0.02320033,0.1022527,0.00004308851,0.0004665336,0.00001716871,0.0003234226,0.00009643286,0.8734482],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9406059,"threshold_uncertainty_score":0.9998972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4353003139","doi":"10.1007/978-3-030-54621-2_752-1","title":"Machine Learning for Combinatorial Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Minnow Environmental (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Combinatorial optimization; Machine learning; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01040094073440899,"gpt":0.2195346519535981,"spread":0.2091337112191891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003234094,0.0003636944,0.0004513531,0.0003575827,0.0003211368,0.00007664526,0.0005078394,0.0002864791,0.002570987],"category_scores_gemma":[0.0001804051,0.0004368926,0.0002149184,0.0001781793,0.00005639757,0.0006063094,0.0002209612,0.0003796584,0.000005289497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001706285,"about_ca_system_score_gemma":0.0002502697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007996808,"about_ca_topic_score_gemma":0.00000150456,"domain_scores_codex":[0.9978735,0.00006166869,0.0007232412,0.0005943503,0.0005227501,0.0002244653],"domain_scores_gemma":[0.9979609,0.0002178913,0.0009093845,0.0004348956,0.000385759,0.00009117078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002066435,0.00002053362,0.0000134634,0.00003346484,0.00003142147,0.000001144429,0.00009160219,0.7661859,3.378365e-7,0.226609,0.0003564838,0.006635952],"study_design_scores_gemma":[0.0007883623,0.000191079,0.00000176471,0.00002821629,0.00005344643,0.00000563722,0.000003957522,0.815888,0.000003286833,0.002317826,0.1803584,0.0003599981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[9.332627e-8,0.0001892074,0.675065,0.0001537289,0.00159394,0.0005967493,0.00002961168,0.0001810621,0.3221906],"genre_scores_gemma":[0.0001933623,0.01020315,0.8239682,0.00009992783,0.0004161476,0.0001501489,0.003199365,0.0001701068,0.1615995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2242911,"threshold_uncertainty_score":0.9998083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4246068167","doi":"10.1007/978-0-387-74759-0_702","title":"Vehicle Routing","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01355077143882855,"gpt":0.2249357597717832,"spread":0.2113849883329547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001796,0.0003676072,0.0004653304,0.0002417722,0.00007281459,0.00001470969,0.0002124503,0.0004514058,0.0005832489],"category_scores_gemma":[0.00009197848,0.0004443769,0.0001365224,0.0001036025,0.00006656111,0.000163285,0.00005059097,0.0003476382,0.00004518812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001084074,"about_ca_system_score_gemma":0.0000589353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002176836,"about_ca_topic_score_gemma":5.81393e-7,"domain_scores_codex":[0.9984319,0.00002436892,0.0006955357,0.000280345,0.0003326411,0.0002352662],"domain_scores_gemma":[0.9989818,0.0001109641,0.0002594181,0.0003887917,0.0001738561,0.00008515188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003094553,0.000005520474,0.00002827368,0.00006453493,0.00004447117,0.000005160967,0.0002081318,0.989853,0.000007121874,0.0008787801,0.002990062,0.005911797],"study_design_scores_gemma":[0.0003019508,0.00002795006,0.00002239289,0.0001802328,0.00006940534,0.00001146719,0.000005879923,0.9435469,0.00009128942,0.0001058483,0.05509192,0.0005447795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.00002298574,0.0005572528,0.264416,0.00001129532,0.0004665755,0.0002077612,0.0000162386,0.0004265007,0.7338753],"genre_scores_gemma":[0.001824324,0.03229615,0.6318263,0.00004101075,0.0007744995,0.00001922543,0.0004171543,0.0006086611,0.3321926],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.4016827,"threshold_uncertainty_score":0.9998008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4299790063","doi":"10.1007/978-0-387-74759-0_103","title":"Criss-Cross Pivoting Rules","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04436691264716803,"gpt":0.3397273638812548,"spread":0.2953604512340868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002645675,0.0004960453,0.0007129904,0.0004297365,0.0002047287,0.00003806292,0.0004262533,0.0005531834,0.002177807],"category_scores_gemma":[0.001130842,0.0005318269,0.0002164717,0.0001170775,0.0002836025,0.0003552215,0.0002024434,0.0005368381,0.00009156194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001583558,"about_ca_system_score_gemma":0.0002219089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003602363,"about_ca_topic_score_gemma":0.000001294281,"domain_scores_codex":[0.9969704,0.00004089784,0.001100316,0.0005674423,0.0009428199,0.0003781037],"domain_scores_gemma":[0.9967835,0.0004981101,0.0009613278,0.0006624204,0.0009483781,0.0001462927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000773815,0.0001680263,0.00006792822,0.0006828888,0.0002124167,0.0000724087,0.001216265,0.8904495,0.000002120737,0.07433482,0.02019828,0.01251791],"study_design_scores_gemma":[0.004008386,0.0004742115,0.00004362629,0.001833343,0.000418748,0.0001859286,0.0001271447,0.4465922,0.0002171837,0.1303968,0.4115173,0.004185113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.00001296012,0.0004095139,0.3435149,0.00003273661,0.0002446374,0.0005289552,0.00006974379,0.0001628229,0.6550237],"genre_scores_gemma":[0.00001358374,0.01170475,0.5206655,0.00001441702,0.0002953899,0.00001894575,0.0002828101,0.0002056552,0.4667989],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.4438573,"threshold_uncertainty_score":0.9997133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770352112","doi":"10.1007/978-0-387-74759-0_151","title":"Dynamic Programming: Optimal Control Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dynamic programming; Control (management); Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0040351149971361,"gpt":0.1941576459441989,"spread":0.1901225309470628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007455528,0.0005076519,0.0006646956,0.0003153322,0.00008646314,0.00001966304,0.0002674743,0.0005051719,0.0001297392],"category_scores_gemma":[0.00002214164,0.00059831,0.0001813248,0.0001141194,0.0001008385,0.0002464455,0.0000246998,0.000313408,0.00004696547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002150543,"about_ca_system_score_gemma":0.0000727848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001397714,"about_ca_topic_score_gemma":0.000002383608,"domain_scores_codex":[0.9980513,0.00001395509,0.0008807248,0.0003969509,0.0003607438,0.0002962534],"domain_scores_gemma":[0.9985754,0.00007495897,0.0004160399,0.0005325445,0.0002875209,0.0001134615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000120746,0.00001489558,0.000003531316,0.0001252862,0.0001148112,0.000003524694,0.00006266873,0.9859883,0.000003889962,0.0008914482,0.000481378,0.01229825],"study_design_scores_gemma":[0.0007243463,0.00004539951,0.000002913356,0.00009430896,0.0001359486,0.00001657,0.000005075044,0.7419121,0.000002213151,0.000068322,0.2564879,0.0005048452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[7.255433e-7,0.002131641,0.698801,0.00001152515,0.0002260751,0.001428368,0.00006534012,0.0004548787,0.2968804],"genre_scores_gemma":[0.006816,0.04834142,0.6626006,0.00003834581,0.000801717,0.001776807,0.002963241,0.001132024,0.2755298],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2560066,"threshold_uncertainty_score":0.9996468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W82584263","doi":"10.1007/0-306-48332-7_78","title":"Criss-Cross Pivoting Rules","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04159238333358787,"gpt":0.3473829017767931,"spread":0.3057905184432052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003693367,0.0004990597,0.0006963818,0.0004409237,0.0001619342,0.00005923237,0.0004385493,0.0005603879,0.00453621],"category_scores_gemma":[0.001113384,0.0005345511,0.0002044288,0.0001391622,0.000213382,0.000364987,0.000203534,0.0005297527,0.00009671129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001685975,"about_ca_system_score_gemma":0.0001693263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004458976,"about_ca_topic_score_gemma":0.000002282703,"domain_scores_codex":[0.9969826,0.00004150045,0.001102595,0.0005755172,0.0008966785,0.0004011292],"domain_scores_gemma":[0.9967986,0.0004909743,0.0009598961,0.0006744298,0.0009263398,0.0001497673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006600621,0.0001375539,0.00008327329,0.0005634077,0.0001699554,0.00004943508,0.0004880273,0.7470543,0.000001777643,0.2290961,0.006190583,0.01609957],"study_design_scores_gemma":[0.002512105,0.0002945361,0.00001930232,0.001363392,0.0003602306,0.00007410297,0.00011331,0.3157152,0.00008447356,0.3568528,0.3199875,0.002623122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000007110234,0.0002169843,0.3969853,0.00003597203,0.0002074618,0.0004418606,0.00004893746,0.0001347066,0.6019217],"genre_scores_gemma":[0.00001102536,0.00569057,0.4499879,0.00001552094,0.0003383016,0.000019394,0.0002914818,0.000207841,0.543438],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4313391,"threshold_uncertainty_score":0.9997106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210604531","doi":"10.1007/0-306-48332-7_463","title":"Signal Processing with Higher Order Statistics","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Higher-order statistics; Statistics; Signal processing; Computer science; SIGNAL (programming language); Order statistic; Order (exchange); Mathematics; Digital signal processing; Economics; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.01199695668369597,"gpt":0.2341534278270847,"spread":0.2221564711433888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001301584,0.0002699795,0.0002852717,0.0002206882,0.00006402461,0.00009334909,0.0004081432,0.0002302225,0.0004754447],"category_scores_gemma":[0.000007865539,0.0002463256,0.00002933292,0.0001640853,0.00008015623,0.0004788591,0.00008299353,0.000229566,0.00001034725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004342107,"about_ca_system_score_gemma":0.0003287321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005155189,"about_ca_topic_score_gemma":0.000004123823,"domain_scores_codex":[0.9985662,0.00002360245,0.0003968089,0.0003793699,0.0004819256,0.0001521679],"domain_scores_gemma":[0.9983813,0.00004853605,0.0005381429,0.0003431634,0.0006291232,0.00005974064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002694961,0.00007529272,0.0000276172,0.0001250281,0.00005277731,0.00003495326,0.0007396806,0.2081647,0.000001498283,0.6879007,0.01036619,0.0924846],"study_design_scores_gemma":[0.0006764635,0.0005581165,0.00003241843,0.0005265048,0.0001135337,0.00002886792,0.000006169727,0.3286945,0.00004677349,0.0304913,0.6375824,0.001242922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.33799e-7,0.00007191172,0.5555944,0.00008576011,0.00003568206,0.0001557936,0.000008249114,0.0001379913,0.4439101],"genre_scores_gemma":[0.00006495688,0.0006194703,0.7604939,0.0001267201,0.0000801833,0.0000115669,0.0001382503,0.00004808213,0.2384169],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6574094,"threshold_uncertainty_score":0.9999989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406083589","doi":"10.1007/978-3-030-54621-2_129-1","title":"Direct Search Luus–Jaakola Optimization Procedure","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01267615159411441,"gpt":0.2473719257059181,"spread":0.2346957741118037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004478035,0.0005853162,0.0006401459,0.0008347877,0.0001518155,0.0002344477,0.001153072,0.0006170818,0.0002144468],"category_scores_gemma":[0.00008303053,0.0006001798,0.000244078,0.0004508229,0.0001050474,0.0005714447,0.0005053334,0.0005149561,0.00006921149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001503678,"about_ca_system_score_gemma":0.0004036002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006313341,"about_ca_topic_score_gemma":0.000001056747,"domain_scores_codex":[0.9968177,0.00005176785,0.0009090087,0.0010502,0.0007992305,0.0003720743],"domain_scores_gemma":[0.9978134,0.0001213178,0.0003473985,0.0009368277,0.0006322721,0.0001488044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007113208,0.00003009756,0.000004104808,0.0002062782,0.00005946988,0.00001171835,0.0002678866,0.9470177,0.00000125693,0.04470281,0.006261525,0.00143002],"study_design_scores_gemma":[0.0001706738,0.0001284892,0.000001463391,0.0005420196,0.00006996512,0.00001597698,0.000003633991,0.96455,0.0001223535,0.002195017,0.03157302,0.0006273591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[3.157042e-7,0.0009676799,0.5162383,0.0001547187,0.0003869527,0.0003789824,0.00001221895,0.0007273843,0.4811334],"genre_scores_gemma":[0.0001719887,0.008345532,0.5821883,0.00007607372,0.0003086963,0.000031749,0.000295771,0.0001454229,0.4084365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07269697,"threshold_uncertainty_score":0.9996449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4362504448","doi":"10.1007/978-3-030-54621-2_738-1","title":"Inverse Integer Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Inverse; Integer (computer science); Mathematical optimization; Mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01010261178090125,"gpt":0.1946640961028639,"spread":0.1845614843219626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001511233,0.0004234869,0.0004430082,0.0004749774,0.00008909051,0.00002923131,0.0002570192,0.0003613288,0.02271209],"category_scores_gemma":[0.00003728059,0.0005102158,0.0001505244,0.000165345,0.00006267559,0.0003022481,0.00008450625,0.0004474311,0.00004487109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001784629,"about_ca_system_score_gemma":0.00007338945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004448119,"about_ca_topic_score_gemma":0.00000346353,"domain_scores_codex":[0.998336,0.00002396455,0.0006945045,0.0003242197,0.0004062807,0.0002150199],"domain_scores_gemma":[0.9989806,0.0000544246,0.0002902441,0.0004142547,0.0001651635,0.00009527678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008344667,0.00001266215,0.000006012254,0.0001275927,0.00006836654,0.000003254806,0.0002215532,0.9806839,6.521883e-7,0.007044042,0.01105719,0.0007664941],"study_design_scores_gemma":[0.0002482202,0.0000383647,4.123557e-7,0.00007329378,0.00007421272,0.000003845389,0.000010072,0.7151098,0.000004276688,0.0001620168,0.2838733,0.0004022653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[5.859645e-7,0.0002942963,0.2926936,0.0000273791,0.001047576,0.0003228901,0.00005723751,0.0003436874,0.7052128],"genre_scores_gemma":[0.0001736129,0.05023729,0.2427821,0.00015551,0.0004831511,0.0001000965,0.005349398,0.0007250843,0.6999937],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2728161,"threshold_uncertainty_score":0.9997349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4361006326","doi":"10.1007/978-3-030-54621-2_838-1","title":"Algorithm Portfolios","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01159713485106524,"gpt":0.2189899654966995,"spread":0.2073928306456343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001621161,0.0002860131,0.0003397558,0.0004936972,0.00007250946,0.00005272264,0.0004366444,0.0003200758,0.000614584],"category_scores_gemma":[0.00004718234,0.0003185972,0.0001461482,0.0002017354,0.00006128989,0.0003996016,0.0001636491,0.0002097326,0.0001722233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005516725,"about_ca_system_score_gemma":0.000203174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004940155,"about_ca_topic_score_gemma":0.00000291316,"domain_scores_codex":[0.9982832,0.00001703162,0.0005813682,0.0004688964,0.0004652086,0.0001842841],"domain_scores_gemma":[0.9984785,0.00007357624,0.0005215383,0.0005527309,0.0002790196,0.00009461384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002971553,0.00002018162,0.00001563034,0.00004213479,0.00007635099,0.00002941863,0.0001933717,0.3182138,7.012464e-7,0.1858035,0.005966082,0.4896359],"study_design_scores_gemma":[0.0004983207,0.00009904557,0.00009393403,0.0002000333,0.00007536482,0.00002718288,0.000009104144,0.8942415,0.00001243996,0.01517507,0.08873357,0.0008344801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[5.668998e-8,0.0000352656,0.558017,0.0001049299,0.000717957,0.0001743741,0.0000143917,0.0002497818,0.4406863],"genre_scores_gemma":[0.000005657148,0.00461889,0.4898881,0.00005478075,0.000153286,0.00001029162,0.0002083413,0.00005889176,0.5050018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5760277,"threshold_uncertainty_score":0.9999266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360908927","doi":"10.1007/978-3-030-54621-2_797-1","title":"Decentralized Multiobjective Optimization Algorithms","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Mathematical optimization; Optimization algorithm; Multi-objective optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01129485158693542,"gpt":0.2242816212784535,"spread":0.2129867696915181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000359732,0.0005522218,0.000748653,0.0004638839,0.0002033876,0.0001080975,0.001217348,0.0003682807,0.001638563],"category_scores_gemma":[0.0001481877,0.0006304959,0.0002869515,0.0002783881,0.00006999161,0.0008835673,0.000402489,0.0003880098,0.00003161448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004487,"about_ca_system_score_gemma":0.0003247066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000478535,"about_ca_topic_score_gemma":0.000002856318,"domain_scores_codex":[0.9964724,0.0001374531,0.001059953,0.0009309329,0.001005186,0.000394031],"domain_scores_gemma":[0.9969106,0.0001719529,0.001310825,0.0009332914,0.0005147307,0.0001586346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002106525,0.00006398259,0.000007110476,0.00003561029,0.0001274628,0.00001622993,0.0002947915,0.9540671,0.00000170118,0.03879239,0.001037108,0.0055355],"study_design_scores_gemma":[0.001360903,0.0001108487,0.000007337473,0.00007873671,0.0001006893,0.00001175978,0.00001389879,0.9147009,0.00001069669,0.0003938757,0.08260673,0.0006035829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[2.889028e-7,0.0004681534,0.6907937,0.00009826493,0.001352921,0.0009116652,0.0001294588,0.00023568,0.3060099],"genre_scores_gemma":[0.0003695023,0.009668633,0.7991885,0.0001329149,0.0004216642,0.0003094781,0.003445764,0.0002573067,0.1862063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1198036,"threshold_uncertainty_score":0.9996147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412034374","doi":"10.1007/978-3-030-54621-2_312-1","title":"Jaynes’ Maximum Entropy Principle","year":2025,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Principle of maximum entropy; Mathematics; Statistical physics; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.006794307817757435,"gpt":0.2356366743102401,"spread":0.2288423664924827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005393981,0.0002679372,0.0003733282,0.000113334,0.00005494948,0.00001972739,0.0001725465,0.0001356738,0.007723285],"category_scores_gemma":[0.00001896321,0.0002731163,0.0001420443,0.00004379263,0.00003210678,0.00005218112,0.00009297823,0.0001945489,0.0000495881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003160137,"about_ca_system_score_gemma":0.0001154214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001482026,"about_ca_topic_score_gemma":1.8394e-7,"domain_scores_codex":[0.9988428,0.00001088256,0.0004338383,0.0003055351,0.0002211176,0.0001858382],"domain_scores_gemma":[0.9991111,0.00007571325,0.0002873602,0.0003025141,0.0001504512,0.00007292491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000130282,0.0000303101,0.00005838636,0.00003763872,0.00007875647,0.000001342307,0.00001659423,0.005337329,8.516652e-7,0.9734286,0.004469617,0.01652754],"study_design_scores_gemma":[0.0006794088,0.00008993439,0.00001367385,0.0002491926,0.0002874813,3.32905e-7,0.00001121246,0.08631064,0.00003570215,0.2318494,0.6799217,0.0005513371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000002060342,0.00004701761,0.4025056,0.00002919601,0.0003868504,0.000185888,0.0001594606,0.00001694311,0.596667],"genre_scores_gemma":[0.0005261611,0.0005349875,0.0524167,0.00003642747,0.0008461017,0.00002982124,0.001308761,0.00007583393,0.9442252],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7415792,"threshold_uncertainty_score":0.9999721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4300819837","doi":"10.1007/0-306-48332-7_70","title":"Continuous Global Optimization: Applications","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01088340976358786,"gpt":0.2523594653732054,"spread":0.2414760556096175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001675281,0.0003508255,0.0005109229,0.0001207012,0.0001051354,0.0000768995,0.0008583769,0.0003207469,0.0004534978],"category_scores_gemma":[0.00004279538,0.0003600649,0.0001660629,0.0003134421,0.00009672893,0.0003270338,0.0002273006,0.0001882866,0.00003832156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009443963,"about_ca_system_score_gemma":0.0001456241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006994416,"about_ca_topic_score_gemma":4.751001e-7,"domain_scores_codex":[0.9980047,0.00003876621,0.0006554531,0.0006174908,0.0004404516,0.0002431666],"domain_scores_gemma":[0.997977,0.000093502,0.0006177365,0.0007805446,0.0003834186,0.0001478166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003495597,0.00004859696,0.00001301893,0.00002466004,0.00003634895,0.000007704085,0.00002139774,0.5549642,1.322002e-7,0.2723551,0.0009569246,0.1715685],"study_design_scores_gemma":[0.0003589025,0.0001218802,0.000006043499,0.00008379836,0.00007375003,0.0000307387,0.000003740253,0.4567432,0.000002312072,0.02819098,0.5137467,0.0006379416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.339614e-8,0.0003411387,0.5278326,0.0001341478,0.0002478823,0.0003069731,0.00001822428,0.0001082569,0.4710108],"genre_scores_gemma":[0.000002113523,0.004253072,0.8946475,0.0000964451,0.0003501153,0.00004980823,0.0001061036,0.000034222,0.1004606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5127898,"threshold_uncertainty_score":0.9998851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4299583889","doi":"10.1007/978-0-387-74759-0_528","title":"Production-Distribution System Design Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; York University","funders":"","keywords":"Production (economics); Distribution (mathematics); Computer science; Mathematics; Economics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.02189641626713019,"gpt":0.1969425298247792,"spread":0.175046113557649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000347125,0.0003382263,0.0003495365,0.0002952389,0.0001868693,0.0000471883,0.0002429557,0.0002149083,0.0006164201],"category_scores_gemma":[0.00007933859,0.000360226,0.0001239631,0.0001894567,0.00007120104,0.0006632882,0.0001002427,0.0001478168,0.0003381721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001468206,"about_ca_system_score_gemma":0.00006247478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009657894,"about_ca_topic_score_gemma":0.00001103936,"domain_scores_codex":[0.9980552,0.00001022663,0.0007351408,0.0004773344,0.000527095,0.0001949972],"domain_scores_gemma":[0.9984794,0.00001011153,0.0004661907,0.0004042754,0.0006250005,0.0000149945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003473793,0.00004868217,0.00001648158,0.001124223,0.00006265492,0.000003216289,0.00003811447,0.800729,7.745844e-7,0.05537678,0.1403213,0.002244126],"study_design_scores_gemma":[0.0002833384,0.00001974456,0.00004725571,0.0003795434,0.0002370942,0.000003416553,0.00004282813,0.1012732,0.000004741967,0.0004205163,0.8967007,0.0005875634],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000007534469,0.0001777157,0.1798054,0.0003263062,0.00134261,0.001316585,0.00001901288,0.0002992435,0.8167056],"genre_scores_gemma":[0.004928913,0.007994861,0.02642222,0.0002173164,0.004368286,0.0002581776,0.008240661,0.0002533419,0.9473162],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7563795,"threshold_uncertainty_score":0.999885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W134881188","doi":"10.1007/0-306-48332-7_177","title":"Global Optimization in the Analysis and Management of Environmental Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Environmental resource management; Environmental science","retraction":null,"screen_n_in":null,"score":{"opus":0.02257526817568389,"gpt":0.2554348670017945,"spread":0.2328595988261106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009556358,0.0001963841,0.00045913,0.0003851101,0.00003256825,0.0000374176,0.0003928366,0.0001694039,0.0002309115],"category_scores_gemma":[0.00005925481,0.0001398191,0.0001080562,0.0004927673,0.0001061277,0.0001095285,0.0000785395,0.00007012658,0.000002545546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006668916,"about_ca_system_score_gemma":0.00001683859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000133749,"about_ca_topic_score_gemma":0.000003096448,"domain_scores_codex":[0.9976751,0.00006738934,0.0008801146,0.0003578698,0.0009073247,0.0001122077],"domain_scores_gemma":[0.9987129,0.0002078648,0.0005346711,0.0004570959,0.0000538042,0.00003367267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000100101,0.00002571507,0.0008308852,0.00003247076,0.0001226482,0.000006722177,0.00007658932,0.9852405,3.155655e-8,0.01166072,0.0001328952,0.00186086],"study_design_scores_gemma":[0.0003598825,0.0000568238,0.004464829,0.0001338762,0.000907024,0.000007775207,0.0002819335,0.987564,8.700776e-8,0.001957682,0.00398684,0.0002793041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003832738,0.0008605616,0.733396,0.00001839109,0.0001205757,0.0004017422,0.00006454883,0.000007385503,0.2650925],"genre_scores_gemma":[0.2152753,0.1430057,0.3708398,0.00006818007,0.0003989404,0.000154018,0.001185745,0.0001638915,0.2689084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3625562,"threshold_uncertainty_score":0.5701658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233154258","doi":"10.1007/0-306-48332-7_512","title":"Suboptimal Control","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008498577183526958,"gpt":0.2131990507971212,"spread":0.2047004736135942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004834363,0.0002443923,0.0003303012,0.00009177318,0.00004849485,0.00001332819,0.000113598,0.0001474461,0.01168077],"category_scores_gemma":[0.000002068007,0.0002471416,0.0001688294,0.00003311424,0.0000520111,0.00009908293,0.0000205192,0.0002246462,0.00004274234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000150772,"about_ca_system_score_gemma":0.00004981718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009604514,"about_ca_topic_score_gemma":2.547788e-7,"domain_scores_codex":[0.9990291,0.00001161967,0.000371341,0.0002522131,0.0001842011,0.000151524],"domain_scores_gemma":[0.9992182,0.00003049562,0.0003434774,0.0002168747,0.0001179387,0.00007304815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004186966,0.00003753725,0.0001470396,0.00001175082,0.0001031825,0.000001916371,0.00002948414,0.8463301,0.000001380143,0.1277476,0.008604254,0.01694382],"study_design_scores_gemma":[0.001667924,0.0001341272,0.00001794247,0.0001578638,0.0003415102,0.000004485087,0.00001533874,0.2703894,0.00001585059,0.0100167,0.7163402,0.0008986609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001060978,0.00009208546,0.2118203,0.00005395289,0.0003392574,0.0002049767,0.00003288883,0.00002604368,0.7874199],"genre_scores_gemma":[0.01477385,0.00117588,0.004240764,0.00004546354,0.001905076,0.00001783678,0.0005329453,0.00009353678,0.9772146],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7077359,"threshold_uncertainty_score":0.9999981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786931536","doi":"10.1007/978-0-387-74759-0_466","title":"Operations Research and Financial Markets","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Business; Finance; Financial market; Financial system","retraction":null,"screen_n_in":null,"score":{"opus":0.09175422378166155,"gpt":0.3638844289880762,"spread":0.2721302052064147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001765866,0.000271893,0.0005001026,0.001111792,0.000400248,0.0001214431,0.0004516176,0.0005066583,0.001385812],"category_scores_gemma":[0.002274768,0.0002427398,0.0000972423,0.000394307,0.0004233443,0.000453385,0.0001946598,0.000412634,0.0000994908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004479676,"about_ca_system_score_gemma":0.0004575009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000216614,"about_ca_topic_score_gemma":0.00003456768,"domain_scores_codex":[0.9959591,0.0001309306,0.001111416,0.0006832519,0.001865885,0.0002494236],"domain_scores_gemma":[0.9963718,0.0006170478,0.0002776753,0.0006624454,0.001925474,0.0001455338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001409892,0.0001008461,0.0003848664,0.00001671214,0.00002933577,0.00003526809,0.001590289,0.7015521,0.000001659017,0.03527829,0.193072,0.06779764],"study_design_scores_gemma":[0.0004766288,0.0002265378,0.000732385,0.00009287208,0.00003203364,0.00003290822,0.00003755614,0.07029586,0.000008470084,0.01160745,0.9159651,0.0004921528],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002574292,0.001274194,0.03372451,0.0002277704,0.0005230182,0.0005831495,0.00007021187,0.00003263696,0.9633071],"genre_scores_gemma":[0.001219024,0.1375561,0.03208015,0.00004142536,0.0004387844,0.00002048717,0.000235365,0.0000610474,0.8283476],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7228932,"threshold_uncertainty_score":0.999527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4300107446","doi":"10.1007/0-306-48332-7_252","title":"Least-Index Anticycling Rules","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Index (typography); Computer science; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.03774584614018987,"gpt":0.319496045868419,"spread":0.2817501997282291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002954713,0.0004996665,0.0007504122,0.0005642249,0.0001243021,0.00003665761,0.000402803,0.0005577196,0.00393603],"category_scores_gemma":[0.0007387524,0.0005346141,0.0002074439,0.0001461635,0.0001750738,0.000299634,0.0001694922,0.0005286695,0.00009156511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001439357,"about_ca_system_score_gemma":0.0001900831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004383524,"about_ca_topic_score_gemma":0.000003865539,"domain_scores_codex":[0.9970621,0.00004211139,0.001028376,0.0005583485,0.0009252877,0.0003837722],"domain_scores_gemma":[0.997177,0.0004355055,0.0008651565,0.0006841901,0.0006853634,0.0001527826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007900106,0.0001505213,0.00008334756,0.0004465774,0.0001960775,0.00005196419,0.0002424296,0.8142511,0.000001798814,0.1581136,0.004492735,0.02189083],"study_design_scores_gemma":[0.001883609,0.0001900221,0.00001399752,0.001149922,0.0003270733,0.00004983971,0.00007659401,0.5453315,0.00002873081,0.264905,0.1842275,0.00181626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000003466433,0.0001752438,0.4693651,0.00004920903,0.0001736986,0.0004104548,0.00003011925,0.0001074136,0.5296853],"genre_scores_gemma":[0.0000301123,0.01122289,0.430779,0.00001836558,0.0003904859,0.00001777914,0.0002711404,0.0002377356,0.5570325],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2689197,"threshold_uncertainty_score":0.9997106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4324288401","doi":"10.1007/978-3-030-54621-2_744-1","title":"Kidney Exchange Programs","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Organ Donation and Transplantation","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01460975447438822,"gpt":0.2355542435832592,"spread":0.220944489108871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000915983,0.0001971366,0.0003040282,0.0002592233,0.00005094115,0.000006956,0.00006703177,0.0001835479,0.02079883],"category_scores_gemma":[0.00002984032,0.0002080308,0.0001158119,0.00007519929,0.00004330508,0.0000907415,0.00002258675,0.0002293161,0.00003404627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007785601,"about_ca_system_score_gemma":0.000198034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006230702,"about_ca_topic_score_gemma":0.000001582938,"domain_scores_codex":[0.9988121,0.00001268227,0.0003636078,0.0002494126,0.0004528282,0.0001093619],"domain_scores_gemma":[0.9992329,0.00001779498,0.0002666327,0.0002126963,0.0001462161,0.000123794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003119928,0.002998175,0.007069299,0.01825275,0.002965144,0.0008961585,0.01281562,0.03553367,0.000113979,0.3356274,0.1339542,0.4466536],"study_design_scores_gemma":[0.001271584,0.0003515944,0.0001153029,0.0002578972,0.0004488209,0.00003615663,0.00001230444,0.001028435,0.00001899234,0.0002025348,0.9959972,0.0002591724],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001028947,0.0002746766,0.003165103,0.0005390447,0.0004130249,0.0007652016,0.00007026945,0.0001047003,0.9946577],"genre_scores_gemma":[0.0003566276,0.01714531,0.01614643,0.00040596,0.000347645,0.00005489044,0.01141441,0.000131664,0.9539971],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.862043,"threshold_uncertainty_score":0.9800963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404198960","doi":"10.1007/978-3-030-54621-2_446-1","title":"Nondifferentiable Optimization: Cutting Plane Methods","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Plane (geometry); Cutting-plane method; Computer science; Mathematics; Geometry; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.008230566604085835,"gpt":0.2601310801794713,"spread":0.2519005135753855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001319485,0.0004462807,0.0006440351,0.0004172705,0.00004185643,0.00003303978,0.0002258503,0.0003986318,0.001879286],"category_scores_gemma":[0.00003529719,0.0004616282,0.0001926643,0.0001907888,0.0000542304,0.0001865413,0.00008494881,0.0004113473,0.00003494254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113203,"about_ca_system_score_gemma":0.00002109494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002174315,"about_ca_topic_score_gemma":4.807121e-7,"domain_scores_codex":[0.9983844,0.00001554159,0.0007243991,0.0003825191,0.0002715984,0.0002215594],"domain_scores_gemma":[0.9991041,0.000108213,0.0002071015,0.0003799539,0.0001193451,0.00008125022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002774625,0.000006485076,0.00000114971,0.0002465431,0.0001517158,0.000004957169,0.00003830141,0.9886129,0.00001266332,0.004338946,0.001308661,0.005274859],"study_design_scores_gemma":[0.00007405047,0.00003133181,1.935105e-7,0.000294704,0.0003464746,0.000004688269,0.000004428412,0.9068086,0.0004134764,0.004463081,0.08707471,0.0004842315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.830652e-7,0.001233543,0.5382355,0.000009357071,0.0002486071,0.0001417348,0.00001880825,0.0005425783,0.4595697],"genre_scores_gemma":[0.00001885047,0.00945548,0.7844974,0.000009021041,0.000210543,0.00002364062,0.0005631318,0.0002017641,0.2050202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2545495,"threshold_uncertainty_score":0.9997835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367724364","doi":"10.1007/978-3-030-54621-2_823-1","title":"Opposition-Based Computing","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Neural Networks and Reservoir Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Opposition (politics); Political science; Computer science; Law; Politics","retraction":null,"screen_n_in":null,"score":{"opus":0.01574335923664161,"gpt":0.2262545536718627,"spread":0.2105111944352211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002122771,0.00027822,0.0003500738,0.0002633351,0.0001431094,0.00007691645,0.000746523,0.0002380467,0.00003891267],"category_scores_gemma":[0.0000281113,0.0002779623,0.0001672496,0.0001844694,0.00004586482,0.0001614961,0.0003161584,0.0002762181,0.00003988531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000385594,"about_ca_system_score_gemma":0.0001324257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004712657,"about_ca_topic_score_gemma":0.000001263232,"domain_scores_codex":[0.9982715,0.0000292666,0.0005385895,0.0004808409,0.0004352975,0.0002445074],"domain_scores_gemma":[0.9983898,0.0002865514,0.0005112297,0.0005134494,0.0002140121,0.00008493274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001820006,0.000009378321,0.000006707808,0.00005227822,0.00001680098,0.00001883759,0.00003347302,0.9567186,0.000001267575,0.03242286,0.001791456,0.008926542],"study_design_scores_gemma":[0.0001733085,0.00005718821,0.000008604123,0.0003779897,0.0000165672,0.000002689173,8.936656e-7,0.9920036,0.00001137288,0.00220991,0.004850325,0.0002876046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003629741,0.00008731437,0.6999416,0.0002513946,0.0009257623,0.0001923076,0.00000360651,0.0002872855,0.2983071],"genre_scores_gemma":[0.003235899,0.001500757,0.6615708,0.0004368867,0.001685637,0.000009173468,0.0004403929,0.000253611,0.3308668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03837076,"threshold_uncertainty_score":0.9999673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4362504304","doi":"10.1007/978-3-030-54621-2_736-1","title":"Data-Driven Inverse Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Inverse; Computer science; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02618374193444844,"gpt":0.2597484799584814,"spread":0.2335647380240329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003123734,0.0005874927,0.0006620146,0.0006709613,0.0002626873,0.00008261218,0.002705844,0.0003420332,0.003109467],"category_scores_gemma":[0.0002417454,0.0006990672,0.0001422131,0.0004145078,0.000141901,0.002478941,0.002167436,0.0005395266,0.00004007573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003212575,"about_ca_system_score_gemma":0.0004585838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009928414,"about_ca_topic_score_gemma":0.000006946004,"domain_scores_codex":[0.9961994,0.00009715505,0.0009974231,0.001390343,0.0009716323,0.0003440769],"domain_scores_gemma":[0.9951635,0.0001753129,0.00137968,0.002560201,0.0005543529,0.0001669592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001063177,0.00005453085,0.000003388779,0.00003015624,0.00006436451,0.00001807159,0.0001664791,0.9679977,3.854662e-7,0.02411692,0.002651374,0.004885974],"study_design_scores_gemma":[0.000519675,0.00008505605,0.000001225454,0.00004380076,0.00006618034,0.00001380333,0.000009972334,0.8706274,0.000001892341,0.0004968912,0.1275647,0.0005693618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[5.728168e-8,0.0001680171,0.6607749,0.0001161895,0.0008675107,0.0005649993,0.00025312,0.0002492279,0.3370059],"genre_scores_gemma":[0.000002593541,0.008958727,0.8876108,0.000127839,0.0001864528,0.00003852225,0.004121298,0.0001369177,0.09881685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2381891,"threshold_uncertainty_score":0.9995461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4327518366","doi":"10.1007/978-3-030-54621-2_739-1","title":"Bilevel Knapsack Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Knapsack problem; Bilevel optimization; Computer science; Mathematics; Mathematical optimization; Optimization problem","retraction":null,"screen_n_in":null,"score":{"opus":0.0298448764551417,"gpt":0.2409009152561241,"spread":0.2110560388009824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003680908,0.0003699613,0.0004497808,0.0005610745,0.0001007294,0.0001000303,0.001010308,0.0003936805,0.0004973204],"category_scores_gemma":[0.00009841062,0.00037408,0.0001614321,0.0003122586,0.00009120222,0.0005272015,0.0003965512,0.0003254209,0.0003801518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000612167,"about_ca_system_score_gemma":0.0002868478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006662687,"about_ca_topic_score_gemma":0.000004369605,"domain_scores_codex":[0.9975077,0.00003700882,0.0007546364,0.0006541242,0.0007233176,0.0003232149],"domain_scores_gemma":[0.9978703,0.0001266985,0.0005357303,0.0008360564,0.0004806684,0.0001505892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002548524,0.00002707965,0.000005525357,0.0001240661,0.00004478839,0.000006698309,0.0003100444,0.7001243,0.000001361885,0.2814727,0.007989538,0.009891278],"study_design_scores_gemma":[0.000534535,0.0001833596,0.00001133941,0.0003900846,0.00003469723,0.000006639347,0.000004243444,0.7965488,0.000008990055,0.03434782,0.167161,0.0007684676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[7.675582e-8,0.00007371525,0.5046117,0.0002517067,0.0004434349,0.0004167617,0.00001495295,0.0002853024,0.4939023],"genre_scores_gemma":[0.00001134227,0.008283957,0.2288942,0.00007229387,0.0001332291,0.00003635381,0.0002380543,0.0001027257,0.7622278],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.2757176,"threshold_uncertainty_score":0.9998711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406233261","doi":"10.1007/978-3-030-54621-2_292-1","title":"Interior Point Methods for Semidefinite Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Interior point method; Point (geometry); Computer science; Mathematical optimization; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05319793775319912,"gpt":0.4045016012678865,"spread":0.3513036635146874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008577487,0.0004763151,0.0007487496,0.0005723781,0.0000790476,0.00006730786,0.0003188033,0.0004681857,0.0007774737],"category_scores_gemma":[0.001487662,0.0004744712,0.0003343952,0.0001594308,0.0001301244,0.0002150953,0.0002220981,0.0004471017,0.00002555949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000189446,"about_ca_system_score_gemma":0.0001689912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000118212,"about_ca_topic_score_gemma":0.000001504113,"domain_scores_codex":[0.997525,0.00004625121,0.00108511,0.0006180423,0.0003806252,0.0003449757],"domain_scores_gemma":[0.9967846,0.001205329,0.0006183595,0.0005407362,0.0007294497,0.0001215428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001383044,0.00008451542,9.600847e-7,0.00377372,0.0005212532,0.0000130725,0.001109005,0.08706164,0.00001423369,0.6495864,0.005727962,0.2519689],"study_design_scores_gemma":[0.0004780467,0.0002189504,4.00809e-8,0.0009617207,0.0003323039,0.00001250041,0.00006071104,0.2644661,0.00008232857,0.3264671,0.4062931,0.0006271744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[8.799272e-8,0.0006362894,0.6821331,0.0001083998,0.000428152,0.001384693,0.00006134696,0.0001806125,0.3150674],"genre_scores_gemma":[2.425839e-7,0.001668035,0.6209185,0.00001142438,0.0001377832,0.0001678233,0.0002152769,0.0002113765,0.3766695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4005651,"threshold_uncertainty_score":0.9997707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412175736","doi":"10.1007/978-3-030-54621-2_610-1","title":"Signal Processing with Higher Order Statistics","year":2025,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Higher-order statistics; Statistics; SIGNAL (programming language); Signal processing; Computer science; Order (exchange); Order statistic; Mathematics; Digital signal processing; Economics; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.008964758547998964,"gpt":0.2339373189283428,"spread":0.2249725603803439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001233586,0.0002483618,0.0002811816,0.0002604985,0.0000625281,0.00008875551,0.000417571,0.0002206207,0.0002286377],"category_scores_gemma":[0.00001156501,0.0002286012,0.00002900613,0.0001722501,0.00006930742,0.0003751578,0.0001078918,0.0002222707,0.000004627924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004237525,"about_ca_system_score_gemma":0.0005534252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004280036,"about_ca_topic_score_gemma":0.000003345942,"domain_scores_codex":[0.9986999,0.00002390766,0.0003810871,0.0003678839,0.0003993,0.0001279185],"domain_scores_gemma":[0.998439,0.00006682872,0.000443448,0.0003396386,0.0006686721,0.00004246784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001683585,0.00004144199,0.00001039184,0.0001736099,0.00004377938,0.000009836638,0.0003880627,0.08823953,8.083916e-7,0.8215122,0.0161654,0.07339814],"study_design_scores_gemma":[0.0006901864,0.0004382948,0.00002655972,0.001037781,0.0001576303,0.000007529317,0.000005709257,0.4763387,0.00008584843,0.03407218,0.4859625,0.001177063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[4.32443e-8,0.00008054279,0.5603248,0.0001128029,0.00004464532,0.000163791,0.00001295638,0.0001291708,0.4391312],"genre_scores_gemma":[0.00002730691,0.000296653,0.6726087,0.000134595,0.00003848727,0.00001103616,0.0001161159,0.00002299723,0.3267441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.78744,"threshold_uncertainty_score":0.9322087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232611266","doi":"10.1007/0-306-48332-7_373","title":"Order Complementarity","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Computer science; Mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.04843168130442801,"gpt":0.303625301599578,"spread":0.25519362029515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001518733,0.0002417991,0.0004077135,0.0001033318,0.00005431276,0.00001305718,0.0001997795,0.0001873809,0.006064857],"category_scores_gemma":[0.00008136287,0.0002430363,0.0001266505,0.00006065912,0.00004250463,0.00004886301,0.00007026871,0.0001556347,0.00003784487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000409931,"about_ca_system_score_gemma":0.00006128765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007854527,"about_ca_topic_score_gemma":0.00001635511,"domain_scores_codex":[0.9987,0.000008766012,0.0006145618,0.0002316966,0.0003131222,0.0001318059],"domain_scores_gemma":[0.9985381,0.0001651504,0.0005735346,0.0004759509,0.0001938251,0.00005345598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003687723,0.0001326914,0.00001366356,0.0002280762,0.0001124286,0.000002579858,0.0002309144,0.001767048,7.614069e-7,0.8932089,0.1033686,0.0009306045],"study_design_scores_gemma":[0.000246621,0.00002793596,0.000001175917,0.0001383326,0.0002188949,0.000003082989,0.00001298435,0.004756748,0.000003134765,0.2981412,0.6961361,0.0003137806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000009107812,0.00004248421,0.1595073,0.00009457689,0.00008996663,0.0004785598,0.00004818974,0.00005321095,0.8396766],"genre_scores_gemma":[0.00004946938,0.001331348,0.4162344,0.0000301949,0.0001527045,0.00003543646,0.0004000067,0.00009183992,0.5816746],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5950677,"threshold_uncertainty_score":0.9948437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412694328","doi":"10.1007/978-3-030-54621-2_667-1","title":"Stochastic Vehicle RoutingProblems","year":2025,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.00927828317183463,"gpt":0.2258627667009326,"spread":0.2165844835290979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000242704,0.0004015677,0.0005178771,0.000367343,0.00006031857,0.00002532425,0.0002585673,0.0004766443,0.0005345649],"category_scores_gemma":[0.0001536072,0.0004832296,0.0001348574,0.000150621,0.00005714895,0.0001260937,0.0000721055,0.0003764261,0.00002418061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001306726,"about_ca_system_score_gemma":0.0000949211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002980584,"about_ca_topic_score_gemma":0.000001171957,"domain_scores_codex":[0.9983487,0.00002468196,0.0007553998,0.0003252757,0.0003000917,0.0002459066],"domain_scores_gemma":[0.9988402,0.0001782493,0.0002482839,0.0004414376,0.0002164497,0.00007543026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004360326,0.000007027857,0.000005211606,0.0001964445,0.00006646096,0.000001176798,0.00008752711,0.9822727,0.000005267346,0.005688073,0.002233968,0.009431751],"study_design_scores_gemma":[0.0002947512,0.00002449366,0.000004628221,0.0004417463,0.000135295,0.000001625887,0.000004844278,0.9853035,0.00002261428,0.0008247771,0.01250746,0.0004343296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000002275256,0.0003469238,0.4829257,0.00001431959,0.0004705591,0.0002359717,0.00002229756,0.0002991811,0.5156828],"genre_scores_gemma":[0.0006626094,0.002384254,0.4548564,0.0000358914,0.0003199755,0.00003023175,0.000382327,0.0002830449,0.5410452],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02806924,"threshold_uncertainty_score":0.9997619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4362504276","doi":"10.1007/978-3-030-54621-2_737-1","title":"Inverse Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01142636264077847,"gpt":0.2284659006488761,"spread":0.2170395380080977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000249576,0.0005483091,0.0005967231,0.0007113001,0.0002407061,0.00006188193,0.00111327,0.0003367713,0.004059327],"category_scores_gemma":[0.0001669247,0.0006563343,0.0002126408,0.0003967475,0.0001214047,0.001379842,0.0006741263,0.000484962,0.00003664922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003656345,"about_ca_system_score_gemma":0.0003471693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000802622,"about_ca_topic_score_gemma":0.000002268379,"domain_scores_codex":[0.9968998,0.00007658819,0.0008904544,0.0009498133,0.0008649737,0.0003183767],"domain_scores_gemma":[0.9968356,0.0001442185,0.001204357,0.001089923,0.0005731488,0.0001527174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009935157,0.00004458406,0.000002928934,0.00002642373,0.00004312148,0.00001429207,0.000227889,0.9348626,5.252424e-7,0.05968397,0.001087538,0.003996173],"study_design_scores_gemma":[0.0005540458,0.0001155553,0.000001366084,0.00004391011,0.00004712717,0.00001477156,0.00001036795,0.9073703,0.000007811542,0.001332972,0.08990327,0.0005984647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[5.994264e-8,0.00012663,0.5666336,0.00008665012,0.0007196452,0.0004305634,0.00002712744,0.0002059894,0.4317697],"genre_scores_gemma":[0.000003519279,0.005419197,0.793804,0.0001250943,0.0001311509,0.00005149964,0.0005063451,0.0001163295,0.1998428],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2319269,"threshold_uncertainty_score":0.9995888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}