{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Jean‐Louis Goffin","is_ca":true},{"name":"Jean-Philippe Vial","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375107,0.001254599,0.0008668702,0.0006867429,0.0003131399,0.001685754,0.0008057461,0.0006469366,0.03114787],"category_scores_gemma":[0.00105582,0.0004089686,0.0005197889,0.001425309,0.000862173,0.001374217,0.0008940707,0.002819916,0.01260518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000703137,"about_ca_system_score_gemma":0.0008455132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005381287,"about_ca_topic_score_gemma":0.001073292,"domain_scores_codex":[0.9997099,0.0000452677,0.00001125979,0.00004687467,0.0001715692,0.00001514583],"domain_scores_gemma":[0.9998109,0.00008839832,0.000009480241,0.00003391791,0.00004522921,0.00001209647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001826662,0.00005297899,0.00008037572,0.0003816876,0.00002222861,0.00004494905,0.00005689694,0.006988967,0.001115476,0.5637521,0.1950722,0.232414],"study_design_scores_gemma":[0.00000959439,0.00002553127,0.0003192321,0.0002259746,0.00001136816,0.0001538935,0.00001996344,0.01019125,0.0007479548,0.4787687,0.5095128,0.0000138206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001264189,0.02992087,0.1601593,0.001916802,0.001647903,0.00005039137,0.0005425721,0.0004899076,0.8040081],"genre_scores_gemma":[0.03862485,0.04483259,0.1012671,0.001766092,0.002060292,0.000221064,0.001775232,0.0009116528,0.8085411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03114787,"threshold_uncertainty_score":0.1042,"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","authors":[{"name":"Leonardo Lozano","is_ca":false},{"name":"David Bergman","is_ca":false},{"name":"André A. Ciré","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927476,0.001622641,0.001016876,0.001691848,0.0006612865,0.003234668,0.001232113,0.0009282831,0.04351667],"category_scores_gemma":[0.002391415,0.0007752325,0.000951033,0.002396468,0.001573652,0.00345662,0.001307982,0.002505105,0.01254252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001923826,"about_ca_system_score_gemma":0.001008173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534024,"about_ca_topic_score_gemma":0.001998369,"domain_scores_codex":[0.9990407,0.0002646935,0.00007227676,0.000169331,0.0003965634,0.00005642608],"domain_scores_gemma":[0.9993462,0.0003852363,0.00002992077,0.0001071488,0.0001115077,0.00001994879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001238798,0.00002115077,0.00003425632,0.0002264981,0.00001299036,0.00002969932,0.00009298479,0.003223052,0.0006170477,0.8633454,0.02702602,0.1053585],"study_design_scores_gemma":[0.000008410184,0.00000853642,0.00004981746,0.0001246327,0.000009698302,0.000065914,0.00002336046,0.005306322,0.0005399067,0.7765221,0.2173316,0.00000976357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001054455,0.01565373,0.6840498,0.001240842,0.0007588616,0.0001046413,0.000740879,0.001551426,0.2948453],"genre_scores_gemma":[0.09177021,0.02571327,0.6163778,0.001251967,0.001057734,0.0008030368,0.003072105,0.002004266,0.2579497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04351667,"threshold_uncertainty_score":0.1455777,"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","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008405782,0.001180247,0.001732424,0.000787084,0.0005090861,0.003050966,0.0009984347,0.001407277,0.01414259],"category_scores_gemma":[0.004219148,0.0005753872,0.0007101724,0.002804425,0.0009821357,0.001840432,0.00279083,0.002992364,0.004976014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005238301,"about_ca_system_score_gemma":0.0007369383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008610479,"about_ca_topic_score_gemma":0.0008909866,"domain_scores_codex":[0.9994072,0.0002266339,0.00003779588,0.0001008422,0.0001932454,0.00003431526],"domain_scores_gemma":[0.9990743,0.0005753298,0.00004355268,0.00008574432,0.0001788064,0.00004215461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007623713,0.0001479162,0.0004824857,0.0007063968,0.00006383113,0.0001040207,0.0001505015,0.1015471,0.0007751857,0.3789973,0.0367241,0.480225],"study_design_scores_gemma":[0.00002261965,0.00003379587,0.0001578376,0.0001784223,0.00001838333,0.0001174086,0.00006154113,0.2835583,0.0006025938,0.647649,0.06757759,0.00002252822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003451483,0.01749454,0.9106584,0.001739713,0.0004327978,0.00003486739,0.000244572,0.0006976205,0.06524607],"genre_scores_gemma":[0.2031181,0.04495243,0.6470045,0.001026505,0.001716279,0.0003791758,0.001181719,0.001549929,0.09907133],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01414259,"threshold_uncertainty_score":0.04731172,"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","authors":[{"name":"Charles Audet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003699688,0.001366079,0.001231475,0.000543558,0.0004559064,0.002054851,0.001036735,0.001080838,0.08283878],"category_scores_gemma":[0.001352172,0.0004843072,0.0006651554,0.0009914534,0.0006665203,0.001851896,0.001479753,0.002499846,0.03214575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007083667,"about_ca_system_score_gemma":0.0008182914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006172442,"about_ca_topic_score_gemma":0.001077931,"domain_scores_codex":[0.9996946,0.00005338053,0.00001027506,0.00006462199,0.0001500424,0.00002714466],"domain_scores_gemma":[0.9997696,0.00009436892,0.00001461327,0.00005766868,0.00004310124,0.00002051576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007793059,0.00009626972,0.0001258144,0.0003633919,0.00005069257,0.00006876288,0.00003499904,0.04099496,0.001980669,0.3781666,0.2837725,0.2942674],"study_design_scores_gemma":[0.00002562746,0.00004474668,0.0002518847,0.0002351539,0.00002153996,0.0001409533,0.00001998947,0.09520703,0.001846902,0.5006624,0.401517,0.00002678657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.001929,0.01147576,0.3545433,0.002044366,0.001719883,0.00007294887,0.0008177062,0.002186015,0.6252111],"genre_scores_gemma":[0.06488922,0.01574587,0.1410449,0.001967683,0.001370943,0.0003115407,0.001939927,0.002771541,0.7699583],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.08283878,"threshold_uncertainty_score":0.2771233,"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","authors":[{"name":"François Louveaux","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331419,0.001316978,0.0009920658,0.0005543642,0.0003547994,0.001436897,0.00092039,0.0008940839,0.01538774],"category_scores_gemma":[0.0007251236,0.0004276479,0.000633031,0.001259391,0.000595836,0.0008988933,0.0007310034,0.001530142,0.006070561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007975267,"about_ca_system_score_gemma":0.00105053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001065918,"about_ca_topic_score_gemma":0.001764594,"domain_scores_codex":[0.9996668,0.00006157404,0.00001479912,0.0000681426,0.0001664508,0.00002218249],"domain_scores_gemma":[0.9998562,0.00005332835,0.0000126179,0.00002023209,0.00004582575,0.00001175947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002602298,0.00007839478,0.0002019409,0.0003129216,0.00004862335,0.0001016268,0.00006325673,0.1078872,0.00201203,0.5620852,0.1153442,0.2118385],"study_design_scores_gemma":[0.00001877739,0.00004036086,0.0003810129,0.0001347756,0.00002173158,0.0002412123,0.00003652526,0.179908,0.001068181,0.4618676,0.3562536,0.00002833289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004116026,0.01410243,0.6293879,0.00253659,0.00166475,0.0001003928,0.0009380709,0.0007885455,0.3463653],"genre_scores_gemma":[0.1385804,0.03663117,0.2171312,0.001566868,0.002235432,0.0005521658,0.004302634,0.0007364777,0.5982636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01538774,"threshold_uncertainty_score":0.05147713,"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","authors":[{"name":"George O. Wesolowsky","is_ca":true},{"name":"Jack Brimberg","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042211,0.00199017,0.002104643,0.0007234291,0.0003148318,0.001261149,0.001790362,0.001300441,0.006520167],"category_scores_gemma":[0.002486552,0.001273158,0.0009345533,0.00231714,0.000748556,0.001829525,0.001350728,0.001280041,0.00137216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252258,"about_ca_system_score_gemma":0.0009805667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00452339,"about_ca_topic_score_gemma":0.004503443,"domain_scores_codex":[0.9993772,0.0002221039,0.00002430201,0.0001328021,0.0001821681,0.00006144582],"domain_scores_gemma":[0.9994552,0.0003460418,0.00005601891,0.00006036122,0.00006130662,0.00002105804],"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.00003749682,0.00001973465,0.00007807573,0.00008292063,0.00001720276,0.00002239323,0.00001709191,0.9533947,0.0005687769,0.01213352,0.002269663,0.03135843],"study_design_scores_gemma":[0.00001276594,0.00003382874,0.00006420345,0.00001257104,0.000008366902,0.00002242921,0.000007796952,0.9851917,0.0005862064,0.0117541,0.002296296,0.000009601506],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007020851,0.001003342,0.981734,0.0001283023,0.00008755796,0.00003742595,0.0001586985,0.0003726432,0.009457206],"genre_scores_gemma":[0.2210095,0.002476945,0.743842,0.0001314608,0.0001639324,0.0003214502,0.0006307166,0.0005837307,0.03084026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006520167,"threshold_uncertainty_score":0.02181208,"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","authors":[{"name":"Dimitrios Hatzinakos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004532897,0.001321931,0.001282484,0.0009967397,0.0002462662,0.0019745,0.0007085831,0.0009195931,0.01859204],"category_scores_gemma":[0.001227895,0.0004451017,0.0005631096,0.002247032,0.0009601059,0.00142017,0.0008365278,0.002402928,0.0155442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003196757,"about_ca_system_score_gemma":0.0005763606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003715202,"about_ca_topic_score_gemma":0.0005908628,"domain_scores_codex":[0.9995602,0.00007570229,0.00002745167,0.00006981161,0.0002467086,0.00002027629],"domain_scores_gemma":[0.9995376,0.0002283759,0.00002050541,0.00009862817,0.0001015769,0.00001343858],"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.00005647241,0.0000477775,0.0001063243,0.0008177658,0.0000696179,0.0001481169,0.000148408,0.01553551,0.01244166,0.3209969,0.0818919,0.5677395],"study_design_scores_gemma":[0.00002882046,0.0001155155,0.0006812389,0.000282922,0.00005754818,0.000914695,0.0000416218,0.1146942,0.01209806,0.4212981,0.449701,0.00008629593],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001083525,0.01519421,0.9043341,0.000494137,0.001438422,0.00003002764,0.0002039834,0.001283323,0.07593828],"genre_scores_gemma":[0.0430376,0.04390636,0.6493372,0.0008115398,0.003678765,0.0002338827,0.001175859,0.001601889,0.2562168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01859204,"threshold_uncertainty_score":0.06219655,"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","authors":[{"name":"H. K. Kesavan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410637,0.0008844887,0.000996762,0.0008712806,0.0009791949,0.00213316,0.0009362329,0.001278798,0.008426824],"category_scores_gemma":[0.00326814,0.0005445358,0.0006995692,0.0008285716,0.003347123,0.004200852,0.001875368,0.003734898,0.002676653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021417,"about_ca_system_score_gemma":0.0009801339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005117715,"about_ca_topic_score_gemma":0.0005228746,"domain_scores_codex":[0.9991964,0.0002531369,0.00003402233,0.000156628,0.0003037796,0.00005605816],"domain_scores_gemma":[0.999396,0.0003414615,0.0000295142,0.0001036963,0.00009675249,0.00003261925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004703332,0.00000487286,0.00002045497,0.00002813631,0.000004794281,0.00001256916,0.00004207823,0.001215104,0.0001588413,0.9871846,0.003765663,0.007558114],"study_design_scores_gemma":[0.000003423012,0.000004516127,0.00005372558,0.00001487872,0.000002578564,0.00003016622,0.000005552299,0.002099967,0.0002006404,0.9772663,0.02031149,0.000006753691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01154809,0.01227697,0.370358,0.00742443,0.002136571,0.00005892552,0.0005192993,0.0002791778,0.5953984],"genre_scores_gemma":[0.5087184,0.01895545,0.2271983,0.004315119,0.005572348,0.0003471408,0.0006347619,0.0006860282,0.2335724],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.008426824,"threshold_uncertainty_score":0.02819049,"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","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003723907,0.001333645,0.001355776,0.0007700389,0.0004819414,0.00314197,0.0008272361,0.001012734,0.03322655],"category_scores_gemma":[0.001430108,0.0005558208,0.0005529786,0.00205133,0.0006405413,0.002161069,0.001700479,0.002639021,0.01983372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005502887,"about_ca_system_score_gemma":0.0007862711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005591225,"about_ca_topic_score_gemma":0.00089025,"domain_scores_codex":[0.9996506,0.00006598268,0.00001964306,0.00007456281,0.0001693458,0.000019828],"domain_scores_gemma":[0.9997227,0.00009964519,0.00001491267,0.00006290695,0.00008314622,0.00001673587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000379155,0.00007803823,0.000174461,0.0003987991,0.00004146299,0.00007672945,0.00008019649,0.02330044,0.001491448,0.3348544,0.09469683,0.5447693],"study_design_scores_gemma":[0.00001486964,0.0000434401,0.0002326482,0.0002669881,0.00002528477,0.0002935445,0.00004904251,0.06829117,0.002343354,0.5021027,0.4263036,0.0000334586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002051746,0.01545585,0.6754574,0.001681196,0.0009755253,0.00005652857,0.000640556,0.001680602,0.3020006],"genre_scores_gemma":[0.06533931,0.03074005,0.3588989,0.001230036,0.001161113,0.0003501271,0.002997912,0.001769217,0.5375134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03322655,"threshold_uncertainty_score":0.1111539,"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","authors":[{"name":"Maxime Gasse","is_ca":true},{"name":"Andrea Lodi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004643547,0.00141281,0.001429594,0.001117189,0.0003754077,0.002096108,0.001267377,0.0009923489,0.0334908],"category_scores_gemma":[0.001770853,0.0005148737,0.0006531118,0.002871896,0.0008692991,0.001783856,0.001157141,0.003111946,0.01710128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008052606,"about_ca_system_score_gemma":0.0007466232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001000497,"about_ca_topic_score_gemma":0.001926294,"domain_scores_codex":[0.9996107,0.0001075194,0.00001719837,0.00007493866,0.0001704532,0.00001927512],"domain_scores_gemma":[0.9994397,0.0003444526,0.00002274412,0.0001004236,0.00007200766,0.00002071759],"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.00002002089,0.00006777723,0.0001738432,0.0007075371,0.00005949915,0.0000578846,0.00007213376,0.01162145,0.0006926191,0.2401491,0.2778722,0.468506],"study_design_scores_gemma":[0.00001475413,0.00002763335,0.000461554,0.0004041093,0.00002311098,0.0002502394,0.00003505982,0.03687868,0.0006456888,0.4816581,0.4795719,0.00002913371],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001607205,0.1276738,0.4900174,0.004514374,0.003175544,0.0001068468,0.001159382,0.002399688,0.3693458],"genre_scores_gemma":[0.05214894,0.1160704,0.4447007,0.003058887,0.005889297,0.0006901686,0.004111465,0.002162375,0.3711678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0334908,"threshold_uncertainty_score":0.1120379,"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","authors":[{"name":"Jean‐Yves Potvin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002091852,0.001083873,0.0007056483,0.001144743,0.0005987381,0.001858219,0.001153695,0.0009288152,0.08671086],"category_scores_gemma":[0.0004478835,0.0004796578,0.0004261079,0.001655015,0.0003847288,0.001408599,0.00100713,0.001166187,0.0642316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007492286,"about_ca_system_score_gemma":0.0008113057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001563242,"about_ca_topic_score_gemma":0.003226363,"domain_scores_codex":[0.9997088,0.00002310595,0.000009619317,0.00006060782,0.0001764485,0.00002125062],"domain_scores_gemma":[0.9998716,0.00001732094,0.000005077441,0.0000339836,0.00006152572,0.00001039709],"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.00002096795,0.00004718078,0.00009940316,0.0002457686,0.00001521045,0.00006322904,0.00006691534,0.0100714,0.002896886,0.1026661,0.2888891,0.594918],"study_design_scores_gemma":[0.000003820021,0.00001449768,0.000132394,0.00007724168,0.000005978639,0.0001545334,0.000022029,0.005628082,0.001083985,0.02396181,0.9689056,0.00001000661],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000975488,0.009027905,0.1499891,0.0009306672,0.001762016,0.0001042151,0.001150621,0.002587698,0.8334723],"genre_scores_gemma":[0.01412988,0.01029509,0.04871321,0.0003257734,0.0003924845,0.000107334,0.002051556,0.0005838826,0.9234007],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.08671086,"threshold_uncertainty_score":0.2900767,"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","authors":[{"name":"Tamás Terlaky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093741,0.000884025,0.001216491,0.002120398,0.001282537,0.002286073,0.001363512,0.0008873148,0.04102446],"category_scores_gemma":[0.002771934,0.0006329124,0.000960213,0.001903882,0.001942291,0.00256721,0.001769599,0.002787737,0.01693082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000547082,"about_ca_system_score_gemma":0.0009663021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004620093,"about_ca_topic_score_gemma":0.0007938153,"domain_scores_codex":[0.999081,0.0001406737,0.00006320117,0.0001670674,0.0004480748,0.00009989702],"domain_scores_gemma":[0.9993712,0.0001513704,0.00005434097,0.000190895,0.0001817495,0.00005044734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003542428,0.00002332238,0.00009735387,0.000119961,0.00001353077,0.00006358136,0.00007175009,0.003168591,0.00107751,0.8785492,0.02271909,0.09406073],"study_design_scores_gemma":[0.00002217971,0.00003827643,0.0002034829,0.00006572967,0.00001507122,0.0002824523,0.00005715836,0.01017059,0.00359297,0.8814833,0.1040326,0.00003613269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01075885,0.001670655,0.5433943,0.0004554394,0.00161,0.000165903,0.0005663863,0.001515211,0.4398634],"genre_scores_gemma":[0.2032959,0.004094664,0.4285635,0.00114409,0.000871015,0.000500376,0.00206053,0.00326651,0.3562035],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04102446,"threshold_uncertainty_score":0.1372405,"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","authors":[{"name":"Rein Luus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002449072,0.001512464,0.0012437,0.00064626,0.0003412423,0.002035697,0.001118998,0.0009989885,0.02089196],"category_scores_gemma":[0.000508493,0.0005777876,0.0004480435,0.001756228,0.0007834395,0.001291635,0.0010584,0.002447234,0.01031694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005175689,"about_ca_system_score_gemma":0.0007950659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009124646,"about_ca_topic_score_gemma":0.001521555,"domain_scores_codex":[0.9997452,0.00003637959,0.000009733311,0.00004548364,0.0001452594,0.00001791313],"domain_scores_gemma":[0.9998842,0.00004818515,0.000006761113,0.0000147052,0.00003735296,0.000008742657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002247517,0.0001059254,0.00007889863,0.0007014275,0.00003201848,0.00006685964,0.00008113931,0.02269375,0.001951115,0.2098572,0.2269943,0.5374148],"study_design_scores_gemma":[0.00001550359,0.00003986817,0.0003537651,0.0004442105,0.00002084226,0.0002153699,0.00005649143,0.03046374,0.001228889,0.2869091,0.6802196,0.00003259557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001319579,0.06330689,0.359237,0.002689318,0.00260921,0.00007404145,0.0003983386,0.0009766899,0.5693889],"genre_scores_gemma":[0.04910655,0.138835,0.2192248,0.002337781,0.00428869,0.0005211671,0.001095333,0.001404374,0.5831863],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02089196,"threshold_uncertainty_score":0.06989056,"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","authors":[{"name":"Tamás Terlaky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001064,0.0008295474,0.001167917,0.00209786,0.001318638,0.002117981,0.001245889,0.0008197637,0.03780098],"category_scores_gemma":[0.002743053,0.0006128083,0.0008737589,0.001939605,0.001821019,0.002536945,0.001696469,0.002556232,0.0149854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005332283,"about_ca_system_score_gemma":0.0009124229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004486228,"about_ca_topic_score_gemma":0.0008077394,"domain_scores_codex":[0.9991838,0.0001289712,0.00005640926,0.0001503732,0.0003882574,0.00009206859],"domain_scores_gemma":[0.9993781,0.0001459917,0.00005458047,0.0001928857,0.0001783988,0.00005011003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000357324,0.00002491856,0.0001043597,0.0001109683,0.00001284185,0.00005991829,0.00007119607,0.003165844,0.001011034,0.8722902,0.02245055,0.1006625],"study_design_scores_gemma":[0.0000238587,0.00003839318,0.0001998021,0.00005575838,0.00001436306,0.000255868,0.00005146756,0.01014639,0.003402977,0.8960032,0.08977679,0.00003110468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01289735,0.001678757,0.5621287,0.0004296498,0.001417411,0.0001669739,0.0005395346,0.00153548,0.4192062],"genre_scores_gemma":[0.2267776,0.003854867,0.4329973,0.00102279,0.0007862173,0.0005069104,0.0019398,0.002801607,0.329313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03780098,"threshold_uncertainty_score":0.1264569,"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","authors":[{"name":"Dimitrios Hatzinakos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836584,0.001438859,0.001453861,0.001057321,0.0002642006,0.002034793,0.0007394316,0.0009389803,0.01816091],"category_scores_gemma":[0.00139809,0.0004831587,0.0005242617,0.002575486,0.0009420476,0.001499053,0.0008240368,0.002497647,0.01539357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003248277,"about_ca_system_score_gemma":0.000586703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004361982,"about_ca_topic_score_gemma":0.000694561,"domain_scores_codex":[0.9995739,0.00007722883,0.00002735039,0.00006778913,0.000233492,0.00002016495],"domain_scores_gemma":[0.9994629,0.000264475,0.00002368247,0.0001166734,0.0001165114,0.00001569789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006486176,0.00005376905,0.0001187663,0.0008359368,0.00007125478,0.000156229,0.0001547835,0.01622774,0.01073356,0.2946608,0.09034677,0.5865755],"study_design_scores_gemma":[0.00003715068,0.0001207415,0.0007142018,0.0002895744,0.00006070008,0.000879274,0.00004055566,0.1224768,0.01049435,0.437382,0.4274177,0.00008706858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001134193,0.01830012,0.9085134,0.0005112368,0.001495679,0.00003109362,0.0002013294,0.001371315,0.06844173],"genre_scores_gemma":[0.04505653,0.0488525,0.658374,0.0007557783,0.003759072,0.0002634098,0.001265064,0.001569,0.2401047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01816091,"threshold_uncertainty_score":0.0607543,"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","authors":[{"name":"Rein Luus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259012,0.0007593626,0.001393673,0.0006974978,0.0006899067,0.0009579632,0.001064942,0.001109122,0.02494551],"category_scores_gemma":[0.001262383,0.0003729942,0.0007760678,0.0006254432,0.0006584182,0.0006874662,0.001327451,0.0015542,0.009779294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004677706,"about_ca_system_score_gemma":0.001131271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001373829,"about_ca_topic_score_gemma":0.002586968,"domain_scores_codex":[0.9997597,0.00007130086,0.00001053016,0.00004157915,0.00009081374,0.00002610636],"domain_scores_gemma":[0.9997978,0.00007462865,0.00001464071,0.0000411609,0.00005618667,0.00001562879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003027777,0.0001553438,0.0004303249,0.0009856541,0.000184289,0.0002977971,0.0001759228,0.1885173,0.01165177,0.2975619,0.07073688,0.429],"study_design_scores_gemma":[0.0001212519,0.000148135,0.0005036236,0.0002087488,0.00006981828,0.000498271,0.00006989357,0.7654027,0.01044125,0.08458944,0.1378593,0.00008750681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00491649,0.001387491,0.9010047,0.0005089892,0.0006887864,0.000122807,0.000315653,0.001361622,0.0896934],"genre_scores_gemma":[0.1247339,0.001175268,0.7407951,0.0007670021,0.0003087125,0.0007144281,0.0007667787,0.001932504,0.1288063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02494551,"threshold_uncertainty_score":0.08345097,"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","authors":[{"name":"Daria Terekhov","is_ca":true},{"name":"Taewoo Lee","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865171,0.001658029,0.001081743,0.0009383042,0.0004701463,0.002040191,0.0009584558,0.0008716322,0.059127],"category_scores_gemma":[0.0008290723,0.0005780355,0.0007437479,0.001731577,0.0007115459,0.00162997,0.001256773,0.003164028,0.03502897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007272173,"about_ca_system_score_gemma":0.000800278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006947682,"about_ca_topic_score_gemma":0.00144191,"domain_scores_codex":[0.9997011,0.00004251185,0.00001051124,0.0000534099,0.0001688865,0.00002360344],"domain_scores_gemma":[0.999845,0.00006163355,0.000008613723,0.00003332379,0.000038455,0.00001289898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004213808,0.0001236593,0.0000969754,0.0005156161,0.00003229896,0.0000749746,0.00006304391,0.01381975,0.002055534,0.2450494,0.3282463,0.4098803],"study_design_scores_gemma":[0.00001159649,0.00003225485,0.0002343144,0.0002736352,0.00001565731,0.0002222175,0.000026539,0.01696985,0.001619266,0.218498,0.7620748,0.00002197609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0007886373,0.02000933,0.1406757,0.001214561,0.001839124,0.00005403711,0.0005164961,0.0008830634,0.8340191],"genre_scores_gemma":[0.02962001,0.03359721,0.1607915,0.001708121,0.001936811,0.0002640971,0.002292511,0.001574992,0.7682148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.059127,"threshold_uncertainty_score":0.1977995,"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","authors":[{"name":"Konstantinos E. Parsopoulos","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Pãnos M. Pardalos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000876349,0.001130044,0.0009419153,0.001162153,0.0005723232,0.003046202,0.001685917,0.001380267,0.1119673],"category_scores_gemma":[0.003621401,0.0004668975,0.0006815682,0.001638812,0.0003846597,0.002344812,0.001949871,0.001467305,0.04750024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007008463,"about_ca_system_score_gemma":0.001204733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004543438,"about_ca_topic_score_gemma":0.0009409488,"domain_scores_codex":[0.9990898,0.0002071363,0.00004377756,0.0001839025,0.0003748716,0.0001003845],"domain_scores_gemma":[0.999358,0.0001925879,0.0000358277,0.0002393451,0.0001305091,0.00004380117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001267934,0.0001507052,0.0003366716,0.0002460684,0.00006919753,0.00006531869,0.00003121,0.04817974,0.001351016,0.1875505,0.1196518,0.642241],"study_design_scores_gemma":[0.0001162702,0.0001698243,0.0003100235,0.0001611297,0.00004867826,0.0003971657,0.00004896255,0.2381306,0.004264519,0.3802314,0.3760955,0.00002589265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00405018,0.002352875,0.6783022,0.0011305,0.0005635882,0.000375843,0.001731343,0.00371923,0.3077742],"genre_scores_gemma":[0.107292,0.004326056,0.4490779,0.001038796,0.0005073445,0.0008784002,0.005893132,0.001970687,0.4290155],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1119673,"threshold_uncertainty_score":0.374568,"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","authors":[{"name":"Maude Josée Blondin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004955215,0.0008265297,0.0009090755,0.0003999397,0.0004094345,0.0009297813,0.0009048536,0.0006598891,0.007584574],"category_scores_gemma":[0.001180701,0.0004035479,0.0003715223,0.0007713505,0.0004742239,0.0007262927,0.001243658,0.001154298,0.002177757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005214934,"about_ca_system_score_gemma":0.0006198035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005634785,"about_ca_topic_score_gemma":0.001121069,"domain_scores_codex":[0.9996572,0.0001025342,0.00001263164,0.00006549949,0.0001376384,0.00002457735],"domain_scores_gemma":[0.9997049,0.0001310325,0.00002226553,0.00007335567,0.00005505557,0.00001332061],"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.00006355067,0.0001122672,0.0002293203,0.000204415,0.00006142443,0.00004332502,0.0000411896,0.5661913,0.003249944,0.1171721,0.0166291,0.2960022],"study_design_scores_gemma":[0.00002879029,0.00003499902,0.0001600532,0.00002805938,0.00001194742,0.00004608012,0.00001022676,0.9076273,0.001116656,0.07281174,0.01811579,0.000008248775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003700885,0.001562935,0.9440715,0.0002435028,0.0001645429,0.00004798774,0.00007938172,0.0004897855,0.04963943],"genre_scores_gemma":[0.2870604,0.003216355,0.6327153,0.0003432348,0.0003497041,0.0006248267,0.0006685679,0.0005070089,0.07451458],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007584574,"threshold_uncertainty_score":0.02537292,"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","authors":[{"name":"H. K. Kesavan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230357,0.0008787999,0.0008251612,0.000862815,0.0008798778,0.001996048,0.0008623457,0.001168384,0.01032546],"category_scores_gemma":[0.002910808,0.0004926078,0.0006345218,0.0007969521,0.003428156,0.003765078,0.001723594,0.003537737,0.003514289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001082968,"about_ca_system_score_gemma":0.0009275167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005428803,"about_ca_topic_score_gemma":0.0005553798,"domain_scores_codex":[0.9992142,0.0002529727,0.00003249119,0.0001490677,0.0002990362,0.00005221274],"domain_scores_gemma":[0.9994466,0.0003225133,0.00002636933,0.00008943664,0.00008740184,0.0000276367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004805462,0.000004561293,0.00001727054,0.00003148691,0.000004428138,0.0000120022,0.00004111527,0.001102562,0.000174406,0.985521,0.004685737,0.008400643],"study_design_scores_gemma":[0.000002894512,0.0000047091,0.00005813656,0.00001915282,0.000002616835,0.0000335685,0.000006253292,0.001792633,0.0002382938,0.9623433,0.03549119,0.000007188557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.007471222,0.01105596,0.2574486,0.005869315,0.002136529,0.0000442302,0.000478417,0.0002453444,0.7152504],"genre_scores_gemma":[0.4192998,0.02012318,0.1891717,0.004874661,0.005677542,0.0003069684,0.0006663888,0.000845756,0.3590339],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01032546,"threshold_uncertainty_score":0.03454208,"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","authors":[{"name":"János D. Pintér","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003587722,0.001349571,0.001317309,0.000879065,0.0003672767,0.001384501,0.0008985252,0.001168381,0.01482186],"category_scores_gemma":[0.0008059746,0.0003751264,0.0005247049,0.002489143,0.000867821,0.0009884693,0.001426511,0.001713821,0.006607366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004526163,"about_ca_system_score_gemma":0.0005324061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000868623,"about_ca_topic_score_gemma":0.001172955,"domain_scores_codex":[0.9997132,0.00005356577,0.00001145374,0.00005139941,0.0001530891,0.00001718192],"domain_scores_gemma":[0.9998214,0.00007558585,0.000009729524,0.00002775831,0.00004881321,0.00001671054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004800775,0.0001161821,0.0001762928,0.001175041,0.00004489947,0.0001142264,0.0001133389,0.04898194,0.002505633,0.1934281,0.1358007,0.6174956],"study_design_scores_gemma":[0.00003893907,0.0001161634,0.0008459028,0.0005129398,0.00003816466,0.000465056,0.00007540952,0.1230092,0.001933217,0.4073738,0.4655454,0.00004578567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003757617,0.1406513,0.4630983,0.002065023,0.001820203,0.0000723526,0.0003104795,0.001244845,0.38698],"genre_scores_gemma":[0.1458708,0.1603001,0.3598776,0.001758448,0.00355053,0.0004042223,0.001207236,0.001535765,0.3254953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01482186,"threshold_uncertainty_score":0.04958403,"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","authors":[{"name":"Abdullah Daşçı","is_ca":true},{"name":"Vedat Verter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121374,0.001362824,0.001521233,0.0007495272,0.0006140434,0.002346021,0.001065355,0.00243976,0.0211939],"category_scores_gemma":[0.002327642,0.0008434368,0.000880592,0.0009277138,0.000855901,0.001683932,0.001099999,0.001436753,0.001389166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00149127,"about_ca_system_score_gemma":0.001931771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002351012,"about_ca_topic_score_gemma":0.002786459,"domain_scores_codex":[0.9992437,0.0003420407,0.00002275893,0.0001736749,0.0001508653,0.00006690771],"domain_scores_gemma":[0.9993342,0.00047749,0.00003494235,0.00002744201,0.00008401091,0.00004201521],"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.0001390502,0.0001504476,0.0006528189,0.0005227992,0.00009010545,0.0003870056,0.0001080354,0.8146642,0.001291605,0.1147602,0.01363456,0.05359923],"study_design_scores_gemma":[0.000191001,0.0001708667,0.0003915007,0.00008773984,0.00007242704,0.0002408339,0.0001019713,0.832615,0.001260339,0.1411711,0.02366322,0.00003401775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03002613,0.001610942,0.8236753,0.002974248,0.0003284862,0.000474345,0.001452878,0.0003520588,0.1391056],"genre_scores_gemma":[0.6717933,0.002203965,0.2194594,0.0005601628,0.0004121021,0.0009276358,0.001316858,0.0002369362,0.1030896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0211939,"threshold_uncertainty_score":0.07090062,"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","authors":[{"name":"János D. Pintér","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008734143,0.001604908,0.001646145,0.0007649157,0.0003811073,0.002350898,0.001515754,0.001625282,0.006403466],"category_scores_gemma":[0.001290517,0.0006651053,0.0006001316,0.002510953,0.001801235,0.00203043,0.001127076,0.002774915,0.002036645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008751695,"about_ca_system_score_gemma":0.001369029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002334259,"about_ca_topic_score_gemma":0.004270663,"domain_scores_codex":[0.9994898,0.0001670787,0.00001679272,0.00006958278,0.0002296128,0.00002707912],"domain_scores_gemma":[0.9995058,0.0003516384,0.00002829556,0.00004056594,0.00004933728,0.00002441483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000417214,0.0000710141,0.000193619,0.0007840185,0.00008444287,0.00006527337,0.0001468341,0.1518202,0.001059381,0.4952604,0.09116477,0.2593084],"study_design_scores_gemma":[0.00002585164,0.00005294048,0.0003721619,0.0002803354,0.00003787922,0.00008324505,0.00006433704,0.1133492,0.0006884591,0.6991578,0.1858587,0.00002904664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.003204294,0.1841825,0.6628836,0.005385557,0.001832274,0.00006814328,0.0002161893,0.0005609348,0.1416666],"genre_scores_gemma":[0.1496213,0.2617129,0.3942785,0.00225618,0.00476216,0.0003619308,0.0006560055,0.001196443,0.1851546],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006403466,"threshold_uncertainty_score":0.02142179,"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","authors":[{"name":"Rein Luus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857327,0.001122785,0.001107134,0.0005374096,0.0005708876,0.002134811,0.001035478,0.00126165,0.03255428],"category_scores_gemma":[0.001418313,0.0004287499,0.0004243681,0.0007412911,0.00108968,0.001082329,0.001438776,0.001843229,0.008726443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00099049,"about_ca_system_score_gemma":0.001006495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002172939,"about_ca_topic_score_gemma":0.003186156,"domain_scores_codex":[0.999605,0.00006477303,0.00001823261,0.00009612977,0.0001817972,0.00003403223],"domain_scores_gemma":[0.9997571,0.00007466341,0.00001593539,0.00007340177,0.00006618749,0.00001276196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007216407,0.00007059606,0.0001799915,0.000338823,0.00005456261,0.00008142142,0.00008639503,0.07481757,0.002604299,0.5310871,0.08823124,0.3023758],"study_design_scores_gemma":[0.00003850926,0.00006293499,0.0003249856,0.0001734864,0.00003338718,0.000184623,0.00004533119,0.3075458,0.003072252,0.5013215,0.1871616,0.00003567678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002013968,0.006733224,0.6893011,0.0009805087,0.0009857024,0.00007040588,0.0003390422,0.0009470705,0.298629],"genre_scores_gemma":[0.2606322,0.01021486,0.2660768,0.00143848,0.001028387,0.0005051463,0.001414929,0.001068324,0.4576208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03255428,"threshold_uncertainty_score":0.108905,"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","authors":[{"name":"John Board","is_ca":false},{"name":"Charles Sutcliffe","is_ca":false},{"name":"William T. Ziemba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111482,0.002483101,0.002180621,0.002553578,0.0006970689,0.004661944,0.001192223,0.001882176,0.04747916],"category_scores_gemma":[0.003106439,0.0004957027,0.0005704214,0.006744731,0.001713161,0.004049158,0.001222539,0.004312515,0.02518172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321569,"about_ca_system_score_gemma":0.002138342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001612425,"about_ca_topic_score_gemma":0.002197565,"domain_scores_codex":[0.9987432,0.000276573,0.00007005181,0.0001663005,0.0006796513,0.00006417107],"domain_scores_gemma":[0.998908,0.0004803,0.00009605817,0.0001532172,0.0002753954,0.00008688799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002931664,0.00008713171,0.0001602544,0.0006373985,0.00003693322,0.00006499983,0.0001673945,0.002930655,0.0005690736,0.3318706,0.3357924,0.3276539],"study_design_scores_gemma":[0.00001442463,0.00003598314,0.0004322484,0.0005054819,0.00001799662,0.0001804403,0.00008042806,0.002744183,0.0002323294,0.3690751,0.6266577,0.00002370761],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001297436,0.2614815,0.06941356,0.00872168,0.008369328,0.00009089018,0.0007883798,0.0007473568,0.6490899],"genre_scores_gemma":[0.03609759,0.2798298,0.0554443,0.004594625,0.01300505,0.0004479997,0.002014631,0.0006314231,0.6079346],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.04747916,"threshold_uncertainty_score":0.1588336,"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","authors":[{"name":"Tamás Terlaky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006276108,0.0007276939,0.001268058,0.001489801,0.00162385,0.00287446,0.00165523,0.0008624956,0.02898099],"category_scores_gemma":[0.003841943,0.0005344378,0.0009096573,0.002697318,0.001329395,0.00482639,0.001205001,0.002726573,0.01362169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006015738,"about_ca_system_score_gemma":0.0008822717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009811765,"about_ca_topic_score_gemma":0.001697066,"domain_scores_codex":[0.9989982,0.00008378107,0.0001581419,0.0003188372,0.0003521504,0.00008888026],"domain_scores_gemma":[0.9986156,0.0004884065,0.00007005502,0.0004414064,0.0003289012,0.00005561016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001220559,0.00009583094,0.0002749809,0.0003687158,0.00002497921,0.0001496585,0.000201666,0.001717035,0.00254102,0.5648416,0.05364408,0.3760183],"study_design_scores_gemma":[0.00003431594,0.0000495519,0.0002058996,0.000146103,0.0000407007,0.0004744598,0.00007433855,0.007541268,0.005721296,0.7617422,0.2239313,0.000038589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01881562,0.002742735,0.572909,0.00118839,0.002204892,0.0002525361,0.002788665,0.003384575,0.3957136],"genre_scores_gemma":[0.2012489,0.004257438,0.5940843,0.001573575,0.001100798,0.000390374,0.005300392,0.002703687,0.1893406],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02898099,"threshold_uncertainty_score":0.09695113,"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","authors":[{"name":"Ana Viana","is_ca":false},{"name":"Xenia Klimentova","is_ca":false},{"name":"Margarida Carvalho","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767296,0.0003805977,0.0002323995,0.0006882387,0.0006848341,0.001639139,0.0004705343,0.0005071186,0.1839984],"category_scores_gemma":[0.0005925323,0.0001869344,0.0002034405,0.0009384777,0.0002553779,0.001380938,0.0009661769,0.001024126,0.0442461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008404352,"about_ca_system_score_gemma":0.001358424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002373279,"about_ca_topic_score_gemma":0.006522833,"domain_scores_codex":[0.9998317,0.00002390673,0.000005051346,0.00002446069,0.00008773732,0.00002716154],"domain_scores_gemma":[0.9998822,0.00003219541,0.000007383774,0.00001546539,0.00003963927,0.00002296557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001504705,0.00006421407,0.0001944514,0.00006586361,0.000001908156,0.00004785392,0.00009074706,0.0004383276,0.0001899795,0.08411755,0.547402,0.367372],"study_design_scores_gemma":[0.000001966791,0.000005751674,0.0003295326,0.00005367997,9.83605e-7,0.00008024345,0.0000323792,0.0002239882,0.0001294698,0.009060565,0.9900793,0.000002180879],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0006726092,0.002546969,0.003450059,0.001556484,0.0003635465,0.00003412327,0.0004094314,0.0002588857,0.990708],"genre_scores_gemma":[0.004688707,0.002804087,0.002711548,0.0005815298,0.0001353592,0.00003556267,0.00048671,0.000109829,0.9884467],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1839984,"threshold_uncertainty_score":0.615536,"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","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Jean‐Louis Goffin","is_ca":true},{"name":"Jean-Philippe Vial","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525105,0.002116357,0.001365984,0.001148676,0.0003725482,0.002142298,0.001665423,0.001300066,0.01629895],"category_scores_gemma":[0.001450393,0.0008755937,0.0007485899,0.003581972,0.001109974,0.002133851,0.001180484,0.003504329,0.009824083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006586745,"about_ca_system_score_gemma":0.0009561405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265269,"about_ca_topic_score_gemma":0.002153878,"domain_scores_codex":[0.9994096,0.00009148113,0.00002408733,0.00009028395,0.0003602301,0.00002437856],"domain_scores_gemma":[0.9997243,0.0001174983,0.00001445482,0.00003746842,0.00009277213,0.00001351649],"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.00003636102,0.0001251867,0.0001159274,0.0009925225,0.0000476126,0.00007002777,0.0001064002,0.04185563,0.002760682,0.2847435,0.1726131,0.496533],"study_design_scores_gemma":[0.00002951448,0.00005544408,0.0005594071,0.0005329077,0.00004298892,0.0003394863,0.00006921072,0.08788265,0.00208031,0.4430879,0.4652753,0.00004484633],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001543383,0.07183373,0.652278,0.00107933,0.002074035,0.00008489777,0.0005434272,0.0007791077,0.2697841],"genre_scores_gemma":[0.04427439,0.09781116,0.5408054,0.00129865,0.002875346,0.0004742615,0.002067426,0.001500296,0.3088931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01629895,"threshold_uncertainty_score":0.05452543,"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","authors":[{"name":"Mario Ventresca","is_ca":false},{"name":"Shahryar Rahnamayan","is_ca":true},{"name":"Hamid R. Tizhoosh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002314566,0.0007837039,0.00073661,0.0004958845,0.0004118956,0.001907817,0.001126956,0.0007675593,0.03146571],"category_scores_gemma":[0.000794627,0.0003208891,0.0004136302,0.0009902574,0.000829294,0.001258701,0.001191511,0.001617358,0.01113801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004910469,"about_ca_system_score_gemma":0.0004619135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005355263,"about_ca_topic_score_gemma":0.001011757,"domain_scores_codex":[0.999763,0.00004136078,0.00001030067,0.00004859007,0.0001158869,0.0000209569],"domain_scores_gemma":[0.9998422,0.00006036421,0.000006518271,0.00003894285,0.00003753382,0.0000143614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008040275,0.00007572411,0.0001365141,0.000310522,0.00004695418,0.00007571471,0.00007780278,0.04321387,0.004985205,0.3755771,0.08477333,0.4906469],"study_design_scores_gemma":[0.00002544977,0.00006710822,0.0002137745,0.0001499556,0.00001846511,0.000255371,0.00003677774,0.1841055,0.00428959,0.430069,0.3807392,0.00002977711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003201432,0.01329993,0.5115016,0.001110683,0.001754631,0.00009224049,0.0003264658,0.00183671,0.4668764],"genre_scores_gemma":[0.1979357,0.0165123,0.3856029,0.001088292,0.001264397,0.0003476059,0.001572315,0.001550634,0.3941259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03146571,"threshold_uncertainty_score":0.1052633,"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","authors":[{"name":"Taewoo Lee","is_ca":false},{"name":"Daria Terekhov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815094,0.0009189038,0.0009385295,0.0004207164,0.0002253218,0.001374793,0.0008946212,0.0008209007,0.01822221],"category_scores_gemma":[0.0008094758,0.0004964224,0.0005769674,0.0007279675,0.0005005975,0.0008558044,0.001414396,0.001420724,0.008470865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003082719,"about_ca_system_score_gemma":0.0004835321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007244094,"about_ca_topic_score_gemma":0.001273728,"domain_scores_codex":[0.9997732,0.00003180599,0.000008247183,0.00004150658,0.0001351604,0.00001014589],"domain_scores_gemma":[0.9997579,0.0001061335,0.00001133749,0.00004877963,0.00006552821,0.0000102603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009026362,0.00008390834,0.000211317,0.0005697116,0.00007711694,0.00009090868,0.00006247318,0.294116,0.01446238,0.1119841,0.08446427,0.4937876],"study_design_scores_gemma":[0.00001085977,0.00003076455,0.000186618,0.0000761939,0.00001406462,0.0001425436,0.00001804952,0.8283418,0.006308335,0.06655482,0.09829119,0.00002480992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001114393,0.002529972,0.9485799,0.0002485067,0.0003708474,0.00002402616,0.0002681627,0.0009542448,0.04590997],"genre_scores_gemma":[0.1033559,0.006742944,0.7374628,0.0005181441,0.0005096926,0.0002672547,0.002287505,0.002106379,0.1467495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01822221,"threshold_uncertainty_score":0.0609594,"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","authors":[{"name":"Margarida Carvalho","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003233187,0.001864925,0.00153096,0.001035463,0.0007673531,0.004307301,0.001468846,0.001307542,0.04623803],"category_scores_gemma":[0.00135591,0.0007877328,0.0006585913,0.003523526,0.0008201435,0.002324447,0.001970292,0.002926075,0.02684989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000668848,"about_ca_system_score_gemma":0.0009831707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001068927,"about_ca_topic_score_gemma":0.001706487,"domain_scores_codex":[0.999574,0.00005653665,0.00002253832,0.00006876499,0.0002381049,0.00004013624],"domain_scores_gemma":[0.9997242,0.0001095611,0.00001770859,0.00004389003,0.00008302797,0.00002155502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006739877,0.0001361935,0.0001401949,0.001007228,0.00004849003,0.0001423422,0.0001047987,0.05754928,0.002061149,0.3158296,0.1523972,0.4705162],"study_design_scores_gemma":[0.00002044437,0.00004633579,0.0001900159,0.0004847313,0.00002373313,0.0003289537,0.00009530853,0.07654866,0.001974843,0.3653513,0.5548938,0.00004177228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002124496,0.02257768,0.4101014,0.00114738,0.001484494,0.00009663065,0.0008377984,0.001180907,0.5604492],"genre_scores_gemma":[0.04934759,0.04960878,0.2700201,0.001049147,0.001134781,0.0004460235,0.003596558,0.001535374,0.6232617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04623803,"threshold_uncertainty_score":0.1546816,"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","authors":[{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006546326,0.001873414,0.001267748,0.0006748462,0.0003862363,0.001832988,0.001335426,0.0009339717,0.02735064],"category_scores_gemma":[0.001965116,0.000675745,0.0008550969,0.001678539,0.001138124,0.001700811,0.00107743,0.004641961,0.0151817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005387492,"about_ca_system_score_gemma":0.0006346581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006125058,"about_ca_topic_score_gemma":0.00107624,"domain_scores_codex":[0.9994653,0.0001624792,0.00002432952,0.00007469959,0.0002514268,0.00002180736],"domain_scores_gemma":[0.9993595,0.0003931767,0.00002366575,0.00008269106,0.0001185862,0.0000223108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003910394,0.0001182402,0.00007734942,0.0008013876,0.00004953522,0.00007303648,0.0001493442,0.03610283,0.003137823,0.5259332,0.1253037,0.3082144],"study_design_scores_gemma":[0.00003348494,0.00004576831,0.0001807791,0.0002545161,0.0000223192,0.0002063717,0.00004792102,0.1509887,0.001841677,0.6003488,0.2459929,0.00003673433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006709752,0.00915757,0.8955019,0.0004258499,0.0008566538,0.0000453588,0.0002969624,0.0009507494,0.09209401],"genre_scores_gemma":[0.03415193,0.01965456,0.8116105,0.0006729523,0.001493748,0.0004963459,0.001369889,0.002376219,0.1281739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02735064,"threshold_uncertainty_score":0.091497,"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","authors":[{"name":"Dimitrios Hatzinakos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365806,0.001267029,0.001118245,0.001066068,0.0002502633,0.002070422,0.0006210763,0.0008081652,0.02678692],"category_scores_gemma":[0.001130742,0.0004116559,0.0005034668,0.002327555,0.0008880583,0.00128256,0.000853558,0.002251055,0.02099262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003220899,"about_ca_system_score_gemma":0.0005333709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003908749,"about_ca_topic_score_gemma":0.0006367963,"domain_scores_codex":[0.9996065,0.0000649877,0.00002129284,0.00005911671,0.0002292252,0.00001877641],"domain_scores_gemma":[0.9995585,0.0002207287,0.00001973303,0.00008895921,0.00009803598,0.00001388551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000581965,0.000051535,0.0000958025,0.0007974833,0.00006116724,0.000129318,0.0001266447,0.01351575,0.01265479,0.286298,0.1168697,0.5693417],"study_design_scores_gemma":[0.00002190077,0.0001060588,0.0006667011,0.0003024467,0.000045219,0.0007110219,0.00003912766,0.08496364,0.009817832,0.3391462,0.5641116,0.00006826967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001339443,0.02442175,0.8094991,0.0006910693,0.002410624,0.00003844938,0.0003437519,0.001801033,0.1594547],"genre_scores_gemma":[0.04329803,0.05323043,0.4670873,0.0009677408,0.004584277,0.0002237949,0.001471031,0.001953987,0.4271834],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02678692,"threshold_uncertainty_score":0.08961117,"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","authors":[{"name":"G. Isac","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001280453,0.0006846181,0.0005711886,0.0008627299,0.0006988848,0.001591149,0.0005273075,0.0006379638,0.05250995],"category_scores_gemma":[0.0004119035,0.0003236796,0.0003421057,0.0009958668,0.0009902668,0.001288119,0.0008618844,0.001575556,0.01330839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009986265,"about_ca_system_score_gemma":0.0009338298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001254169,"about_ca_topic_score_gemma":0.002224105,"domain_scores_codex":[0.9998507,0.00001487004,0.000004286675,0.00002477266,0.00008945737,0.00001575525],"domain_scores_gemma":[0.9999142,0.00002123461,0.000005738867,0.00001926744,0.00003099983,0.000008654685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000127027,0.0000206214,0.00004372053,0.0001009601,0.000006737007,0.00003634424,0.0000693774,0.001697545,0.001037535,0.8550023,0.07307324,0.06889884],"study_design_scores_gemma":[0.000008063234,0.00001291954,0.0001626062,0.00007022426,0.000006504732,0.0001528583,0.00002781931,0.003292178,0.001297518,0.5588983,0.4360609,0.00001004366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001596491,0.005367225,0.04212473,0.000911617,0.0006919632,0.00002815889,0.0002218231,0.0002347945,0.9488232],"genre_scores_gemma":[0.06484175,0.008027588,0.02475595,0.0007402392,0.0006103731,0.0001057899,0.0005334866,0.0003268508,0.900058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05250995,"threshold_uncertainty_score":0.1756633,"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","authors":[{"name":"François Louveaux","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000265638,0.001352213,0.0009098069,0.0004888896,0.00034906,0.001418486,0.0007856765,0.0007369164,0.02840925],"category_scores_gemma":[0.0006213363,0.0004453541,0.0006121245,0.001165542,0.0005105797,0.0008315409,0.0009362047,0.001678511,0.01103414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000807332,"about_ca_system_score_gemma":0.0009279635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282439,"about_ca_topic_score_gemma":0.002340621,"domain_scores_codex":[0.9997327,0.00005069181,0.00000984134,0.00005354495,0.0001341144,0.00001909818],"domain_scores_gemma":[0.9998744,0.00004429685,0.00001019062,0.00002228465,0.00003854336,0.00001042841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003171591,0.00009312014,0.0001765626,0.0003369021,0.00004300224,0.00006065496,0.00005288584,0.1236562,0.002504098,0.4209718,0.1726114,0.2794617],"study_design_scores_gemma":[0.00002129803,0.00004054705,0.0004191093,0.000136242,0.00001978772,0.0001706175,0.0000306029,0.1998629,0.001458808,0.3467944,0.4510231,0.00002265435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003178547,0.01208325,0.5731305,0.001929513,0.001563487,0.0001034741,0.001503751,0.001098351,0.4054091],"genre_scores_gemma":[0.09295256,0.02758192,0.1968877,0.001231122,0.001801852,0.0005674434,0.005944174,0.001049905,0.6719833],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02840925,"threshold_uncertainty_score":0.09503841,"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","authors":[{"name":"Taewoo Lee","is_ca":false},{"name":"Daria Terekhov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002349447,0.001181785,0.001142322,0.000862392,0.0004687115,0.00199756,0.0009897122,0.001234868,0.06496328],"category_scores_gemma":[0.0007519546,0.0004900063,0.0007752051,0.000988782,0.0006693958,0.001319847,0.001519286,0.001894897,0.03410113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004097018,"about_ca_system_score_gemma":0.0005634497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006558176,"about_ca_topic_score_gemma":0.001101653,"domain_scores_codex":[0.9997157,0.0000328416,0.000009090086,0.00005553446,0.0001714895,0.00001532841],"domain_scores_gemma":[0.9998441,0.00004367936,0.000008903262,0.00003849848,0.00005356047,0.00001128003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006022045,0.0000757141,0.0002049958,0.0007080879,0.0000643118,0.0001137382,0.00008379787,0.03150953,0.009998824,0.2772114,0.1726779,0.5072914],"study_design_scores_gemma":[0.00001852184,0.00005206015,0.00045709,0.0002408082,0.00003137221,0.0005347334,0.00005573049,0.07826604,0.006925362,0.1713543,0.7420171,0.00004682834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001368995,0.01221837,0.4550409,0.0008811574,0.001633282,0.00005863588,0.0006024021,0.001479972,0.5267162],"genre_scores_gemma":[0.05312842,0.01727173,0.2738554,0.001027721,0.0009667487,0.0002554636,0.002227731,0.001652815,0.6496139],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.06496328,"threshold_uncertainty_score":0.2173238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}