{"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003204294,0.18418245,0.66288364,0.005385557,0.0018322737,0.00006814328,0.00021618932,0.00056093483,0.14166656],"genre_scores_gemma":[0.14962126,0.26171288,0.3942785,0.0022561797,0.00476216,0.00036193084,0.0006560055,0.0011964432,0.18515465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994898,0.0001670787,0.000016792716,0.00006958278,0.00022961276,0.000027079119],"domain_scores_gemma":[0.99950576,0.00035163845,0.000028295564,0.000040565945,0.000049337283,0.000024414829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087341433,0.001604908,0.0016461452,0.0007649157,0.00038110733,0.0023508978,0.0015157545,0.0016252819,0.006403466],"category_scores_gemma":[0.0012905169,0.0006651053,0.0006001316,0.0025109535,0.0018012355,0.0020304297,0.0011270758,0.0027749147,0.0020366448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041721403,0.000071014096,0.00019361895,0.0007840185,0.00008444287,0.00006527337,0.00014683412,0.15182015,0.0010593808,0.49526036,0.09116477,0.2593084],"study_design_scores_gemma":[0.000025851645,0.00005294048,0.00037216194,0.00028033543,0.000037879225,0.00008324505,0.00006433704,0.11334924,0.0006884591,0.6991578,0.18585874,0.000029046638],"about_ca_topic_score_codex":0.0023342585,"about_ca_topic_score_gemma":0.004270663,"teacher_disagreement_score":0.006403466,"about_ca_system_score_codex":0.0008751695,"about_ca_system_score_gemma":0.0013690288,"threshold_uncertainty_score":0.02142179},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034514833,0.017494543,0.91065836,0.0017397131,0.00043279782,0.000034867386,0.00024457203,0.0006976205,0.06524607],"genre_scores_gemma":[0.20311815,0.04495243,0.64700454,0.0010265047,0.001716279,0.00037917576,0.0011817194,0.0015499286,0.09907133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994072,0.0002266339,0.00003779588,0.00010084218,0.00019324539,0.00003431526],"domain_scores_gemma":[0.99907434,0.00057532976,0.00004355268,0.00008574432,0.00017880641,0.000042154614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084057817,0.0011802472,0.0017324243,0.00078708405,0.0005090861,0.003050966,0.0009984347,0.0014072773,0.014142591],"category_scores_gemma":[0.0042191483,0.00057538715,0.0007101724,0.002804425,0.0009821357,0.0018404322,0.0027908296,0.0029923639,0.004976014],"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.000076237135,0.00014791616,0.00048248575,0.00070639676,0.00006383113,0.00010402072,0.0001505015,0.10154713,0.0007751857,0.37899727,0.0367241,0.48022503],"study_design_scores_gemma":[0.000022619646,0.000033795874,0.00015783764,0.00017842228,0.000018383329,0.00011740856,0.00006154113,0.28355828,0.00060259376,0.647649,0.067577586,0.000022528217],"about_ca_topic_score_codex":0.0008610479,"about_ca_topic_score_gemma":0.0008909866,"teacher_disagreement_score":0.014142591,"about_ca_system_score_codex":0.0005238301,"about_ca_system_score_gemma":0.00073693827,"threshold_uncertainty_score":0.047311723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010835254,0.015194206,0.9043341,0.000494137,0.001438422,0.000030027642,0.0002039834,0.001283323,0.07593828],"genre_scores_gemma":[0.0430376,0.043906357,0.64933723,0.0008115398,0.0036787647,0.00023388266,0.0011758592,0.0016018886,0.2562168],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995602,0.000075702286,0.000027451668,0.00006981161,0.00024670857,0.000020276291],"domain_scores_gemma":[0.9995376,0.00022837588,0.000020505411,0.000098628174,0.00010157688,0.000013438583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045328966,0.001321931,0.0012824837,0.0009967397,0.0002462662,0.0019745005,0.0007085831,0.0009195931,0.01859204],"category_scores_gemma":[0.001227895,0.0004451017,0.00056310964,0.0022470322,0.0009601059,0.0014201704,0.00083652785,0.0024029284,0.015544201],"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.000056472407,0.000047777503,0.00010632432,0.00081776583,0.0000696179,0.00014811689,0.00014840803,0.015535509,0.012441657,0.32099694,0.0818919,0.56773955],"study_design_scores_gemma":[0.00002882046,0.00011551548,0.0006812389,0.00028292203,0.000057548175,0.00091469503,0.000041621795,0.11469423,0.012098056,0.42129812,0.44970095,0.00008629593],"about_ca_topic_score_codex":0.00037152017,"about_ca_topic_score_gemma":0.00059086276,"teacher_disagreement_score":0.01859204,"about_ca_system_score_codex":0.00031967566,"about_ca_system_score_gemma":0.0005763606,"threshold_uncertainty_score":0.062196553},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013195792,0.06330689,0.35923702,0.0026893178,0.0026092099,0.00007404145,0.0003983386,0.0009766899,0.5693889],"genre_scores_gemma":[0.049106546,0.13883503,0.21922477,0.002337781,0.00428869,0.00052116707,0.0010953335,0.001404374,0.58318627],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997452,0.00003637959,0.000009733311,0.00004548364,0.00014525936,0.000017913126],"domain_scores_gemma":[0.99988425,0.00004818515,0.0000067611127,0.0000147052015,0.000037352962,0.000008742657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024490716,0.0015124638,0.0012437002,0.00064626,0.00034124232,0.0020356975,0.0011189982,0.0009989885,0.020891963],"category_scores_gemma":[0.00050849305,0.00057778764,0.0004480435,0.0017562279,0.0007834395,0.0012916353,0.0010584,0.0024472345,0.010316944],"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.000022475173,0.00010592537,0.00007889863,0.0007014275,0.000032018477,0.00006685964,0.00008113931,0.02269375,0.0019511152,0.20985721,0.22699428,0.53741485],"study_design_scores_gemma":[0.000015503589,0.000039868166,0.0003537651,0.00044421048,0.000020842255,0.00021536993,0.00005649143,0.030463744,0.0012288889,0.28690907,0.6802196,0.000032595573],"about_ca_topic_score_codex":0.0009124646,"about_ca_topic_score_gemma":0.0015215548,"teacher_disagreement_score":0.020891963,"about_ca_system_score_codex":0.0005175689,"about_ca_system_score_gemma":0.00079506595,"threshold_uncertainty_score":0.06989056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012974356,0.2614815,0.06941356,0.00872168,0.008369328,0.00009089018,0.00078837975,0.0007473568,0.6490899],"genre_scores_gemma":[0.03609759,0.27982977,0.055444296,0.0045946254,0.013005051,0.00044799972,0.0020146314,0.0006314231,0.6079346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874324,0.00027657297,0.000070051814,0.00016630048,0.0006796513,0.00006417107],"domain_scores_gemma":[0.99890804,0.0004803,0.00009605817,0.00015321722,0.00027539543,0.00008688799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011148205,0.0024831009,0.0021806215,0.0025535782,0.00069706887,0.004661944,0.0011922227,0.001882176,0.047479164],"category_scores_gemma":[0.0031064395,0.0004957027,0.0005704214,0.0067447308,0.0017131608,0.004049158,0.001222539,0.004312515,0.02518172],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002931664,0.00008713171,0.0001602544,0.0006373985,0.000036933216,0.000064999826,0.00016739448,0.0029306547,0.0005690736,0.3318706,0.33579242,0.32765386],"study_design_scores_gemma":[0.000014424633,0.00003598314,0.00043224837,0.0005054819,0.000017996623,0.0001804403,0.000080428064,0.0027441834,0.00023232937,0.3690751,0.6266577,0.000023707607],"about_ca_topic_score_codex":0.0016124246,"about_ca_topic_score_gemma":0.0021975646,"teacher_disagreement_score":0.047479164,"about_ca_system_score_codex":0.0013215691,"about_ca_system_score_gemma":0.0021383415,"threshold_uncertainty_score":0.15883356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011341928,0.01830012,0.90851337,0.00051123684,0.0014956789,0.00003109362,0.00020132941,0.0013713149,0.068441726],"genre_scores_gemma":[0.045056526,0.048852503,0.65837395,0.00075577834,0.0037590722,0.0002634098,0.0012650642,0.0015690004,0.24010466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995739,0.00007722883,0.000027350392,0.00006778913,0.00023349197,0.000020164953],"domain_scores_gemma":[0.9994629,0.00026447503,0.000023682473,0.00011667342,0.000116511415,0.000015697886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836584,0.0014388587,0.0014538608,0.0010573212,0.00026420056,0.002034793,0.00073943165,0.00093898026,0.01816091],"category_scores_gemma":[0.0013980903,0.00048315868,0.0005242617,0.0025754855,0.0009420476,0.0014990531,0.00082403683,0.0024976472,0.015393574],"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.00006486176,0.00005376905,0.000118766286,0.0008359368,0.00007125478,0.00015622897,0.00015478348,0.016227735,0.010733555,0.29466078,0.09034677,0.5865755],"study_design_scores_gemma":[0.00003715068,0.000120741504,0.0007142018,0.00028957438,0.000060700077,0.000879274,0.000040555657,0.1224768,0.0104943495,0.43738195,0.42741767,0.00008706858],"about_ca_topic_score_codex":0.0004361982,"about_ca_topic_score_gemma":0.000694561,"teacher_disagreement_score":0.01816091,"about_ca_system_score_codex":0.00032482768,"about_ca_system_score_gemma":0.000586703,"threshold_uncertainty_score":0.0607543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004116026,0.014102429,0.6293879,0.0025365904,0.0016647497,0.00010039284,0.0009380709,0.00078854547,0.3463653],"genre_scores_gemma":[0.1385804,0.036631174,0.21713123,0.0015668683,0.0022354324,0.0005521658,0.004302634,0.00073647767,0.5982636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996668,0.00006157404,0.000014799124,0.0000681426,0.00016645079,0.000022182494],"domain_scores_gemma":[0.99985623,0.000053328346,0.000012617897,0.000020232088,0.000045825753,0.000011759468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033314186,0.001316978,0.0009920658,0.0005543642,0.00035479944,0.0014368972,0.00092038995,0.00089408393,0.015387744],"category_scores_gemma":[0.00072512357,0.00042764793,0.000633031,0.0012593912,0.00059583597,0.00089889334,0.00073100335,0.0015301417,0.0060705612],"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.000026022975,0.00007839478,0.00020194086,0.0003129216,0.000048623348,0.00010162681,0.00006325673,0.10788722,0.0020120298,0.56208515,0.11534425,0.2118385],"study_design_scores_gemma":[0.000018777386,0.000040360857,0.00038101288,0.00013477558,0.000021731583,0.00024121231,0.000036525264,0.17990796,0.0010681812,0.46186757,0.35625356,0.000028332894],"about_ca_topic_score_codex":0.0010659178,"about_ca_topic_score_gemma":0.0017645941,"teacher_disagreement_score":0.015387744,"about_ca_system_score_codex":0.00079752674,"about_ca_system_score_gemma":0.0010505305,"threshold_uncertainty_score":0.051477134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015964906,0.0053672246,0.042124726,0.00091161695,0.0006919632,0.000028158887,0.00022182312,0.00023479451,0.94882315],"genre_scores_gemma":[0.064841755,0.008027588,0.024755955,0.00074023916,0.0006103731,0.000105789884,0.0005334866,0.0003268508,0.900058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985075,0.000014870043,0.000004286675,0.000024772664,0.000089457375,0.000015755251],"domain_scores_gemma":[0.99991417,0.000021234608,0.0000057388665,0.00001926744,0.00003099983,0.000008654685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001280453,0.00068461813,0.0005711886,0.0008627299,0.0006988848,0.0015911494,0.0005273075,0.0006379638,0.052509952],"category_scores_gemma":[0.00041190346,0.0003236796,0.0003421057,0.0009958668,0.0009902668,0.0012881187,0.0008618844,0.0015755557,0.013308394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012702703,0.000020621395,0.00004372053,0.00010096008,0.000006737007,0.00003634424,0.0000693774,0.001697545,0.0010375346,0.8550023,0.07307324,0.06889884],"study_design_scores_gemma":[0.0000080632335,0.000012919537,0.00016260624,0.00007022426,0.0000065047325,0.00015285832,0.00002781931,0.0032921783,0.0012975177,0.5588983,0.43606088,0.0000100436555],"about_ca_topic_score_codex":0.0012541692,"about_ca_topic_score_gemma":0.0022241052,"teacher_disagreement_score":0.052509952,"about_ca_system_score_codex":0.0009986265,"about_ca_system_score_gemma":0.00093382975,"threshold_uncertainty_score":0.17566329},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020139676,0.006733224,0.6893011,0.0009805087,0.0009857024,0.00007040588,0.00033904225,0.00094707054,0.29862905],"genre_scores_gemma":[0.26063225,0.0102148615,0.26607683,0.0014384798,0.0010283872,0.00050514634,0.0014149288,0.0010683244,0.45762083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999605,0.000064773034,0.000018232613,0.00009612977,0.0001817972,0.000034032226],"domain_scores_gemma":[0.9997571,0.00007466341,0.000015935388,0.000073401774,0.000066187495,0.000012761959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038573268,0.001122785,0.0011071338,0.00053740956,0.0005708876,0.002134811,0.0010354784,0.0012616502,0.032554284],"category_scores_gemma":[0.0014183127,0.00042874986,0.0004243681,0.0007412911,0.0010896797,0.0010823286,0.0014387758,0.0018432294,0.008726443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007216407,0.00007059606,0.00017999146,0.00033882295,0.00005456261,0.00008142142,0.000086395026,0.07481757,0.002604299,0.5310871,0.08823124,0.3023758],"study_design_scores_gemma":[0.000038509264,0.00006293499,0.00032498562,0.00017348639,0.00003338718,0.00018462302,0.000045331188,0.30754575,0.0030722518,0.5013215,0.18716158,0.000035676778],"about_ca_topic_score_codex":0.0021729388,"about_ca_topic_score_gemma":0.0031861556,"teacher_disagreement_score":0.032554284,"about_ca_system_score_codex":0.00099049,"about_ca_system_score_gemma":0.0010064954,"threshold_uncertainty_score":0.10890496},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020517465,0.015455851,0.6754574,0.0016811963,0.0009755253,0.000056528574,0.000640556,0.0016806023,0.3020006],"genre_scores_gemma":[0.06533931,0.030740054,0.35889894,0.0012300364,0.0011611135,0.00035012714,0.0029979125,0.0017692173,0.5375134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996506,0.000065982684,0.000019643065,0.00007456281,0.00016934583,0.000019828],"domain_scores_gemma":[0.99972266,0.00009964519,0.000014912671,0.00006290695,0.000083146224,0.00001673587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037239073,0.001333645,0.001355776,0.00077003887,0.0004819414,0.0031419697,0.0008272361,0.0010127341,0.033226546],"category_scores_gemma":[0.0014301083,0.00055582076,0.0005529786,0.0020513302,0.0006405413,0.002161069,0.0017004788,0.002639021,0.019833721],"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.0000379155,0.00007803823,0.00017446103,0.0003987991,0.000041462994,0.00007672945,0.000080196485,0.023300437,0.0014914484,0.33485436,0.09469683,0.54476935],"study_design_scores_gemma":[0.000014869637,0.000043440097,0.00023264818,0.0002669881,0.00002528477,0.00029354452,0.000049042508,0.06829117,0.002343354,0.5021027,0.42630357,0.0000334586],"about_ca_topic_score_codex":0.00055912253,"about_ca_topic_score_gemma":0.00089025,"teacher_disagreement_score":0.033226546,"about_ca_system_score_codex":0.0005502887,"about_ca_system_score_gemma":0.0007862711,"threshold_uncertainty_score":0.1111539},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097548804,0.009027905,0.14998911,0.00093066716,0.0017620162,0.00010421511,0.001150621,0.0025876977,0.83347225],"genre_scores_gemma":[0.014129881,0.010295095,0.04871321,0.00032577338,0.0003924845,0.00010733404,0.002051556,0.0005838826,0.9234007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970883,0.000023105953,0.000009619317,0.000060607817,0.00017644854,0.000021250624],"domain_scores_gemma":[0.9998716,0.000017320943,0.000005077441,0.0000339836,0.00006152572,0.000010397091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020918524,0.0010838726,0.00070564833,0.0011447427,0.0005987381,0.0018582189,0.0011536953,0.0009288152,0.08671086],"category_scores_gemma":[0.0004478835,0.0004796578,0.00042610793,0.0016550148,0.00038472883,0.0014085989,0.00100713,0.0011661873,0.064231604],"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.000020967955,0.00004718078,0.00009940316,0.00024576864,0.000015210452,0.00006322904,0.00006691534,0.0100714015,0.0028968859,0.10266606,0.28888908,0.59491795],"study_design_scores_gemma":[0.0000038200205,0.000014497678,0.00013239402,0.000077241675,0.000005978639,0.0001545334,0.000022029,0.005628082,0.0010839847,0.023961812,0.96890557,0.000010006608],"about_ca_topic_score_codex":0.0015632422,"about_ca_topic_score_gemma":0.0032263633,"teacher_disagreement_score":0.08671086,"about_ca_system_score_codex":0.00074922864,"about_ca_system_score_gemma":0.00081130565,"threshold_uncertainty_score":0.29007673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007020851,0.0010033424,0.98173404,0.00012830234,0.00008755796,0.00003742595,0.00015869855,0.00037264318,0.009457206],"genre_scores_gemma":[0.2210095,0.0024769453,0.743842,0.00013146084,0.00016393239,0.00032145018,0.0006307166,0.0005837307,0.030840263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993772,0.00022210387,0.000024302006,0.00013280212,0.00018216809,0.00006144582],"domain_scores_gemma":[0.99945515,0.00034604184,0.00005601891,0.000060361217,0.00006130662,0.00002105804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080422114,0.00199017,0.0021046435,0.0007234291,0.00031483182,0.0012611486,0.001790362,0.0013004408,0.0065201665],"category_scores_gemma":[0.002486552,0.001273158,0.00093455333,0.0023171403,0.000748556,0.0018295245,0.0013507277,0.0012800413,0.0013721596],"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.000037496822,0.000019734653,0.00007807573,0.00008292063,0.000017202761,0.000022393235,0.000017091907,0.95339465,0.00056877686,0.012133525,0.0022696627,0.03135843],"study_design_scores_gemma":[0.000012765938,0.00003382874,0.00006420345,0.000012571041,0.000008366902,0.000022429205,0.000007796952,0.9851917,0.00058620644,0.011754104,0.0022962962,0.0000096015065],"about_ca_topic_score_codex":0.0045233895,"about_ca_topic_score_gemma":0.0045034434,"teacher_disagreement_score":0.0065201665,"about_ca_system_score_codex":0.0012522581,"about_ca_system_score_gemma":0.0009805667,"threshold_uncertainty_score":0.021812081},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030026127,0.0016109422,0.8236753,0.002974248,0.00032848617,0.00047434497,0.0014528779,0.0003520588,0.1391056],"genre_scores_gemma":[0.67179334,0.0022039649,0.21945944,0.0005601628,0.0004121021,0.00092763576,0.0013168579,0.00023693622,0.10308958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924374,0.00034204073,0.000022758928,0.00017367487,0.00015086531,0.000066907705],"domain_scores_gemma":[0.99933416,0.00047748996,0.000034942354,0.000027442007,0.000084010906,0.000042015206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012137404,0.0013628242,0.0015212325,0.0007495272,0.0006140434,0.0023460211,0.0010653554,0.00243976,0.021193897],"category_scores_gemma":[0.0023276417,0.0008434368,0.000880592,0.00092771376,0.00085590105,0.0016839324,0.0010999988,0.0014367527,0.0013891661],"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.00013905017,0.00015044762,0.0006528189,0.0005227992,0.00009010545,0.00038700562,0.00010803542,0.8146642,0.001291605,0.11476016,0.013634556,0.05359923],"study_design_scores_gemma":[0.00019100102,0.00017086673,0.00039150068,0.00008773984,0.00007242704,0.00024083386,0.000101971294,0.83261496,0.0012603387,0.1411711,0.023663223,0.000034017754],"about_ca_topic_score_codex":0.0023510118,"about_ca_topic_score_gemma":0.0027864592,"teacher_disagreement_score":0.021193897,"about_ca_system_score_codex":0.0014912703,"about_ca_system_score_gemma":0.0019317707,"threshold_uncertainty_score":0.07090062},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010758846,0.001670655,0.54339427,0.00045543938,0.0016099999,0.00016590304,0.0005663863,0.001515211,0.43986335],"genre_scores_gemma":[0.20329595,0.0040946645,0.42856348,0.0011440897,0.00087101496,0.000500376,0.0020605305,0.00326651,0.3562035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999081,0.00014067373,0.00006320117,0.00016706741,0.00044807477,0.00009989702],"domain_scores_gemma":[0.99937123,0.00015137039,0.000054340973,0.00019089498,0.00018174949,0.000050447343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937408,0.00088402495,0.0012164905,0.0021203978,0.0012825368,0.0022860733,0.0013635124,0.0008873148,0.041024458],"category_scores_gemma":[0.0027719343,0.00063291244,0.00096021296,0.0019038817,0.001942291,0.0025672098,0.0017695988,0.0027877367,0.016930819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035424284,0.000023322384,0.00009735387,0.00011996105,0.000013530774,0.00006358136,0.00007175009,0.003168591,0.00107751,0.87854916,0.022719085,0.09406073],"study_design_scores_gemma":[0.000022179713,0.000038276426,0.0002034829,0.00006572967,0.000015071225,0.00028245227,0.000057158362,0.010170595,0.0035929698,0.8814833,0.104032606,0.000036132686],"about_ca_topic_score_codex":0.0004620093,"about_ca_topic_score_gemma":0.0007938153,"teacher_disagreement_score":0.041024458,"about_ca_system_score_codex":0.00054708205,"about_ca_system_score_gemma":0.0009663021,"threshold_uncertainty_score":0.13724047},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018815622,0.0027427354,0.572909,0.00118839,0.0022048925,0.00025253612,0.002788665,0.0033845755,0.3957136],"genre_scores_gemma":[0.20124893,0.0042574382,0.59408426,0.001573575,0.0011007977,0.000390374,0.0053003924,0.0027036872,0.18934058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989982,0.00008378107,0.00015814186,0.00031883718,0.00035215038,0.00008888026],"domain_scores_gemma":[0.9986156,0.00048840645,0.00007005502,0.0004414064,0.0003289012,0.000055610162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062761083,0.0007276939,0.0012680576,0.0014898011,0.0016238496,0.0028744598,0.0016552301,0.0008624956,0.028980993],"category_scores_gemma":[0.0038419433,0.00053443783,0.00090965733,0.0026973176,0.0013293948,0.00482639,0.0012050007,0.0027265733,0.013621687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012205592,0.00009583094,0.00027498094,0.00036871585,0.000024979214,0.00014965847,0.00020166597,0.0017170346,0.00254102,0.5648416,0.05364408,0.3760183],"study_design_scores_gemma":[0.000034315937,0.000049551898,0.00020589957,0.00014610299,0.000040700696,0.00047445978,0.00007433855,0.007541268,0.0057212957,0.7617422,0.22393127,0.000038588998],"about_ca_topic_score_codex":0.0009811765,"about_ca_topic_score_gemma":0.0016970662,"teacher_disagreement_score":0.028980993,"about_ca_system_score_codex":0.00060157385,"about_ca_system_score_gemma":0.00088227174,"threshold_uncertainty_score":0.09695113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037576172,0.14065126,0.46309826,0.0020650227,0.0018202033,0.0000723526,0.0003104795,0.001244845,0.38698],"genre_scores_gemma":[0.14587079,0.16030009,0.35987765,0.001758448,0.0035505297,0.00040422226,0.0012072359,0.0015357654,0.32549527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971324,0.000053565775,0.000011453741,0.00005139941,0.0001530891,0.000017181921],"domain_scores_gemma":[0.99982136,0.00007558585,0.000009729524,0.000027758311,0.000048813206,0.000016710537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035877217,0.0013495706,0.0013173091,0.000879065,0.00036727675,0.0013845005,0.00089852524,0.0011683807,0.014821863],"category_scores_gemma":[0.0008059746,0.00037512643,0.00052470487,0.0024891426,0.000867821,0.0009884693,0.0014265105,0.0017138206,0.0066073663],"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.000048007747,0.000116182135,0.00017629284,0.0011750407,0.000044899465,0.00011422643,0.000113338916,0.04898194,0.0025056326,0.1934281,0.13580073,0.6174956],"study_design_scores_gemma":[0.00003893907,0.00011616338,0.00084590283,0.00051293976,0.00003816466,0.00046505604,0.00007540952,0.12300918,0.0019332168,0.40737385,0.46554536,0.00004578567],"about_ca_topic_score_codex":0.00086862297,"about_ca_topic_score_gemma":0.0011729554,"teacher_disagreement_score":0.014821863,"about_ca_system_score_codex":0.00045261625,"about_ca_system_score_gemma":0.0005324061,"threshold_uncertainty_score":0.04958403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011548091,0.012276968,0.37035805,0.0074244305,0.0021365706,0.00005892552,0.0005192993,0.00027917777,0.5953984],"genre_scores_gemma":[0.50871843,0.01895545,0.22719835,0.0043151192,0.005572348,0.00034714083,0.0006347619,0.00068602816,0.23357241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919635,0.0002531369,0.000034022334,0.00015662803,0.00030377964,0.00005605816],"domain_scores_gemma":[0.99939597,0.0003414615,0.000029514202,0.00010369628,0.00009675249,0.000032619246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106373,0.0008844887,0.000996762,0.0008712806,0.0009791949,0.0021331597,0.00093623286,0.0012787976,0.008426824],"category_scores_gemma":[0.0032681404,0.00054453575,0.0006995692,0.0008285716,0.003347123,0.0042008515,0.0018753677,0.0037348983,0.002676653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004703332,0.00000487286,0.000020454965,0.000028136308,0.000004794281,0.0000125691595,0.000042078227,0.0012151038,0.00015884126,0.9871846,0.003765663,0.007558114],"study_design_scores_gemma":[0.000003423012,0.000004516127,0.000053725576,0.000014878716,0.0000025785641,0.000030166217,0.0000055522987,0.0020999669,0.0002006404,0.9772663,0.020311493,0.0000067536907],"about_ca_topic_score_codex":0.00051177153,"about_ca_topic_score_gemma":0.0005228746,"teacher_disagreement_score":0.008426824,"about_ca_system_score_codex":0.0010214166,"about_ca_system_score_gemma":0.0009801339,"threshold_uncertainty_score":0.028190494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006726092,0.0025469689,0.0034500589,0.0015564839,0.00036354648,0.00003412327,0.00040943138,0.00025888573,0.990708],"genre_scores_gemma":[0.0046887067,0.0028040872,0.0027115482,0.0005815298,0.0001353592,0.000035562665,0.00048671002,0.000109829016,0.9884467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998317,0.000023906734,0.0000050513463,0.000024460693,0.00008773732,0.000027161537],"domain_scores_gemma":[0.9998822,0.00003219541,0.000007383774,0.000015465394,0.00003963927,0.000022965572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027672958,0.00038059772,0.00023239948,0.00068823865,0.0006848341,0.0016391394,0.00047053435,0.0005071186,0.18399839],"category_scores_gemma":[0.00059253233,0.00018693437,0.00020344055,0.0009384777,0.00025537793,0.0013809379,0.00096617686,0.0010241263,0.044246104],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150470505,0.000064214066,0.00019445144,0.00006586361,0.0000019081565,0.00004785392,0.00009074706,0.00043832764,0.0001899795,0.08411755,0.547402,0.36737198],"study_design_scores_gemma":[0.000001966791,0.0000057516736,0.00032953257,0.00005367997,9.83605e-7,0.00008024345,0.0000323792,0.00022398825,0.00012946976,0.009060565,0.9900793,0.0000021808792],"about_ca_topic_score_codex":0.0023732788,"about_ca_topic_score_gemma":0.006522833,"teacher_disagreement_score":0.18399839,"about_ca_system_score_codex":0.0008404352,"about_ca_system_score_gemma":0.0013584244,"threshold_uncertainty_score":0.615536},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021244963,0.022577677,0.41010135,0.00114738,0.0014844944,0.000096630654,0.0008377984,0.0011809072,0.56044924],"genre_scores_gemma":[0.049347587,0.049608782,0.2700201,0.0010491468,0.0011347807,0.00044602348,0.0035965575,0.0015353743,0.6232617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999574,0.000056536654,0.000022538323,0.00006876499,0.00023810494,0.000040136245],"domain_scores_gemma":[0.9997242,0.00010956107,0.000017708586,0.00004389003,0.00008302797,0.000021555017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003233187,0.0018649251,0.0015309601,0.0010354626,0.0007673531,0.0043073012,0.0014688455,0.0013075423,0.046238028],"category_scores_gemma":[0.0013559103,0.0007877328,0.00065859134,0.0035235258,0.0008201435,0.002324447,0.0019702916,0.0029260751,0.026849888],"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.00006739877,0.00013619353,0.00014019487,0.0010072279,0.00004849003,0.00014234219,0.00010479872,0.05754928,0.0020611486,0.31582958,0.15239719,0.47051618],"study_design_scores_gemma":[0.000020444375,0.000046335786,0.00019001585,0.00048473125,0.000023733128,0.0003289537,0.000095308525,0.07654866,0.0019748432,0.36535132,0.5548938,0.000041772277],"about_ca_topic_score_codex":0.0010689268,"about_ca_topic_score_gemma":0.0017064875,"teacher_disagreement_score":0.046238028,"about_ca_system_score_codex":0.000668848,"about_ca_system_score_gemma":0.0009831707,"threshold_uncertainty_score":0.15468162},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019290001,0.011475759,0.3545433,0.002044366,0.0017198828,0.000072948875,0.00081770617,0.0021860155,0.62521106],"genre_scores_gemma":[0.06488922,0.01574587,0.14104494,0.001967683,0.0013709433,0.00031154073,0.001939927,0.0027715415,0.7699583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996946,0.000053380525,0.000010275064,0.00006462199,0.00015004243,0.000027144659],"domain_scores_gemma":[0.9997696,0.000094368916,0.000014613266,0.000057668683,0.000043101245,0.000020515765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036996877,0.0013660787,0.001231475,0.000543558,0.00045590635,0.002054851,0.0010367355,0.0010808381,0.08283878],"category_scores_gemma":[0.001352172,0.00048430724,0.00066515536,0.0009914534,0.0006665203,0.0018518956,0.0014797533,0.0024998458,0.032145746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007793059,0.00009626972,0.00012581445,0.0003633919,0.000050692568,0.00006876288,0.00003499904,0.040994965,0.0019806686,0.37816656,0.2837725,0.29426742],"study_design_scores_gemma":[0.000025627456,0.00004474668,0.00025188466,0.00023515394,0.000021539956,0.0001409533,0.000019989466,0.09520703,0.0018469023,0.50066245,0.401517,0.000026786565],"about_ca_topic_score_codex":0.00061724416,"about_ca_topic_score_gemma":0.0010779311,"teacher_disagreement_score":0.08283878,"about_ca_system_score_codex":0.0007083667,"about_ca_system_score_gemma":0.0008182914,"threshold_uncertainty_score":0.27712333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016072054,0.12767379,0.4900174,0.004514374,0.003175544,0.00010684676,0.001159382,0.0023996877,0.36934575],"genre_scores_gemma":[0.05214894,0.11607044,0.44470066,0.0030588873,0.0058892975,0.0006901686,0.0041114646,0.0021623755,0.3711678],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996107,0.00010751935,0.000017198372,0.00007493866,0.00017045316,0.000019275118],"domain_scores_gemma":[0.99943966,0.00034445262,0.000022744121,0.000100423575,0.00007200766,0.000020717585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046435467,0.0014128098,0.0014295937,0.0011171886,0.00037540766,0.0020961084,0.0012673772,0.0009923489,0.0334908],"category_scores_gemma":[0.0017708534,0.00051487365,0.0006531118,0.0028718957,0.0008692991,0.0017838563,0.0011571407,0.0031119462,0.017101277],"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.000020020892,0.000067777226,0.00017384317,0.0007075371,0.00005949915,0.0000578846,0.00007213376,0.011621452,0.0006926191,0.24014913,0.2778722,0.46850598],"study_design_scores_gemma":[0.000014754127,0.00002763335,0.00046155395,0.00040410928,0.000023110975,0.00025023942,0.000035059817,0.036878675,0.0006456888,0.48165813,0.47957194,0.000029133713],"about_ca_topic_score_codex":0.0010004968,"about_ca_topic_score_gemma":0.0019262936,"teacher_disagreement_score":0.0334908,"about_ca_system_score_codex":0.0008052606,"about_ca_system_score_gemma":0.0007466232,"threshold_uncertainty_score":0.1120379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037008852,0.0015629348,0.94407153,0.00024350277,0.00016454286,0.00004798774,0.00007938172,0.0004897855,0.049639434],"genre_scores_gemma":[0.28706038,0.0032163553,0.63271534,0.0003432348,0.00034970406,0.0006248267,0.0006685679,0.0005070089,0.07451458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965715,0.000102534235,0.000012631636,0.00006549949,0.00013763845,0.000024577348],"domain_scores_gemma":[0.9997049,0.00013103253,0.000022265534,0.00007335567,0.000055055567,0.000013320615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004955215,0.0008265297,0.0009090755,0.0003999397,0.00040943455,0.0009297813,0.00090485363,0.0006598891,0.007584574],"category_scores_gemma":[0.0011807008,0.00040354792,0.0003715223,0.0007713505,0.00047422393,0.00072629267,0.0012436575,0.0011542976,0.002177757],"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.00006355067,0.00011226719,0.00022932033,0.00020441505,0.00006142443,0.00004332502,0.000041189596,0.56619126,0.0032499442,0.11717207,0.0166291,0.29600218],"study_design_scores_gemma":[0.000028790286,0.000034999022,0.00016005323,0.000028059383,0.000011947424,0.00004608012,0.000010226759,0.90762734,0.0011166561,0.07281174,0.01811579,0.000008248775],"about_ca_topic_score_codex":0.0005634785,"about_ca_topic_score_gemma":0.0011210686,"teacher_disagreement_score":0.007584574,"about_ca_system_score_codex":0.0005214934,"about_ca_system_score_gemma":0.0006198035,"threshold_uncertainty_score":0.025372922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00405018,0.002352875,0.67830217,0.0011305001,0.00056358817,0.000375843,0.0017313428,0.00371923,0.3077742],"genre_scores_gemma":[0.107292,0.004326056,0.44907793,0.0010387963,0.0005073445,0.0008784002,0.0058931317,0.0019706874,0.42901552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908984,0.00020713625,0.000043777556,0.00018390252,0.00037487163,0.00010038449],"domain_scores_gemma":[0.999358,0.0001925879,0.0000358277,0.00023934511,0.00013050911,0.000043801167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000876349,0.0011300435,0.00094191526,0.001162153,0.00057232316,0.0030462025,0.0016859167,0.0013802665,0.111967325],"category_scores_gemma":[0.0036214013,0.00046689747,0.0006815682,0.0016388125,0.0003846597,0.0023448116,0.0019498708,0.0014673049,0.047500238],"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.00012679338,0.0001507052,0.00033667163,0.0002460684,0.00006919753,0.000065318694,0.000031210002,0.04817974,0.0013510163,0.18755047,0.119651824,0.642241],"study_design_scores_gemma":[0.00011627023,0.00016982427,0.0003100235,0.00016112969,0.000048678256,0.00039716574,0.000048962545,0.23813058,0.004264519,0.38023135,0.3760955,0.000025892652],"about_ca_topic_score_codex":0.00045434383,"about_ca_topic_score_gemma":0.0009409488,"teacher_disagreement_score":0.111967325,"about_ca_system_score_codex":0.0007008463,"about_ca_system_score_gemma":0.0012047333,"threshold_uncertainty_score":0.37456805},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013689947,0.012218368,0.45504093,0.0008811574,0.0016332816,0.000058635884,0.00060240214,0.0014799723,0.52671623],"genre_scores_gemma":[0.053128418,0.017271731,0.27385542,0.0010277207,0.00096674875,0.0002554636,0.002227731,0.0016528146,0.6496139],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971575,0.0000328416,0.000009090086,0.000055534456,0.00017148953,0.000015328415],"domain_scores_gemma":[0.9998441,0.00004367936,0.000008903262,0.00003849848,0.00005356047,0.00001128003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023494467,0.0011817855,0.0011423222,0.000862392,0.0004687115,0.0019975605,0.0009897122,0.0012348684,0.06496328],"category_scores_gemma":[0.00075195456,0.0004900063,0.00077520515,0.000988782,0.0006693958,0.0013198471,0.0015192863,0.0018948971,0.034101132],"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.00006022045,0.0000757141,0.0002049958,0.00070808793,0.000064311804,0.000113738184,0.00008379787,0.031509526,0.009998824,0.27721137,0.17267792,0.50729144],"study_design_scores_gemma":[0.00001852184,0.00005206015,0.00045709,0.00024080816,0.00003137221,0.0005347334,0.000055730492,0.07826604,0.0069253617,0.17135434,0.74201715,0.00004682834],"about_ca_topic_score_codex":0.0006558176,"about_ca_topic_score_gemma":0.0011016525,"teacher_disagreement_score":0.06496328,"about_ca_system_score_codex":0.0004097018,"about_ca_system_score_gemma":0.0005634497,"threshold_uncertainty_score":0.21732384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011143931,0.0025299718,0.9485799,0.00024850667,0.00037084744,0.000024026158,0.00026816272,0.00095424475,0.045909975],"genre_scores_gemma":[0.103355855,0.0067429445,0.73746276,0.0005181441,0.0005096926,0.0002672547,0.0022875047,0.0021063786,0.14674948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997732,0.000031805994,0.000008247183,0.000041506577,0.00013516044,0.000010145893],"domain_scores_gemma":[0.99975795,0.00010613348,0.000011337488,0.000048779628,0.000065528206,0.000010260302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028150942,0.0009189038,0.0009385295,0.0004207164,0.0002253218,0.0013747934,0.00089462125,0.0008209007,0.018222209],"category_scores_gemma":[0.00080947584,0.0004964224,0.00057696743,0.00072796753,0.0005005975,0.00085580436,0.0014143956,0.0014207236,0.008470865],"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.00009026362,0.00008390834,0.00021131702,0.00056971156,0.000077116936,0.00009090868,0.00006247318,0.294116,0.014462382,0.11198411,0.084464274,0.49378762],"study_design_scores_gemma":[0.000010859769,0.000030764546,0.00018661804,0.0000761939,0.00001406462,0.00014254362,0.000018049515,0.8283418,0.0063083353,0.06655482,0.09829119,0.000024809922],"about_ca_topic_score_codex":0.00072440936,"about_ca_topic_score_gemma":0.0012737275,"teacher_disagreement_score":0.018222209,"about_ca_system_score_codex":0.00030827193,"about_ca_system_score_gemma":0.00048353212,"threshold_uncertainty_score":0.0609594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078863726,0.020009333,0.1406757,0.0012145607,0.0018391245,0.000054037107,0.0005164961,0.00088306336,0.8340191],"genre_scores_gemma":[0.02962001,0.03359721,0.16079146,0.0017081207,0.0019368108,0.00026409706,0.0022925108,0.0015749916,0.76821476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997011,0.00004251185,0.000010511237,0.000053409898,0.00016888652,0.00002360344],"domain_scores_gemma":[0.999845,0.00006163355,0.000008613723,0.00003332379,0.000038454997,0.000012898979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028651708,0.0016580289,0.001081743,0.00093830423,0.00047014633,0.0020401913,0.0009584558,0.00087163225,0.059127003],"category_scores_gemma":[0.0008290723,0.00057803554,0.00074374786,0.0017315774,0.00071154593,0.0016299698,0.001256773,0.0031640278,0.035028968],"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.00004213808,0.00012365927,0.000096975404,0.00051561615,0.000032298958,0.0000749746,0.00006304391,0.013819749,0.002055534,0.24504939,0.3282463,0.40988034],"study_design_scores_gemma":[0.000011596487,0.000032254855,0.00023431436,0.0002736352,0.00001565731,0.00022221747,0.000026539004,0.016969848,0.0016192658,0.21849804,0.76207477,0.000021976086],"about_ca_topic_score_codex":0.00069476815,"about_ca_topic_score_gemma":0.0014419099,"teacher_disagreement_score":0.059127003,"about_ca_system_score_codex":0.0007272173,"about_ca_system_score_gemma":0.00080027804,"threshold_uncertainty_score":0.1977995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010544551,0.015653733,0.68404984,0.0012408418,0.0007588616,0.00010464128,0.000740879,0.001551426,0.29484528],"genre_scores_gemma":[0.09177021,0.02571327,0.6163778,0.0012519667,0.001057734,0.0008030368,0.003072105,0.0020042663,0.25794965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904066,0.00026469352,0.00007227676,0.00016933098,0.00039656344,0.000056426084],"domain_scores_gemma":[0.9993462,0.00038523626,0.000029920768,0.00010714876,0.00011150775,0.000019948795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927476,0.0016226409,0.0010168764,0.0016918484,0.00066128647,0.0032346684,0.0012321132,0.0009282831,0.043516666],"category_scores_gemma":[0.0023914147,0.0007752325,0.00095103297,0.0023964676,0.0015736523,0.00345662,0.001307982,0.0025051045,0.012542522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012387984,0.000021150769,0.00003425632,0.00022649813,0.000012990359,0.000029699324,0.00009298479,0.0032230518,0.0006170477,0.8633454,0.02702602,0.10535846],"study_design_scores_gemma":[0.000008410184,0.00000853642,0.00004981746,0.0001246327,0.000009698302,0.000065914,0.000023360464,0.0053063217,0.0005399067,0.7765221,0.21733159,0.00000976357],"about_ca_topic_score_codex":0.0015340238,"about_ca_topic_score_gemma":0.0019983687,"teacher_disagreement_score":0.043516666,"about_ca_system_score_codex":0.0019238264,"about_ca_system_score_gemma":0.001008173,"threshold_uncertainty_score":0.14557773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032014318,0.013299928,0.51150155,0.0011106826,0.0017546314,0.000092240494,0.00032646582,0.0018367101,0.46687642],"genre_scores_gemma":[0.19793566,0.016512305,0.38560292,0.0010882916,0.001264397,0.0003476059,0.001572315,0.0015506342,0.3941259],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976295,0.00004136078,0.000010300668,0.000048590067,0.00011588695,0.000020956904],"domain_scores_gemma":[0.99984217,0.00006036421,0.000006518271,0.00003894285,0.00003753382,0.000014361403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023145658,0.0007837039,0.00073661,0.00049588445,0.00041189557,0.0019078165,0.0011269561,0.0007675593,0.031465705],"category_scores_gemma":[0.000794627,0.00032088908,0.00041363025,0.0009902574,0.000829294,0.0012587011,0.0011915109,0.0016173582,0.011138009],"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.00008040275,0.00007572411,0.00013651414,0.00031052195,0.00004695418,0.00007571471,0.000077802775,0.043213874,0.0049852054,0.37557706,0.08477333,0.49064693],"study_design_scores_gemma":[0.000025449774,0.000067108216,0.00021377449,0.00014995561,0.00001846511,0.00025537104,0.000036777743,0.18410553,0.0042895903,0.43006897,0.3807392,0.000029777106],"about_ca_topic_score_codex":0.00053552625,"about_ca_topic_score_gemma":0.0010117572,"teacher_disagreement_score":0.031465705,"about_ca_system_score_codex":0.0004910469,"about_ca_system_score_gemma":0.0004619135,"threshold_uncertainty_score":0.10526329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015433831,0.07183373,0.652278,0.0010793299,0.0020740354,0.00008489777,0.00054342725,0.0007791077,0.2697841],"genre_scores_gemma":[0.044274393,0.097811155,0.5408054,0.0012986496,0.0028753458,0.0004742615,0.0020674255,0.0015002956,0.30889308],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940956,0.00009148113,0.000024087327,0.000090283946,0.0003602301,0.000024378558],"domain_scores_gemma":[0.9997243,0.00011749829,0.000014454817,0.00003746842,0.00009277213,0.0000135164855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525105,0.002116357,0.0013659839,0.0011486762,0.00037254818,0.002142298,0.0016654228,0.0013000655,0.016298946],"category_scores_gemma":[0.0014503925,0.0008755937,0.0007485899,0.0035819719,0.001109974,0.0021338512,0.0011804844,0.0035043294,0.009824083],"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.000036361023,0.00012518674,0.0001159274,0.0009925225,0.000047612597,0.000070027774,0.000106400235,0.041855626,0.0027606823,0.2847435,0.1726131,0.49653304],"study_design_scores_gemma":[0.00002951448,0.000055444085,0.0005594071,0.0005329077,0.00004298892,0.00033948626,0.00006921072,0.08788265,0.00208031,0.44308788,0.4652753,0.000044846325],"about_ca_topic_score_codex":0.0012652695,"about_ca_topic_score_gemma":0.002153878,"teacher_disagreement_score":0.016298946,"about_ca_system_score_codex":0.0006586745,"about_ca_system_score_gemma":0.00095614046,"threshold_uncertainty_score":0.054525435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012641886,0.029920874,0.16015926,0.0019168024,0.0016479034,0.000050391365,0.00054257206,0.00048990763,0.80400807],"genre_scores_gemma":[0.03862485,0.04483259,0.10126709,0.0017660923,0.0020602923,0.00022106397,0.0017752321,0.0009116528,0.80854106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997099,0.000045267705,0.0000112597945,0.00004687467,0.00017156919,0.00001514583],"domain_scores_gemma":[0.9998109,0.000088398316,0.000009480241,0.00003391791,0.000045229208,0.00001209647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037510696,0.0012545993,0.00086687016,0.0006867429,0.0003131399,0.0016857538,0.00080574607,0.0006469366,0.031147875],"category_scores_gemma":[0.0010558205,0.0004089686,0.00051978894,0.0014253088,0.00086217304,0.0013742168,0.0008940707,0.0028199165,0.012605176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018266615,0.000052978987,0.00008037572,0.00038168763,0.000022228614,0.00004494905,0.000056896944,0.006988967,0.001115476,0.56375206,0.1950722,0.23241396],"study_design_scores_gemma":[0.00000959439,0.00002553127,0.00031923206,0.0002259746,0.000011368158,0.00015389355,0.000019963441,0.010191245,0.0007479548,0.4787687,0.5095128,0.0000138206],"about_ca_topic_score_codex":0.0005381287,"about_ca_topic_score_gemma":0.0010732925,"teacher_disagreement_score":0.031147875,"about_ca_system_score_codex":0.00070313696,"about_ca_system_score_gemma":0.0008455132,"threshold_uncertainty_score":0.104200006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00491649,0.0013874911,0.90100473,0.0005089892,0.00068878644,0.00012280696,0.00031565301,0.0013616225,0.089693405],"genre_scores_gemma":[0.12473394,0.0011752676,0.7407951,0.0007670021,0.00030871254,0.0007144281,0.00076677866,0.001932504,0.12880628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975973,0.00007130086,0.000010530155,0.00004157915,0.000090813744,0.000026106363],"domain_scores_gemma":[0.99979776,0.000074628646,0.000014640711,0.0000411609,0.00005618667,0.000015628788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259012,0.0007593626,0.0013936735,0.0006974978,0.0006899067,0.0009579632,0.0010649423,0.0011091216,0.024945507],"category_scores_gemma":[0.0012623834,0.00037299417,0.0007760678,0.00062544324,0.00065841817,0.0006874662,0.0013274507,0.0015541998,0.009779294],"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.00030277774,0.00015534379,0.00043032493,0.0009856541,0.000184289,0.00029779706,0.00017592285,0.18851732,0.011651771,0.2975619,0.07073688,0.42900005],"study_design_scores_gemma":[0.00012125191,0.00014813496,0.00050362357,0.00020874884,0.000069818285,0.000498271,0.00006989357,0.76540273,0.01044125,0.08458944,0.13785933,0.00008750681],"about_ca_topic_score_codex":0.0013738294,"about_ca_topic_score_gemma":0.0025869678,"teacher_disagreement_score":0.024945507,"about_ca_system_score_codex":0.0004677706,"about_ca_system_score_gemma":0.0011312712,"threshold_uncertainty_score":0.08345097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006709752,0.00915757,0.89550185,0.00042584992,0.00085665385,0.000045358796,0.00029696245,0.00095074944,0.09209401],"genre_scores_gemma":[0.034151934,0.019654563,0.8116105,0.0006729523,0.0014937483,0.00049634586,0.0013698891,0.002376219,0.12817386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994653,0.00016247923,0.000024329518,0.00007469959,0.0002514268,0.000021807362],"domain_scores_gemma":[0.99935955,0.00039317674,0.000023665754,0.00008269106,0.000118586235,0.000022310804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065463263,0.001873414,0.0012677484,0.00067484623,0.00038623626,0.0018329882,0.0013354255,0.00093397166,0.027350638],"category_scores_gemma":[0.0019651158,0.00067574496,0.0008550969,0.0016785389,0.0011381237,0.0017008107,0.0010774302,0.004641961,0.0151817035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039103936,0.00011824019,0.00007734942,0.0008013876,0.000049535218,0.00007303648,0.00014934423,0.036102828,0.0031378227,0.5259332,0.12530373,0.3082144],"study_design_scores_gemma":[0.000033484936,0.000045768305,0.0001807791,0.00025451608,0.000022319204,0.00020637174,0.000047921018,0.15098874,0.0018416769,0.60034883,0.24599288,0.000036734327],"about_ca_topic_score_codex":0.0006125058,"about_ca_topic_score_gemma":0.0010762402,"teacher_disagreement_score":0.027350638,"about_ca_system_score_codex":0.00053874915,"about_ca_system_score_gemma":0.0006346581,"threshold_uncertainty_score":0.091497004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074712224,0.011055965,0.2574486,0.005869315,0.0021365294,0.000044230204,0.000478417,0.00024534436,0.7152504],"genre_scores_gemma":[0.41929978,0.020123182,0.18917175,0.004874661,0.0056775417,0.00030696843,0.0006663888,0.000845756,0.35903394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992142,0.0002529727,0.000032491185,0.00014906771,0.0002990362,0.000052212738],"domain_scores_gemma":[0.9994466,0.00032251325,0.000026369335,0.00008943664,0.000087401844,0.000027636695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012303565,0.00087879994,0.00082516123,0.00086281495,0.00087987777,0.0019960478,0.0008623457,0.0011683839,0.010325463],"category_scores_gemma":[0.0029108082,0.0004926078,0.00063452177,0.00079695205,0.0034281556,0.0037650776,0.0017235941,0.0035377368,0.0035142894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048054617,0.0000045612933,0.000017270542,0.00003148691,0.0000044281383,0.000012002196,0.00004111527,0.0011025616,0.000174406,0.985521,0.004685737,0.008400643],"study_design_scores_gemma":[0.0000028945124,0.0000047091,0.000058136564,0.000019152818,0.0000026168352,0.000033568496,0.000006253292,0.0017926331,0.00023829375,0.9623433,0.035491187,0.0000071885565],"about_ca_topic_score_codex":0.00054288027,"about_ca_topic_score_gemma":0.00055537984,"teacher_disagreement_score":0.010325463,"about_ca_system_score_codex":0.001082968,"about_ca_system_score_gemma":0.0009275167,"threshold_uncertainty_score":0.034542084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013394427,0.02442175,0.80949914,0.0006910693,0.0024106244,0.000038449383,0.0003437519,0.0018010332,0.15945475],"genre_scores_gemma":[0.04329803,0.053230435,0.46708727,0.00096774084,0.0045842766,0.0002237949,0.0014710311,0.0019539872,0.42718345],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960655,0.000064987704,0.000021292835,0.000059116708,0.00022922519,0.000018776405],"domain_scores_gemma":[0.9995585,0.00022072866,0.000019733026,0.00008895921,0.00009803598,0.000013885508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365806,0.001267029,0.0011182447,0.0010660681,0.00025026334,0.0020704218,0.0006210763,0.00080816523,0.026786922],"category_scores_gemma":[0.0011307423,0.00041165593,0.0005034668,0.0023275553,0.00088805833,0.00128256,0.00085355795,0.0022510546,0.020992622],"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.0000581965,0.000051535,0.0000958025,0.0007974833,0.00006116724,0.00012931802,0.00012664468,0.013515746,0.0126547925,0.28629798,0.11686975,0.56934166],"study_design_scores_gemma":[0.000021900769,0.000106058775,0.0006667011,0.00030244672,0.000045219003,0.00071102194,0.000039127663,0.08496364,0.009817832,0.3391462,0.5641116,0.00006826967],"about_ca_topic_score_codex":0.00039087486,"about_ca_topic_score_gemma":0.0006367963,"teacher_disagreement_score":0.026786922,"about_ca_system_score_codex":0.00032208994,"about_ca_system_score_gemma":0.00053337094,"threshold_uncertainty_score":0.08961117},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003178547,0.01208325,0.57313055,0.0019295131,0.0015634871,0.00010347414,0.0015037514,0.0010983507,0.40540907],"genre_scores_gemma":[0.092952564,0.027581923,0.19688775,0.0012311224,0.0018018524,0.00056744344,0.005944174,0.0010499052,0.6719833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997327,0.000050691815,0.00000984134,0.00005354495,0.00013411444,0.000019098175],"domain_scores_gemma":[0.99987435,0.00004429685,0.000010190616,0.000022284647,0.000038543363,0.000010428411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000265638,0.0013522131,0.00090980687,0.00048888964,0.00034906002,0.0014184862,0.0007856765,0.00073691644,0.028409248],"category_scores_gemma":[0.0006213363,0.00044535406,0.00061212445,0.0011655422,0.00051057973,0.0008315409,0.0009362047,0.0016785109,0.011034142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031715907,0.000093120136,0.00017656256,0.00033690213,0.000043002237,0.000060654962,0.000052885836,0.12365618,0.0025040975,0.42097175,0.17261143,0.27946165],"study_design_scores_gemma":[0.000021298032,0.00004054705,0.00041910927,0.00013624196,0.00001978772,0.0001706175,0.0000306029,0.19986288,0.0014588081,0.34679437,0.45102307,0.000022654347],"about_ca_topic_score_codex":0.0012824391,"about_ca_topic_score_gemma":0.0023406213,"teacher_disagreement_score":0.028409248,"about_ca_system_score_codex":0.000807332,"about_ca_system_score_gemma":0.00092796347,"threshold_uncertainty_score":0.095038414},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012897353,0.0016787575,0.5621287,0.0004296498,0.0014174111,0.00016697386,0.0005395346,0.0015354798,0.4192062],"genre_scores_gemma":[0.22677757,0.003854867,0.43299735,0.0010227895,0.00078621734,0.0005069104,0.0019397995,0.0028016071,0.32931295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918383,0.00012897121,0.00005640926,0.0001503732,0.00038825738,0.00009206859],"domain_scores_gemma":[0.9993781,0.00014599167,0.00005458047,0.00019288568,0.00017839878,0.00005011003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010636,0.00082954735,0.0011679166,0.0020978595,0.0013186384,0.002117981,0.0012458895,0.0008197637,0.03780098],"category_scores_gemma":[0.002743053,0.00061280833,0.0008737589,0.001939605,0.0018210193,0.0025369448,0.0016964693,0.002556232,0.014985405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035732402,0.00002491856,0.00010435973,0.000110968256,0.000012841847,0.000059918293,0.00007119607,0.003165844,0.001011034,0.8722902,0.022450551,0.10066248],"study_design_scores_gemma":[0.000023858702,0.00003839318,0.00019980209,0.000055758384,0.000014363061,0.00025586804,0.000051467556,0.010146392,0.0034029775,0.89600325,0.08977679,0.000031104675],"about_ca_topic_score_codex":0.00044862277,"about_ca_topic_score_gemma":0.00080773945,"teacher_disagreement_score":0.03780098,"about_ca_system_score_codex":0.00053322833,"about_ca_system_score_gemma":0.0009124229,"threshold_uncertainty_score":0.12645686},"labels":[],"label_agreement":null}]}