{"meta":{"query_hash":"cbbb0b300fe6","filters":{"venue":"Encyclopedia of Optimization"},"cohort_total":36,"direct_labels_cover":0,"predictions_cover":36,"exported":36,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/cbbb0b300fe6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Encyclopedia+of+Optimization"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Environmental resource management; Environmental science","score_opus":0.02257526817568389,"score_gpt":0.2554348670017945,"score_spread":0.23285959882611063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134881188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003832738,0.00086056156,0.733396,0.000018391089,0.00012057569,0.00040174217,0.000064548825,0.000007385503,0.2650925],"genre_scores_gemma":[0.21527535,0.14300567,0.3708398,0.00006818007,0.00039894038,0.00015401797,0.0011857451,0.00016389147,0.2689084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976751,0.000067389345,0.00088011456,0.00035786975,0.0009073247,0.00011220766],"domain_scores_gemma":[0.9987129,0.00020786482,0.0005346711,0.00045709586,0.0000538042,0.000033672666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009556358,0.0001963841,0.00045912998,0.00038511012,0.00003256825,0.000037417598,0.00039283658,0.0001694039,0.0002309115],"category_scores_gemma":[0.000059254806,0.0001398191,0.000108056185,0.0004927673,0.00010612769,0.0001095285,0.0000785395,0.00007012658,0.0000025455456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010010104,0.00002571507,0.0008308852,0.00003247076,0.00012264817,0.000006722177,0.00007658932,0.98524046,3.1556546e-8,0.011660718,0.00013289525,0.00186086],"study_design_scores_gemma":[0.00035988246,0.0000568238,0.0044648293,0.00013387616,0.00090702396,0.000007775207,0.00028193346,0.98756397,8.700776e-8,0.0019576824,0.0039868397,0.00027930413],"about_ca_topic_score_codex":0.000013374904,"about_ca_topic_score_gemma":0.000003096448,"teacher_disagreement_score":0.3625562,"about_ca_system_score_codex":0.00006668916,"about_ca_system_score_gemma":0.000016838592,"threshold_uncertainty_score":0.57016575},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Computer science; Programming language; Algorithm; Optimization problem","score_opus":0.02553414972291377,"score_gpt":0.20103088371784508,"score_spread":0.17549673399493132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277950237","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035806863,0.0023664078,0.19147463,0.00005734396,0.00022822608,0.00053904275,0.00023403522,0.00004518649,0.80505157],"genre_scores_gemma":[0.00074107875,0.043469675,0.08301604,0.000058497513,0.0005383804,0.00019531626,0.00071819156,0.00015940418,0.8711034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984475,0.0000023736995,0.00089982606,0.00044279697,0.000032734555,0.00017480817],"domain_scores_gemma":[0.998418,0.000032415865,0.0009554803,0.00045646942,0.00006768092,0.00006998989],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013061383,0.00024183067,0.00053526263,0.00024936933,0.000079947335,0.00001735914,0.00023560463,0.0003083656,0.0011803156],"category_scores_gemma":[0.00001967155,0.0003112744,0.00017519586,0.00004534953,0.0001117628,0.00014392594,0.000059782746,0.00015445003,0.00028459664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061648398,0.00003559314,0.00006423979,0.000049104106,0.000061648476,8.4403746e-7,0.0001888036,0.026167782,4.0153367e-8,0.9633817,0.0028112133,0.0072328537],"study_design_scores_gemma":[0.00019234244,0.000034623838,0.000008357272,0.000020460302,0.0000139376225,0.0000035025887,0.0000040812843,0.002328087,8.8896576e-7,0.05408753,0.9429878,0.00031839625],"about_ca_topic_score_codex":0.000015797214,"about_ca_topic_score_gemma":0.00000199436,"teacher_disagreement_score":0.9401766,"about_ca_system_score_codex":0.00008017145,"about_ca_system_score_gemma":0.00005132447,"threshold_uncertainty_score":0.99993396},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012573216030350241,"score_gpt":0.2279365445735584,"score_spread":0.21536332854320814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770061147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1661869e-7,0.00012152769,0.61939585,0.00007229324,0.000038393086,0.00016991954,0.00001062508,0.00015190135,0.38003927],"genre_scores_gemma":[0.00008160459,0.0012632265,0.8168928,0.000120834375,0.00007200941,0.000011566235,0.00013720887,0.000048681824,0.18137209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855703,0.000023277738,0.00039609757,0.0003743295,0.00050578325,0.0001434877],"domain_scores_gemma":[0.9983725,0.000049202263,0.00053902046,0.00033736962,0.00064356637,0.000058321744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000944135,0.00026844657,0.00029185234,0.00021538338,0.00008019088,0.00006125762,0.000397247,0.00022740834,0.00023432472],"category_scores_gemma":[0.0000079767715,0.00024514744,0.000031009335,0.00013911423,0.00010537104,0.00046665332,0.000082581944,0.00023249006,0.000009806571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051466734,0.00014910233,0.00003737725,0.0002465951,0.00010725089,0.000082763814,0.002906302,0.39944705,0.0000029090595,0.4249584,0.052152634,0.11985814],"study_design_scores_gemma":[0.00081062486,0.0006766742,0.00005423273,0.00053778366,0.00010084331,0.000053584008,0.0000053016956,0.35148177,0.0000887701,0.008720041,0.6359763,0.0014940616],"about_ca_topic_score_codex":0.000004192085,"about_ca_topic_score_gemma":0.0000023899272,"teacher_disagreement_score":0.5838237,"about_ca_system_score_codex":0.000040849794,"about_ca_system_score_gemma":0.00042558607,"threshold_uncertainty_score":0.9996823},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dynamic programming; Control (management); Artificial intelligence; Algorithm","score_opus":0.0040351149971361005,"score_gpt":0.19415764594419893,"score_spread":0.19012253094706283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770352112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.255433e-7,0.0021316407,0.69880104,0.000011525148,0.00022607509,0.0014283684,0.00006534012,0.00045487867,0.29688042],"genre_scores_gemma":[0.0068159997,0.048341423,0.66260064,0.000038345814,0.000801717,0.0017768075,0.0029632412,0.0011320241,0.27552977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805135,0.000013955094,0.0008807248,0.0003969509,0.00036074375,0.00029625336],"domain_scores_gemma":[0.99857545,0.000074958974,0.00041603993,0.0005325445,0.0002875209,0.000113461545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007455528,0.00050765194,0.00066469563,0.0003153322,0.00008646314,0.000019663044,0.0002674743,0.00050517195,0.00012973922],"category_scores_gemma":[0.000022141638,0.00059830997,0.00018132478,0.00011411941,0.000100838515,0.00024644553,0.000024699797,0.00031340803,0.000046965473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012074597,0.000014895584,0.0000035313155,0.00012528623,0.0001148112,0.0000035246942,0.00006266873,0.98598826,0.000003889962,0.00089144823,0.000481378,0.012298253],"study_design_scores_gemma":[0.0007243463,0.000045399505,0.0000029133557,0.00009430896,0.00013594859,0.000016570002,0.0000050750436,0.7419121,0.0000022131505,0.000068322,0.25648794,0.0005048452],"about_ca_topic_score_codex":0.0000013977141,"about_ca_topic_score_gemma":0.000002383608,"teacher_disagreement_score":0.25600657,"about_ca_system_score_codex":0.00021505432,"about_ca_system_score_gemma":0.0000727848,"threshold_uncertainty_score":0.99964684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Business; Finance; Financial market; Financial system","score_opus":0.09175422378166155,"score_gpt":0.3638844289880762,"score_spread":0.2721302052064147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786931536","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025742917,0.001274194,0.03372451,0.0002277704,0.0005230182,0.0005831495,0.00007021187,0.000032636955,0.9633071],"genre_scores_gemma":[0.0012190238,0.13755612,0.032080155,0.000041425355,0.00043878437,0.00002048717,0.00023536505,0.0000610474,0.8283476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959591,0.00013093062,0.0011114161,0.00068325194,0.0018658855,0.00024942358],"domain_scores_gemma":[0.9963718,0.00061704783,0.00027767528,0.00066244544,0.0019254744,0.0001455338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017658657,0.000271893,0.0005001026,0.001111792,0.00040024798,0.000121443125,0.00045161764,0.0005066583,0.0013858118],"category_scores_gemma":[0.0022747682,0.00024273983,0.0000972423,0.000394307,0.0004233443,0.00045338497,0.0001946598,0.00041263402,0.0000994908],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014098917,0.00010084608,0.00038486643,0.000016712143,0.000029335772,0.000035268087,0.0015902891,0.7015521,0.0000016590166,0.035278294,0.19307199,0.06779764],"study_design_scores_gemma":[0.00047662883,0.00022653783,0.00073238503,0.000092872084,0.00003203364,0.00003290822,0.000037556143,0.07029586,0.000008470084,0.011607449,0.91596514,0.00049215276],"about_ca_topic_score_codex":0.000021661397,"about_ca_topic_score_gemma":0.000034567678,"teacher_disagreement_score":0.7228932,"about_ca_system_score_codex":0.000044796758,"about_ca_system_score_gemma":0.00045750086,"threshold_uncertainty_score":0.99952704},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011996956683695971,"score_gpt":0.23415342782708473,"score_spread":0.22215647114338877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210604531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3379899e-7,0.000071911716,0.5555944,0.00008576011,0.00003568206,0.00015579365,0.000008249114,0.00013799127,0.44391006],"genre_scores_gemma":[0.000064956876,0.0006194703,0.7604939,0.00012672009,0.0000801833,0.000011566903,0.00013825028,0.000048082125,0.23841693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856615,0.000023602446,0.00039680893,0.0003793699,0.00048192564,0.0001521679],"domain_scores_gemma":[0.9983813,0.000048536054,0.00053814286,0.00034316335,0.0006291232,0.000059740636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013015838,0.00026997947,0.00028527167,0.00022068823,0.00006402461,0.00009334909,0.0004081432,0.00023022255,0.00047544466],"category_scores_gemma":[0.000007865539,0.00024632562,0.000029332925,0.00016408534,0.000080156235,0.0004788591,0.00008299353,0.00022956604,0.00001034725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026949614,0.000075292715,0.000027617201,0.00012502809,0.000052777308,0.000034953257,0.0007396806,0.2081647,0.0000014982829,0.6879007,0.010366195,0.0924846],"study_design_scores_gemma":[0.0006764635,0.00055811653,0.000032418433,0.00052650477,0.00011353366,0.000028867924,0.000006169727,0.32869452,0.00004677349,0.0304913,0.6375824,0.0012429219],"about_ca_topic_score_codex":0.0000051551892,"about_ca_topic_score_gemma":0.0000041238227,"teacher_disagreement_score":0.65740937,"about_ca_system_score_codex":0.000043421074,"about_ca_system_score_gemma":0.00032873207,"threshold_uncertainty_score":0.9999989},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014853531005721492,"score_gpt":0.22130532858053298,"score_spread":0.2064517975748115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229698747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016400043,0.0005636813,0.53335375,0.000009723304,0.00040820695,0.00033917496,0.000017031374,0.00040869985,0.46488333],"genre_scores_gemma":[0.007540598,0.01811783,0.6471233,0.000048433983,0.001192554,0.00007550812,0.00078520144,0.0011657645,0.32395086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998119,0.000028329188,0.0008202409,0.00034366988,0.00039589664,0.00029286396],"domain_scores_gemma":[0.9987989,0.00013925078,0.00033324998,0.0004119194,0.00021413203,0.000102557584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002182062,0.00043960998,0.00053745083,0.00028767472,0.00008972056,0.000019884903,0.00023881106,0.00047278593,0.00039865126],"category_scores_gemma":[0.000121924895,0.0005232043,0.00013833094,0.00013026802,0.00008012552,0.00018433567,0.000059648566,0.0004167694,0.00004135875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031645698,0.000008320671,0.000008764016,0.00010871862,0.000053159725,0.000002857978,0.00034907766,0.9941281,0.000007784321,0.0005496428,0.0011146611,0.0036657422],"study_design_scores_gemma":[0.00031487484,0.00003467659,0.000009672741,0.00030775982,0.00007759654,0.000011980302,0.000005496733,0.9908237,0.000018365079,0.00013183155,0.007744524,0.00051955285],"about_ca_topic_score_codex":0.0000030938088,"about_ca_topic_score_gemma":0.0000010192083,"teacher_disagreement_score":0.14093249,"about_ca_system_score_codex":0.0001345767,"about_ca_system_score_gemma":0.000074479234,"threshold_uncertainty_score":0.99972194},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Computer science; Mathematics; Biology","score_opus":0.04843168130442801,"score_gpt":0.303625301599578,"score_spread":0.25519362029515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232611266","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009107812,0.000042484207,0.15950729,0.00009457689,0.000089966634,0.00047855978,0.000048189737,0.000053210948,0.8396766],"genre_scores_gemma":[0.000049469385,0.0013313483,0.41623443,0.000030194904,0.0001527045,0.000035436464,0.0004000067,0.000091839924,0.5816746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987,0.000008766012,0.0006145618,0.00023169655,0.00031312223,0.00013180591],"domain_scores_gemma":[0.9985381,0.00016515036,0.0005735346,0.00047595086,0.00019382512,0.000053455977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015187332,0.00024179908,0.0004077135,0.000103331775,0.000054312757,0.000013057182,0.00019977955,0.00018738087,0.006064857],"category_scores_gemma":[0.00008136287,0.00024303634,0.00012665048,0.000060659124,0.000042504635,0.000048863007,0.00007026871,0.00015563471,0.00003784487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036877234,0.00013269139,0.000013663564,0.00022807623,0.000112428635,0.0000025798583,0.00023091436,0.0017670483,7.614069e-7,0.8932089,0.10336861,0.0009306045],"study_design_scores_gemma":[0.000246621,0.000027935956,0.000001175917,0.00013833262,0.00021889489,0.0000030829885,0.000012984351,0.004756748,0.000003134765,0.29814118,0.6961361,0.00031378065],"about_ca_topic_score_codex":0.000007854527,"about_ca_topic_score_gemma":0.000016355114,"teacher_disagreement_score":0.59506774,"about_ca_system_score_codex":0.000040993098,"about_ca_system_score_gemma":0.00006128765,"threshold_uncertainty_score":0.9948437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.008498577183526958,"score_gpt":0.21319905079712118,"score_spread":0.20470047361359422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233154258","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010609779,0.00009208546,0.21182029,0.00005395289,0.00033925736,0.00020497668,0.000032888835,0.000026043681,0.7874199],"genre_scores_gemma":[0.01477385,0.0011758797,0.004240764,0.000045463537,0.0019050763,0.000017836777,0.0005329453,0.00009353678,0.97721463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990291,0.000011619672,0.000371341,0.00025221313,0.00018420114,0.00015152403],"domain_scores_gemma":[0.99921817,0.000030495625,0.00034347738,0.00021687469,0.00011793875,0.00007304815],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000048343634,0.0002443923,0.0003303012,0.00009177318,0.000048494847,0.000013328192,0.00011359801,0.00014744613,0.01168077],"category_scores_gemma":[0.0000020680072,0.00024714158,0.00016882939,0.000033114244,0.000052011095,0.00009908293,0.000020519201,0.0002246462,0.000042742337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041869658,0.000037537255,0.0001470396,0.000011750822,0.00010318247,0.0000019163713,0.000029484141,0.8463301,0.0000013801431,0.12774764,0.008604254,0.016943822],"study_design_scores_gemma":[0.0016679239,0.00013412716,0.000017942466,0.00015786376,0.00034151023,0.000004485087,0.000015338735,0.27038944,0.000015850588,0.010016699,0.7163402,0.0008986609],"about_ca_topic_score_codex":0.000009604514,"about_ca_topic_score_gemma":2.547788e-7,"teacher_disagreement_score":0.7077359,"about_ca_system_score_codex":0.000015077199,"about_ca_system_score_gemma":0.00004981718,"threshold_uncertainty_score":0.9999981},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Computer science; Algorithm","score_opus":0.05661161189794757,"score_gpt":0.32372416211595345,"score_spread":0.2671125502180059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234387703","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051003276,0.00040415567,0.2531979,0.0000910515,0.0006510079,0.00043047505,0.00002553509,0.00006503331,0.7451297],"genre_scores_gemma":[0.00015217613,0.02320033,0.10225268,0.00004308851,0.0004665336,0.000017168713,0.00032342257,0.000096432865,0.8734482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99559623,0.000056734432,0.0015989523,0.00072284666,0.0017518705,0.00027335726],"domain_scores_gemma":[0.9959324,0.0003877896,0.0016175209,0.0008766268,0.0010399658,0.00014567995],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011077444,0.00040615763,0.00068516337,0.0008644294,0.00012185083,0.00012957495,0.00068375503,0.0005388626,0.004174123],"category_scores_gemma":[0.00087294367,0.00034801828,0.0002755948,0.00040007432,0.00014247245,0.000447375,0.00012743864,0.00026309132,0.00026372814],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031484622,0.00004286249,0.0004750809,0.00000919112,0.000038240152,0.000015166511,0.0002343137,0.5254318,3.4419674e-7,0.020130644,0.017646026,0.43594486],"study_design_scores_gemma":[0.00024792503,0.000085676475,0.00004505203,0.00006851088,0.00007259011,0.000011689222,0.000021858381,0.022884198,0.0000030577019,0.017901761,0.9582519,0.0004057666],"about_ca_topic_score_codex":0.000012346678,"about_ca_topic_score_gemma":0.000008198835,"teacher_disagreement_score":0.9406059,"about_ca_system_score_codex":0.000055751665,"about_ca_system_score_gemma":0.0002242468,"threshold_uncertainty_score":0.9998972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.01355077143882855,"score_gpt":0.22493575977178323,"score_spread":0.2113849883329547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246068167","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022985741,0.00055725285,0.26441604,0.000011295318,0.00046657553,0.00020776122,0.000016238599,0.00042650066,0.73387533],"genre_scores_gemma":[0.0018243245,0.03229615,0.63182634,0.000041010753,0.0007744995,0.000019225432,0.0004171543,0.0006086611,0.33219263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843186,0.000024368917,0.00069553574,0.00028034498,0.00033264107,0.00023526623],"domain_scores_gemma":[0.99898183,0.0001109641,0.00025941813,0.00038879167,0.00017385613,0.00008515188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017959997,0.00036760722,0.00046533038,0.00024177217,0.00007281459,0.000014709685,0.0002124503,0.00045140577,0.0005832489],"category_scores_gemma":[0.00009197848,0.00044437693,0.00013652237,0.000103602455,0.00006656111,0.00016328497,0.00005059097,0.0003476382,0.000045188117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030945532,0.000005520474,0.000028273682,0.00006453493,0.00004447117,0.000005160967,0.00020813182,0.989853,0.000007121874,0.00087878015,0.0029900623,0.005911797],"study_design_scores_gemma":[0.0003019508,0.000027950058,0.00002239289,0.00018023283,0.00006940534,0.00001146719,0.000005879923,0.9435469,0.000091289425,0.00010584828,0.05509192,0.0005447795],"about_ca_topic_score_codex":0.0000021768356,"about_ca_topic_score_gemma":5.81393e-7,"teacher_disagreement_score":0.4016827,"about_ca_system_score_codex":0.00010840739,"about_ca_system_score_gemma":0.000058935297,"threshold_uncertainty_score":0.9998008},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; McMaster University","funders":"","keywords":"Facility location problem; Computer science; Geography; Mathematics; Geometry","score_opus":0.009022575624135465,"score_gpt":0.19843439357369136,"score_spread":0.1894118179495559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253175148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004324712,0.0005343482,0.5789433,0.000005635352,0.00018746166,0.00020960133,0.000035494646,0.00023143135,0.4198484],"genre_scores_gemma":[0.013781945,0.0565767,0.6760935,0.000024297939,0.000654013,0.000088732144,0.004112868,0.0004543016,0.2482136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867123,0.000009854386,0.00048867543,0.0003427341,0.00028405082,0.00020343348],"domain_scores_gemma":[0.9989781,0.0000631052,0.0002510358,0.00037521974,0.00026190627,0.00007064347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008311312,0.00039766773,0.0004062734,0.00017602346,0.00007041533,0.000023400813,0.00014305153,0.0002940088,0.00023482334],"category_scores_gemma":[0.00004119196,0.00039341763,0.00005609493,0.0001046056,0.00010268806,0.00023407496,0.00002012063,0.00028695463,0.000011847268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032862845,0.000009997159,0.0000058419864,0.00019569723,0.00004572224,0.0000036266388,0.00011997856,0.99357915,5.5618204e-7,0.0009782359,0.00020742226,0.0048209005],"study_design_scores_gemma":[0.00084879686,0.00022423959,0.000013907659,0.00068413024,0.00030602948,0.000015499705,0.00006331543,0.82946265,0.00023809931,0.0018683374,0.16475484,0.0015201621],"about_ca_topic_score_codex":0.000004686685,"about_ca_topic_score_gemma":0.000013298578,"teacher_disagreement_score":0.17163481,"about_ca_system_score_codex":0.0001409702,"about_ca_system_score_gemma":0.000047854297,"threshold_uncertainty_score":0.99985176},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"","keywords":"Production (economics); Distribution (mathematics); Computer science; Mathematics; Economics; Microeconomics","score_opus":0.021896416267130195,"score_gpt":0.19694252982477925,"score_spread":0.17504611355764904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299583889","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007534469,0.0001777157,0.17980543,0.0003263062,0.0013426096,0.0013165853,0.000019012885,0.00029924352,0.8167056],"genre_scores_gemma":[0.0049289134,0.007994861,0.026422216,0.0002173164,0.0043682856,0.00025817764,0.008240661,0.00025334186,0.9473162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980552,0.0000102266295,0.0007351408,0.00047733443,0.000527095,0.00019499719],"domain_scores_gemma":[0.9984794,0.00001011153,0.0004661907,0.00040427543,0.0006250005,0.000014994501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034712502,0.00033822627,0.00034953648,0.00029523886,0.00018686929,0.000047188296,0.00024295566,0.00021490832,0.0006164201],"category_scores_gemma":[0.00007933859,0.00036022603,0.00012396308,0.00018945668,0.000071201044,0.00066328817,0.00010024268,0.00014781681,0.00033817207],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003473793,0.000048682174,0.000016481577,0.0011242226,0.00006265492,0.0000032162886,0.00003811447,0.800729,7.7458435e-7,0.055376776,0.14032125,0.002244126],"study_design_scores_gemma":[0.00028333845,0.000019744559,0.000047255715,0.0003795434,0.00023709422,0.0000034165525,0.000042828127,0.101273246,0.0000047419667,0.00042051633,0.8967007,0.00058756344],"about_ca_topic_score_codex":0.000096578944,"about_ca_topic_score_gemma":0.000011039356,"teacher_disagreement_score":0.7563795,"about_ca_system_score_codex":0.00014682059,"about_ca_system_score_gemma":0.00006247478,"threshold_uncertainty_score":0.99988496},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04436691264716803,"score_gpt":0.3397273638812548,"score_spread":0.2953604512340868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299790063","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012960122,0.0004095139,0.34351495,0.00003273661,0.00024463743,0.0005289552,0.00006974379,0.00016282294,0.6550237],"genre_scores_gemma":[0.000013583737,0.01170475,0.5206655,0.000014417024,0.00029538994,0.000018945751,0.00028281013,0.00020565519,0.4667989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969704,0.000040897838,0.0011003163,0.0005674423,0.0009428199,0.00037810366],"domain_scores_gemma":[0.9967835,0.0004981101,0.00096132775,0.00066242035,0.0009483781,0.00014629272],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002645675,0.00049604534,0.00071299035,0.00042973645,0.00020472867,0.000038062917,0.00042625333,0.00055318343,0.0021778073],"category_scores_gemma":[0.0011308423,0.0005318269,0.00021647166,0.00011707748,0.00028360254,0.00035522148,0.0002024434,0.0005368381,0.00009156194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000773815,0.00016802631,0.000067928224,0.00068288884,0.00021241674,0.0000724087,0.0012162647,0.8904495,0.000002120737,0.07433482,0.02019828,0.012517914],"study_design_scores_gemma":[0.004008386,0.0004742115,0.00004362629,0.0018333433,0.00041874798,0.00018592864,0.00012714474,0.44659224,0.0002171837,0.13039683,0.41151726,0.0041851127],"about_ca_topic_score_codex":0.0000036023632,"about_ca_topic_score_gemma":0.0000012942811,"teacher_disagreement_score":0.4438573,"about_ca_system_score_codex":0.00015835582,"about_ca_system_score_gemma":0.00022190894,"threshold_uncertainty_score":0.9997133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Index (typography); Computer science; World Wide Web","score_opus":0.03774584614018987,"score_gpt":0.31949604586841895,"score_spread":0.28175019972822907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300107446","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034664333,0.00017524381,0.4693651,0.000049209026,0.00017369857,0.0004104548,0.000030119254,0.00010741358,0.5296853],"genre_scores_gemma":[0.000030112302,0.011222889,0.43077895,0.000018365581,0.00039048592,0.000017779139,0.00027114036,0.0002377356,0.5570325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970621,0.000042111387,0.0010283762,0.00055834855,0.0009252877,0.00038377225],"domain_scores_gemma":[0.997177,0.0004355055,0.00086515653,0.0006841901,0.0006853634,0.00015278262],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029547128,0.0004996665,0.00075041223,0.0005642249,0.00012430213,0.000036657613,0.000402803,0.00055771956,0.0039360304],"category_scores_gemma":[0.0007387524,0.0005346141,0.00020744385,0.00014616347,0.00017507382,0.00029963398,0.00016949222,0.0005286695,0.00009156511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007900106,0.00015052134,0.00008334756,0.00044657738,0.00019607753,0.000051964187,0.00024242961,0.8142511,0.0000017988137,0.15811357,0.0044927355,0.021890834],"study_design_scores_gemma":[0.0018836093,0.0001900221,0.000013997524,0.0011499216,0.0003270733,0.000049839706,0.000076594006,0.5453315,0.00002873081,0.26490498,0.18422751,0.0018162598],"about_ca_topic_score_codex":0.0000043835244,"about_ca_topic_score_gemma":0.000003865539,"teacher_disagreement_score":0.26891968,"about_ca_system_score_codex":0.00014393567,"about_ca_system_score_gemma":0.0001900831,"threshold_uncertainty_score":0.99971056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.010883409763587856,"score_gpt":0.25235946537320536,"score_spread":0.2414760556096175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300819837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3396139e-8,0.00034113872,0.52783257,0.0001341478,0.00024788227,0.00030697306,0.000018224284,0.00010825694,0.4710108],"genre_scores_gemma":[0.0000021135231,0.0042530717,0.89464754,0.000096445096,0.0003501153,0.000049808234,0.000106103595,0.000034222005,0.1004606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980047,0.000038766208,0.0006554531,0.00061749085,0.0004404516,0.00024316656],"domain_scores_gemma":[0.99797696,0.000093502,0.0006177365,0.0007805446,0.00038341858,0.00014781657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001675281,0.00035082555,0.00051092287,0.00012070117,0.00010513537,0.0000768995,0.0008583769,0.0003207469,0.0004534978],"category_scores_gemma":[0.000042795382,0.00036006494,0.00016606295,0.00031344208,0.00009672893,0.0003270338,0.00022730058,0.0001882866,0.00003832156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034955965,0.000048596965,0.000013018934,0.000024660038,0.00003634895,0.000007704085,0.000021397742,0.5549642,1.3220019e-7,0.27235508,0.0009569246,0.17156848],"study_design_scores_gemma":[0.0003589025,0.000121880235,0.0000060434986,0.00008379836,0.00007375003,0.000030738698,0.000003740253,0.45674318,0.0000023120722,0.028190983,0.51374674,0.00063794164],"about_ca_topic_score_codex":0.0000069944163,"about_ca_topic_score_gemma":4.751001e-7,"teacher_disagreement_score":0.5127898,"about_ca_system_score_codex":0.00009443963,"about_ca_system_score_gemma":0.00014562406,"threshold_uncertainty_score":0.99988514},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Principle of maximum entropy; Statistical physics; Mathematics; Physics; Statistics","score_opus":0.009252950400803825,"score_gpt":0.23533959668544635,"score_spread":0.22608664628464253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301361476","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006890279,0.000043256485,0.38411433,0.000022966158,0.00031912504,0.00018237815,0.00010364512,0.000018839894,0.6151886],"genre_scores_gemma":[0.0017284903,0.0015224554,0.054356705,0.000045088404,0.0024109278,0.000041690088,0.0020841595,0.00021730646,0.93759316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987294,0.000010767722,0.00045227693,0.0003160377,0.00026958776,0.00022194804],"domain_scores_gemma":[0.99904364,0.000054514283,0.0003510102,0.00030578108,0.00014096437,0.00010408212],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000057043948,0.00029206162,0.00037914724,0.00009510981,0.000056317414,0.00002088677,0.00016873903,0.00014137971,0.016538871],"category_scores_gemma":[0.000012727424,0.0002950199,0.00014396974,0.00004174673,0.0000372483,0.00006720636,0.0000716183,0.0002017192,0.00011576967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015038456,0.000039598028,0.00011461145,0.000019054505,0.000068231704,0.0000035986657,0.000023289658,0.009391422,0.0000011542618,0.9735993,0.001962838,0.014761833],"study_design_scores_gemma":[0.0006078172,0.000106498934,0.00001546297,0.00011301136,0.00018833991,0.0000012385145,0.000011344293,0.052893095,0.000017400478,0.19190224,0.75360763,0.0005359301],"about_ca_topic_score_codex":0.000017993194,"about_ca_topic_score_gemma":2.2930728e-7,"teacher_disagreement_score":0.7816971,"about_ca_system_score_codex":0.00003236337,"about_ca_system_score_gemma":0.00006724184,"threshold_uncertainty_score":0.9999502},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.014609754474388217,"score_gpt":0.2355542435832592,"score_spread":0.22094448910887096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324288401","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010289474,0.00027467663,0.0031651033,0.0005390447,0.0004130249,0.00076520164,0.00007026945,0.000104700346,0.9946577],"genre_scores_gemma":[0.0003566276,0.01714531,0.016146427,0.00040596005,0.000347645,0.000054890435,0.011414412,0.00013166397,0.9539971],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988121,0.000012682271,0.0003636078,0.00024941255,0.00045282824,0.00010936187],"domain_scores_gemma":[0.9992329,0.000017794979,0.0002666327,0.00021269631,0.00014621615,0.00012379403],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000915983,0.00019713656,0.00030402825,0.00025922328,0.00005094115,0.000006956,0.000067031775,0.00018354789,0.020798828],"category_scores_gemma":[0.000029840317,0.00020803077,0.00011581187,0.00007519929,0.000043305085,0.0000907415,0.000022586748,0.00022931605,0.00003404627],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031199283,0.0029981753,0.0070692985,0.018252745,0.0029651436,0.00089615845,0.012815621,0.035533674,0.00011397903,0.33562744,0.13395424,0.4466536],"study_design_scores_gemma":[0.0012715843,0.00035159438,0.00011530292,0.0002578972,0.00044882085,0.000036156627,0.000012304444,0.0010284351,0.000018992343,0.00020253478,0.9959972,0.00025917238],"about_ca_topic_score_codex":0.000006230702,"about_ca_topic_score_gemma":0.0000015829377,"teacher_disagreement_score":0.86204296,"about_ca_system_score_codex":0.000077856006,"about_ca_system_score_gemma":0.000198034,"threshold_uncertainty_score":0.9800963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Knapsack problem; Bilevel optimization; Computer science; Mathematics; Mathematical optimization; Optimization problem","score_opus":0.029844876455141705,"score_gpt":0.24090091525612406,"score_spread":0.21105603880098237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327518366","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.6755825e-8,0.00007371525,0.50461173,0.00025170675,0.0004434349,0.00041676173,0.000014952945,0.00028530243,0.4939023],"genre_scores_gemma":[0.000011342266,0.008283957,0.22889419,0.00007229387,0.00013322911,0.00003635381,0.00023805426,0.00010272572,0.76222783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975077,0.000037008816,0.00075463636,0.0006541242,0.0007233176,0.0003232149],"domain_scores_gemma":[0.99787027,0.00012669848,0.0005357303,0.00083605637,0.00048066842,0.00015058916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036809084,0.00036996132,0.0004497808,0.0005610745,0.00010072938,0.000100030324,0.0010103084,0.00039368053,0.0004973204],"category_scores_gemma":[0.00009841062,0.00037407997,0.0001614321,0.0003122586,0.00009120222,0.0005272015,0.00039655124,0.00032542093,0.0003801518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025485244,0.000027079652,0.0000055253568,0.00012406606,0.000044788394,0.000006698309,0.00031004436,0.7001243,0.0000013618852,0.28147274,0.007989538,0.009891278],"study_design_scores_gemma":[0.000534535,0.00018335956,0.000011339411,0.00039008458,0.000034697234,0.000006639347,0.0000042434444,0.7965488,0.000008990055,0.03434782,0.16716105,0.0007684676],"about_ca_topic_score_codex":0.000006662687,"about_ca_topic_score_gemma":0.0000043696045,"teacher_disagreement_score":0.27571756,"about_ca_system_score_codex":0.0000612167,"about_ca_system_score_gemma":0.00028684776,"threshold_uncertainty_score":0.99987113},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science","score_opus":0.03340248210910603,"score_gpt":0.3083465401588456,"score_spread":0.2749440580497396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327521332","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.109668e-7,0.00016239187,0.47095096,0.00008327487,0.00028579752,0.00069395656,0.00008385646,0.00014888715,0.5275906],"genre_scores_gemma":[0.0000030920746,0.00805784,0.549322,0.000028012857,0.00019394193,0.00006688329,0.00090881257,0.00026616076,0.44115323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962075,0.00009603401,0.0012200626,0.00071535754,0.001372757,0.0003883318],"domain_scores_gemma":[0.9965087,0.0004983222,0.0012250826,0.00090561796,0.0006990578,0.00016317611],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044876107,0.0005749128,0.0008045065,0.0007312272,0.00023279856,0.000034247558,0.0005627659,0.00046025944,0.040617153],"category_scores_gemma":[0.000766034,0.000661362,0.0002567,0.00028528983,0.00018013858,0.00045015855,0.0003639423,0.00072162953,0.000033884353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003790587,0.000070734524,0.0000021056542,0.00013951457,0.00008023646,0.000010886818,0.00016086502,0.88023937,3.0565647e-7,0.11300155,0.0048013385,0.0014552099],"study_design_scores_gemma":[0.0011551197,0.0002615767,5.537943e-7,0.00017728863,0.0002661866,0.000020554113,0.000058999653,0.72568434,0.000012805025,0.037677534,0.23353444,0.0011505965],"about_ca_topic_score_codex":0.000003712247,"about_ca_topic_score_gemma":0.0000016158161,"teacher_disagreement_score":0.22873309,"about_ca_system_score_codex":0.0003719873,"about_ca_system_score_gemma":0.00032953668,"threshold_uncertainty_score":0.9995838},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Minnow Environmental (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Combinatorial optimization; Machine learning; Algorithm","score_opus":0.010400940734408988,"score_gpt":0.21953465195359811,"score_spread":0.20913371121918914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353003139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.332627e-8,0.00018920742,0.67506504,0.0001537289,0.0015939397,0.0005967493,0.000029611678,0.00018106212,0.32219058],"genre_scores_gemma":[0.00019336231,0.010203148,0.82396823,0.000099927835,0.00041614758,0.00015014892,0.0031993655,0.00017010678,0.16159953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787354,0.00006166869,0.00072324125,0.0005943503,0.0005227501,0.00022446534],"domain_scores_gemma":[0.9979609,0.00021789134,0.00090938446,0.00043489563,0.00038575902,0.00009117078],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032340945,0.0003636944,0.0004513531,0.0003575827,0.0003211368,0.000076645265,0.0005078394,0.0002864791,0.0025709872],"category_scores_gemma":[0.00018040511,0.0004368926,0.00021491837,0.00017817931,0.000056397574,0.0006063094,0.00022096124,0.00037965836,0.000005289497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020664349,0.00002053362,0.000013463401,0.00003346484,0.000031421474,0.0000011444293,0.00009160219,0.76618594,3.3783652e-7,0.22660898,0.0003564838,0.0066359523],"study_design_scores_gemma":[0.0007883623,0.00019107899,0.0000017647099,0.000028216287,0.000053446434,0.0000056372196,0.0000039575225,0.81588805,0.0000032868327,0.002317826,0.18035841,0.0003599981],"about_ca_topic_score_codex":0.000007996808,"about_ca_topic_score_gemma":0.0000015045605,"teacher_disagreement_score":0.22429115,"about_ca_system_score_codex":0.00017062847,"about_ca_system_score_gemma":0.00025026975,"threshold_uncertainty_score":0.9998083},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Mathematical optimization; Optimization algorithm; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.011294851586935417,"score_gpt":0.22428162127845347,"score_spread":0.21298676969151806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360908927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8890284e-7,0.00046815342,0.6907937,0.00009826493,0.0013529209,0.0009116652,0.00012945884,0.00023567998,0.3060099],"genre_scores_gemma":[0.00036950235,0.009668633,0.7991885,0.00013291492,0.00042166415,0.00030947805,0.0034457638,0.00025730673,0.18620625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964724,0.00013745311,0.0010599528,0.0009309329,0.0010051858,0.00039403103],"domain_scores_gemma":[0.9969106,0.00017195292,0.0013108252,0.0009332914,0.0005147307,0.00015863462],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035973205,0.0005522218,0.000748653,0.00046388392,0.00020338764,0.00010809746,0.0012173476,0.00036828071,0.001638563],"category_scores_gemma":[0.00014818774,0.0006304959,0.0002869515,0.0002783881,0.000069991605,0.0008835673,0.000402489,0.00038800976,0.000031614483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002106525,0.00006398259,0.0000071104764,0.000035610294,0.00012746282,0.00001622993,0.00029479148,0.95406705,0.0000017011799,0.03879239,0.0010371084,0.0055354997],"study_design_scores_gemma":[0.0013609035,0.000110848705,0.000007337473,0.00007873671,0.00010068928,0.000011759777,0.000013898787,0.9147009,0.000010696692,0.00039387573,0.082606725,0.00060358294],"about_ca_topic_score_codex":0.000047853504,"about_ca_topic_score_gemma":0.000002856318,"teacher_disagreement_score":0.119803645,"about_ca_system_score_codex":0.00044869998,"about_ca_system_score_gemma":0.00032470663,"threshold_uncertainty_score":0.99961466},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science","score_opus":0.011597134851065236,"score_gpt":0.2189899654966995,"score_spread":0.20739283064563427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361006326","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.668998e-8,0.000035265602,0.55801696,0.00010492992,0.00071795704,0.00017437412,0.000014391703,0.00024978182,0.44068626],"genre_scores_gemma":[0.0000056571475,0.00461889,0.48988807,0.00005478075,0.00015328598,0.000010291619,0.00020834128,0.00005889176,0.5050018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982832,0.000017031622,0.00058136816,0.0004688964,0.00046520864,0.00018428409],"domain_scores_gemma":[0.99847853,0.000073576244,0.00052153826,0.0005527309,0.00027901964,0.00009461384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016211612,0.0002860131,0.0003397558,0.0004936972,0.00007250946,0.00005272264,0.00043664436,0.0003200758,0.000614584],"category_scores_gemma":[0.000047182337,0.00031859716,0.00014614825,0.0002017354,0.000061289895,0.00039960162,0.0001636491,0.00020973262,0.00017222333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029715527,0.000020181624,0.000015630338,0.000042134787,0.00007635099,0.000029418632,0.0001933717,0.3182138,7.0124645e-7,0.18580353,0.005966082,0.48963585],"study_design_scores_gemma":[0.00049832073,0.00009904557,0.00009393403,0.0002000333,0.00007536482,0.000027182878,0.000009104144,0.89424145,0.000012439958,0.015175065,0.08873357,0.0008344801],"about_ca_topic_score_codex":0.0000049401547,"about_ca_topic_score_gemma":0.0000029131602,"teacher_disagreement_score":0.5760277,"about_ca_system_score_codex":0.000055167246,"about_ca_system_score_gemma":0.00020317402,"threshold_uncertainty_score":0.9999266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.011426362640778473,"score_gpt":0.22846590064887615,"score_spread":0.21703953800809767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362504276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.994264e-8,0.00012663,0.5666336,0.00008665012,0.0007196452,0.0004305634,0.00002712744,0.0002059894,0.43176973],"genre_scores_gemma":[0.0000035192788,0.005419197,0.79380405,0.0001250943,0.0001311509,0.00005149964,0.0005063451,0.00011632945,0.1998428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968998,0.000076588185,0.0008904544,0.00094981334,0.0008649737,0.00031837667],"domain_scores_gemma":[0.99683565,0.0001442185,0.0012043572,0.0010899233,0.0005731488,0.0001527174],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024957597,0.0005483091,0.00059672305,0.0007113001,0.00024070611,0.00006188193,0.0011132702,0.0003367713,0.004059327],"category_scores_gemma":[0.00016692473,0.0006563343,0.00021264084,0.00039674755,0.000121404744,0.0013798423,0.00067412626,0.00048496205,0.000036649217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009935157,0.00004458406,0.000002928934,0.000026423731,0.000043121476,0.000014292073,0.00022788902,0.9348626,5.252424e-7,0.059683975,0.0010875383,0.0039961734],"study_design_scores_gemma":[0.0005540458,0.00011555535,0.0000013660838,0.00004391011,0.00004712717,0.000014771559,0.0000103679495,0.9073703,0.000007811542,0.0013329721,0.089903265,0.00059846474],"about_ca_topic_score_codex":0.00000802622,"about_ca_topic_score_gemma":0.0000022683787,"teacher_disagreement_score":0.23192693,"about_ca_system_score_codex":0.00036563448,"about_ca_system_score_gemma":0.0003471693,"threshold_uncertainty_score":0.9995888},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Inverse; Computer science; Mathematics; Geometry","score_opus":0.02618374193444844,"score_gpt":0.2597484799584814,"score_spread":0.23356473802403294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362504304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.7281678e-8,0.00016801713,0.66077495,0.000116189454,0.00086751074,0.0005649993,0.00025312,0.00024922792,0.33700594],"genre_scores_gemma":[0.000002593541,0.008958727,0.8876108,0.00012783901,0.0001864528,0.00003852225,0.0041212975,0.00013691769,0.09881685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619937,0.00009715505,0.0009974231,0.0013903432,0.00097163225,0.0003440769],"domain_scores_gemma":[0.9951635,0.00017531287,0.0013796801,0.0025602013,0.0005543529,0.00016695916],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003123734,0.0005874927,0.0006620146,0.00067096134,0.0002626873,0.00008261218,0.0027058444,0.0003420332,0.003109467],"category_scores_gemma":[0.00024174544,0.0006990672,0.00014221312,0.0004145078,0.00014190098,0.0024789406,0.0021674358,0.00053952663,0.000040075727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010631769,0.000054530847,0.0000033887789,0.000030156236,0.00006436451,0.000018071585,0.00016647908,0.9679977,3.854662e-7,0.02411692,0.002651374,0.0048859743],"study_design_scores_gemma":[0.00051967497,0.000085056054,0.0000012254535,0.00004380076,0.00006618034,0.000013803328,0.000009972334,0.8706274,0.000001892341,0.00049689115,0.12756471,0.0005693618],"about_ca_topic_score_codex":0.000009928414,"about_ca_topic_score_gemma":0.000006946004,"teacher_disagreement_score":0.2381891,"about_ca_system_score_codex":0.00032125745,"about_ca_system_score_gemma":0.00045858376,"threshold_uncertainty_score":0.99954605},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Inverse; Integer (computer science); Mathematical optimization; Mathematics; Computer science; Geometry","score_opus":0.01010261178090125,"score_gpt":0.19466409610286387,"score_spread":0.18456148432196262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362504448","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.8596453e-7,0.00029429633,0.29269356,0.000027379097,0.0010475757,0.00032289012,0.00005723751,0.00034368742,0.70521283],"genre_scores_gemma":[0.00017361286,0.050237294,0.24278212,0.00015550999,0.0004831511,0.00010009652,0.0053493977,0.00072508433,0.6999937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998336,0.00002396455,0.0006945045,0.00032421973,0.0004062807,0.00021501991],"domain_scores_gemma":[0.99898064,0.000054424603,0.00029024406,0.00041425473,0.00016516348,0.00009527678],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015112331,0.00042348693,0.0004430082,0.0004749774,0.00008909051,0.000029231305,0.00025701916,0.00036132883,0.022712091],"category_scores_gemma":[0.00003728059,0.00051021576,0.00015052443,0.000165345,0.000062675594,0.00030224805,0.00008450625,0.00044743114,0.00004487109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008344667,0.000012662151,0.000006012254,0.00012759268,0.00006836654,0.0000032548062,0.00022155319,0.98068386,6.521883e-7,0.007044042,0.011057191,0.00076649414],"study_design_scores_gemma":[0.00024822017,0.000038364702,4.1235572e-7,0.000073293784,0.00007421272,0.0000038453886,0.0000100720035,0.71510977,0.000004276688,0.00016201682,0.28387326,0.00040226532],"about_ca_topic_score_codex":0.0000044481194,"about_ca_topic_score_gemma":0.00000346353,"teacher_disagreement_score":0.27281606,"about_ca_system_score_codex":0.00017846285,"about_ca_system_score_gemma":0.00007338945,"threshold_uncertainty_score":0.99973494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital","funders":"","keywords":"Computer science; Influence diagram; Artificial intelligence; Decision tree","score_opus":0.01993996292632648,"score_gpt":0.2671341508412789,"score_spread":0.2471941879149524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362725787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.4496918e-7,0.00021102678,0.7294744,0.000050746716,0.0015293206,0.00081774744,0.00003089844,0.00012904615,0.26775643],"genre_scores_gemma":[0.0000066261705,0.0036701318,0.94954205,0.00004835107,0.00016343994,0.00015391376,0.0004947233,0.00007645761,0.045844335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757254,0.000053602693,0.0008344519,0.00066922384,0.0006377859,0.00023239097],"domain_scores_gemma":[0.9972373,0.00034458115,0.00095603353,0.0009815933,0.00039824142,0.00008221728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069612573,0.00034282575,0.0004273825,0.0004132283,0.00020178797,0.000064906526,0.0010852375,0.00031849512,0.0006545529],"category_scores_gemma":[0.00042339085,0.00038263053,0.0002094387,0.00020525814,0.000057402453,0.0008502871,0.00032922832,0.000238277,0.000007980179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002068034,0.000021402695,0.0000015924135,0.00003509061,0.000014786166,6.0600235e-7,0.000089094945,0.6864036,4.3499637e-7,0.2741788,0.00089319824,0.038340725],"study_design_scores_gemma":[0.0003361769,0.00020435643,0.0000031669135,0.000056489265,0.00004343198,0.000004157731,0.000002981021,0.81979966,0.000016778533,0.00923379,0.16993791,0.00036110386],"about_ca_topic_score_codex":0.0000029090304,"about_ca_topic_score_gemma":8.1920433e-7,"teacher_disagreement_score":0.264945,"about_ca_system_score_codex":0.0001876916,"about_ca_system_score_gemma":0.00017283625,"threshold_uncertainty_score":0.99986255},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Opposition (politics); Political science; Computer science; Law; Politics","score_opus":0.01574335923664161,"score_gpt":0.22625455367186267,"score_spread":0.21051119443522107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367724364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036297406,0.000087314365,0.6999416,0.00025139464,0.00092576235,0.0001923076,0.00000360651,0.0002872855,0.29830712],"genre_scores_gemma":[0.0032358991,0.0015007573,0.6615708,0.00043688674,0.0016856372,0.000009173468,0.00044039288,0.00025361095,0.33086684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982715,0.000029266605,0.0005385895,0.00048084094,0.0004352975,0.00024450745],"domain_scores_gemma":[0.99838984,0.00028655143,0.00051122974,0.00051344937,0.00021401212,0.00008493274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002122771,0.00027821996,0.00035007382,0.00026333513,0.00014310943,0.000076916454,0.000746523,0.00023804675,0.000038912673],"category_scores_gemma":[0.0000281113,0.00027796233,0.00016724957,0.00018446938,0.00004586482,0.00016149608,0.00031615837,0.00027621805,0.00003988531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018200064,0.000009378321,0.0000067078076,0.000052278217,0.00001680098,0.000018837593,0.000033473025,0.95671856,0.0000012675747,0.032422855,0.001791456,0.0089265425],"study_design_scores_gemma":[0.0001733085,0.00005718821,0.000008604123,0.00037798972,0.000016567199,0.0000026891732,8.9366563e-7,0.99200356,0.000011372879,0.00220991,0.0048503247,0.00028760463],"about_ca_topic_score_codex":0.000004712657,"about_ca_topic_score_gemma":0.0000012632323,"teacher_disagreement_score":0.038370762,"about_ca_system_score_codex":0.0000385594,"about_ca_system_score_gemma":0.00013242567,"threshold_uncertainty_score":0.9999673},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Plane (geometry); Cutting-plane method; Computer science; Mathematics; Geometry; Algorithm","score_opus":0.008230566604085835,"score_gpt":0.26013108017947134,"score_spread":0.2519005135753855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404198960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8306515e-7,0.0012335434,0.53823555,0.000009357071,0.00024860707,0.00014173481,0.000018808254,0.0005425783,0.45956966],"genre_scores_gemma":[0.000018850471,0.00945548,0.7844974,0.000009021041,0.00021054302,0.00002364062,0.00056313176,0.00020176405,0.2050202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838436,0.000015541595,0.0007243991,0.0003825191,0.00027159843,0.0002215594],"domain_scores_gemma":[0.99910414,0.00010821304,0.00020710148,0.00037995385,0.000119345146,0.00008125022],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001319485,0.00044628067,0.00064403506,0.00041727046,0.000041856427,0.00003303978,0.00022585032,0.00039863182,0.0018792865],"category_scores_gemma":[0.000035297195,0.00046162817,0.00019266427,0.00019078879,0.0000542304,0.00018654132,0.00008494881,0.00041134725,0.00003494254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027746253,0.0000064850756,0.0000011497095,0.0002465431,0.00015171584,0.0000049571695,0.00003830141,0.98861295,0.000012663321,0.004338946,0.0013086613,0.0052748593],"study_design_scores_gemma":[0.00007405047,0.000031331805,1.935105e-7,0.00029470402,0.00034647458,0.000004688269,0.000004428412,0.9068086,0.0004134764,0.0044630812,0.08707471,0.00048423148],"about_ca_topic_score_codex":0.0000021743151,"about_ca_topic_score_gemma":4.807121e-7,"teacher_disagreement_score":0.25454947,"about_ca_system_score_codex":0.00011320295,"about_ca_system_score_gemma":0.000021094944,"threshold_uncertainty_score":0.9997835},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.02878496451378674,"score_gpt":0.3089569060354497,"score_spread":0.2801719415216629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404910912","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.0949477e-7,0.00038258813,0.4865121,0.00005271306,0.00041006913,0.0005459012,0.00006501746,0.00019370753,0.5118376],"genre_scores_gemma":[0.0000043784494,0.004986601,0.4173788,0.0000096902695,0.00022282863,0.00003120802,0.00050969946,0.00024693267,0.57660985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678254,0.00003121762,0.0011140617,0.0007228583,0.00097232306,0.00037700008],"domain_scores_gemma":[0.99741,0.00031408423,0.00066203007,0.0007493247,0.0007057261,0.0001588611],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026579647,0.0005982876,0.00077647076,0.0008034355,0.0001050782,0.00007402786,0.00040808998,0.0006577238,0.008742126],"category_scores_gemma":[0.00032525018,0.0006135916,0.0002586014,0.00025801087,0.00015810443,0.00033603873,0.00024270774,0.0006102823,0.00014692123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019229452,0.000047687085,0.000001093985,0.0004682271,0.00012701003,0.0000114282675,0.000105001636,0.82553566,7.497072e-7,0.16764425,0.005302207,0.00073743396],"study_design_scores_gemma":[0.00049905415,0.00011170733,2.0087569e-7,0.00069181493,0.0003648121,0.000012099609,0.000019977799,0.83749986,0.000037339585,0.11548273,0.044507496,0.00077291543],"about_ca_topic_score_codex":0.0000025780425,"about_ca_topic_score_gemma":0.0000023069354,"teacher_disagreement_score":0.06913328,"about_ca_system_score_codex":0.00021958761,"about_ca_system_score_gemma":0.00021496571,"threshold_uncertainty_score":0.9996315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01267615159411441,"score_gpt":0.24737192570591815,"score_spread":0.23469577411180373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406083589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.157042e-7,0.0009676799,0.51623833,0.00015471867,0.0003869527,0.00037898243,0.0000122189485,0.0007273843,0.48113343],"genre_scores_gemma":[0.00017198874,0.008345532,0.5821883,0.00007607372,0.00030869633,0.000031749005,0.00029577102,0.00014542286,0.40843648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968177,0.00005176785,0.0009090087,0.0010501998,0.00079923053,0.0003720743],"domain_scores_gemma":[0.9978134,0.00012131784,0.0003473985,0.00093682774,0.0006322721,0.00014880442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004478035,0.00058531616,0.00064014585,0.0008347877,0.00015181553,0.00023444765,0.0011530716,0.0006170818,0.00021444677],"category_scores_gemma":[0.00008303053,0.0006001798,0.000244078,0.00045082293,0.00010504741,0.00057144475,0.00050533336,0.0005149561,0.00006921149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071132076,0.000030097564,0.0000041048083,0.00020627817,0.000059469883,0.0000117183545,0.00026788661,0.9470177,0.0000012569303,0.044702806,0.0062615247,0.0014300195],"study_design_scores_gemma":[0.00017067377,0.00012848925,0.0000014633907,0.0005420196,0.00006996512,0.000015976984,0.0000036339911,0.96455,0.00012235352,0.0021950174,0.031573024,0.0006273591],"about_ca_topic_score_codex":0.0000063133407,"about_ca_topic_score_gemma":0.0000010567469,"teacher_disagreement_score":0.07269697,"about_ca_system_score_codex":0.00015036776,"about_ca_system_score_gemma":0.00040360016,"threshold_uncertainty_score":0.99964494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Interior point method; Point (geometry); Computer science; Mathematical optimization; Mathematics; Geometry","score_opus":0.05319793775319912,"score_gpt":0.40450160126788653,"score_spread":0.3513036635146874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406233261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.799272e-8,0.0006362894,0.6821331,0.00010839977,0.00042815195,0.0013846927,0.00006134696,0.0001806125,0.31506735],"genre_scores_gemma":[2.4258392e-7,0.0016680348,0.6209185,0.000011424376,0.00013778322,0.00016782331,0.00021527694,0.00021137652,0.37666953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997525,0.00004625121,0.0010851104,0.0006180423,0.00038062525,0.00034497568],"domain_scores_gemma":[0.99678457,0.0012053285,0.00061835954,0.0005407362,0.00072944973,0.00012154281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008577487,0.00047631506,0.0007487496,0.0005723781,0.0000790476,0.00006730786,0.00031880333,0.00046818572,0.00077747373],"category_scores_gemma":[0.0014876616,0.0004744712,0.00033439518,0.00015943083,0.00013012436,0.00021509528,0.00022209814,0.00044710175,0.000025559491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013830443,0.00008451542,9.600847e-7,0.0037737198,0.00052125315,0.000013072498,0.0011090051,0.087061636,0.000014233691,0.64958644,0.005727962,0.25196886],"study_design_scores_gemma":[0.00047804674,0.00021895044,4.00809e-8,0.00096172065,0.00033230387,0.000012500414,0.00006071104,0.26446608,0.000082328566,0.3264671,0.40629306,0.0006271744],"about_ca_topic_score_codex":0.0000011821196,"about_ca_topic_score_gemma":0.0000015041132,"teacher_disagreement_score":0.4005651,"about_ca_system_score_codex":0.000189446,"about_ca_system_score_gemma":0.00016899122,"threshold_uncertainty_score":0.9997707},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Principle of maximum entropy; Mathematics; Statistical physics; Physics; Statistics","score_opus":0.006794307817757435,"score_gpt":0.2356366743102401,"score_spread":0.22884236649248266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412034374","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020603418,0.00004701761,0.4025056,0.000029196013,0.00038685038,0.00018588797,0.00015946063,0.000016943108,0.596667],"genre_scores_gemma":[0.0005261611,0.0005349875,0.0524167,0.000036427475,0.00084610167,0.000029821238,0.0013087613,0.00007583393,0.9442252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988428,0.000010882563,0.00043383834,0.00030553513,0.00022111763,0.00018583822],"domain_scores_gemma":[0.99911106,0.00007571325,0.00028736022,0.00030251415,0.00015045122,0.00007292491],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005393981,0.00026793717,0.00037332816,0.000113334,0.00005494948,0.000019727393,0.00017254653,0.00013567382,0.007723285],"category_scores_gemma":[0.000018963212,0.0002731163,0.00014204427,0.000043792632,0.00003210678,0.00005218112,0.000092978225,0.00019454892,0.0000495881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013028204,0.000030310097,0.000058386362,0.000037638718,0.00007875647,0.0000013423074,0.000016594231,0.0053373287,8.5166516e-7,0.9734286,0.004469617,0.016527541],"study_design_scores_gemma":[0.0006794088,0.00008993439,0.000013673851,0.00024919258,0.00028748126,3.3290496e-7,0.000011212463,0.08631064,0.000035702145,0.23184936,0.67992175,0.00055133714],"about_ca_topic_score_codex":0.000014820257,"about_ca_topic_score_gemma":1.8393996e-7,"teacher_disagreement_score":0.74157923,"about_ca_system_score_codex":0.00003160137,"about_ca_system_score_gemma":0.00011542142,"threshold_uncertainty_score":0.9999721},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008964758547998964,"score_gpt":0.23393731892834282,"score_spread":0.22497256038034386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412175736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3244295e-8,0.00008054279,0.56032485,0.00011280285,0.00004464532,0.00016379099,0.000012956376,0.00012917076,0.4391312],"genre_scores_gemma":[0.000027306907,0.00029665302,0.6726087,0.00013459503,0.000038487266,0.0000110361625,0.00011611591,0.000022997234,0.32674414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986999,0.00002390766,0.00038108707,0.0003678839,0.0003993,0.00012791851],"domain_scores_gemma":[0.99843895,0.00006682872,0.00044344802,0.00033963862,0.00066867215,0.000042467836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012335862,0.00024836176,0.00028118162,0.00026049852,0.000062528095,0.000088755514,0.00041757105,0.00022062068,0.00022863771],"category_scores_gemma":[0.000011565008,0.00022860122,0.000029006134,0.00017225012,0.00006930742,0.0003751578,0.0001078918,0.00022227068,0.0000046279238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016835855,0.000041441992,0.000010391838,0.0001736099,0.000043779382,0.000009836638,0.0003880627,0.08823953,8.083916e-7,0.82151216,0.016165402,0.07339814],"study_design_scores_gemma":[0.0006901864,0.00043829475,0.000026559725,0.0010377805,0.00015763035,0.000007529317,0.000005709257,0.47633868,0.00008584843,0.034072183,0.48596254,0.0011770627],"about_ca_topic_score_codex":0.000004280036,"about_ca_topic_score_gemma":0.0000033459423,"teacher_disagreement_score":0.78744,"about_ca_system_score_codex":0.000042375254,"about_ca_system_score_gemma":0.00055342517,"threshold_uncertainty_score":0.93220866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science","score_opus":0.00927828317183463,"score_gpt":0.22586276670093255,"score_spread":0.21658448352909793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412694328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002275256,0.00034692383,0.48292565,0.000014319587,0.00047055914,0.00023597175,0.000022297558,0.00029918112,0.5156828],"genre_scores_gemma":[0.0006626094,0.0023842542,0.4548564,0.000035891397,0.00031997552,0.000030231755,0.00038232695,0.0002830449,0.54104525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834865,0.00002468196,0.0007553998,0.0003252757,0.00030009172,0.00024590665],"domain_scores_gemma":[0.99884015,0.00017824929,0.0002482839,0.0004414376,0.00021644968,0.00007543026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024270405,0.0004015677,0.00051787705,0.00036734296,0.000060318573,0.000025324254,0.00025856734,0.00047664435,0.0005345649],"category_scores_gemma":[0.00015360724,0.0004832296,0.00013485739,0.00015062097,0.000057148955,0.00012609367,0.0000721055,0.00037642612,0.000024180608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004360326,0.0000070278575,0.0000052116056,0.00019644454,0.00006646096,0.0000011767979,0.000087527114,0.98227274,0.0000052673463,0.005688073,0.0022339683,0.0094317505],"study_design_scores_gemma":[0.00029475117,0.000024493662,0.000004628221,0.00044174626,0.00013529498,0.0000016258865,0.000004844278,0.98530346,0.000022614282,0.0008247771,0.012507458,0.00043432962],"about_ca_topic_score_codex":0.0000029805838,"about_ca_topic_score_gemma":0.0000011719566,"teacher_disagreement_score":0.028069243,"about_ca_system_score_codex":0.00013067263,"about_ca_system_score_gemma":0.0000949211,"threshold_uncertainty_score":0.99976194},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04159238333358787,"score_gpt":0.3473829017767931,"score_spread":0.3057905184432052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82584263","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000071102345,0.00021698428,0.3969853,0.00003597203,0.00020746182,0.00044186058,0.00004893746,0.00013470663,0.6019217],"genre_scores_gemma":[0.000011025365,0.00569057,0.4499879,0.00001552094,0.0003383016,0.000019394003,0.00029148182,0.00020784099,0.54343796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969826,0.000041500454,0.0011025952,0.0005755172,0.0008966785,0.0004011292],"domain_scores_gemma":[0.9967986,0.00049097434,0.0009598961,0.00067442976,0.0009263398,0.00014976731],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036933666,0.00049905974,0.0006963818,0.00044092373,0.00016193416,0.00005923237,0.0004385493,0.0005603879,0.0045362096],"category_scores_gemma":[0.0011133841,0.0005345511,0.0002044288,0.00013916225,0.00021338204,0.00036498703,0.00020353396,0.0005297527,0.000096711294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066006214,0.00013755386,0.00008327329,0.0005634077,0.00016995538,0.00004943508,0.00048802735,0.7470543,0.0000017776432,0.22909614,0.0061905826,0.016099574],"study_design_scores_gemma":[0.0025121046,0.00029453615,0.000019302315,0.0013633921,0.00036023062,0.00007410297,0.00011330998,0.31571516,0.000084473555,0.3568528,0.31998748,0.0026231217],"about_ca_topic_score_codex":0.0000044589756,"about_ca_topic_score_gemma":0.000002282703,"teacher_disagreement_score":0.4313391,"about_ca_system_score_codex":0.00016859747,"about_ca_system_score_gemma":0.0001693263,"threshold_uncertainty_score":0.9997106},"labels":[],"label_agreement":null}]}