{"meta":{"query_hash":"a8563e9b44bc","filters":{"venue":"Optimization Letters"},"cohort_total":79,"direct_labels_cover":1,"predictions_cover":79,"exported":79,"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/a8563e9b44bc","api":"https://metacan.xera.ac/api/v1/cohort?venue=Optimization+Letters"},"results":[{"id":"W1100220100","doi":"10.1007/s11590-015-0927-y","title":"Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Transport Systems and Technology","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Western Canada Research Grid","keywords":"Circulant matrix; Computational intelligence; Metaheuristic; Computer science; Mathematical optimization; Mathematics; Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.023703231626806712,"score_gpt":0.21130793611003193,"score_spread":0.18760470448322522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1100220100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006453067,0.00044810405,0.996043,0.0006669127,0.00063602335,0.00038465913,0.00001497731,0.0006752843,0.00048571712],"genre_scores_gemma":[0.335437,0.00033027134,0.6632367,0.00019435753,0.00024215101,0.00017794216,0.00025008037,0.00010720065,0.000024345914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990841,0.000013763159,0.00031652997,0.0001952505,0.00013665449,0.00025365825],"domain_scores_gemma":[0.9995702,0.000031463645,0.00007344995,0.00018071636,0.000062428764,0.00008172467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016437603,0.00016855831,0.00022737485,0.00018438627,0.00007116972,0.000044826025,0.00012828228,0.00012576021,0.00001531809],"category_scores_gemma":[0.000024758245,0.00017658052,0.000059232083,0.0001961082,0.00001876662,0.0001954008,0.0000090733565,0.0000858661,0.000005663917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060195493,0.000010089775,0.00006966338,0.00008458234,0.00005099898,0.000005512872,0.00020459139,0.9969703,0.000054084536,0.0011315843,0.001275422,0.00013718258],"study_design_scores_gemma":[0.00068324205,0.000020094663,0.000004221947,0.000030284154,0.00005303253,0.0000069084867,0.00006616854,0.99398243,0.000027068747,0.000042298667,0.0048697386,0.00021448637],"about_ca_topic_score_codex":0.000006567553,"about_ca_topic_score_gemma":0.0000024397116,"teacher_disagreement_score":0.3347917,"about_ca_system_score_codex":0.00009095693,"about_ca_system_score_gemma":0.00001085999,"threshold_uncertainty_score":0.7200745},"labels":[],"label_agreement":null},{"id":"W1148679896","doi":"10.1007/s11590-015-0939-7","title":"Machine scheduling with a maintenance interval and job delivery coordination","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Job shop scheduling; Computer science; Computational intelligence; Mathematical optimization; Scheduling (production processes); Distribution center; Interval (graph theory); Distributed computing; Artificial intelligence; Mathematics; Embedded system","score_opus":0.009302570831021779,"score_gpt":0.19525225775025798,"score_spread":0.1859496869192362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1148679896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0393361,0.00018558478,0.95788956,0.001344118,0.00020326737,0.00010674567,0.000004509512,0.00032439947,0.00060572027],"genre_scores_gemma":[0.37393206,0.000050631585,0.6250092,0.00074069866,0.00006957818,0.000014495273,0.000050909126,0.000045102548,0.000087335655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.000021601567,0.00015780119,0.00016490587,0.00014849706,0.00016267461],"domain_scores_gemma":[0.99961096,0.000019281008,0.000036792942,0.00011122718,0.00011075053,0.0001110124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013053649,0.00014137801,0.00012202301,0.00011728354,0.00005142716,0.00008884548,0.00006880096,0.00004608704,0.000018867839],"category_scores_gemma":[0.00003644071,0.00013129669,0.000016339318,0.00023216144,0.000043029715,0.00030201848,0.000017362529,0.000110574925,0.000007954724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017808188,0.000005118825,0.0008607906,0.000011465623,0.00002017335,0.000004687209,0.00018779126,0.99754167,0.000058460813,0.000053842014,0.0004228498,0.0008153276],"study_design_scores_gemma":[0.00084638206,0.000025913376,0.00009488667,0.000041497795,0.000015092417,0.000023997254,0.00012493317,0.9983772,0.00007606231,0.000004016499,0.00019037022,0.0001796718],"about_ca_topic_score_codex":0.000013976637,"about_ca_topic_score_gemma":0.000003750147,"teacher_disagreement_score":0.33459595,"about_ca_system_score_codex":0.0000693026,"about_ca_system_score_gemma":0.000012891855,"threshold_uncertainty_score":0.5354124},"labels":[],"label_agreement":null},{"id":"W1929806008","doi":"10.1007/s11590-015-0920-5","title":"On the order of the operators in the Douglas–Rachford algorithm","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Order (exchange); Computer science; Mathematics; Algorithm; Artificial intelligence; Economics","score_opus":0.015303671949726535,"score_gpt":0.21836981839208475,"score_spread":0.2030661464423582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929806008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087155536,0.0000070278907,0.91030586,0.08730723,0.00024404799,0.00017191996,0.0000020616098,0.000015589076,0.0010746995],"genre_scores_gemma":[0.35452142,0.00003230464,0.4857263,0.15841746,0.00026997784,0.00012673686,0.000041321236,0.000035318695,0.0008291625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987572,0.0003031422,0.00021793177,0.00016231868,0.00044675052,0.000112662245],"domain_scores_gemma":[0.9990365,0.00017274477,0.00011998595,0.00048586787,0.00016040313,0.000024504878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060623337,0.00009085961,0.00008535181,0.00007895735,0.0001344651,0.00013644782,0.00097384915,0.000029327899,0.00004690794],"category_scores_gemma":[0.00018598056,0.000042043514,0.00005337752,0.0015762233,0.000051157513,0.00024117711,0.00008981628,0.00011238915,0.000011659394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013901482,0.00003123147,0.0001630549,5.0851605e-7,0.000008925209,3.2614346e-7,0.0009442056,0.95852816,0.0000028984516,0.033901066,0.0061410936,0.00027714318],"study_design_scores_gemma":[0.00022319757,0.00001137627,0.00028983012,0.0000053337103,0.0000065808485,0.0000013291823,0.000113241746,0.99771416,0.000028364222,0.00021282907,0.0013303685,0.000063362604],"about_ca_topic_score_codex":0.000040353723,"about_ca_topic_score_gemma":0.000005432504,"teacher_disagreement_score":0.4245796,"about_ca_system_score_codex":0.000033540415,"about_ca_system_score_gemma":0.000062869745,"threshold_uncertainty_score":0.18096702},"labels":[],"label_agreement":null},{"id":"W1966840469","doi":"10.1007/s11590-008-0109-2","title":"On the upper bounds of the minimum number of rows of disjunct matrices","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"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 Alberta","funders":"","keywords":"Row; Disjunct; Column (typography); Row and column spaces; Combinatorics; Matrix (chemical analysis); Mathematics; Upper and lower bounds; Value (mathematics); Chemistry; Geometry; Computer science; Statistics; Connection (principal bundle); Population; Chromatography; Mathematical analysis","score_opus":0.005580011362657026,"score_gpt":0.17649678357502357,"score_spread":0.17091677221236654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966840469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876629,0.00003567542,0.006580151,0.00035746297,0.00024329104,0.000117913914,0.000008957823,0.000017979932,0.00497568],"genre_scores_gemma":[0.9994324,0.0000176254,0.00029272086,0.00013333918,0.000016477836,0.000005668863,0.0000021479232,0.000012417981,0.00008723149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994694,0.000052944597,0.0002090166,0.000054913908,0.00014129623,0.00007245704],"domain_scores_gemma":[0.999563,0.000087805456,0.000091811504,0.00022354393,0.00002371878,0.000010130658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009502671,0.00007129686,0.00011258538,0.000032458403,0.000042626973,0.0000036202237,0.00015283676,0.00003057425,0.00014927027],"category_scores_gemma":[0.000016930837,0.000042315656,0.000082939114,0.00023357965,0.00009829839,0.000049244896,0.000010604803,0.000048274316,0.0000037520422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010124182,0.000016360178,0.0042162887,0.000049953967,0.000039815382,2.4899595e-7,0.0006901121,0.9814302,0.004501031,0.0031626641,0.005870314,0.000012926094],"study_design_scores_gemma":[0.0034834687,0.00019718222,0.03874171,0.0012165331,0.00036794864,0.00010116503,0.002101355,0.7341002,0.21034963,0.0013658679,0.006472086,0.0015028062],"about_ca_topic_score_codex":0.0000066164394,"about_ca_topic_score_gemma":3.4808946e-7,"teacher_disagreement_score":0.24732992,"about_ca_system_score_codex":0.000007233428,"about_ca_system_score_gemma":0.0000043159534,"threshold_uncertainty_score":0.17255825},"labels":[],"label_agreement":null},{"id":"W1977873546","doi":"10.1007/s11590-006-0032-3","title":"On pitfalls in computing the geodetic number of a graph","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"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; HEC Montréal","funders":"","keywords":"Geodetic datum; Combinatorics; Mathematics; Shortest path problem; Graph; Geodesic; Discrete mathematics","score_opus":0.004860542944742337,"score_gpt":0.20948864178880877,"score_spread":0.20462809884406644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977873546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016216572,0.0000034608333,0.9775623,0.003838014,0.000112347894,0.0000943032,8.530564e-7,0.000031345808,0.0021407832],"genre_scores_gemma":[0.76045287,0.0000049947316,0.23473719,0.0045858603,0.00005542908,0.0000050804474,0.00002589861,0.000009735303,0.00012295827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993763,0.000040613857,0.00015738845,0.00015351415,0.0001532992,0.00011891611],"domain_scores_gemma":[0.9995872,0.000060047056,0.00007513414,0.00025585043,0.00001337326,0.000008390064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636247,0.00006167956,0.000064607375,0.00007783655,0.00004282991,0.00008131315,0.00041695163,0.000012066059,0.000014126137],"category_scores_gemma":[0.000007095338,0.00004796421,0.000024157378,0.0004371035,0.000028966722,0.00022073222,0.00009089047,0.000048058908,0.0000127985795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7984455e-7,0.000028809309,0.00094462506,0.0000032418575,0.0000024949272,0.0000028204693,0.000052859617,0.9620091,0.000019553094,0.03258109,0.0032296532,0.001124896],"study_design_scores_gemma":[0.00024812977,0.0000063737752,0.0030865308,0.000019020434,0.000002200362,9.349871e-7,0.000005497984,0.9955676,0.000043401407,0.000758026,0.00018342028,0.00007885257],"about_ca_topic_score_codex":0.00006606783,"about_ca_topic_score_gemma":0.0000028462675,"teacher_disagreement_score":0.7442363,"about_ca_system_score_codex":0.000010615887,"about_ca_system_score_gemma":0.000003385,"threshold_uncertainty_score":0.19559237},"labels":[],"label_agreement":null},{"id":"W1977899896","doi":"10.1007/s11590-013-0688-4","title":"A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Variance (accounting); Mathematical optimization; Rank (graph theory); Mathematics; Function (biology); Divergence (linguistics); Computational intelligence; Computer science; Artificial intelligence","score_opus":0.012320311983936696,"score_gpt":0.25321201544526784,"score_spread":0.24089170346133115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977899896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012212942,0.000011369566,0.9907425,0.0067467405,0.0003368526,0.0011428072,0.00001686695,0.0001558861,0.0008347566],"genre_scores_gemma":[0.0018435881,0.000004141057,0.9918812,0.0057319878,0.000056248973,0.0001915058,0.000007949321,0.00003576869,0.000247609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973146,0.0006000544,0.00042404857,0.0006547432,0.0005946286,0.00041196778],"domain_scores_gemma":[0.9976881,0.00041786188,0.00023544593,0.00085434096,0.0006510319,0.00015320748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005281156,0.00026838068,0.00032240548,0.00027323485,0.00023376915,0.00016282756,0.0011189034,0.000085541295,0.00014902391],"category_scores_gemma":[0.00017289052,0.0002190563,0.00011686165,0.0020787735,0.00009987484,0.00085826806,0.00031727724,0.00019297973,0.000032577347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007017637,0.00005610789,0.000022429675,0.000005844693,0.000032040854,0.0000012647345,0.0003746543,0.978817,0.0012354203,0.0007176812,0.0007076225,0.018022904],"study_design_scores_gemma":[0.0006985439,0.000047251793,0.00019535793,0.000039419807,0.000011966229,0.0000032474122,0.000025308436,0.99000335,0.008413416,0.0000658188,0.0002409763,0.00025535622],"about_ca_topic_score_codex":0.0001437789,"about_ca_topic_score_gemma":0.0000010398295,"teacher_disagreement_score":0.017767547,"about_ca_system_score_codex":0.0001747671,"about_ca_system_score_gemma":0.0001658541,"threshold_uncertainty_score":0.89328563},"labels":[],"label_agreement":null},{"id":"W1983531822","doi":"10.1007/s11590-014-0828-5","title":"On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"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":"Computational intelligence; Euclidean geometry; Mathematical optimization; Mathematics; Computer science; Artificial intelligence","score_opus":0.10348452853156816,"score_gpt":0.2886102378094453,"score_spread":0.18512570927787714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983531822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007454974,0.0000024826795,0.96809375,0.022331713,0.00021863286,0.00047026857,0.000014564646,0.00013904496,0.0012745437],"genre_scores_gemma":[0.38910443,0.0000031282882,0.6072199,0.0034012217,0.0000721105,0.000053313353,0.00004243936,0.000017833614,0.0000856284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984058,0.0002151725,0.0004261091,0.00037567274,0.0002875071,0.00028975014],"domain_scores_gemma":[0.99841774,0.0006240058,0.00031600508,0.00042291978,0.00015254751,0.000066808665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007851807,0.0001697378,0.00021013602,0.00013916717,0.0005220009,0.00013869774,0.00046067178,0.00006139755,0.00015949369],"category_scores_gemma":[0.00044287695,0.00014120202,0.000119849305,0.00040812758,0.00025470436,0.00046022967,0.00010012132,0.00012842756,0.000011781162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021012811,0.000037612048,0.00018077275,0.000011677452,0.000014960636,1.0433198e-7,0.00028350507,0.9287043,0.00025416576,0.06650166,0.003194901,0.00079532684],"study_design_scores_gemma":[0.00035634777,0.00008203961,0.0007122887,0.000028312663,0.00001066827,0.0000020543212,0.00002125568,0.9974992,0.0002697782,0.00038392135,0.00046880066,0.00016531715],"about_ca_topic_score_codex":0.0000062944105,"about_ca_topic_score_gemma":0.000003174045,"teacher_disagreement_score":0.38164946,"about_ca_system_score_codex":0.00007733026,"about_ca_system_score_gemma":0.000055733097,"threshold_uncertainty_score":0.5758051},"labels":[],"label_agreement":null},{"id":"W2004594161","doi":"10.1007/s11590-015-0859-6","title":"A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Computational intelligence; Mathematical optimization; Job scheduler; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.016414328054018552,"score_gpt":0.242009478236808,"score_spread":0.22559515018278944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004594161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001993272,0.00007726205,0.9918012,0.004431892,0.00039660357,0.0003539858,0.000013016868,0.00048811786,0.0004446517],"genre_scores_gemma":[0.014660909,0.0000091605825,0.9817701,0.0027770011,0.0004067073,0.000120686644,0.00008318355,0.00010970481,0.000062575724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988549,0.000034536497,0.00024206903,0.00027450654,0.00028731817,0.00030666488],"domain_scores_gemma":[0.9992492,0.00012216633,0.00007030662,0.00026283172,0.00017273457,0.00012273299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003026161,0.00025817967,0.00018468397,0.00013164277,0.0002113508,0.00021721136,0.00019977002,0.0000642967,0.000026341],"category_scores_gemma":[0.000104842606,0.00018774919,0.000054229677,0.0004315618,0.000050562896,0.0002384408,0.00001612072,0.0001865256,0.000015386975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023916136,0.000013188376,0.000012626444,0.000015446902,0.000024079101,0.0000021633655,0.0004610216,0.9873459,0.00005549742,0.000039427116,0.00052378065,0.011482962],"study_design_scores_gemma":[0.0011584578,0.000037577436,0.000002242058,0.00007197975,0.000032203916,0.000008281912,0.00013649835,0.99757534,0.0003183696,0.00001561551,0.00036403516,0.0002794045],"about_ca_topic_score_codex":0.0000064481897,"about_ca_topic_score_gemma":0.000002396987,"teacher_disagreement_score":0.012667637,"about_ca_system_score_codex":0.000092452756,"about_ca_system_score_gemma":0.00004402521,"threshold_uncertainty_score":0.7656189},"labels":[],"label_agreement":null},{"id":"W2010081598","doi":"10.1007/s11590-013-0641-6","title":"The NC-proximal average for multiple functions","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Banach Space Theory","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":"University of British Columbia, Okanagan Campus; Kelowna General Hospital","funders":"","keywords":"Mathematical proof; Discontinuity (linguistics); Computational intelligence; Function (biology); Finite set","score_opus":0.01758841269589743,"score_gpt":0.25589790954997943,"score_spread":0.238309496854082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010081598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053267376,0.000010989999,0.9839044,0.009008183,0.000229428,0.0008679391,0.000008472128,0.00014000296,0.00050382834],"genre_scores_gemma":[0.1391584,0.000016312233,0.8467873,0.0033234016,0.00037595106,0.0012467734,0.000066053246,0.00012180789,0.008904035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999259,0.000043844662,0.00018082524,0.00016027015,0.0001143651,0.00024172629],"domain_scores_gemma":[0.9985005,0.0009404503,0.00011045597,0.00030832607,0.000096173324,0.000044087992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016446873,0.00011560575,0.00009788176,0.000037337835,0.00042944835,0.00007239213,0.00013950092,0.000038681712,0.00018850518],"category_scores_gemma":[0.00062014506,0.000085916065,0.000068021836,0.00010289863,0.00007529439,0.00026081642,0.000028048053,0.00008035678,0.00006701033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043497992,0.00005783656,0.000135266,0.000030048237,0.000058551625,5.0864764e-7,0.000317994,0.86070126,0.0037705735,0.017958375,0.11503494,0.0018911527],"study_design_scores_gemma":[0.0015995037,0.000057189874,0.00007915045,0.000020666215,0.00005261136,0.0000051604834,0.00044992074,0.9496863,0.0009927747,0.025043642,0.021600379,0.0004127015],"about_ca_topic_score_codex":0.0000046632813,"about_ca_topic_score_gemma":0.000006101798,"teacher_disagreement_score":0.13711715,"about_ca_system_score_codex":0.000053753738,"about_ca_system_score_gemma":0.000009980076,"threshold_uncertainty_score":0.35035554},"labels":[],"label_agreement":null},{"id":"W2014643492","doi":"10.1007/s11590-009-0144-7","title":"An efficient string sorting algorithm for weighing matrices of small weight","year":2009,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Wilfrid Laurier University","keywords":"Sorting; String (physics); Computational intelligence; Algorithm; Mathematics; Connection (principal bundle); Range (aeronautics); Combinatorics; Computer science; Artificial intelligence","score_opus":0.009961612166301382,"score_gpt":0.2369741017125232,"score_spread":0.22701248954622183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014643492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033427174,0.000049860708,0.9953879,0.0006351386,0.00024529983,0.00018384849,0.0000065634094,0.00011113353,0.000037536898],"genre_scores_gemma":[0.015468028,0.000009877189,0.9838041,0.0005447183,0.00012251487,0.000005515372,0.000033044384,0.0000078345965,0.00000436928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894744,0.00003161823,0.00030081315,0.0003183604,0.00018476648,0.00021698081],"domain_scores_gemma":[0.99921626,0.00005310514,0.00024227127,0.00034481767,0.000079419864,0.000064107866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023380523,0.000114741786,0.00013905881,0.00013848067,0.00016643478,0.00014179706,0.0005250122,0.000038469298,0.0000046176933],"category_scores_gemma":[0.000013433175,0.00010632515,0.00004999296,0.0002743997,0.000012890177,0.0004979385,0.000059718004,0.000056837012,7.8263366e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020887535,0.000046837547,0.000013334089,0.0000057871894,0.0000036606298,0.0000013480529,0.00014591463,0.81208634,0.0013107475,0.0010851647,0.000090569,0.18520822],"study_design_scores_gemma":[0.00029703637,0.000062037456,0.000069521746,0.000034865436,0.0000063578127,0.0000017307319,0.000011341815,0.9965792,0.0025855699,0.000051764502,0.0001694091,0.00013117096],"about_ca_topic_score_codex":0.000007452914,"about_ca_topic_score_gemma":1.14367324e-7,"teacher_disagreement_score":0.18507704,"about_ca_system_score_codex":0.00002444888,"about_ca_system_score_gemma":0.00001724544,"threshold_uncertainty_score":0.43358135},"labels":[],"label_agreement":null},{"id":"W2022954527","doi":"10.1007/s11590-006-0024-3","title":"Disjunctive cuts for continuous linear bilevel programming","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"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":"Air Force Office of Scientific Research","keywords":"Bilevel optimization; Linear programming; Duality (order theory); Relaxation (psychology); Mathematical optimization; Computational intelligence; Computer science; Mathematics; Linear programming relaxation; Domain (mathematical analysis); Optimization problem; Artificial intelligence; Discrete mathematics","score_opus":0.007874505805032505,"score_gpt":0.21972093456933942,"score_spread":0.2118464287643069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022954527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011890969,0.000010227636,0.99005353,0.00874201,0.00018037723,0.00031835667,0.000008104034,0.00018932989,0.00037914238],"genre_scores_gemma":[0.016263992,0.0000026324092,0.98003405,0.0022668708,0.00019240685,0.00009582654,0.00020682425,0.000015849388,0.00092156656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893713,0.000035927565,0.0002655485,0.00034015154,0.00020721124,0.00021403284],"domain_scores_gemma":[0.99925834,0.000082619656,0.00015794608,0.00021522611,0.00023974627,0.00004612519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001448446,0.000130638,0.00014679322,0.00015999812,0.0001980038,0.0001985422,0.00027333715,0.00004537308,0.00003122581],"category_scores_gemma":[0.00004810189,0.00012418295,0.000103751714,0.00056755927,0.000026518765,0.0005174412,0.000044732966,0.00004437486,0.000013182006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005674904,0.00005409207,0.00028076587,0.0000041442345,0.000020571384,7.8256164e-7,0.000046967263,0.97854704,0.0000879849,0.016170876,0.0030691926,0.0017119342],"study_design_scores_gemma":[0.00044816968,0.000024481882,0.00019857455,0.0000049559526,0.000019363119,0.0000015707031,0.00000621181,0.9903423,0.00009727223,0.00016370657,0.008522673,0.00017068232],"about_ca_topic_score_codex":0.000030928022,"about_ca_topic_score_gemma":0.0000031481168,"teacher_disagreement_score":0.016145082,"about_ca_system_score_codex":0.00004682952,"about_ca_system_score_gemma":0.00003087759,"threshold_uncertainty_score":0.5064034},"labels":[],"label_agreement":null},{"id":"W2030454071","doi":"10.1007/s11590-011-0428-6","title":"Efficient use of parallelism in algorithmic parameter optimization applications","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"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":"Parallelism (grammar); Computer science; Solver; Computational intelligence; Context (archaeology); Task (project management); Minification; Identification (biology); Mathematical optimization; Optimization problem; Algorithm; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.08854811697420045,"score_gpt":0.31406325915510647,"score_spread":0.22551514218090601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030454071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019141694,0.000016152751,0.99610394,0.00024866543,0.00006300561,0.0012034967,0.000019036845,0.00010962516,0.0003218851],"genre_scores_gemma":[0.008239286,0.000058000245,0.9908102,0.0002537712,0.000029586921,0.00034380474,0.00006551522,0.00006809888,0.00013174603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978374,0.00016674065,0.000769098,0.00042848504,0.00042947996,0.00036876183],"domain_scores_gemma":[0.9983127,0.00039470967,0.0003487896,0.0005600959,0.00027918813,0.000104486506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028627567,0.00023375395,0.00032241203,0.00055652426,0.00008254001,0.000037748716,0.00026884564,0.0001267846,0.0005671156],"category_scores_gemma":[0.00043688307,0.00024570175,0.00008619164,0.0010498319,0.00016082756,0.000284517,0.00008458309,0.00020106438,0.000011538217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000305946,0.00027781946,0.00022271306,0.000033530796,0.000019375608,0.0000036885372,0.00048632082,0.99627495,0.000057484885,0.0017551434,0.0001485696,0.0006898377],"study_design_scores_gemma":[0.0006999265,0.000023725952,0.000084740575,0.000032973432,0.000018866787,0.000004358287,0.00005396239,0.9980872,0.00028524298,0.00037496924,0.00009231674,0.000241688],"about_ca_topic_score_codex":0.00003157962,"about_ca_topic_score_gemma":0.0000028790225,"teacher_disagreement_score":0.006325117,"about_ca_system_score_codex":0.0001278858,"about_ca_system_score_gemma":0.00004270649,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W2031089199","doi":"10.1007/s11590-014-0789-8","title":"Characterizing the optimality gap and the optimal packings for the bin packing problem","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","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":"University of Waterloo","funders":"","keywords":"Bin packing problem; Column generation; Benchmark (surveying); Mathematical optimization; Bin; Heuristic; Set (abstract data type); Lagrangian relaxation; Column (typography); Relaxation (psychology); Packing problems; Mathematics; Set packing; Computer science; Algorithm","score_opus":0.011155338939447047,"score_gpt":0.202790661698188,"score_spread":0.19163532275874096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031089199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019775708,0.00014382823,0.96562225,0.029475695,0.00038230987,0.0010650015,0.000009283384,0.00026094605,0.0010631115],"genre_scores_gemma":[0.86605835,0.0006270722,0.115782365,0.015675133,0.00068881846,0.0006683012,0.00009975638,0.00018957745,0.00021062329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987376,0.00014323714,0.00034580688,0.00023816513,0.0001925155,0.00034272185],"domain_scores_gemma":[0.99860126,0.00076122856,0.00013453451,0.00038196056,0.0000722997,0.000048704936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013233343,0.00023999553,0.00020520033,0.000051194067,0.00069464225,0.00048334006,0.00032304964,0.00007169849,0.00004040511],"category_scores_gemma":[0.00011466526,0.00012856566,0.00009812881,0.00024787933,0.00025317247,0.00025421873,0.00005874115,0.00023137171,0.000004916859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002578396,0.0000041473854,0.000070526825,0.000041195457,0.000053169486,9.998168e-8,0.0014630489,0.9919087,0.00028995573,0.002946642,0.0015505016,0.0016462276],"study_design_scores_gemma":[0.0009892777,0.000011685115,0.00010447648,0.0000351382,0.00005958879,0.000007476863,0.000116744486,0.9821942,0.0001638072,0.00004628993,0.016073264,0.00019809442],"about_ca_topic_score_codex":0.0000106734715,"about_ca_topic_score_gemma":0.0000025619634,"teacher_disagreement_score":0.8640808,"about_ca_system_score_codex":0.000030410009,"about_ca_system_score_gemma":0.000008350646,"threshold_uncertainty_score":0.5342697},"labels":[],"label_agreement":null},{"id":"W2040539280","doi":"10.1007/s11590-013-0672-z","title":"A fluence map optimization model for restoring traditional fractionation in IMRT treatment planning","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"University of Toronto","funders":"","keywords":"Radiation treatment planning; Radiation therapy; Dose fractionation; Fraction (chemistry); Medicine; Fractionation; Fluence; Nuclear medicine; Dosimetry; Computer science; Medical physics; Radiology; Irradiation; Chemistry","score_opus":0.028989465033733973,"score_gpt":0.2778612898883049,"score_spread":0.2488718248545709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040539280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003526506,0.000012370025,0.99427444,0.0012169363,0.000074866606,0.0006414458,0.000019094803,0.0000752312,0.00015908686],"genre_scores_gemma":[0.11080579,0.0000054634806,0.88700897,0.0003251779,0.00018374868,0.0010337435,0.00044466936,0.00003252785,0.00015994172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992644,0.000018135192,0.0002133039,0.00022947128,0.00011102806,0.00016363029],"domain_scores_gemma":[0.9996197,0.000055793338,0.0001185363,0.00011131537,0.00006053041,0.000034087705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047849917,0.00013420303,0.00011196303,0.00014317881,0.000110983776,0.000052924308,0.000063066276,0.000034985816,0.00020245157],"category_scores_gemma":[0.0000043888203,0.00014331393,0.000046340312,0.00011207744,0.000018895533,0.0007846047,0.000004436664,0.00005599602,0.0000013497248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010594584,0.000056861747,0.0018106138,0.0000031931268,0.000014167284,1.3182758e-7,0.0002261986,0.9947433,0.0010276502,0.0008028915,0.00046145028,0.00084296777],"study_design_scores_gemma":[0.00054167304,0.000024176918,0.00012695823,0.000022085545,0.000005733586,2.8423744e-7,0.000021690415,0.9981921,0.0003149901,0.00048310787,0.0001234616,0.00014379366],"about_ca_topic_score_codex":0.000048342525,"about_ca_topic_score_gemma":2.7336904e-7,"teacher_disagreement_score":0.107279286,"about_ca_system_score_codex":0.00026246026,"about_ca_system_score_gemma":0.000026222198,"threshold_uncertainty_score":0.5844172},"labels":[],"label_agreement":null},{"id":"W2043873753","doi":"10.1007/s11590-010-0185-y","title":"A note on diameters of point sets","year":2010,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Equilateral triangle; Mathematics; Combinatorics; Plane (geometry); RADIUS; Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.021376411838199372,"score_gpt":0.2896799265772811,"score_spread":0.2683035147390817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043873753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09935022,3.4032996e-7,0.884642,0.0056980024,0.00020789956,0.00030203446,0.0000070474953,0.000086987886,0.009705447],"genre_scores_gemma":[0.16577663,0.0000012359908,0.831818,0.0021593259,0.0000379734,0.000025136376,0.000021207283,0.000026109397,0.00013440035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000034827273,0.00032085978,0.00013884681,0.00022485561,0.000108403154],"domain_scores_gemma":[0.99917734,0.00026230497,0.00017937661,0.00026237147,0.00007014156,0.000048449518],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022757886,0.00010887793,0.00015808415,0.000106932544,0.00003738164,0.000023922097,0.00010094438,0.000064068976,0.0010356387],"category_scores_gemma":[0.00074443297,0.000088514644,0.000069677444,0.00013816197,0.00005408526,0.00012299232,0.000012679106,0.00014864492,0.00003266819],"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.00007145775,0.00060273847,0.00004538119,0.00027832564,0.000045776895,0.0000023087894,0.0025338936,0.0151136555,0.07224589,0.8786492,0.02657121,0.0038402085],"study_design_scores_gemma":[0.0012184554,0.0001563976,0.00006233523,0.00014410373,0.000057073885,0.0000097460725,0.00011403984,0.86364996,0.067918085,0.065225564,0.0009631744,0.00048106973],"about_ca_topic_score_codex":0.0000020926332,"about_ca_topic_score_gemma":0.000002363095,"teacher_disagreement_score":0.8485363,"about_ca_system_score_codex":0.000015343017,"about_ca_system_score_gemma":0.000009743768,"threshold_uncertainty_score":0.9998776},"labels":[],"label_agreement":null},{"id":"W2044674112","doi":"10.1007/s11590-006-0001-x","title":"A counterexample to the dominating set conjecture","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Conjecture; Combinatorics; Counterexample; Mathematics; Polytope; Vertex (graph theory); Polyhedron; Convex polytope; Discrete mathematics; Regular polygon; Graph; Convex set; Geometry","score_opus":0.016348271983206406,"score_gpt":0.2627674421359366,"score_spread":0.2464191701527302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044674112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20108062,0.000020701951,0.78197396,0.012340152,0.00044981515,0.00047280677,0.000032795175,0.00012752404,0.0035016232],"genre_scores_gemma":[0.8792127,0.0000012671261,0.109492116,0.010389001,0.00042458906,0.000031931697,0.000032713386,0.00003835836,0.0003773368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992338,0.000070659364,0.00018979845,0.00015953973,0.00017165368,0.00017455261],"domain_scores_gemma":[0.99933416,0.0002426806,0.00008595595,0.00027387874,0.000037798058,0.00002550779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023542787,0.00011742257,0.00011040625,0.00005492792,0.00032228103,0.000072528615,0.00019521973,0.000042105716,0.00020385657],"category_scores_gemma":[0.00008784896,0.00007646812,0.000050441537,0.00017940908,0.000043058288,0.000059784772,0.000057281333,0.00009529805,0.000005918879],"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.000018428385,0.000015118307,0.00022325481,0.000023135628,0.000026684776,0.0000050343415,0.0018139724,0.65032,0.0004809477,0.17274484,0.1740695,0.00025908192],"study_design_scores_gemma":[0.0067480234,0.0003125441,0.0035388218,0.00039618908,0.0005399094,0.00032690514,0.0031520887,0.34243917,0.0058549135,0.35374764,0.27914345,0.0038003149],"about_ca_topic_score_codex":0.000026777825,"about_ca_topic_score_gemma":0.00001546198,"teacher_disagreement_score":0.67813206,"about_ca_system_score_codex":0.000027998865,"about_ca_system_score_gemma":0.0000057198768,"threshold_uncertainty_score":0.31182796},"labels":[],"label_agreement":null},{"id":"W2051095135","doi":"10.1007/s11590-012-0538-9","title":"On the Weber facility location problem with limited distances and side constraints","year":2012,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Facility location problem; 1-center problem; Limit (mathematics); Mathematical optimization; Computer science; Computational intelligence; Constant (computer programming); Function (biology); Upper and lower bounds; Optimization problem; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.015008318441302869,"score_gpt":0.19076410873708835,"score_spread":0.17575579029578547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051095135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29068148,0.00007203487,0.57815623,0.09109657,0.0004638452,0.0016514123,0.000012103079,0.00031537324,0.037550952],"genre_scores_gemma":[0.9878522,0.0000067028523,0.0010038844,0.010813531,0.00007872691,0.00004827172,0.00008033768,0.000007192634,0.00010913451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999285,0.000018086343,0.00015566513,0.0001697856,0.00019114025,0.00018035315],"domain_scores_gemma":[0.9996358,0.000027523858,0.00006584622,0.00016979556,0.00008783086,0.000013206456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898644,0.000120603,0.0000737988,0.00007160729,0.00020710849,0.00014191847,0.00007940335,0.000021836142,0.0003670229],"category_scores_gemma":[0.00006169196,0.00008089281,0.000015000268,0.00033219878,0.00014451762,0.0007599341,0.000028826315,0.000060738268,0.00011166688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008619116,0.00016838314,0.01405274,0.00022420984,0.000064726875,5.845838e-7,0.00034058778,0.8917881,0.00007429021,0.07124305,0.015750397,0.006206704],"study_design_scores_gemma":[0.0035508936,0.000067924375,0.11165673,0.0003594475,0.00039129474,0.0000046028845,0.004136726,0.72352815,0.00016300777,0.0007647813,0.1531137,0.0022627353],"about_ca_topic_score_codex":0.00007271044,"about_ca_topic_score_gemma":0.000041402876,"teacher_disagreement_score":0.69717073,"about_ca_system_score_codex":0.000022119488,"about_ca_system_score_gemma":0.0000045356173,"threshold_uncertainty_score":0.40186435},"labels":[],"label_agreement":null},{"id":"W2053680637","doi":"10.1007/s11590-015-0874-7","title":"An information theoretic based integer linear programming approach for the discrete search path planning problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Search Problems","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":"Université TÉLUQ; Université du Québec à Montréal; Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Computer science; Motion planning; Heuristics; Integer programming; Heuristic; Entropy (arrow of time); Mathematics; Artificial intelligence","score_opus":0.03145900289209521,"score_gpt":0.2827877760298572,"score_spread":0.25132877313776203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053680637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035965684,0.000011913699,0.9927231,0.0051544295,0.00009024619,0.0013036268,0.000004552423,0.00023893648,0.00043722618],"genre_scores_gemma":[0.044609558,0.000002517141,0.95177644,0.002905487,0.00006395033,0.0003020165,0.00030122226,0.000018747707,0.000020065216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983854,0.00018817796,0.0003131207,0.000271612,0.00047523118,0.00036645087],"domain_scores_gemma":[0.9987579,0.0001163408,0.00012487338,0.00047026286,0.00035876036,0.00017187334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395452,0.00016135542,0.00012017922,0.00017035371,0.00031690835,0.00078426884,0.0007744303,0.00006242877,0.000006942732],"category_scores_gemma":[0.00009105037,0.00011422224,0.000054226704,0.0005534575,0.00009941668,0.0020942176,0.00008392899,0.00017948562,0.000005625175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022108223,0.000029789433,0.00008442353,0.000029564813,0.000008663084,3.1555948e-7,0.002826318,0.9877267,0.000009406926,0.0055651073,0.0006557241,0.0030418925],"study_design_scores_gemma":[0.0006816826,0.000120581295,0.0000055203127,0.000017201373,0.000006860921,0.00000222032,0.00039632386,0.9964412,0.000048082413,0.000035604346,0.0020788054,0.00016591877],"about_ca_topic_score_codex":0.000009540416,"about_ca_topic_score_gemma":1.0836971e-7,"teacher_disagreement_score":0.04457359,"about_ca_system_score_codex":0.000065916734,"about_ca_system_score_gemma":0.00013707302,"threshold_uncertainty_score":0.7562722},"labels":[],"label_agreement":null},{"id":"W2059147749","doi":"10.1007/s11590-008-0083-8","title":"Regular exceptional family of elements with respect to isotone projection cones in Hilbert spaces and complementarity problems","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"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":"Mathematics; Hilbert space; Complementarity (molecular biology); Cone (formal languages); Pure mathematics; Rigged Hilbert space; Projection (relational algebra); Mathematical analysis; Reproducing kernel Hilbert space; Algorithm","score_opus":0.0203606626991976,"score_gpt":0.23197117013080876,"score_spread":0.21161050743161117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059147749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10995353,0.000009545336,0.8808051,0.008644335,0.000032054697,0.00036984,0.0000056404283,0.000032215357,0.00014776296],"genre_scores_gemma":[0.3500615,0.000049140148,0.64704245,0.0025428962,0.000024688932,0.000056904883,0.00008188216,0.0000105209865,0.00013000115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876577,0.00007692979,0.00033674217,0.0003212546,0.00035967014,0.00013962199],"domain_scores_gemma":[0.9994389,0.000029439003,0.00016653129,0.00016680667,0.00014628703,0.000052065076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020167403,0.000115462775,0.00016804859,0.00035689335,0.00012313641,0.00005198137,0.00015364829,0.000025399655,0.00004562771],"category_scores_gemma":[0.000015791044,0.000106863445,0.00002297724,0.0008899721,0.000054552936,0.0004722243,0.00006492041,0.000049809565,0.000002170765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029794786,0.000093134484,0.051331002,0.0000116320025,0.00003309427,0.0000020991265,0.0008889363,0.94337314,0.0009981034,0.002437071,0.0006971532,0.00010483983],"study_design_scores_gemma":[0.0014071497,0.00016050591,0.105630085,0.000044626195,0.000014829452,0.000015110717,0.00007952589,0.8912841,0.00023424937,0.000053958716,0.0008141309,0.0002617241],"about_ca_topic_score_codex":0.00027626735,"about_ca_topic_score_gemma":0.00010123315,"teacher_disagreement_score":0.24010797,"about_ca_system_score_codex":0.00006258069,"about_ca_system_score_gemma":0.00004391021,"threshold_uncertainty_score":0.43577647},"labels":[],"label_agreement":null},{"id":"W2066043589","doi":"10.1007/s11590-007-0068-z","title":"A simpler and tighter redundant Klee–Minty construction","year":2007,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Hyperplane; Mathematics; Dimension (graph theory); Combinatorics; Bent molecular geometry; Computational intelligence; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0056916164472046015,"score_gpt":0.21211858192349364,"score_spread":0.20642696547628905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066043589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028082075,0.00002113501,0.96714133,0.0037153114,0.00037263014,0.00009202369,8.1807343e-7,0.00007934862,0.0004953282],"genre_scores_gemma":[0.28526804,0.000011836771,0.71125424,0.0032117066,0.00014794497,0.0000035451276,0.000023966437,0.000006306757,0.00007243989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.000026316275,0.00017950892,0.00024004072,0.00016312035,0.00014559376],"domain_scores_gemma":[0.99960035,0.000055955465,0.00007122597,0.00013966803,0.000067317254,0.00006545301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002486603,0.000083551364,0.00006839843,0.00016227504,0.00013833077,0.00013468601,0.00010171041,0.000034631947,0.000033379856],"category_scores_gemma":[0.000020175548,0.00008343908,0.000021307955,0.0003332428,0.000044409015,0.00047383117,0.000048683964,0.000054592503,0.000008367421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002592619,0.00003548408,0.0007651667,0.000012217519,0.0000253736,0.000014697845,0.0005971046,0.8615282,0.007271673,0.040900715,0.003895094,0.084928334],"study_design_scores_gemma":[0.000569113,0.000053124255,0.0040183174,0.000011227727,0.000009352347,0.00013660407,0.000025619018,0.9801278,0.0036033904,0.000574223,0.010587921,0.00028327754],"about_ca_topic_score_codex":0.000003332308,"about_ca_topic_score_gemma":0.0000014323815,"teacher_disagreement_score":0.25718597,"about_ca_system_score_codex":0.00002949493,"about_ca_system_score_gemma":0.000016998889,"threshold_uncertainty_score":0.3402547},"labels":[],"label_agreement":null},{"id":"W2071575532","doi":"10.1007/s11590-006-0027-0","title":"An ILP based hierarchical global routing approach for VLSI ASIC design","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"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 Guelph; University of Waterloo","funders":"","keywords":"Routing (electronic design automation); Computer science; Very-large-scale integration; Integer programming; Rounding; Heuristic; Physical design; Parallel computing; Application-specific integrated circuit; Circuit design; Embedded system; Algorithm","score_opus":0.010559122700771837,"score_gpt":0.21219346988723609,"score_spread":0.20163434718646425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071575532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006359447,0.00001347574,0.99678767,0.00017072323,0.000056669563,0.0004172149,0.000015188693,0.0009509785,0.00095216295],"genre_scores_gemma":[0.34938383,7.751414e-7,0.64978004,0.00041785388,0.000120898236,0.00007681213,0.00018470206,0.000030426028,0.0000046871287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991796,0.000048718117,0.00019654841,0.00020171006,0.00011638913,0.0002570339],"domain_scores_gemma":[0.99967235,0.00004667157,0.000029370285,0.00017384876,0.000026578922,0.000051157283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017395774,0.00015300445,0.00012841061,0.00006164554,0.000086149405,0.00008576271,0.00013835204,0.00009287765,0.0000133931135],"category_scores_gemma":[0.000013611849,0.00016496252,0.00005451816,0.00019153144,0.000027072643,0.00017848519,0.0000049055066,0.00007589785,0.000001350472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008630382,0.00002810539,0.00015710307,0.000017533635,0.0000060284106,0.0000010215138,0.000009990979,0.9894998,0.0042528627,0.00034431615,0.0044701206,0.001204487],"study_design_scores_gemma":[0.00030991886,0.000032329473,0.00008414179,0.000006723505,0.000013604,0.0000020983166,0.0000036456345,0.9958299,0.0033412213,0.000054166147,0.00012348106,0.00019880716],"about_ca_topic_score_codex":0.0000072768526,"about_ca_topic_score_gemma":2.824707e-7,"teacher_disagreement_score":0.34874788,"about_ca_system_score_codex":0.000098487384,"about_ca_system_score_gemma":0.000011877737,"threshold_uncertainty_score":0.67269766},"labels":[],"label_agreement":null},{"id":"W2073491843","doi":"10.1007/s11590-008-0089-2","title":"Mesh adaptive direct search algorithms for mixed variable optimization","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Variable (mathematics); Algorithm; Iterated function; Convergence (economics); Mathematics; Categorical variable; Mathematical optimization; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.04295862349070323,"score_gpt":0.27375931317915003,"score_spread":0.2308006896884468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073491843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019650633,0.000050905448,0.9925301,0.0025345064,0.0006793573,0.0011689698,0.00004015586,0.00043306383,0.0025433057],"genre_scores_gemma":[0.0010938402,0.00016310599,0.99519813,0.0012360692,0.00020517303,0.00027203432,0.00020436979,0.0000683692,0.0015589142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962648,0.00037624384,0.00060432864,0.0009888214,0.0009927396,0.000773062],"domain_scores_gemma":[0.9971781,0.00051800814,0.0002055929,0.00087114144,0.0009300998,0.00029709912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093782344,0.0003511006,0.00041921993,0.0005550673,0.0007636373,0.0003078737,0.0011424344,0.00015330272,0.00029648817],"category_scores_gemma":[0.0004603338,0.0003688647,0.00013635895,0.0019016545,0.00017717408,0.0013129449,0.0002729751,0.00023128762,0.00004229836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027642829,0.00009446137,0.000019341585,0.000015298549,0.000058180016,0.000013094925,0.00023751537,0.98541987,0.000078761856,0.0025149558,0.010423612,0.0010972958],"study_design_scores_gemma":[0.0011623424,0.000113120004,0.000017942117,0.000016103433,0.000015925558,0.00003387282,0.000018861358,0.9962445,0.00066097645,0.000023630764,0.0012837878,0.00040895483],"about_ca_topic_score_codex":0.000030782463,"about_ca_topic_score_gemma":3.923437e-7,"teacher_disagreement_score":0.010824643,"about_ca_system_score_codex":0.00020816567,"about_ca_system_score_gemma":0.0003145038,"threshold_uncertainty_score":0.9998763},"labels":[],"label_agreement":null},{"id":"W2074030523","doi":"10.1007/s11590-014-0788-9","title":"A general variable neighborhood search variants for the travelling salesman problem with draft limits","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"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":"Travelling salesman problem; Traveling purchaser problem; Variable neighborhood search; Descent (aeronautics); 2-opt; Mathematical optimization; Computational intelligence; Variable (mathematics); Set (abstract data type); Computer science; Limit (mathematics); Extension (predicate logic); Bottleneck traveling salesman problem; Context (archaeology); Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.012782624187917832,"score_gpt":0.22573323936400003,"score_spread":0.2129506151760822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074030523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008112057,0.000019316229,0.99470145,0.0014118339,0.00017941746,0.00063566107,0.00000781512,0.00034517178,0.0018881493],"genre_scores_gemma":[0.054074608,0.000022793116,0.9441194,0.0010020552,0.00029427334,0.000118712574,0.000054928998,0.00012612304,0.00018712405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864703,0.00012282736,0.00028585215,0.00028673126,0.00023039134,0.00042718215],"domain_scores_gemma":[0.99903405,0.00037031362,0.00006036071,0.0003327555,0.000118505755,0.00008403919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428374,0.00022359999,0.0001940331,0.00010384999,0.00028707995,0.00018409392,0.00025635434,0.000089290814,0.00005591437],"category_scores_gemma":[0.00005358359,0.00017736627,0.000044856737,0.0004669531,0.00004568898,0.00021794913,0.000016409342,0.00018799218,0.0000057168604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001630301,0.000012148931,0.0001445841,0.00005069359,0.0000691245,4.0300768e-7,0.00026824675,0.9932187,0.0021387665,0.0020441506,0.00043765112,0.0015991792],"study_design_scores_gemma":[0.00080230366,0.000039052757,0.00010431412,0.000035819186,0.00005534663,0.0000076101082,0.000016872704,0.99729985,0.0005616079,0.00002692202,0.00080069737,0.00024962542],"about_ca_topic_score_codex":0.0000067343326,"about_ca_topic_score_gemma":0.0000013033357,"teacher_disagreement_score":0.053263403,"about_ca_system_score_codex":0.000060334816,"about_ca_system_score_gemma":0.000029990873,"threshold_uncertainty_score":0.72327864},"labels":[],"label_agreement":null},{"id":"W2077382842","doi":"10.1007/s11590-013-0621-x","title":"A locally optimal hierarchical divisive heuristic for bipartite modularity maximization","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bipartite graph; Heuristic; Modularity (biology); Mathematics; Combinatorics; Maximization; Hierarchical clustering; Partition (number theory); Cluster analysis; Theoretical computer science; Computer science; Graph; Mathematical optimization; Statistics","score_opus":0.007227211670618004,"score_gpt":0.22886043147526455,"score_spread":0.22163321980464654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077382842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017713957,0.000005668547,0.9788524,0.0022575716,0.000050214003,0.0006698633,0.000018155133,0.00011661977,0.0003155462],"genre_scores_gemma":[0.70371544,0.0000016160185,0.29426596,0.0007312426,0.00026133243,0.0003709048,0.00051030493,0.000032988024,0.000110202134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988544,0.00006236179,0.00030801992,0.00032612457,0.00015940862,0.00028970555],"domain_scores_gemma":[0.99924535,0.00008551021,0.00013946996,0.00025747388,0.00017861994,0.000093607014],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009900757,0.00017779385,0.0002102533,0.000112869115,0.00017558529,0.00017399553,0.00017582519,0.000039129078,0.000982434],"category_scores_gemma":[0.00001861875,0.00018237831,0.0001422723,0.00026547094,0.00006673807,0.00027289873,0.00006124392,0.00011314735,0.00002683411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010390293,0.00006461961,0.0027346506,0.0000062697,0.000062462335,2.4795116e-7,0.000056482357,0.9808543,0.00030568993,0.0033165368,0.009189495,0.0033988678],"study_design_scores_gemma":[0.0003425922,0.000028308965,0.0006081867,0.000012086684,0.00004857238,3.0344398e-7,0.00001316297,0.9964663,0.00020813866,0.0014551849,0.00060363306,0.00021357795],"about_ca_topic_score_codex":0.00007874285,"about_ca_topic_score_gemma":8.148852e-7,"teacher_disagreement_score":0.68600154,"about_ca_system_score_codex":0.00003376734,"about_ca_system_score_gemma":0.000019152088,"threshold_uncertainty_score":0.9999308},"labels":[],"label_agreement":null},{"id":"W2078847524","doi":"10.1007/s11590-015-0890-7","title":"Optimal task allocation in multi-human multi-robot interaction","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Air Force Research Laboratory; Air Force Office of Scientific Research; National Institute of Food and Agriculture","keywords":"Computer science; Task (project management); Robot; Computational intelligence; Key (lock); Human–robot interaction; Artificial intelligence; Information exchange; Distributed computing; Engineering; Computer security; Systems engineering","score_opus":0.07855689840505382,"score_gpt":0.3867542891530454,"score_spread":0.3081973907479916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078847524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053138413,0.0000151965,0.93687797,0.0037187818,0.002070922,0.0004298138,0.000005872005,0.00027205687,0.0034710031],"genre_scores_gemma":[0.9159642,0.0000035680325,0.07638547,0.0035674958,0.00016162987,0.00015817238,0.00039847443,0.000054654112,0.0033063367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982424,0.00029138775,0.00057932397,0.00040913184,0.00020902451,0.00026877702],"domain_scores_gemma":[0.9990887,0.00004474909,0.00025848523,0.00031450542,0.00015868722,0.00013485983],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035642507,0.00020272512,0.00019082054,0.00044515953,0.0001075653,0.00009176694,0.00016890063,0.00013499126,0.002198032],"category_scores_gemma":[0.0000876188,0.00022659401,0.00006758478,0.00031696382,0.00005415204,0.0006149121,0.00003043711,0.00027974806,0.00087230734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007107581,0.00036623856,0.0017045569,0.0000049603264,0.00003081312,0.000010565888,0.006274229,0.9778256,0.0023563297,0.00031859928,0.010526331,0.00051070034],"study_design_scores_gemma":[0.0063756444,0.00009154881,0.020368027,0.0000542345,0.000025891573,0.000050849576,0.003345444,0.9544109,0.0001866217,0.0000026457974,0.014539228,0.0005489649],"about_ca_topic_score_codex":0.00025515584,"about_ca_topic_score_gemma":0.00009957872,"teacher_disagreement_score":0.8628258,"about_ca_system_score_codex":0.000330953,"about_ca_system_score_gemma":0.000025159934,"threshold_uncertainty_score":0.99990565},"labels":[],"label_agreement":null},{"id":"W2080943874","doi":"10.1007/s11590-015-0869-4","title":"Solving the clique partitioning problem as a maximally diverse grouping problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Clique; Heuristic; Variable neighborhood search; Mathematical optimization; Local search (optimization); Computer science; Mathematics; Diversification (marketing strategy); Metaheuristic; Combinatorics","score_opus":0.02134978858238772,"score_gpt":0.2425588380450419,"score_spread":0.22120904946265418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080943874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056961454,0.000044604058,0.98056275,0.0030289432,0.00027239902,0.00046051788,0.0000025598608,0.0008300917,0.009101986],"genre_scores_gemma":[0.12058732,0.00004926907,0.87634563,0.002394625,0.00021876136,0.00012341772,0.00005307517,0.00011494988,0.00011292627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984651,0.00019162292,0.00039978352,0.00023011501,0.0003161139,0.0003972621],"domain_scores_gemma":[0.999212,0.0000969419,0.00011779802,0.0002868251,0.00014490604,0.0001414827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089158997,0.000228101,0.00017656104,0.00013609875,0.0002651015,0.00026210948,0.00025785857,0.00009320794,0.00008887528],"category_scores_gemma":[0.00015014634,0.00020965982,0.00006453193,0.00054881244,0.000066682864,0.00057250593,0.00007942282,0.00026685628,0.00006373005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067579094,0.000009420481,0.0004535528,0.000027478214,0.00003091565,0.0000050467443,0.0017987486,0.99300325,0.0004960313,0.0009239972,0.0026277914,0.0006170052],"study_design_scores_gemma":[0.0004943563,0.000021702526,0.000042658186,0.000077480945,0.000031166506,0.000025898466,0.00042911773,0.9962184,0.00036682968,0.0001641562,0.0018243518,0.0003038721],"about_ca_topic_score_codex":0.000034126224,"about_ca_topic_score_gemma":0.0000049231926,"teacher_disagreement_score":0.11489117,"about_ca_system_score_codex":0.00019891067,"about_ca_system_score_gemma":0.000046885478,"threshold_uncertainty_score":0.85496795},"labels":[],"label_agreement":null},{"id":"W2090646187","doi":"10.1007/s11590-008-0106-5","title":"Sufficiency of linear transformations on Euclidean Jordan algebras","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"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":"Convexity; Mathematics; Euclidean geometry; Complementarity (molecular biology); Linear map; Jordan algebra; Commutative property; Linear complementarity problem; Euclidean distance; Pure mathematics; Transformation (genetics); Computational intelligence; Combinatorics; Euclidean distance matrix; Property (philosophy); Applied mathematics; Algebra over a field; Nonlinear system; Computer science; Algebra representation; Geometry","score_opus":0.01178637397763147,"score_gpt":0.21714134833001084,"score_spread":0.20535497435237937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090646187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030759789,0.0000032898986,0.96222216,0.004654781,0.00013964235,0.00013147833,0.0000041969547,0.00007837942,0.0020063103],"genre_scores_gemma":[0.5318216,0.000015788799,0.46301815,0.0049244612,0.000058272177,0.000009588843,0.000010788874,0.000010806901,0.00013051085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.000049012415,0.00022470624,0.00016663996,0.00020248738,0.00014260969],"domain_scores_gemma":[0.99949783,0.000048588143,0.00006228298,0.00027551825,0.000047588543,0.00006816335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013992451,0.00008520259,0.00009853097,0.00018090713,0.0001803102,0.000017438273,0.00038097927,0.000022667266,0.000048494116],"category_scores_gemma":[0.000027468199,0.00008118804,0.000049523846,0.00057190703,0.000038946924,0.0003118918,0.00002417285,0.00005998379,0.00005016118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041316266,0.000057754343,0.000015237917,0.0000047961353,0.000003921732,0.0000035527407,0.001596757,0.9512744,0.00037964078,0.045049697,0.00074133277,0.00086875935],"study_design_scores_gemma":[0.00042148205,0.00017431423,0.00016739508,0.000024191513,0.000004840798,0.000022100368,0.00002647199,0.9880897,0.008323072,0.00022844618,0.0022684531,0.00024955568],"about_ca_topic_score_codex":0.0000030081517,"about_ca_topic_score_gemma":1.6249356e-7,"teacher_disagreement_score":0.50106186,"about_ca_system_score_codex":0.0000138459645,"about_ca_system_score_gemma":0.000022217904,"threshold_uncertainty_score":0.33107522},"labels":[],"label_agreement":null},{"id":"W2093976283","doi":"10.1007/s11590-013-0662-1","title":"Service network design models for two-tier city logistics","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Canada Research Chairs","keywords":"Flexibility (engineering); Computer science; Traffic management; Service (business); Tier 2 network; Network planning and design; Tier 1 network; Fleet management; Transport engineering; Operations research; Telecommunications; Business; Marketing","score_opus":0.04759172000207915,"score_gpt":0.19713150017476389,"score_spread":0.14953978017268474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093976283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078325575,0.000058631278,0.9974089,0.00053275324,0.0003874417,0.00045878696,0.000015659494,0.00028772236,0.00077173667],"genre_scores_gemma":[0.15141405,0.00003001974,0.843575,0.004214822,0.00033423508,0.000120511424,0.00017373511,0.00006613055,0.00007150375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.000012540792,0.00020185218,0.00014331126,0.00008827282,0.00028627925],"domain_scores_gemma":[0.99956125,0.00007120119,0.000028348059,0.00017506543,0.00009265278,0.00007149766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007248982,0.00015166085,0.00013674791,0.0000342181,0.000070607945,0.000055986107,0.00012413616,0.00006913037,0.00015737022],"category_scores_gemma":[0.0000067117594,0.00015725655,0.000037373913,0.00016969068,0.000026837528,0.0001948971,0.0000062307686,0.00008177795,0.0000219116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004137531,0.000006388878,0.00003055486,0.0000249121,0.00002375385,7.7677674e-7,0.000047754296,0.9543192,0.00007700614,0.0006670877,0.044685073,0.00011335016],"study_design_scores_gemma":[0.00031073546,0.000008156818,0.000014637699,0.0000084857365,0.000031140367,6.363965e-7,0.000003735767,0.99791825,0.00005110665,0.0006933622,0.00076278835,0.0001969933],"about_ca_topic_score_codex":0.00002077116,"about_ca_topic_score_gemma":0.000004392159,"teacher_disagreement_score":0.15383394,"about_ca_system_score_codex":0.00004113292,"about_ca_system_score_gemma":0.0000074143045,"threshold_uncertainty_score":0.6412736},"labels":[],"label_agreement":null},{"id":"W2095616212","doi":"10.1007/s11590-010-0264-0","title":"New weighing matrices constructed from two circulant submatrices","year":2010,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Circulant matrix; Computational intelligence; Mathematics; Block matrix; Combinatorics; Block (permutation group theory); Matrix (chemical analysis); Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Eigenvalues and eigenvectors; Artificial intelligence; Physics; Chemistry","score_opus":0.0025580334296203483,"score_gpt":0.1698387427357697,"score_spread":0.16728070930614936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095616212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6093242,0.00012806685,0.3860427,0.00019738209,0.0022764485,0.000120003286,0.000016601438,0.00051713566,0.001377457],"genre_scores_gemma":[0.9516531,0.000016533982,0.047555745,0.0001517863,0.0004972685,0.0000048569746,0.000067278976,0.00003551616,0.000017915714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930423,0.000025381984,0.00021075421,0.0001576788,0.00012608929,0.00017587251],"domain_scores_gemma":[0.9995768,0.000061379236,0.00005629785,0.00019806922,0.000017681907,0.000089779445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072929295,0.00014043208,0.00013775734,0.000120880104,0.00007342729,0.00012111884,0.00016262868,0.00006487558,0.00068133324],"category_scores_gemma":[0.000009908765,0.00014277107,0.00004950593,0.0002597412,0.0000230001,0.00026185118,0.000011373985,0.00017028704,0.000049962015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004205942,0.0000024361204,0.004859256,0.000016461729,0.000053580407,0.000007832299,0.00024547457,0.916112,0.074042305,0.000888573,0.0026318305,0.0011360504],"study_design_scores_gemma":[0.0018369368,0.000009523112,0.0020379492,0.000074161246,0.00012406925,0.000045186956,0.00029775003,0.97627264,0.010238097,0.0005283552,0.0075481893,0.0009871615],"about_ca_topic_score_codex":0.00017495369,"about_ca_topic_score_gemma":0.000013351204,"teacher_disagreement_score":0.3423289,"about_ca_system_score_codex":0.0000128265965,"about_ca_system_score_gemma":0.000009640204,"threshold_uncertainty_score":0.7460121},"labels":[],"label_agreement":null},{"id":"W2120279149","doi":"10.1007/s11590-008-0085-6","title":"On a posterior evaluation of a simple greedy method for set packing","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"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":"Simple (philosophy); Set packing; Mathematics; Mathematical optimization; Set (abstract data type); Upper and lower bounds; Greedy algorithm; Relaxation (psychology); Packing problems; Function (biology); Linear programming relaxation; Combinatorics; Computer science; Linear programming","score_opus":0.04883040661566376,"score_gpt":0.2983069939448683,"score_spread":0.24947658732920455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120279149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023464898,0.00001889248,0.97467506,0.00030579395,0.00019892825,0.00053315546,0.00003351172,0.00014370643,0.0006260549],"genre_scores_gemma":[0.60916466,0.0000215557,0.38891813,0.0012123857,0.00007085023,0.00012637016,0.00037089616,0.000080257196,0.000034904035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907875,0.00007203167,0.00026567685,0.00015276662,0.00027575472,0.00015503366],"domain_scores_gemma":[0.99941736,0.00010949049,0.00008359153,0.00017277124,0.00017848551,0.000038285725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040997524,0.00012902713,0.00015786376,0.00016464667,0.00008160668,0.000017842698,0.000076318865,0.000059089998,0.00018602342],"category_scores_gemma":[0.0000983754,0.00013879257,0.00006418573,0.00023172582,0.000019407133,0.00013260124,0.000007906264,0.0000544521,0.000004638245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625728,0.000010133082,0.00007859829,0.00003538449,0.000026513815,2.9378842e-7,0.0005423995,0.99302316,0.0018756794,0.00006335241,0.0027821986,0.0015476457],"study_design_scores_gemma":[0.0009116404,0.000038829457,0.000081069054,0.0000259635,0.000037396803,0.00000699419,0.000016367469,0.9966922,0.0016441657,0.000039075436,0.00035957037,0.00014677327],"about_ca_topic_score_codex":0.000005007127,"about_ca_topic_score_gemma":0.0000019230697,"teacher_disagreement_score":0.58575696,"about_ca_system_score_codex":0.00006564155,"about_ca_system_score_gemma":0.000019988862,"threshold_uncertainty_score":0.56597966},"labels":[],"label_agreement":null},{"id":"W2121788643","doi":"10.1007/s11590-011-0412-1","title":"Incorporating the threat of terrorist attacks in the design of public service facility networks","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":23,"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","funders":"","keywords":"Tabu search; Planner; Computer science; Heuristic; Operations research; Service (business); Maximization; Service level; Computational intelligence; Bilevel optimization; Facility location problem; Network planning and design; Level of service; Mathematical optimization; Transport engineering; Optimization problem; Business; Engineering; Computer network; Mathematics; Marketing; Artificial intelligence","score_opus":0.09519457258726062,"score_gpt":0.22391906770479125,"score_spread":0.12872449511753065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121788643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03324005,0.000020562591,0.951379,0.0117132105,0.00019317848,0.00064364664,0.0000022004806,0.00003276587,0.0027753967],"genre_scores_gemma":[0.99215895,0.0000066727775,0.0019319613,0.005758965,0.000046165973,0.000034323988,0.00004693423,0.000006031614,0.000009996589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899,0.00009076147,0.00040850393,0.00015526064,0.00021081854,0.00014468233],"domain_scores_gemma":[0.9992537,0.000034267963,0.00020864743,0.00034683043,0.00015172269,0.0000048280094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013191676,0.00010921131,0.000121655605,0.000110526315,0.00010540774,0.000050383973,0.00042489776,0.000032958727,0.00024208537],"category_scores_gemma":[0.000071625574,0.00007174905,0.000038488623,0.000927265,0.00008003601,0.00055313436,0.0000857218,0.00008568066,0.000011645014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001434528,0.00006778018,0.017188553,0.00007102229,0.000013497008,3.5280473e-7,0.0005600862,0.97875637,0.000020424442,0.001480206,0.0011693104,0.000658039],"study_design_scores_gemma":[0.00024090806,0.0000055100663,0.0152403135,0.000016089372,0.000026614956,1.5595485e-7,0.0014543307,0.98239976,0.000008860663,0.00007982797,0.00041641953,0.000111194946],"about_ca_topic_score_codex":0.0016399748,"about_ca_topic_score_gemma":0.0003573649,"teacher_disagreement_score":0.9589189,"about_ca_system_score_codex":0.000014278223,"about_ca_system_score_gemma":0.000008519693,"threshold_uncertainty_score":0.29258412},"labels":[],"label_agreement":null},{"id":"W2124982716","doi":"10.1007/s11590-008-0076-7","title":"Comments on “Dual methods for nonconvex spectrum optimization of multicarrier systems”","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Mitacs","keywords":"Convexity; Property (philosophy); Dual (grammatical number); Duality (order theory); Scope (computer science); Mathematics; Computational intelligence; Spectrum (functional analysis); Mathematical optimization; Mathematical economics; Optimization problem; Applied mathematics; Computer science; Pure mathematics; Economics; Artificial intelligence; Physics","score_opus":0.016784445877630002,"score_gpt":0.27271200015331154,"score_spread":0.25592755427568153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124982716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077458634,0.00008541365,0.996471,0.00028253888,0.00084911415,0.0008418464,0.00003015452,0.00028592814,0.0003794062],"genre_scores_gemma":[0.063832745,0.0002697341,0.9346568,0.00039696632,0.00018277596,0.0001540264,0.00032081213,0.00012979977,0.000056340625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859536,0.00009632308,0.0005347735,0.00027046673,0.0001917544,0.00031131314],"domain_scores_gemma":[0.9990571,0.00024582678,0.0001779533,0.0003269759,0.0001060558,0.00008605275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017380022,0.0002595534,0.00035714873,0.00021705397,0.00014010604,0.000023289396,0.00013834915,0.00012576685,0.0000489623],"category_scores_gemma":[0.000070913506,0.0002904178,0.00008553027,0.00037473298,0.000075872835,0.0002885056,0.000019085552,0.00011776836,0.0000032897697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038638245,0.000031479438,0.000070827555,0.00006855976,0.000057255624,0.0000013559091,0.00014791517,0.9968805,0.0004975481,0.00014090985,0.0017596168,0.000305395],"study_design_scores_gemma":[0.0010088366,0.000049414113,0.000016110793,0.000056968947,0.000029385006,0.00000675389,0.000022016335,0.99550444,0.0024370647,0.0000029733458,0.00059680553,0.00026920592],"about_ca_topic_score_codex":0.00000290252,"about_ca_topic_score_gemma":1.756173e-7,"teacher_disagreement_score":0.06305816,"about_ca_system_score_codex":0.00015653939,"about_ca_system_score_gemma":0.0000147475175,"threshold_uncertainty_score":0.9999548},"labels":[],"label_agreement":null},{"id":"W2127758564","doi":"10.1007/s11590-015-0959-3","title":"On the cardinality of positively linearly independent sets","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Upper and lower bounds; Computational intelligence; Independent set; Discrete mathematics; Computer science; Graph; Artificial intelligence; Data mining","score_opus":0.09613552248103259,"score_gpt":0.35432996337673606,"score_spread":0.2581944408957035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127758564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01995827,0.000008582262,0.96962637,0.0071978755,0.00010254692,0.00044380355,0.000024767698,0.00005978979,0.0025780138],"genre_scores_gemma":[0.38353628,0.000015947151,0.6121388,0.0032457123,0.000109674416,0.0000790562,0.000059129132,0.00009200184,0.00072342285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833417,0.0002541678,0.0002974424,0.00020405109,0.0007180851,0.00019209427],"domain_scores_gemma":[0.99843687,0.00048992876,0.0001881638,0.00036585287,0.0004206368,0.00009857101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069006276,0.00013134906,0.00017985619,0.000104661536,0.00008095398,0.000040051913,0.00023492286,0.000057695852,0.00013629496],"category_scores_gemma":[0.0013362813,0.00009788637,0.00006258032,0.0003536271,0.00010725619,0.00015894655,0.00006927999,0.00018894975,0.000019574722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000545699,0.00007466869,0.00012375422,0.000011273811,0.00003839535,0.000004695797,0.00050214905,0.98246455,0.000092709626,0.009513677,0.0069408757,0.00017865036],"study_design_scores_gemma":[0.0025183922,0.00027777036,0.00038447528,0.000104827624,0.000066303466,0.000019332114,0.0008057949,0.9784907,0.005141804,0.011180935,0.00045943988,0.0005501905],"about_ca_topic_score_codex":0.000012315332,"about_ca_topic_score_gemma":8.873083e-7,"teacher_disagreement_score":0.363578,"about_ca_system_score_codex":0.0001242262,"about_ca_system_score_gemma":0.00006279872,"threshold_uncertainty_score":0.39916903},"labels":[],"label_agreement":null},{"id":"W2152831483","doi":"10.1007/s11590-011-0383-2","title":"Every maximally monotone operator of Fitzpatrick–Phelps type is actually of dense type","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Pseudo-monotone operator; Mathematics; Type (biology); Monotonic function; Monotone polygon; Banach space; Operator (biology); Pure mathematics; Space (punctuation); Discrete mathematics; Finite-rank operator; Operator space; Computer science; Mathematical analysis","score_opus":0.023883726949208324,"score_gpt":0.2162120690726145,"score_spread":0.1923283421234062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152831483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014361829,0.000041199502,0.9833597,0.0008925631,0.00019455554,0.00012340354,0.00000686057,0.000046958892,0.00097292644],"genre_scores_gemma":[0.40595648,0.00014654834,0.59069496,0.0028860343,0.000026884922,0.000003325913,0.000021930007,0.000015970843,0.00024782447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.00006481739,0.00043016163,0.000262568,0.00029398472,0.00013813384],"domain_scores_gemma":[0.99857134,0.0000403886,0.0002937645,0.00038688636,0.00064311264,0.000064527616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016040103,0.00012946586,0.00022334805,0.00028143314,0.000052116902,0.000031890435,0.0004454163,0.00006493965,0.0008656502],"category_scores_gemma":[0.00008803404,0.00012494464,0.000081330036,0.0013261128,0.000040264367,0.0004800637,0.000096107746,0.000055349396,0.00003552831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104821076,0.00025107202,0.0032623622,0.000041473057,0.00022196824,0.0000058356145,0.0035303454,0.9777937,0.004516626,0.0053213774,0.004332548,0.00061787094],"study_design_scores_gemma":[0.0005399269,0.00014469103,0.0023187434,0.000024180705,0.00007220033,0.000004338248,0.0000372097,0.9869082,0.009317121,0.00005045104,0.00029425693,0.00028869722],"about_ca_topic_score_codex":0.000044038545,"about_ca_topic_score_gemma":9.758194e-7,"teacher_disagreement_score":0.3926647,"about_ca_system_score_codex":0.000025650046,"about_ca_system_score_gemma":0.0001071414,"threshold_uncertainty_score":0.94782627},"labels":[],"label_agreement":null},{"id":"W2234116669","doi":"10.1007/s11590-007-0074-1","title":"Exact L 2-norm plane separation","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"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; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Norm (philosophy); Quadratic equation; Computation; Exact solutions in general relativity; Mathematics; Regular polygon; Heuristic; Plane (geometry); Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.047499468453573064,"score_gpt":0.3420442142460877,"score_spread":0.29454474579251466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234116669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005261724,0.000014252212,0.98816687,0.0019991018,0.00013226212,0.00035306046,0.000008815787,0.0002679737,0.0037959556],"genre_scores_gemma":[0.021223282,0.00017184949,0.9730252,0.0014377256,0.00021841025,0.00006563323,0.00022799378,0.00008435198,0.0035455287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985077,0.0000836664,0.0003367811,0.00029280738,0.00047757107,0.00030148737],"domain_scores_gemma":[0.9990652,0.00019467273,0.00014639708,0.00033543503,0.00014899197,0.00010929933],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015801482,0.00017532302,0.00018859243,0.00020112525,0.000291522,0.000038013655,0.00017096894,0.00007883593,0.0010668866],"category_scores_gemma":[0.00030712067,0.00017887937,0.00005481203,0.0004414064,0.000099558485,0.00048568367,0.000040569066,0.00016358247,0.000112753885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002369627,0.000063549,0.00020298395,0.000015206986,0.000019812238,0.000028340972,0.00032948318,0.9742158,0.00044472807,0.0009177786,0.023497408,0.00024118248],"study_design_scores_gemma":[0.0015742509,0.00006609525,0.00018179292,0.000026094916,0.000021551174,0.0001675262,0.00006738335,0.9891018,0.0021606062,0.0006146943,0.0054425285,0.00057563116],"about_ca_topic_score_codex":0.0000045620104,"about_ca_topic_score_gemma":0.0000014081513,"teacher_disagreement_score":0.01805488,"about_ca_system_score_codex":0.00011950875,"about_ca_system_score_gemma":0.000044527515,"threshold_uncertainty_score":0.9998463},"labels":[],"label_agreement":null},{"id":"W2239439492","doi":"10.1007/s11590-016-1023-7","title":"On the convergence rate of grid search for polynomial optimization over the simplex","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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","funders":"","keywords":"Simplex; Mathematics; Polynomial; Grid; Convergence (economics); Minification; Computational intelligence; Simplex algorithm; Rate of convergence; Combinatorics; Mathematical optimization; Applied mathematics; Linear programming; Mathematical analysis; Geometry; Computer science","score_opus":0.048723286617892415,"score_gpt":0.33309953971401396,"score_spread":0.2843762530961215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239439492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026573993,0.0000056487906,0.9719941,0.023501266,0.00025160747,0.0012664091,0.0000994944,0.00005739745,0.00016668926],"genre_scores_gemma":[0.15018219,0.00050614285,0.8277182,0.015186845,0.0012616817,0.0011352759,0.00020764701,0.0004578906,0.0033441049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980634,0.00033413843,0.00046549013,0.0003275687,0.00042962263,0.0003798093],"domain_scores_gemma":[0.99469745,0.003987058,0.00027010363,0.00060040323,0.000377823,0.00006715567],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009686311,0.0002048981,0.00021095177,0.00013548898,0.00033016977,0.000056515517,0.0004951764,0.00007739697,0.0015848238],"category_scores_gemma":[0.0015159725,0.00010522659,0.000116449075,0.00046007292,0.00031897082,0.00026512763,0.00009023164,0.00013011132,0.000013023329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013398798,0.00004052469,0.000020989179,0.000019182191,0.000038196344,4.247765e-7,0.00013040367,0.95615983,0.00087322906,0.0131472545,0.029047685,0.00038827088],"study_design_scores_gemma":[0.0014172688,0.000084489155,0.000025341033,0.000053712276,0.000025547264,0.0000015357934,0.00007116646,0.989193,0.0067232866,0.00094117026,0.0012427062,0.0002207475],"about_ca_topic_score_codex":0.0000064385245,"about_ca_topic_score_gemma":0.0000012206445,"teacher_disagreement_score":0.14752479,"about_ca_system_score_codex":0.00011376667,"about_ca_system_score_gemma":0.00007506653,"threshold_uncertainty_score":0.99932784},"labels":[],"label_agreement":null},{"id":"W2269669929","doi":"10.1007/s11590-015-0973-5","title":"A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"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; Royal Ottawa Mental Health Centre","funders":"Russian Science Foundation; National Research University Higher School of Economics; Agence Nationale de la Recherche","keywords":"Variable neighborhood search; Heuristics; Mathematical optimization; Heuristic; Benchmark (surveying); Solver; Pairwise comparison; Computational intelligence; Local search (optimization); Computer science; Set (abstract data type); Variable (mathematics); Metaheuristic; Mathematics; Artificial intelligence","score_opus":0.029756073684588987,"score_gpt":0.24712882116455606,"score_spread":0.21737274747996707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269669929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006452331,0.00004640879,0.99467015,0.0020339978,0.0004301074,0.0008896425,0.000029756586,0.00043528512,0.0008194272],"genre_scores_gemma":[0.17222771,0.000022753227,0.8255587,0.0011151311,0.00019528551,0.000258659,0.00032568388,0.00012648804,0.00016957372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986454,0.00013770373,0.00033892377,0.00025018508,0.00026167984,0.00036605896],"domain_scores_gemma":[0.9987938,0.00040482552,0.00006352654,0.00032564244,0.0002962103,0.00011602217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079247885,0.00019928992,0.00016191383,0.00011642455,0.00016390506,0.00014780281,0.00023167001,0.000085499414,0.00004450261],"category_scores_gemma":[0.00035959974,0.00017589646,0.000048781698,0.00057368167,0.000046553185,0.00027611663,0.000028802913,0.00016462503,0.000018564351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021488342,0.000025211326,0.000442333,0.0000447397,0.00005222034,3.8188603e-7,0.00058214547,0.99080914,0.0006109492,0.00027927992,0.0065283435,0.0006037669],"study_design_scores_gemma":[0.0013322375,0.000022895674,0.00004028446,0.000024086416,0.000033911034,0.000004502927,0.000116392715,0.9959961,0.00032546683,0.000032636235,0.0018682998,0.00020316131],"about_ca_topic_score_codex":0.000014639274,"about_ca_topic_score_gemma":0.000001559071,"teacher_disagreement_score":0.17158248,"about_ca_system_score_codex":0.0001803183,"about_ca_system_score_gemma":0.000049001716,"threshold_uncertainty_score":0.717285},"labels":[],"label_agreement":null},{"id":"W2269671001","doi":"10.1007/s11590-016-1081-x","title":"On a linearization technique for solving the quadratic set covering problem and variations","year":2016,"lang":"en","type":"preprint","venue":"Optimization Letters","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":"Simon Fraser University","funders":"","keywords":"Linearization; Heuristic; Class (philosophy); Mathematical optimization; Set (abstract data type); Quadratic equation; Mathematics; Quadratic model; Computer science; Algorithm; Nonlinear system; Artificial intelligence; Statistics","score_opus":0.015207257924394528,"score_gpt":0.2564950073204825,"score_spread":0.241287749396088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269671001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016917476,0.000029843357,0.9933613,0.002974764,0.00040227393,0.0020953298,0.00009337758,0.0004798149,0.00039414963],"genre_scores_gemma":[0.041990504,0.000099974546,0.954641,0.00086499413,0.00027737505,0.0015463284,0.0003223017,0.00019099886,0.00006656434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856895,0.00011179618,0.00046549633,0.00039329418,0.00019047981,0.00026998],"domain_scores_gemma":[0.99860036,0.000591523,0.00021341692,0.00042620202,0.000112685884,0.000055805118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065816287,0.00032947437,0.00026368102,0.00021093866,0.0002703588,0.0002763211,0.00022141213,0.0002687367,0.000024166235],"category_scores_gemma":[0.000324028,0.0002717733,0.00007610516,0.00019845174,0.00004848792,0.00016038943,0.00012262953,0.00033675248,0.0000023327061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006460937,0.0000062594,0.000018428633,0.00022648017,0.000053557545,2.8224233e-7,0.00037879273,0.9931092,0.0031866515,0.0018440981,0.00083735015,0.0003323958],"study_design_scores_gemma":[0.00029180205,0.000015948048,0.000009590687,0.0003472652,0.00006031244,0.0000030474973,0.00000943251,0.99626875,0.0010968206,0.0014454132,0.000120935336,0.0003306558],"about_ca_topic_score_codex":0.0000031972784,"about_ca_topic_score_gemma":8.873976e-7,"teacher_disagreement_score":0.04182133,"about_ca_system_score_codex":0.00017759178,"about_ca_system_score_gemma":0.000043620203,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W2273624835","doi":"10.1007/s11590-016-0998-4","title":"A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"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":"Lagrangian relaxation; Mathematical optimization; Heuristic; Facility location problem; Lagrangian; Branch and bound; Computational intelligence; Upper and lower bounds; Mathematics; Minification; Set (abstract data type); Computer science; Integer (computer science); Applied mathematics; Artificial intelligence","score_opus":0.015758639424597435,"score_gpt":0.20261033103535744,"score_spread":0.18685169161076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273624835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036053467,0.000040578674,0.9110377,0.08280866,0.0001799384,0.001910129,0.000027873055,0.00018461578,0.00020520382],"genre_scores_gemma":[0.99211365,0.00004273469,0.0015568344,0.0046549225,0.0001566244,0.000778974,0.00047144314,0.000017200557,0.00020758856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989594,0.000017881332,0.00031388178,0.00033176795,0.00015938222,0.00021765595],"domain_scores_gemma":[0.9991723,0.000037966587,0.0001359999,0.00024419115,0.00039749593,0.000012093775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000406117,0.00015412558,0.00011700209,0.00022154421,0.00030498175,0.00013195042,0.00014939171,0.00006559728,0.00008852848],"category_scores_gemma":[0.00014114515,0.00010473349,0.000024646499,0.0006261392,0.00013357647,0.0006348,0.00005598513,0.00004466147,0.00007411507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021409274,0.0002538998,0.0059274733,0.0021745327,0.00015535724,0.000001264615,0.0005009479,0.8095557,0.0031487937,0.08444327,0.04633105,0.047293592],"study_design_scores_gemma":[0.003638635,0.00005744592,0.004793165,0.00036904606,0.00025074766,0.000004413234,0.00077252527,0.84545064,0.00019213343,0.0023736914,0.1412063,0.00089125795],"about_ca_topic_score_codex":0.00009014824,"about_ca_topic_score_gemma":0.00010523141,"teacher_disagreement_score":0.98850834,"about_ca_system_score_codex":0.00006938241,"about_ca_system_score_gemma":0.0000150460555,"threshold_uncertainty_score":0.42709076},"labels":[],"label_agreement":null},{"id":"W2290361605","doi":"10.1007/s11590-015-0989-x","title":"An approximation algorithm for the nth power metric facility location problem with linear penalties","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Metric (unit); Mathematics; Linear programming; Approximation algorithm; Power (physics); Algorithm; Combinatorics; Mathematical optimization; Physics","score_opus":0.02564185914331807,"score_gpt":0.23210823795748256,"score_spread":0.2064663788141645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290361605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016482569,0.000027245911,0.9893085,0.0070216446,0.0002257372,0.0011015417,0.0000069060457,0.00015325616,0.000506948],"genre_scores_gemma":[0.6582301,0.000019517192,0.3196107,0.016920693,0.0008662152,0.0010866405,0.0024727092,0.00007599365,0.00071740214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988758,0.000020793728,0.0002663312,0.00028815918,0.00035819685,0.00019072642],"domain_scores_gemma":[0.99890554,0.000018833343,0.00012355001,0.00031596952,0.0006154774,0.000020630492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072023866,0.00015784094,0.00011303392,0.00022036607,0.00025634115,0.00023816616,0.00021706517,0.00003543232,0.000101858306],"category_scores_gemma":[0.00007869531,0.00011317611,0.000033725428,0.0009139868,0.000057805944,0.0015894605,0.000031940723,0.000060087972,0.00006707569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032267053,0.00007206994,0.00023464957,0.000058170557,0.000024913637,1.16426406e-7,0.0001735464,0.98599714,0.000005563635,0.0005733631,0.0042536114,0.008574578],"study_design_scores_gemma":[0.00056580757,0.000025253952,0.00030577273,0.000006696194,0.000053283886,2.4211863e-7,0.0008584801,0.98108584,0.000011878657,0.000031183423,0.016884137,0.00017144834],"about_ca_topic_score_codex":0.00036751563,"about_ca_topic_score_gemma":0.000047262736,"teacher_disagreement_score":0.66969776,"about_ca_system_score_codex":0.000063347754,"about_ca_system_score_gemma":0.000025299049,"threshold_uncertainty_score":0.46151876},"labels":[],"label_agreement":null},{"id":"W2469651670","doi":"10.1007/s11590-016-1004-x","title":"General variable neighborhood search for the uncapacitated single allocation p-hub center problem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"Natural Sciences and Engineering Research Council of Canada; National Research University Higher School of Economics; Russian Science Foundation","keywords":"Benchmark (surveying); Variable neighborhood search; Heuristic; Mathematical optimization; Variable (mathematics); Descent (aeronautics); Computer science; Local search (optimization); Ant colony optimization algorithms; Mathematics; Metaheuristic; Engineering","score_opus":0.018576060220996726,"score_gpt":0.23410725908140795,"score_spread":0.21553119886041122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469651670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009149132,0.000023140297,0.9911734,0.005460791,0.00035404108,0.0005888964,0.00002884822,0.00038162648,0.0010743854],"genre_scores_gemma":[0.06470676,0.00004968205,0.9326487,0.0013073839,0.00028985733,0.00018105393,0.00011196276,0.00012673621,0.0005778266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988111,0.00009831277,0.00030203632,0.0002351665,0.00019179456,0.00036154868],"domain_scores_gemma":[0.99912834,0.0002902089,0.00005594852,0.00029179937,0.00017210115,0.00006158414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044925814,0.00017630357,0.0001300519,0.00009829743,0.00017032096,0.00010668304,0.00020649502,0.0000819216,0.00015559097],"category_scores_gemma":[0.000070492046,0.00012171324,0.000052355732,0.00038024713,0.000050757193,0.00032105055,0.000023729901,0.00008088529,0.000011260205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010534849,0.00002052011,0.0001875345,0.00002184551,0.000049311846,1.657926e-7,0.000118412914,0.94901514,0.043038774,0.0009936837,0.003344067,0.0032000218],"study_design_scores_gemma":[0.0008989245,0.00002185071,0.00004671655,0.000034932793,0.00002320981,0.0000032599246,0.000014047532,0.9893632,0.005893303,0.00002790513,0.003474146,0.00019850221],"about_ca_topic_score_codex":0.0000035334194,"about_ca_topic_score_gemma":5.135687e-7,"teacher_disagreement_score":0.06379184,"about_ca_system_score_codex":0.00016921047,"about_ca_system_score_gemma":0.00001994299,"threshold_uncertainty_score":0.4963322},"labels":[],"label_agreement":null},{"id":"W2507740005","doi":"10.1007/s11590-016-1080-y","title":"Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; University of Guilan","keywords":"Trust region; Conic section; Mathematical optimization; Lemma (botany); Parametrization (atmospheric modeling); Mathematics; Computational intelligence; Class (philosophy); Nonlinear system; Relaxation (psychology); Nonlinear programming; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.06480907493608071,"score_gpt":0.34428207647009645,"score_spread":0.2794730015340158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507740005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017334839,0.000011258561,0.9884798,0.00719107,0.00014720958,0.001536242,0.000026661373,0.0002726611,0.0006016109],"genre_scores_gemma":[0.15286463,0.00008093377,0.8410815,0.0009595456,0.00028605602,0.00052928616,0.00014757056,0.00019152403,0.0038589383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978658,0.000114144896,0.000575315,0.00049435184,0.00042638875,0.00052397465],"domain_scores_gemma":[0.9979053,0.00071316434,0.00036226437,0.0004968725,0.00038674474,0.00013566455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003848357,0.00027229136,0.0003031243,0.0002746022,0.00026448516,0.0000905142,0.0002469879,0.00012300568,0.00019281938],"category_scores_gemma":[0.000669727,0.00021741653,0.00013574131,0.00036848348,0.00006974967,0.00083159766,0.00005576602,0.00010846214,0.000019782638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021100833,0.0000994303,0.000121531535,0.00009442851,0.00006239217,0.0000041189933,0.00021016227,0.94176006,0.002236215,0.04343552,0.005629482,0.0061356523],"study_design_scores_gemma":[0.0058686584,0.00008502856,0.000019062005,0.00010639535,0.00004367143,0.000012947997,0.000040158444,0.978802,0.0015843606,0.011919971,0.0010551162,0.0004626082],"about_ca_topic_score_codex":0.0000039867273,"about_ca_topic_score_gemma":0.0000037151322,"teacher_disagreement_score":0.15113115,"about_ca_system_score_codex":0.00035618542,"about_ca_system_score_gemma":0.00006789496,"threshold_uncertainty_score":0.8865989},"labels":[],"label_agreement":null},{"id":"W2515178122","doi":"10.1007/s11590-017-1226-6","title":"Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":23,"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; Algorithm; Noise (video); Computational intelligence; Mathematical optimization; Optimization problem; Resampling; Function (biology); Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.0369056004540894,"score_gpt":0.2605318215021814,"score_spread":0.223626221048092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515178122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006953047,0.000037502286,0.99638575,0.001125941,0.00048637923,0.00084048614,0.000016912198,0.00022494502,0.0008125438],"genre_scores_gemma":[0.0056558675,0.000051492832,0.9929317,0.0008939611,0.00022359278,0.00003559658,0.000028920067,0.000059939845,0.00011888536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970726,0.00035986563,0.0005869003,0.0007654988,0.000708094,0.00050704606],"domain_scores_gemma":[0.997258,0.00017678304,0.00045470518,0.0008523475,0.0011373514,0.000120817276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005681703,0.00034238183,0.00033835572,0.0003485496,0.000529771,0.00020231251,0.0009928836,0.00011713729,0.000106329426],"category_scores_gemma":[0.000107653315,0.00029161185,0.00011384627,0.0020564124,0.00054144935,0.0014765038,0.00033797752,0.00022448765,0.000012440159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011071729,0.000065633954,0.000022970607,0.000007647155,0.000051606137,0.0000025053266,0.0014397276,0.99512416,0.00034572274,0.0002779248,0.00013923849,0.0025117693],"study_design_scores_gemma":[0.0006198631,0.00010869467,0.000016635911,0.00004845812,0.00002531451,0.000016500908,0.00011998515,0.9961774,0.0024516033,0.00001193887,0.00007417619,0.0003294715],"about_ca_topic_score_codex":0.00005404594,"about_ca_topic_score_gemma":0.0000028244351,"teacher_disagreement_score":0.0055863373,"about_ca_system_score_codex":0.00023309786,"about_ca_system_score_gemma":0.0001388341,"threshold_uncertainty_score":0.9999536},"labels":[],"label_agreement":null},{"id":"W2521931003","doi":"10.1007/s11590-016-1083-8","title":"Optimization of covered call strategies","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Holland Bloorview Kids Rehabilitation Hospital; University of Toronto","funders":"Mitacs","keywords":"CVAR; Call option; Tail risk; Expected shortfall; Downside risk; Sample (material); Semivariance; Computer science; Econometrics; Optimization problem; Expected utility hypothesis; Asset (computer security); Risk measure; Economics; Financial economics; Risk management; Finance; Mathematics; Statistics","score_opus":0.014390779112488976,"score_gpt":0.19892961808768492,"score_spread":0.18453883897519593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521931003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046595486,0.000082086386,0.9924272,0.0023220219,0.000105789215,0.00013824791,0.00010854568,0.00003372571,0.004316486],"genre_scores_gemma":[0.78606576,0.00016853012,0.21229476,0.00089482754,0.00011621419,0.00007981532,0.000057648,0.0000374359,0.00028503052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992271,0.000002435167,0.00039374095,0.00021454161,0.000031450174,0.00013072658],"domain_scores_gemma":[0.9993802,0.000036213798,0.00031244033,0.00018474663,0.000053638243,0.00003280359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008655517,0.000086745815,0.0001737873,0.00011162283,0.000052290678,0.000027760867,0.00013054392,0.00005247924,0.000256954],"category_scores_gemma":[0.00007290142,0.0000806348,0.000045879817,0.00023718872,0.0000653726,0.00031069675,0.00001989325,0.000025834173,0.000052626256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007490375,0.000022389268,0.00027435456,0.000008885316,0.000009256052,1.4597424e-7,0.00004037334,0.602543,0.00023197243,0.39642766,0.000257977,0.00017649146],"study_design_scores_gemma":[0.005544087,0.00026404485,0.0053347847,0.00020746842,0.00005232428,0.000010360461,0.00015294288,0.8602762,0.0013639623,0.109448746,0.015556335,0.0017887127],"about_ca_topic_score_codex":0.000034956094,"about_ca_topic_score_gemma":0.0000011578884,"teacher_disagreement_score":0.78559977,"about_ca_system_score_codex":0.00003913711,"about_ca_system_score_gemma":0.000019454166,"threshold_uncertainty_score":0.3288192},"labels":[],"label_agreement":null},{"id":"W2589061561","doi":"10.1007/s11590-017-1117-x","title":"Compositions of convex functions and fully linear models","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Regular polygon; Mathematics; Convex analysis; Computer science; Convex optimization; Artificial intelligence; Geometry","score_opus":0.06278987189070842,"score_gpt":0.346609635309974,"score_spread":0.2838197634192656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589061561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023388132,0.000012656712,0.9900341,0.004252988,0.000080053695,0.00026033615,0.000041027724,0.000058559668,0.0029214676],"genre_scores_gemma":[0.07551537,0.0000844708,0.92283297,0.00027299853,0.00006633341,0.00003383314,0.000056615114,0.000042453663,0.0010949494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990978,0.000043346572,0.00026538706,0.00020114762,0.0002309679,0.00016133946],"domain_scores_gemma":[0.99878514,0.00013451645,0.00025199013,0.00050054793,0.0002460054,0.00008180575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013826333,0.00011335935,0.00018970283,0.00012494666,0.00052209396,0.00007582128,0.00018987918,0.000056404537,0.00016296458],"category_scores_gemma":[0.00023987147,0.000118067626,0.0000415231,0.00008616071,0.0002784404,0.00056847953,0.00010090688,0.000115054965,0.000005643145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014662883,0.00005189775,0.00008690196,0.000031682765,0.000029881876,0.0000018041856,0.00012074111,0.9899375,0.0005154738,0.007634386,0.0013013221,0.00027377286],"study_design_scores_gemma":[0.00059868407,0.00002268622,0.000044897224,0.00002753852,0.000025379191,0.0000064414135,0.00006411796,0.9966655,0.00026513074,0.0020372076,0.000117574746,0.00012488026],"about_ca_topic_score_codex":0.000009275339,"about_ca_topic_score_gemma":0.0000020601485,"teacher_disagreement_score":0.073176555,"about_ca_system_score_codex":0.00002692633,"about_ca_system_score_gemma":0.000024518957,"threshold_uncertainty_score":0.4814658},"labels":[],"label_agreement":null},{"id":"W2599445248","doi":"10.1007/s11590-017-1135-8","title":"A 5-approximation algorithm for the k-prize-collecting Steiner tree problem","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Vertex (graph theory); Mathematics; Spanning tree; Gomory–Hu tree; Tree (set theory); Minimum spanning tree; Graph; Minimum degree spanning tree; Integer (computer science); Discrete mathematics; K-ary tree; Computer science; Tree structure; Binary tree","score_opus":0.02933868493811216,"score_gpt":0.26105253950293705,"score_spread":0.2317138545648249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599445248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004056281,0.000019098956,0.9782392,0.019652786,0.00046233463,0.00059147604,0.0000038905664,0.00011892485,0.0008717738],"genre_scores_gemma":[0.001990433,0.000009340039,0.9959106,0.0013184864,0.00019959809,0.00017075779,0.00000815148,0.000013274541,0.00037939404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989992,0.000036510497,0.0002040278,0.00031150735,0.0002125842,0.00023619113],"domain_scores_gemma":[0.9986514,0.00018017102,0.00025964485,0.0007681518,0.00010319362,0.000037424677],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040402106,0.00012821866,0.00011406914,0.00007847576,0.0018661546,0.00105393,0.0011836046,0.000039267277,0.000010915138],"category_scores_gemma":[0.000087780354,0.00009874089,0.00009230833,0.00017954959,0.00008690159,0.0008417541,0.00019763222,0.00009672679,0.0000038486205],"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.000005932884,0.00005005961,0.000057191854,0.000019806132,0.00006013246,0.0000021010146,0.0008116362,0.22068961,0.00025994275,0.012265934,0.00628665,0.759491],"study_design_scores_gemma":[0.0005098505,0.000023266432,0.00013801332,0.00001527688,0.000010749977,0.0000049304167,0.000015286194,0.9954375,0.00022408855,0.0009309984,0.0025483866,0.0001416614],"about_ca_topic_score_codex":0.000024490415,"about_ca_topic_score_gemma":0.000006111174,"teacher_disagreement_score":0.7747479,"about_ca_system_score_codex":0.000034029927,"about_ca_system_score_gemma":0.000026725937,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"id":"W2753323787","doi":"10.1007/s11590-017-1185-y","title":"Error bounds for strongly monotone and Lipschitz continuous variational inequalities","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Lipschitz continuity; Variational inequality; Monotone polygon; Computational intelligence; Mathematics; Applied mathematics; Strongly monotone; Inequality; Pure mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry; Artificial intelligence","score_opus":0.02108588286250277,"score_gpt":0.26382439312384726,"score_spread":0.2427385102613445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753323787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093877676,0.000012976444,0.9750841,0.022973489,0.0002329028,0.00019771792,0.000030112767,0.000075269,0.0004545995],"genre_scores_gemma":[0.20279908,0.000018653003,0.79256433,0.0029752809,0.00021602471,0.000086876425,0.00018462692,0.000018462717,0.0011366686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989445,0.000055484914,0.0002666302,0.00033201373,0.00021996866,0.00018136465],"domain_scores_gemma":[0.99887305,0.00013401377,0.00031600744,0.00041433139,0.00018630053,0.00007628991],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034097742,0.00013576659,0.00017565952,0.00012600196,0.00082212145,0.0010775777,0.0004533251,0.000058605903,0.00005462862],"category_scores_gemma":[0.0002416733,0.00013780946,0.000057951744,0.00008424801,0.000067495035,0.0012027437,0.00011719833,0.000057732243,0.0000045981874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011953975,0.000031510895,0.0013151116,0.000008859265,0.00006215255,6.384339e-7,0.00029854916,0.7897018,0.00007031491,0.20655625,0.0014017134,0.0005411467],"study_design_scores_gemma":[0.0006992703,0.000022383565,0.0031205912,0.0000056094,0.000022645416,0.0000021138803,0.00001951642,0.9935927,0.000017302968,0.00049891236,0.0018226827,0.00017630418],"about_ca_topic_score_codex":0.000043433036,"about_ca_topic_score_gemma":0.000005398631,"teacher_disagreement_score":0.20605734,"about_ca_system_score_codex":0.000029938146,"about_ca_system_score_gemma":0.000047339392,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W2774777068","doi":"10.1007/s11590-018-1325-z","title":"“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Separable space; Proximal Gradient Methods; Minification; Convex function; Computational intelligence; Regular polygon; Function (biology); Convex optimization","score_opus":0.0346326266348508,"score_gpt":0.25041753848601944,"score_spread":0.21578491185116866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774777068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086319,0.0000022743168,0.9408438,0.049103767,0.00038913506,0.00066191587,0.000026829379,0.00017243475,0.00016790899],"genre_scores_gemma":[0.62499905,0.0000031993754,0.36582547,0.0087129045,0.00015279365,0.000063440435,0.00003561095,0.00002585881,0.0001816539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998348,0.00011598979,0.00028050033,0.00048517738,0.00043896883,0.00033138518],"domain_scores_gemma":[0.9984865,0.00008567516,0.00027185207,0.0007491958,0.00030091446,0.000105849715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026001895,0.000210105,0.00021042157,0.00022607567,0.00027725066,0.00019582377,0.001098386,0.000056429726,0.00008881811],"category_scores_gemma":[0.000113384194,0.00015254889,0.00007254673,0.0007613869,0.0004034216,0.0005101622,0.0003252211,0.00011392435,0.000013629573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002091848,0.00070169184,0.013698436,0.00015969542,0.0003699553,0.000033493994,0.03635349,0.7820023,0.004780303,0.043803565,0.09725877,0.020629138],"study_design_scores_gemma":[0.00064885226,0.00034735014,0.011598259,0.00010052102,0.000034375676,0.000018774494,0.00015486646,0.9619675,0.023119364,0.00032258953,0.0011154426,0.00057208777],"about_ca_topic_score_codex":0.00003877901,"about_ca_topic_score_gemma":0.000023934223,"teacher_disagreement_score":0.61636716,"about_ca_system_score_codex":0.0000736001,"about_ca_system_score_gemma":0.000027780077,"threshold_uncertainty_score":0.62207633},"labels":[],"label_agreement":null},{"id":"W2790705522","doi":"10.1007/s11590-018-1234-1","title":"Complementarity problems over a hypermatrix (tensor) set","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Complementarity (molecular biology); Complementarity theory; Tensor (intrinsic definition); Combinatorics; Mathematics; Computational intelligence; Order (exchange); Mathematical physics; Physics; Pure mathematics; Mathematical analysis; Computer science; Quantum mechanics; Artificial intelligence","score_opus":0.05394148092549266,"score_gpt":0.32752160638490413,"score_spread":0.27358012545941146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790705522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16112821,0.0000048233996,0.8178345,0.015188104,0.00017746112,0.00074132753,0.00011344593,0.00040903653,0.004403121],"genre_scores_gemma":[0.41855285,0.000008531799,0.56147027,0.018148815,0.00046998722,0.00014117548,0.00039121826,0.00007111994,0.00074603123],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910015,0.00004509606,0.0002717787,0.00021362225,0.00018071155,0.00018861402],"domain_scores_gemma":[0.9993584,0.00006265315,0.000119024284,0.0002962513,0.00009697192,0.000066675995],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000104369494,0.00012313588,0.00013048484,0.00007393767,0.00022851107,0.00006623318,0.0001409893,0.00003859844,0.002458395],"category_scores_gemma":[0.000020894417,0.00012247551,0.000054292505,0.0002133201,0.00009309551,0.00013445612,0.00003792213,0.00007662866,0.00016287348],"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.00003504265,0.0004723418,0.0047244104,0.00009091735,0.00014785485,0.000004482497,0.002729537,0.03122141,0.017567534,0.06668806,0.87585205,0.0004663808],"study_design_scores_gemma":[0.007546978,0.00026723376,0.007937697,0.00017480223,0.00039076497,0.00013383199,0.00047015998,0.54603165,0.0049984567,0.025633361,0.4040844,0.002330654],"about_ca_topic_score_codex":0.000017955845,"about_ca_topic_score_gemma":0.000010036993,"teacher_disagreement_score":0.5148102,"about_ca_system_score_codex":0.000051656072,"about_ca_system_score_gemma":0.000009185561,"threshold_uncertainty_score":0.9984535},"labels":[],"label_agreement":null},{"id":"W2795727769","doi":"10.1007/s11590-018-1254-x","title":"Experiments on virtual private network design with concave capacity costs","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Computational intelligence; Upper and lower bounds; Mathematical optimization; Regular polygon; Computer science; Network planning and design; Mathematics; Artificial intelligence; Computer network; Geometry","score_opus":0.03205164889556149,"score_gpt":0.2358185531798449,"score_spread":0.2037669042842834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795727769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006564764,0.0000033046117,0.99092495,0.0010726702,0.00047006708,0.00022496755,0.0000011805516,0.00016213272,0.00057596737],"genre_scores_gemma":[0.14423172,0.0000026831972,0.84676284,0.008661352,0.00026674994,0.000021758982,0.0000052463015,0.000014503555,0.000033152883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876523,0.00013138172,0.00015046574,0.00037107072,0.0002868864,0.0002949764],"domain_scores_gemma":[0.99923974,0.00008508577,0.00009822724,0.00042095152,0.00007138148,0.000084619845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017463717,0.00015922995,0.00012442374,0.000069465066,0.0003077207,0.00017743686,0.00048295953,0.000039674036,0.000050505798],"category_scores_gemma":[0.000013770125,0.00014135936,0.000028434079,0.00044171332,0.0002074114,0.00036000178,0.00008997361,0.000100548285,0.000040944225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004368195,0.000048316924,0.00007982579,0.00000108993,0.00002980364,0.000010061478,0.0004758682,0.9648818,0.00029965874,0.026581015,0.00537092,0.0021779865],"study_design_scores_gemma":[0.00070542,0.0006093776,0.000119724566,0.0000507749,0.0000052360333,0.000010627206,0.000009719539,0.990131,0.0066873026,0.00017902126,0.0011823807,0.00030937462],"about_ca_topic_score_codex":0.0000064035466,"about_ca_topic_score_gemma":8.531132e-7,"teacher_disagreement_score":0.1441621,"about_ca_system_score_codex":0.000075810225,"about_ca_system_score_gemma":0.00001901288,"threshold_uncertainty_score":0.5764468},"labels":[],"label_agreement":null},{"id":"W2808095563","doi":"10.1007/s11590-018-1285-3","title":"Improved price of anarchy for machine scheduling games with coordination mechanisms","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Price of anarchy; Upper and lower bounds; Computational intelligence; Computer science; Scheduling (production processes); Nash equilibrium; Mathematical optimization; Job shop scheduling; Game theory; Mathematical economics; Operations research; Mathematics; Artificial intelligence; Price of stability; Economics; Computer network","score_opus":0.030898114886665475,"score_gpt":0.31826128258026365,"score_spread":0.28736316769359815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808095563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029988652,0.000004444049,0.9634992,0.0056406483,0.000059957394,0.00038696552,0.00001957881,0.000032104865,0.00036843788],"genre_scores_gemma":[0.624825,6.4285e-7,0.37416795,0.0007027719,0.000037567286,0.000041010266,0.000017900293,0.00000962259,0.00019755504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890035,0.00006161897,0.00032038204,0.00028201242,0.0002995849,0.00013607577],"domain_scores_gemma":[0.99843955,0.00037040908,0.00031455397,0.00031869864,0.0005118266,0.000044965698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009707422,0.00009045724,0.0001429743,0.00017929799,0.00016946389,0.000069619105,0.00029588072,0.00003411323,0.00019728421],"category_scores_gemma":[0.00041163084,0.0000675963,0.000041899853,0.00065030996,0.00014845935,0.0002539514,0.000029292256,0.000040255545,0.000009786816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032132774,0.000106566906,0.00016850399,0.000014358274,0.000041304396,2.3304334e-7,0.00079994067,0.73474115,0.1922725,0.06159624,0.0010140075,0.00892386],"study_design_scores_gemma":[0.00063449715,0.00019376053,0.0000763332,0.000011319764,0.000018591378,0.0000015891418,0.00021462062,0.9603597,0.03168796,0.0058332235,0.0008415266,0.00012690164],"about_ca_topic_score_codex":0.0000046089203,"about_ca_topic_score_gemma":0.000003634217,"teacher_disagreement_score":0.5948363,"about_ca_system_score_codex":0.000015801423,"about_ca_system_score_gemma":0.000024081828,"threshold_uncertainty_score":0.2756497},"labels":[],"label_agreement":null},{"id":"W2896532202","doi":"10.1007/s11590-018-1338-7","title":"Distance between vertices of lattice polytopes","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Polytope; Mathematics; Convex hull; Convex polytope; Minkowski addition; Conjecture; Lattice (music); Uniform k 21 polytope; Hexagonal lattice; Birkhoff polytope; Regular polygon; Discrete mathematics; Convex set; Geometry; Physics; Condensed matter physics","score_opus":0.033182277450117245,"score_gpt":0.3105982867352557,"score_spread":0.27741600928513843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896532202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020108633,0.000009122771,0.9756837,0.0007569596,0.00022725288,0.00017416093,0.000025548137,0.000097557895,0.0029170543],"genre_scores_gemma":[0.34129864,0.0000037115162,0.65782297,0.00028117964,0.00032312938,0.0000123917625,0.000016467457,0.000043987504,0.00019754744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907947,0.00004156891,0.0003344421,0.00015500405,0.00022643643,0.00016307263],"domain_scores_gemma":[0.9986882,0.00054348336,0.000271573,0.0003227278,0.00013058264,0.00004341374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012291226,0.00011756934,0.00022001381,0.000055832083,0.00007133606,0.000019333253,0.00020426801,0.000045556735,0.00037130457],"category_scores_gemma":[0.00065797236,0.000113270944,0.000039989343,0.00024548883,0.0001472278,0.00021504838,0.00004525971,0.000058975267,0.000020052035],"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.00019268616,0.0006544107,0.005625139,0.0014245579,0.0005484485,0.000011459805,0.0077992687,0.034978803,0.0046387385,0.8719852,0.067100294,0.0050409925],"study_design_scores_gemma":[0.0062353844,0.00096714945,0.00071269955,0.0017822778,0.0011385487,0.000011276591,0.00091794773,0.14973438,0.08516363,0.69821,0.051940814,0.003185914],"about_ca_topic_score_codex":0.0000021194273,"about_ca_topic_score_gemma":9.814561e-7,"teacher_disagreement_score":0.32119,"about_ca_system_score_codex":0.000032771324,"about_ca_system_score_gemma":0.000012404492,"threshold_uncertainty_score":0.4619055},"labels":[],"label_agreement":null},{"id":"W2899401464","doi":"10.1007/s11590-018-1349-4","title":"Oil sands extraction plant debottlenecking: an optimization approach","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Bottleneck; Mathematical optimization; Computer science; Process (computing); Optimization problem; Nonlinear programming; Process optimization; Parametric programming; Computational intelligence; Identification (biology); Nonlinear system; Parametric statistics; Engineering; Mathematics; Artificial intelligence","score_opus":0.0182091652072934,"score_gpt":0.2529004218391634,"score_spread":0.23469125663187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899401464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018314017,0.000025000967,0.9749869,0.000084627674,0.00057860557,0.00004473608,0.000006207725,0.0007390248,0.0052208826],"genre_scores_gemma":[0.0900602,0.00006248471,0.9087002,0.00017625742,0.00041366607,0.000023093726,0.00036137647,0.00007636665,0.00012633727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989807,0.00006535803,0.0002643008,0.00024130818,0.00020521526,0.00024313893],"domain_scores_gemma":[0.9994481,0.000037333735,0.000046244357,0.00028967284,0.00007176989,0.00010687393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023687672,0.0001913391,0.00014775517,0.00020799755,0.00013371548,0.000119382734,0.00013807806,0.00011827006,0.00017032982],"category_scores_gemma":[0.00003750514,0.00020587048,0.000040695475,0.0003371692,0.00003657645,0.00056729786,0.000011235144,0.0001298025,0.00000787253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011573066,0.000017201679,0.00006490943,0.000025755086,0.000017716748,9.44812e-7,0.00017490947,0.9966167,0.0014824265,0.000041212625,0.0004126766,0.0011339796],"study_design_scores_gemma":[0.00036823348,0.000019711793,0.0000540191,0.000013163968,0.000013404332,0.000009763863,0.000021722957,0.9974186,0.0006914229,9.63948e-7,0.0011440519,0.00024493737],"about_ca_topic_score_codex":0.0000040717164,"about_ca_topic_score_gemma":4.2836186e-7,"teacher_disagreement_score":0.07174618,"about_ca_system_score_codex":0.00007708402,"about_ca_system_score_gemma":0.000008134397,"threshold_uncertainty_score":0.83951545},"labels":[],"label_agreement":null},{"id":"W2913674600","doi":"10.1007/s11590-019-01401-4","title":"Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of Waterloo","funders":"","keywords":"Lagrangian relaxation; Facility location problem; Mathematical optimization; Flow network; Relaxation (psychology); Convergence (economics); Computer science; Network planning and design; Stochastic programming; Duality (order theory); Stage (stratigraphy); Lagrangian; Subgradient method; Mathematics; Applied mathematics; Economics","score_opus":0.00939775936357898,"score_gpt":0.21357913548204505,"score_spread":0.20418137611846607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913674600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19949135,0.000028215269,0.79591036,0.0014096457,0.0002653696,0.0026166583,0.0000051470856,0.000056901925,0.00021637903],"genre_scores_gemma":[0.99181265,0.0000036231393,0.006551949,0.0010352035,0.0000695922,0.00012506098,0.0002433923,0.000011753537,0.00014677361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894685,0.000026320464,0.0003539049,0.000323478,0.00015957354,0.00018989867],"domain_scores_gemma":[0.99945784,0.000050095743,0.00014900797,0.00018859116,0.00014365159,0.000010812688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052094937,0.00013402941,0.00018153721,0.00015956389,0.000064078224,0.00005492882,0.00008517345,0.000043321656,0.000063987885],"category_scores_gemma":[0.00013748402,0.00014237859,0.000038865954,0.0005283692,0.000031701285,0.00065518013,0.00004367878,0.00005520668,0.000021352073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007818075,0.000060831404,0.00743714,0.0013784068,0.0000103392385,9.955843e-8,0.000086432876,0.98842686,0.00021641182,0.0011923946,0.00032673037,0.00078618305],"study_design_scores_gemma":[0.0014837531,0.000012601092,0.016817251,0.000075444776,0.000028716526,4.2265746e-8,0.000041555213,0.9809537,0.00001286844,0.00010868332,0.00031083578,0.00015454115],"about_ca_topic_score_codex":0.00034066004,"about_ca_topic_score_gemma":0.00022081047,"teacher_disagreement_score":0.7923213,"about_ca_system_score_codex":0.00005707961,"about_ca_system_score_gemma":0.000010674881,"threshold_uncertainty_score":0.580603},"labels":[],"label_agreement":null},{"id":"W2916344177","doi":"10.1007/s11590-019-01412-1","title":"The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Optimal decision; Mathematical optimization; Multinomial logistic regression; Expected utility hypothesis; Decision rule; Expected value; Probability distribution; Mathematics; Stochastic process; Multinomial distribution; Decision theory; Computer science; Econometrics; Statistics; Decision tree; Artificial intelligence","score_opus":0.04098725591223491,"score_gpt":0.35209518520689387,"score_spread":0.31110792929465897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916344177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31906298,0.000035193643,0.6785399,0.001103423,0.0005161737,0.00063653616,0.00004169254,0.000023643908,0.000040506937],"genre_scores_gemma":[0.99129534,0.000005073262,0.0071569285,0.00029648223,0.000017219294,0.000029401472,0.000020039499,0.000023577919,0.001155952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598527,0.00034913083,0.00087224646,0.00052700227,0.001960848,0.00030551417],"domain_scores_gemma":[0.99408937,0.0033629977,0.0006974582,0.0011471533,0.00064247457,0.000060555954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514815,0.00022338264,0.000325855,0.00012772396,0.00046848375,0.00044880086,0.0012648872,0.00007332174,0.00024873216],"category_scores_gemma":[0.0034838314,0.00010452446,0.000138514,0.0011018649,0.0003317682,0.00047730535,0.00018035476,0.00018222476,0.000049215516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003911452,0.000026639593,0.0012120856,0.0000058275073,0.000011529317,5.814734e-7,0.00032967931,0.993887,0.00027412342,0.00014362088,0.0002481894,0.0034695647],"study_design_scores_gemma":[0.0023282967,0.000027848842,0.0043208874,0.000107854066,0.000015672009,0.000005143563,0.000800226,0.99089795,0.00010760306,0.00014358896,0.0010833769,0.00016152723],"about_ca_topic_score_codex":0.000008366469,"about_ca_topic_score_gemma":0.000032293665,"teacher_disagreement_score":0.67223233,"about_ca_system_score_codex":0.00008536286,"about_ca_system_score_gemma":0.00008817941,"threshold_uncertainty_score":0.4327797},"labels":[],"label_agreement":null},{"id":"W2928383288","doi":"10.1007/s11590-019-01452-7","title":"Dynamic improvements of static surrogates in direct search optimization","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicative function; Mathematical optimization; Context (archaeology); Computer science; Variable (mathematics); Quadratic equation; Surrogate model; Algorithm; Mathematics","score_opus":0.008472196214212488,"score_gpt":0.25822590222485003,"score_spread":0.24975370601063754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928383288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00862617,0.000021337448,0.9877182,0.0014042882,0.0002566509,0.0007302719,0.000009070504,0.000081509825,0.0011524967],"genre_scores_gemma":[0.17579153,0.00009546656,0.8231054,0.00038743505,0.0000074500135,0.000032894633,0.00009100007,0.000034145978,0.00045469363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973929,0.0002944661,0.00059447734,0.0005441935,0.0007587419,0.00041523486],"domain_scores_gemma":[0.9985515,0.00022784105,0.00019910048,0.00065957423,0.0002661913,0.00009580684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910994,0.00019093123,0.00031480513,0.00071825966,0.00004970764,0.00014617872,0.00076551887,0.00006751992,0.00045587213],"category_scores_gemma":[0.0001563157,0.00019945689,0.00005654451,0.0016507823,0.000061014936,0.00084504706,0.00022665583,0.00016416186,0.000048658094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010140028,0.000083109655,0.0019965086,0.00005756009,0.000017407408,0.0000029858088,0.00023829324,0.9955286,0.0008330709,0.00019821776,0.000051052022,0.0009831048],"study_design_scores_gemma":[0.0009282784,0.00006084873,0.00050142314,0.00003884873,0.000003803279,0.0000012995926,0.000031424614,0.99758077,0.00064712815,0.000008643676,0.000014036061,0.00018351954],"about_ca_topic_score_codex":0.00005662105,"about_ca_topic_score_gemma":0.0000032199252,"teacher_disagreement_score":0.16716535,"about_ca_system_score_codex":0.00016065342,"about_ca_system_score_gemma":0.000113625545,"threshold_uncertainty_score":0.8133616},"labels":[],"label_agreement":null},{"id":"W2954701560","doi":"10.1007/s11590-019-01448-3","title":"Uniform simplex of an arbitrary orientation","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Mitacs; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Simplex; Simplex algorithm; Convex hull; Combinatorics; Series (stratigraphy); Mathematics; Set (abstract data type); Derivative (finance); Linear programming; Mathematical optimization; Computational intelligence; Regular polygon; Computer science; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.02430181695925274,"score_gpt":0.33051475612565046,"score_spread":0.3062129391663977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954701560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09727324,0.0000033362962,0.8986956,0.00051282626,0.00012257711,0.0005215498,0.000014647311,0.00011016721,0.0027460516],"genre_scores_gemma":[0.025331074,0.000011651918,0.9732443,0.0005742634,0.00004651879,0.000017187696,0.00021855376,0.000054158085,0.0005022916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986857,0.0000755863,0.00036451628,0.00025048637,0.0004130732,0.00021059463],"domain_scores_gemma":[0.9989699,0.00014756652,0.00021348847,0.00039836584,0.00019127806,0.00007936819],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021233459,0.0001291632,0.00018774472,0.00021081342,0.000052419113,0.000028683935,0.00018608707,0.000062469786,0.0013776879],"category_scores_gemma":[0.00013289633,0.00013199712,0.000046331766,0.00048048203,0.00005354862,0.0007451501,0.000037172693,0.000112961556,0.000031355165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000353198,0.00008873054,0.00020162722,0.000060445713,0.00001786168,0.0000018416569,0.00029812788,0.98707014,0.0011458925,0.009582899,0.000288402,0.001208721],"study_design_scores_gemma":[0.0010144481,0.00008481418,0.00007905092,0.000021863429,0.000013089572,0.0000045973693,0.00025824996,0.9914411,0.0037517936,0.0027242578,0.00039179085,0.00021495699],"about_ca_topic_score_codex":0.000005193302,"about_ca_topic_score_gemma":0.0000011107152,"teacher_disagreement_score":0.0745487,"about_ca_system_score_codex":0.00006593366,"about_ca_system_score_gemma":0.00004075045,"threshold_uncertainty_score":0.9995352},"labels":[],"label_agreement":null},{"id":"W2987410708","doi":"10.1007/s11590-019-01497-8","title":"Monotonic grey box direct search optimization","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rio Tinto (Canada); Giro (Canada); Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Mathematical optimization; Computer science; Optimization problem; Computational intelligence; Function (biology); Algorithm; Mathematics; Artificial intelligence","score_opus":0.012358154721532576,"score_gpt":0.24862522730838083,"score_spread":0.23626707258684826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987410708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042045844,0.00004832531,0.98114437,0.0050523053,0.00064928527,0.0008143509,0.000005658975,0.00042854206,0.011436715],"genre_scores_gemma":[0.0156625,0.00016108384,0.97874355,0.0023366946,0.00010064858,0.000059649377,0.00008933888,0.0000659609,0.0027805676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965092,0.00037339103,0.00050565426,0.0009075853,0.0010545392,0.0006496135],"domain_scores_gemma":[0.9977248,0.00020834676,0.0001658258,0.0012224831,0.0004370586,0.00024154021],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007864032,0.0002948583,0.00033131702,0.00057876157,0.00021750799,0.0007178367,0.001296319,0.0001225393,0.0015890014],"category_scores_gemma":[0.00018641326,0.00030433803,0.00011254269,0.0017398471,0.000072063485,0.0015453628,0.00037773923,0.00028676697,0.00067983306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009046346,0.000051773903,0.00031400216,0.000019546582,0.000028105685,0.000008128468,0.00015001233,0.995142,0.00020258864,0.0011239968,0.0017047365,0.0012460889],"study_design_scores_gemma":[0.0006782865,0.000052663083,0.0000789452,0.00001872004,0.000007304215,0.000009903092,0.000013204658,0.9971598,0.0006137961,0.0000069206817,0.0010188146,0.00034166686],"about_ca_topic_score_codex":0.000023469378,"about_ca_topic_score_gemma":4.5687304e-7,"teacher_disagreement_score":0.015242043,"about_ca_system_score_codex":0.00019399174,"about_ca_system_score_gemma":0.00016428065,"threshold_uncertainty_score":0.9999409},"labels":[],"label_agreement":null},{"id":"W3002304143","doi":"10.1007/s11590-020-01609-9","title":"A perturbation view of level-set methods for convex optimization","year":2020,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Seikei University","keywords":"Parameterized complexity; Duality (order theory); Mathematics; Mathematical optimization; Set (abstract data type); Regular polygon; Convex set; Convex optimization; Constraint (computer-aided design); Limiting; Perturbation (astronomy); Feasible region; Computer science; Combinatorics; Physics; Engineering; Geometry","score_opus":0.07606464728142957,"score_gpt":0.32535259871411815,"score_spread":0.24928795143268856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002304143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005601985,0.00035368293,0.9959652,0.0012915583,0.00056849135,0.00085797487,0.00008120889,0.0005462429,0.00027962498],"genre_scores_gemma":[0.008362647,0.00048122095,0.988614,0.00093219033,0.00015623911,0.00014368766,0.0011871038,0.000105113846,0.00001776628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880505,0.000102983686,0.0004675705,0.00033311735,0.00012986091,0.00016141737],"domain_scores_gemma":[0.99906486,0.000104875835,0.00022577234,0.000353676,0.00019923034,0.00005156335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017197011,0.00028970928,0.00044840606,0.00016494007,0.000040879826,0.00006168307,0.00022657742,0.00024748727,0.00004260284],"category_scores_gemma":[0.00011728834,0.00033381913,0.0001590305,0.00016807881,0.0000383938,0.0000788293,0.000103602724,0.00020895775,8.8970995e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013379634,0.0000064622686,0.0000021396022,0.00026053464,0.00009082727,3.5604637e-7,0.0001942838,0.9853398,0.003531866,0.000092189934,0.00731824,0.0031499106],"study_design_scores_gemma":[0.00020135572,0.000021237705,0.0000035590938,0.0002104649,0.00009393628,0.0000012366236,0.000009411776,0.9835129,0.0133188125,0.00023079113,0.002093011,0.00030331305],"about_ca_topic_score_codex":0.000004972651,"about_ca_topic_score_gemma":1.9695905e-7,"teacher_disagreement_score":0.009786946,"about_ca_system_score_codex":0.000070524,"about_ca_system_score_gemma":0.00003128668,"threshold_uncertainty_score":0.99991137},"labels":[],"label_agreement":null},{"id":"W3007930322","doi":"10.1007/s11590-020-01551-w","title":"Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","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":"Université de Montréal","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Computational intelligence; Variable (mathematics); Algorithm; Set (abstract data type); Computer science; Mathematical optimization; Database transaction; Local search (optimization); Mathematics; Metaheuristic; Artificial intelligence; Database","score_opus":0.01777942290356581,"score_gpt":0.2336952618307448,"score_spread":0.21591583892717897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007930322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040930553,0.000014416928,0.98997194,0.005796299,0.00014562644,0.00055223727,0.000014179142,0.0011173966,0.0019786],"genre_scores_gemma":[0.0074763885,0.0000058100823,0.98487616,0.0071554673,0.00020890473,0.00005370272,0.00007117856,0.00012689855,0.000025521626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981951,0.00008886819,0.00042571657,0.00044743487,0.00035716355,0.0004857093],"domain_scores_gemma":[0.99911606,0.000111146794,0.000049855804,0.0002815571,0.00012860677,0.00031277732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004539648,0.00026036336,0.00025731444,0.00017121647,0.00013577074,0.00015806328,0.00026316525,0.00010898824,0.00029204472],"category_scores_gemma":[0.00010787521,0.00030527552,0.000058351136,0.0014104792,0.000019468796,0.00023212425,0.000048403537,0.0002654282,0.00007731949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011880634,0.000015538144,0.00014555629,0.00008029894,0.000034248646,0.0000053710555,0.0007722203,0.9916572,0.0045224694,0.00012768242,0.0019946506,0.00063286675],"study_design_scores_gemma":[0.0004990207,0.000045287383,0.00001700931,0.000036534253,0.000022798513,0.0000018225991,0.000047383834,0.995916,0.0024208769,0.0000054615284,0.0006428609,0.00034495784],"about_ca_topic_score_codex":0.000006589738,"about_ca_topic_score_gemma":1.444392e-7,"teacher_disagreement_score":0.007067083,"about_ca_system_score_codex":0.0001270979,"about_ca_system_score_gemma":0.000053707794,"threshold_uncertainty_score":0.9999399},"labels":[],"label_agreement":null},{"id":"W3044916287","doi":"10.1007/s11590-020-01621-z","title":"Mathematical optimization approach for facility layout on several rows","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Row; Integer programming; Integer (computer science); Computer science; Mathematical optimization; Facility location problem; Position (finance); Linear programming; Focus (optics); Row and column spaces; Computational intelligence; Optimization problem; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.020777797436485286,"score_gpt":0.2077353779526046,"score_spread":0.18695758051611933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044916287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010576116,0.0000065974564,0.9954299,0.00096893165,0.00010123447,0.0004978595,0.00007329798,0.00061578664,0.0022006845],"genre_scores_gemma":[0.06771033,0.000010414096,0.9289822,0.0020761262,0.00013614823,0.00008768945,0.00090752053,0.00005239278,0.0000371736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989898,0.000022917277,0.00027996363,0.00029809927,0.00016487704,0.00024429391],"domain_scores_gemma":[0.99954504,0.00006109706,0.000052522202,0.00017757635,0.000045410052,0.0001183278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007135089,0.00022048382,0.00020604188,0.000057386726,0.000101853984,0.00006566163,0.00012444162,0.00009672807,0.00010648062],"category_scores_gemma":[0.00012824041,0.00022890078,0.00006988248,0.00014376038,0.00003401283,0.00019013623,0.000015784084,0.00013354098,0.000014070965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003525193,0.000023912276,0.0000031229072,0.00011326698,0.000020274147,5.0799207e-7,0.00017431787,0.996463,0.000027473227,0.00024048428,0.0027412635,0.0001571156],"study_design_scores_gemma":[0.0004941211,0.000037059057,0.0000022674772,0.0000062212935,0.00002055982,9.731265e-7,0.00002444648,0.99861234,0.00026267473,0.0000182028,0.00027233668,0.00024880262],"about_ca_topic_score_codex":3.1850237e-7,"about_ca_topic_score_gemma":3.0783212e-8,"teacher_disagreement_score":0.06760457,"about_ca_system_score_codex":0.00006996624,"about_ca_system_score_gemma":0.0000067059145,"threshold_uncertainty_score":0.9334303},"labels":[],"label_agreement":null},{"id":"W3096847493","doi":"10.1007/s11590-021-01754-9","title":"Complexity of near-optimal robust versions of multilevel optimization problems","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Région Hauts-de-France","keywords":"Robustness (evolution); Computational intelligence; Robust optimization; Computational complexity theory; Optimization problem; Adversarial system","score_opus":0.13047109769552634,"score_gpt":0.3247271779096579,"score_spread":0.19425608021413154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096847493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01927915,0.00006226371,0.97648287,0.0020378954,0.00036937042,0.00028642965,0.00009395942,0.00004481608,0.0013432518],"genre_scores_gemma":[0.18218802,0.00024775643,0.8162504,0.0004244767,0.000047026067,0.000011030072,0.0003863698,0.000033685024,0.00041125214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962645,0.0003301735,0.0013254372,0.00056667643,0.0012341486,0.0002790302],"domain_scores_gemma":[0.9962114,0.00037468836,0.0009897588,0.0007467265,0.0015481217,0.00012931132],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085763197,0.0002240613,0.0005090913,0.00032548094,0.00023858239,0.00015071855,0.00047150967,0.00014305697,0.0019173075],"category_scores_gemma":[0.001231202,0.00021170585,0.00021372824,0.0017625821,0.00047916258,0.0006953422,0.00015825545,0.00013902801,0.000019687903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034523666,0.00015107902,0.0025729977,0.000012158892,0.00002993841,0.0000035474263,0.0005624138,0.9912583,0.00085759914,0.00037909718,0.0032304823,0.0009078197],"study_design_scores_gemma":[0.0007854441,0.000038643648,0.0010685929,0.000038329963,0.000039840637,0.000008613058,0.00023969947,0.99461854,0.0021210075,0.000063645464,0.00077199674,0.00020566255],"about_ca_topic_score_codex":0.000051311843,"about_ca_topic_score_gemma":0.0000070937217,"teacher_disagreement_score":0.16290887,"about_ca_system_score_codex":0.000046335965,"about_ca_system_score_gemma":0.00021074379,"threshold_uncertainty_score":0.99899507},"labels":[],"label_agreement":null},{"id":"W3107516874","doi":"10.1007/s11590-020-01675-z","title":"An efficient heuristic for a hub location routing problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"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":"Travelling salesman problem; Mathematical optimization; Heuristic; Variable neighborhood search; Computer science; Computational intelligence; Selection (genetic algorithm); Local search (optimization); Fraction (chemistry); Steiner tree problem; Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.01530435585602781,"score_gpt":0.24606985011928661,"score_spread":0.23076549426325882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107516874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039486215,0.000017127497,0.99241775,0.0019201174,0.00014339572,0.0005250445,0.000008060215,0.00083597883,0.00018390949],"genre_scores_gemma":[0.3934738,0.000002419831,0.60488147,0.0012841397,0.00014606985,0.0000521448,0.00009328855,0.000062923915,0.0000037503944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894094,0.00006591852,0.00032295732,0.00027176074,0.00014794027,0.0002505041],"domain_scores_gemma":[0.999434,0.00007531116,0.000074327014,0.00017009405,0.00011527432,0.00013099768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024462646,0.00016390612,0.00015260959,0.000068931746,0.00012307311,0.00010392451,0.00015095498,0.000063132095,0.000031080544],"category_scores_gemma":[0.00016402149,0.00019273773,0.000039715396,0.00047111217,0.000020462046,0.00015703551,0.000012623028,0.0000956138,0.000010187797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008654978,0.000012286517,0.000062458115,0.00008638911,0.000012042476,4.7737774e-7,0.00081934046,0.9950904,0.0024069275,0.00015679773,0.0005070711,0.00083711924],"study_design_scores_gemma":[0.0004177975,0.000032059143,0.000030294279,0.000020410673,0.000022508522,0.0000012210651,0.000059393453,0.9982708,0.0007586983,0.0000026288542,0.00016870636,0.00021548341],"about_ca_topic_score_codex":0.0000014519578,"about_ca_topic_score_gemma":1.5274384e-7,"teacher_disagreement_score":0.38952518,"about_ca_system_score_codex":0.00007429956,"about_ca_system_score_gemma":0.00001660457,"threshold_uncertainty_score":0.7859616},"labels":[],"label_agreement":null},{"id":"W3119842321","doi":"10.1007/s11590-020-01677-x","title":"On the approximability of the fixed-tree balanced minimum evolution problem","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Catholique de Louvain; University of British Columbia","keywords":"Tree (set theory); Mathematics; Binary number; Combinatorics; Set (abstract data type); Binary tree; Function (biology); Discrete mathematics; Computer science; Arithmetic; Biology","score_opus":0.005297643925768434,"score_gpt":0.18982560180343933,"score_spread":0.1845279578776709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119842321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75279063,0.00012160635,0.222461,0.020391624,0.00028082865,0.0007380476,0.000023159448,0.000016019525,0.0031770628],"genre_scores_gemma":[0.9878645,0.000014634278,0.010075984,0.0014717075,0.00006603252,0.000038326878,0.00008117874,0.000013755919,0.00037385704],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929345,0.00011800625,0.00013616735,0.00020186655,0.00014075203,0.00010973794],"domain_scores_gemma":[0.999371,0.000016944052,0.000087540015,0.00042419837,0.00008520091,0.000015146772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013473914,0.000080062084,0.000066272696,0.000011072491,0.00007125012,0.000012814999,0.00015521311,0.000048422036,0.000048562233],"category_scores_gemma":[0.000102104204,0.000052217267,0.000073182164,0.00015364998,0.00007385388,0.0000024940016,0.00007212792,0.00005324589,0.0000024218775],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000032419808,0.000087679735,0.0024554424,0.00002351078,0.000052083225,3.4481715e-7,0.000057670193,0.29749346,0.69335884,0.0003671993,0.0058039795,0.00026738612],"study_design_scores_gemma":[0.0030687272,0.00034080897,0.025538621,0.00010716996,0.00013734009,0.000012252255,0.00042187472,0.0932933,0.86869735,0.00065822323,0.006944876,0.00077947375],"about_ca_topic_score_codex":0.0000021105382,"about_ca_topic_score_gemma":0.0000033123804,"teacher_disagreement_score":0.23507388,"about_ca_system_score_codex":0.000023367691,"about_ca_system_score_gemma":0.00003799767,"threshold_uncertainty_score":0.21293584},"labels":[],"label_agreement":null},{"id":"W3170479471","doi":"10.1007/s11590-021-01745-w","title":"Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Wildlife-Road Interactions and Conservation","field":"Environmental 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":"Ministry of Natural Resources and Forestry; Natural Resources Canada; Canadian Forest Service","funders":"","keywords":"Woodland caribou; Wildlife; Revenue; Geography; Taiga; Forest management; Environmental resource management; Environmental science; Ecology; Habitat; Forestry; Business","score_opus":0.046256577832037356,"score_gpt":0.21858020585040228,"score_spread":0.17232362801836493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170479471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77641875,0.000013102602,0.2067108,0.012739583,0.0002125462,0.00015181646,0.0000012178864,0.00004762561,0.0037045332],"genre_scores_gemma":[0.9265759,0.00008706468,0.042868078,0.026539728,0.00034246163,0.00013286978,0.00012248194,0.000049105616,0.0032823142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991938,0.000052804175,0.00016138748,0.0002641804,0.00017396611,0.00015388573],"domain_scores_gemma":[0.999604,0.000041478877,0.00007264656,0.00020153583,0.000006714117,0.00007364029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009121933,0.00010723796,0.000080868915,0.000025548276,0.00022561276,0.00014208679,0.00010193508,0.000025154266,0.00041085941],"category_scores_gemma":[0.000043313725,0.000089587076,0.00003394023,0.0002650266,0.00009101976,0.0007811254,0.000064587744,0.000115779396,0.000023675499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004948262,0.000016112317,0.09701474,0.0000018991011,0.000008767382,0.0000032130015,0.00076339085,0.85543203,0.00016128959,0.000020263302,0.04573022,0.0008431503],"study_design_scores_gemma":[0.00038921315,0.00001432891,0.30032226,0.000032806456,0.000032340387,0.000044657518,0.0007838528,0.6646977,0.00010276545,0.000010502958,0.033323243,0.00024630709],"about_ca_topic_score_codex":0.0002794723,"about_ca_topic_score_gemma":0.00002633558,"teacher_disagreement_score":0.20330754,"about_ca_system_score_codex":0.00005374834,"about_ca_system_score_gemma":0.000011575071,"threshold_uncertainty_score":0.44986224},"labels":[],"label_agreement":null},{"id":"W3175439022","doi":"10.1007/s11590-022-01896-4","title":"Directional asymptotics of Fejér monotone sequences","year":2022,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Monotonic function; Convergence (economics); Mathematical proof; Applied mathematics; Computational intelligence; Mathematical analysis; Computer science","score_opus":0.00684713335480327,"score_gpt":0.20037249911562688,"score_spread":0.1935253657608236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175439022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007308174,0.000015562748,0.9885098,0.009243885,0.0002494922,0.000072366725,0.000010800838,0.00007561713,0.0010916985],"genre_scores_gemma":[0.31876802,0.000022485086,0.67598605,0.0044454033,0.000054826305,0.00004610439,0.00011100536,0.000011991318,0.0005541278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988439,0.00011012693,0.00025579124,0.00022689033,0.00045306346,0.0001102467],"domain_scores_gemma":[0.99939585,0.000060800532,0.00019212428,0.00020681764,0.000105256986,0.000039145198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020601366,0.000080779944,0.00011512323,0.0002215586,0.0002747097,0.000052021718,0.00039982796,0.000015921412,0.000722953],"category_scores_gemma":[0.000027707672,0.000087775734,0.00007150925,0.0010078574,0.000029978679,0.00034177618,0.00015446993,0.000073605566,0.0000048977204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027126566,0.00004538241,0.00056738115,0.0000019299255,0.00002743243,9.556636e-7,0.00013227058,0.97488874,0.00041060895,0.022780254,0.000989841,0.00015246555],"study_design_scores_gemma":[0.00016833881,0.00002092668,0.0003177941,0.000001294818,0.000010342258,0.000005721699,0.000021860065,0.99767846,0.00026625383,0.00015086333,0.0012537568,0.00010436455],"about_ca_topic_score_codex":0.000022069798,"about_ca_topic_score_gemma":5.506996e-7,"teacher_disagreement_score":0.3180372,"about_ca_system_score_codex":0.000073551724,"about_ca_system_score_gemma":0.0000563972,"threshold_uncertainty_score":0.7915828},"labels":[],"label_agreement":null},{"id":"W3180950260","doi":"10.1007/s11590-021-01773-6","title":"An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Robotic Path Planning Algorithms","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":"Université du Québec à Montréal","funders":"","keywords":"Airplane; Computational intelligence; Penalty method; Mathematical optimization; Optimal control; Function (biology); Mathematics; Control (management); Computer science; Variable (mathematics); Control theory (sociology); Engineering; Artificial intelligence; Mathematical analysis; Aerospace engineering","score_opus":0.015437600586475936,"score_gpt":0.27257816478995295,"score_spread":0.25714056420347703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180950260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004529119,0.00003590992,0.9931865,0.0018000888,0.00014532245,0.00024146235,0.000012179415,0.000023968423,0.000025468249],"genre_scores_gemma":[0.22284292,0.0000024149592,0.776417,0.0006574029,0.000024717088,0.000021362577,0.000022958762,0.0000057310067,0.0000054675024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868256,0.000344797,0.00029625048,0.00026526762,0.000246852,0.0001642791],"domain_scores_gemma":[0.9985731,0.0006501491,0.00021061227,0.00040712193,0.0001311181,0.00002786699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007373293,0.000092382696,0.00018336657,0.00009344726,0.000054831566,0.00005494659,0.00043830764,0.00004039606,0.0000058024275],"category_scores_gemma":[0.00022228344,0.00007843649,0.00004850298,0.00036917947,0.000029811665,0.00042822756,0.000028452794,0.00007894334,3.699497e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020342428,0.000055652203,0.0005496741,0.000021313215,0.000012823723,0.00000817614,0.00095108384,0.9865257,0.009931198,0.00048449344,0.00009391294,0.0013456132],"study_design_scores_gemma":[0.00060488033,0.0000842928,0.0029248013,0.000031629,0.0000149176785,0.000016337643,0.00014710757,0.994433,0.0016267792,0.00001866587,0.000019426945,0.00007816064],"about_ca_topic_score_codex":0.000033626202,"about_ca_topic_score_gemma":0.0000013241483,"teacher_disagreement_score":0.2183138,"about_ca_system_score_codex":0.000018704282,"about_ca_system_score_gemma":0.00006080096,"threshold_uncertainty_score":0.31985474},"labels":[],"label_agreement":null},{"id":"W4318480902","doi":"10.1007/s11590-023-01973-2","title":"Nicely structured positive bases with maximal cosine measure","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Wollongong","keywords":"Basis (linear algebra); Measure (data warehouse); Algorithm; Trigonometric functions; Computer science; Mathematics; Artificial intelligence; Data mining; Geometry","score_opus":0.03126364182703274,"score_gpt":0.3024735883603846,"score_spread":0.2712099465333519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318480902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003460911,0.000008192953,0.98770905,0.006601517,0.00007550262,0.00060040405,0.00006701327,0.0005493775,0.0009280311],"genre_scores_gemma":[0.021340165,0.000029421413,0.97425675,0.0018551646,0.00015434145,0.000099683704,0.000529148,0.00017120091,0.001564147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981247,0.000120926656,0.00026788464,0.0003839543,0.00068901025,0.00041349855],"domain_scores_gemma":[0.9987603,0.00027890463,0.00014756185,0.00034005116,0.0003482876,0.0001249065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020477339,0.00023347468,0.00023417409,0.00031164687,0.00022493348,0.0000964468,0.00020559665,0.00007647052,0.0004922348],"category_scores_gemma":[0.00036669147,0.00020365977,0.00004971808,0.0013429545,0.00012212162,0.00036553212,0.000065393804,0.00020046993,0.000052280175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014977828,0.00003357096,0.00009722619,0.000029170475,0.00006357342,0.00007104491,0.00022416419,0.987172,0.0005606301,0.00091501593,0.010031259,0.00065254205],"study_design_scores_gemma":[0.0027320425,0.00019046999,0.0003948001,0.00016776801,0.00007156039,0.000073194875,0.00032973458,0.9913819,0.0026302545,0.00072731957,0.00057784526,0.00072311773],"about_ca_topic_score_codex":0.000004750903,"about_ca_topic_score_gemma":0.000005449312,"teacher_disagreement_score":0.017879253,"about_ca_system_score_codex":0.00011418264,"about_ca_system_score_gemma":0.000060478837,"threshold_uncertainty_score":0.8305005},"labels":[],"label_agreement":null},{"id":"W4362596021","doi":"10.1007/s11590-023-02000-0","title":"On the complexity of proportionate open shop and job shop problems","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Open shop; Job shop scheduling; Computational intelligence; Job shop; Mathematical proof; Mathematics; Computer science; Time complexity; Mathematical optimization; Combinatorics; Discrete mathematics; Flow shop scheduling; Artificial intelligence","score_opus":0.046146299963866724,"score_gpt":0.24560146784742318,"score_spread":0.19945516788355644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362596021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1083145,0.000053470838,0.8447929,0.03394816,0.0007085706,0.0017796624,0.00005357875,0.0010451163,0.009304029],"genre_scores_gemma":[0.7508185,0.00032913723,0.24362025,0.0032807586,0.00013583568,0.0002101082,0.00042277,0.00016226235,0.0010203728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.000030639887,0.00020286518,0.00013672943,0.00015086331,0.00012871994],"domain_scores_gemma":[0.99964374,0.000059718797,0.000048337955,0.00016784763,0.00004522677,0.000035128953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002358987,0.0001001393,0.00011280096,0.00009135183,0.00009339397,0.000082966246,0.00018144831,0.00003527613,0.00016204498],"category_scores_gemma":[0.000049837843,0.0000785788,0.000021101114,0.0004308314,0.00011812552,0.00012335385,0.000054245782,0.000086407235,0.000020870166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033810993,0.000006031462,0.00012236692,0.000019954748,0.000017883933,6.452113e-7,0.00016896168,0.99308056,0.00014975462,0.0031357426,0.0031365817,0.00015816613],"study_design_scores_gemma":[0.00022092595,0.000010871588,0.0003039807,0.00002929818,0.0000064308842,0.0000012384133,0.000058725702,0.9987406,0.00022542618,0.00021396764,0.00009011574,0.00009841781],"about_ca_topic_score_codex":0.000005471421,"about_ca_topic_score_gemma":0.000001414395,"teacher_disagreement_score":0.64250404,"about_ca_system_score_codex":0.0000176175,"about_ca_system_score_gemma":0.000007947452,"threshold_uncertainty_score":0.32043505},"labels":[],"label_agreement":null},{"id":"W4383065888","doi":"10.1007/s11590-023-02033-5","title":"Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Hessian matrix; Eigenvalues and eigenvectors; Block matrix; Mathematics; Curvature; Diagonal; Hessian equation; Quasi-Newton method; Mathematical optimization; Applied mathematics; Matrix (chemical analysis); Function (biology); Diagonal matrix; Algorithm; Computer science; Newton's method; Mathematical analysis; Geometry","score_opus":0.0137678340011307,"score_gpt":0.24152640173663803,"score_spread":0.22775856773550734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383065888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066219196,0.000026548072,0.991278,0.000926509,0.00010474235,0.0003645846,0.0000027530853,0.00047243934,0.00020251317],"genre_scores_gemma":[0.16190837,0.00012678142,0.8376372,0.000204787,0.000016701331,0.000053334817,0.000016796761,0.000023330833,0.000012707735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998549,0.00010724882,0.00041862222,0.00040473093,0.00025979092,0.0002606156],"domain_scores_gemma":[0.9990853,0.00020188499,0.0002915409,0.00028155764,0.000084234176,0.00005545621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004063559,0.00016845675,0.00021452307,0.00083912537,0.00010586474,0.00011842963,0.00033266254,0.00006932346,0.000012763198],"category_scores_gemma":[0.00021422279,0.00017775338,0.00003329957,0.0021518697,0.00007707149,0.00081762817,0.00016135235,0.0000913958,0.0000019728022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004702864,0.000013831774,0.0007164314,0.000028839364,0.0000071591758,0.0000033283127,0.0011213664,0.9955072,0.00024977795,0.0012847843,0.00005152463,0.0010110796],"study_design_scores_gemma":[0.00030553245,0.00003162112,0.00040734606,0.000069183276,0.0000054817383,0.000004123646,0.00011686089,0.99684644,0.001770395,0.0002705602,0.0000022795277,0.00017017405],"about_ca_topic_score_codex":0.000029641216,"about_ca_topic_score_gemma":0.0000012945248,"teacher_disagreement_score":0.15528645,"about_ca_system_score_codex":0.0000516812,"about_ca_system_score_gemma":0.00002306338,"threshold_uncertainty_score":0.7248573},"labels":[{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"grok","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"opus","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"agree"},{"id":"W4385392424","doi":"10.1007/s11590-023-02036-2","title":"Every proximal mapping is a resolvent of level proximal subdifferential","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subderivative; Resolvent; Mathematics; Pure mathematics; Function (biology); Representation (politics); Mathematical analysis; Applied mathematics; Regular polygon; Geometry; Convex optimization","score_opus":0.0362417735556344,"score_gpt":0.2407461680358212,"score_spread":0.20450439448018679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385392424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00548517,0.0000056835743,0.9806597,0.013055066,0.00018340557,0.0001870683,0.000016763035,0.0001877584,0.00021935071],"genre_scores_gemma":[0.29135188,0.000040583076,0.70189375,0.004616318,0.0001780588,0.000068623995,0.00026326347,0.00003603624,0.0015514645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984233,0.00007254214,0.0004024734,0.00037340683,0.0004870749,0.00024124127],"domain_scores_gemma":[0.9991615,0.00004684879,0.00022085226,0.00032891886,0.0001756879,0.00006623462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002341175,0.00014267539,0.00019232846,0.00048201033,0.00013524879,0.000118413554,0.00044012655,0.00005666276,0.00019471344],"category_scores_gemma":[0.000047366328,0.00014195146,0.00012951922,0.001752386,0.000036030382,0.00050719164,0.00017790169,0.000076919445,0.000046165133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011839087,0.00007373801,0.0014970568,0.00003316848,0.00008417338,0.000004465776,0.0010070737,0.9802004,0.0025738091,0.0053036143,0.0085954275,0.000615231],"study_design_scores_gemma":[0.0003685396,0.000016119364,0.004295694,0.000018874878,0.0000140706725,0.000001768357,0.000021156096,0.9937356,0.0009742381,0.000069101094,0.0003224397,0.00016241043],"about_ca_topic_score_codex":0.000014639211,"about_ca_topic_score_gemma":7.104095e-7,"teacher_disagreement_score":0.28586674,"about_ca_system_score_codex":0.000043171607,"about_ca_system_score_gemma":0.000059693295,"threshold_uncertainty_score":0.57886124},"labels":[],"label_agreement":null},{"id":"W4386828169","doi":"10.1007/s11590-023-02058-w","title":"Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design 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":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Line (geometry); Constant (computer programming); Approximation algorithm; Line segment; Discrete mathematics; Euclidean geometry; Point (geometry); Tree (set theory); Computer science; Geometry","score_opus":0.010013078112781465,"score_gpt":0.21826461661679858,"score_spread":0.20825153850401712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386828169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003611537,0.000008017506,0.9938135,0.000976509,0.00005107688,0.0005948229,0.000017257766,0.00049230683,0.00043493923],"genre_scores_gemma":[0.06283027,0.000033441032,0.93534493,0.00040441353,0.00015690847,0.00040985644,0.00028180855,0.00011531166,0.00042305383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992877,0.00001536145,0.00023049625,0.00013233256,0.00015292042,0.00018117852],"domain_scores_gemma":[0.999583,0.000079257064,0.000067677596,0.00017364325,0.000073263065,0.000023152686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019094875,0.00013196432,0.0001377095,0.000088857014,0.0000554327,0.00003259591,0.00011089115,0.00005233521,0.00002444819],"category_scores_gemma":[0.000011056373,0.0000943978,0.000042933327,0.00037081738,0.000031961274,0.00018388507,0.000014023877,0.00006356356,0.00000649018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008950278,0.000013848582,0.000077816505,0.00010439488,0.000055874654,0.0000010354047,0.00038149298,0.9594408,0.007830255,0.000086984786,0.013214764,0.01878378],"study_design_scores_gemma":[0.00040030174,0.000030257284,0.000024240322,0.000047583148,0.000025271343,0.0000031315897,0.000054794175,0.9909074,0.007986117,0.000034760338,0.0003506655,0.00013549799],"about_ca_topic_score_codex":0.0000032881746,"about_ca_topic_score_gemma":0.0000012145283,"teacher_disagreement_score":0.059218735,"about_ca_system_score_codex":0.000025232037,"about_ca_system_score_gemma":0.0000067395986,"threshold_uncertainty_score":0.38494307},"labels":[],"label_agreement":null},{"id":"W4391223639","doi":"10.1007/s11590-023-02090-w","title":"Differentially private k-center problems","year":2024,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Center (category theory); Computational intelligence; Computer science; Mathematics; Artificial intelligence; Chemistry","score_opus":0.01630995703206536,"score_gpt":0.23484497362833928,"score_spread":0.21853501659627392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391223639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009236232,0.000066297755,0.8853718,0.11036924,0.0007919404,0.0001530067,0.000007161773,0.0018803442,0.00043656494],"genre_scores_gemma":[0.032505166,0.000099990124,0.9649726,0.002123564,0.00007029705,0.000038190294,0.00006559355,0.000028320877,0.00009625592],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987726,0.000036563975,0.00019882753,0.0004896581,0.00023836404,0.00026399264],"domain_scores_gemma":[0.9968173,0.00004061511,0.00004209726,0.0030393263,0.000021724862,0.00003895818],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00012893615,0.00014093469,0.000097493314,0.00019430048,0.00007213293,0.00066354265,0.009277383,0.00006434482,0.00007613765],"category_scores_gemma":[0.0006153391,0.0001278389,0.000046718156,0.0005163433,0.000053880703,0.0010140941,0.01617842,0.00017136718,0.000099231715],"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.0000028247223,0.00007838177,0.0004335957,0.00013992809,0.00008981519,0.00006992716,0.00015045278,0.1021301,0.006326343,0.0144586135,0.85672444,0.019395597],"study_design_scores_gemma":[0.0001270028,0.000011577931,0.00004455217,0.00007781301,0.000004133564,0.000011503547,6.808858e-7,0.97641724,0.0006413617,0.004296622,0.018198239,0.0001692495],"about_ca_topic_score_codex":0.0000027577855,"about_ca_topic_score_gemma":4.844614e-7,"teacher_disagreement_score":0.8742872,"about_ca_system_score_codex":0.00006174111,"about_ca_system_score_gemma":0.000016886082,"threshold_uncertainty_score":0.9960829},"labels":[],"label_agreement":null},{"id":"W4398144673","doi":"10.1007/s11590-024-02121-0","title":"Comments on finite termination of the generalized Newton method for absolute value equations","year":2024,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Mathematics; Applied mathematics; Value (mathematics); Absolute (philosophy); Newton's method; Mathematical analysis; Calculus (dental); Nonlinear system; Computer science; Physics; Statistics; Medicine; Artificial intelligence","score_opus":0.08917482597135298,"score_gpt":0.4120335905499375,"score_spread":0.32285876457858453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398144673","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047484107,0.000010454381,0.9784597,0.019118426,0.00056363485,0.0008343861,0.00012613423,0.000072953604,0.0003394706],"genre_scores_gemma":[0.0019750216,0.000002955393,0.9936074,0.0018131238,0.00013387844,0.00015389385,0.00015104227,0.000049988386,0.0021126799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985728,0.00041041072,0.00040424944,0.00021723527,0.00025119487,0.0001440627],"domain_scores_gemma":[0.9965401,0.0028148605,0.00018180306,0.00031387497,0.00012435424,0.000024994468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007824961,0.00014464415,0.00016991876,0.00018602888,0.0001846999,0.00007690608,0.00016953162,0.000059370494,0.000058509275],"category_scores_gemma":[0.0013000799,0.0001110158,0.00017077943,0.0004147803,0.00004096913,0.00015772479,0.00003267167,0.000106558015,0.000004545342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015858677,0.00007580877,0.0000047541803,0.0001095897,0.00007983929,3.353512e-7,0.00094663375,0.79906833,0.005221903,0.1821543,0.009990263,0.0023323915],"study_design_scores_gemma":[0.00038733578,0.00003289953,0.000009473466,0.000113091235,0.000108099266,6.84853e-7,0.00001417125,0.9737671,0.005095999,0.01665177,0.0037059623,0.00011341674],"about_ca_topic_score_codex":0.0000073062088,"about_ca_topic_score_gemma":0.0000023622722,"teacher_disagreement_score":0.17469877,"about_ca_system_score_codex":0.00009230477,"about_ca_system_score_gemma":0.00003877892,"threshold_uncertainty_score":0.4527093},"labels":[],"label_agreement":null},{"id":"W4404790055","doi":"10.1007/s11590-024-02165-2","title":"Convergence towards a local minimum by direct search methods with a covering step","year":2024,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Iterative Methods for Nonlinear Equations","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computational intelligence; Convergence (economics); Mathematical optimization; Mathematics; Computer science; Artificial intelligence; Economics","score_opus":0.05197252452228647,"score_gpt":0.39286515572204644,"score_spread":0.34089263119976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404790055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020025657,0.00010320367,0.9935203,0.0020441348,0.00024820448,0.00033432106,0.000047756912,0.0002501449,0.0014493666],"genre_scores_gemma":[0.0081137875,0.000013652055,0.9899495,0.00048013162,0.00007406475,0.000053469434,0.000058710168,0.00007240192,0.0011842421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825174,0.0004991431,0.00027940416,0.0003735656,0.0003281754,0.00026796138],"domain_scores_gemma":[0.9988005,0.00070930383,0.000051219886,0.0002562042,0.00010328695,0.00007947529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091843825,0.00020158413,0.00023145822,0.00015408544,0.00011305645,0.00018041128,0.00014741068,0.00006055474,0.00041680882],"category_scores_gemma":[0.00020552146,0.00016927945,0.00006921714,0.00062547636,0.0001384065,0.0002917323,0.000049779672,0.00020373675,0.000024037077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017212625,0.00025884266,0.00014689099,0.0010052052,0.0007658222,0.00012326278,0.008174141,0.8246178,0.03639552,0.010944387,0.047578383,0.069817625],"study_design_scores_gemma":[0.00023934641,0.00006264934,0.0000026343823,0.000119369855,0.000067701934,0.000013731711,0.00013667018,0.9809526,0.011544076,0.00014330311,0.0064630182,0.0002548638],"about_ca_topic_score_codex":0.000024638757,"about_ca_topic_score_gemma":0.0000028572726,"teacher_disagreement_score":0.15633483,"about_ca_system_score_codex":0.00014848693,"about_ca_system_score_gemma":0.00009272416,"threshold_uncertainty_score":0.69030154},"labels":[],"label_agreement":null},{"id":"W4407244990","doi":"10.1007/s11590-025-02192-7","title":"A necessary condition for the guarantee of the superiorization method","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Cancer Institute; National Institutes of Health; University of Haifa; Israel Science Foundation; National Natural Science Foundation of China; Deutsches Krebsforschungszentrum","keywords":"Iterated function; Sequence (biology); Function (biology); Outcome (game theory); Mathematics; Mathematical optimization; Value (mathematics); Convergence (economics); Initial value problem; Convex function; Rate of convergence; Regular polygon; Algorithm; Gradient descent; Applied mathematics; Computer science; Mathematical economics; Statistics; Mathematical analysis; Channel (broadcasting); Artificial intelligence","score_opus":0.006837686961980912,"score_gpt":0.2661051495676065,"score_spread":0.2592674626056256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407244990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070429465,0.000027185395,0.94670105,0.05228793,0.00034272202,0.0003160496,0.000008174042,0.00003224231,0.00021420808],"genre_scores_gemma":[0.113278955,0.000059947823,0.8679016,0.017581703,0.00007324882,0.00014388555,0.000079578575,0.000012739157,0.00086831505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991686,0.00011659795,0.00025659523,0.00018751029,0.00017767942,0.000093056056],"domain_scores_gemma":[0.9989299,0.00033365298,0.000157417,0.00035182064,0.00021793031,0.000009240615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030329387,0.000081625214,0.00010524499,0.000110975714,0.00030928827,0.000099570694,0.0005453784,0.00003673093,0.0000302045],"category_scores_gemma":[0.00013265101,0.000051440715,0.00011661787,0.0011279645,0.000039909486,0.00031531687,0.00007305647,0.00004652967,8.7881216e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039441825,0.00001333315,0.00015159039,0.000007371429,0.000041515934,2.286411e-8,0.000107749234,0.88909423,0.0004147712,0.10742307,0.002093019,0.00064936234],"study_design_scores_gemma":[0.00029028096,0.000004932651,0.000683144,0.000012095407,0.00005254156,5.03605e-7,0.000022399392,0.9959737,0.0008651907,0.0005369547,0.0015023486,0.000055925673],"about_ca_topic_score_codex":0.00001212651,"about_ca_topic_score_gemma":0.0000020342088,"teacher_disagreement_score":0.113208525,"about_ca_system_score_codex":0.000028396924,"about_ca_system_score_gemma":0.00006179425,"threshold_uncertainty_score":0.23788266},"labels":[],"label_agreement":null},{"id":"W4409067445","doi":"10.1007/s11590-025-02197-2","title":"Publisher Correction: A necessary condition for the guarantee of the superiorization method","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Statistical Methods in Clinical Trials","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":"Computational intelligence; Computer science; Artificial intelligence","score_opus":0.17409348746357278,"score_gpt":0.49143962599326285,"score_spread":0.31734613852969007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409067445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107739885,0.000012823795,0.97442806,0.017422918,0.0061428198,0.0009788375,0.000017085833,0.000041511536,0.00084819226],"genre_scores_gemma":[0.0030139277,0.000013876398,0.99150926,0.0038711806,0.00015739017,0.00019648352,0.000009761736,0.000022050797,0.0012060715],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998221,0.000638584,0.0005918389,0.0002082995,0.00021225751,0.00012805867],"domain_scores_gemma":[0.97317153,0.025872597,0.00029548505,0.00040169497,0.00024518667,0.000013479595],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0018063418,0.000112127695,0.00025447545,0.000061561776,0.00021913605,0.00007480461,0.00028782312,0.00009986332,0.00014338232],"category_scores_gemma":[0.033514906,0.00006838211,0.00015202808,0.0005897199,0.00014573339,0.00014169305,0.00005167764,0.00013614305,6.00892e-7],"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.00018875812,0.00012217996,0.00044759945,0.00018072971,0.00023803623,2.2196181e-7,0.00022768087,0.35024443,0.00068357185,0.16366777,0.47328153,0.010717509],"study_design_scores_gemma":[0.0017595342,0.000045337143,0.0005605812,0.00018533849,0.0005454692,0.0000025935478,0.00021726545,0.69138724,0.0017127416,0.2987142,0.0046710726,0.0001986188],"about_ca_topic_score_codex":0.000006816623,"about_ca_topic_score_gemma":0.0000017078931,"teacher_disagreement_score":0.46861047,"about_ca_system_score_codex":0.00004162534,"about_ca_system_score_gemma":0.000050107406,"threshold_uncertainty_score":0.9746262},"labels":[],"label_agreement":null},{"id":"W4412203422","doi":"10.1007/s11590-025-02220-6","title":"Greedy Newton: Newton’s method with exact line search","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Iterative Methods for Nonlinear Equations","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":"Alberta Medical Association; University of British Columbia","funders":"","keywords":"Newton's method; Line (geometry); Computational intelligence; Mathematics; Quasi-Newton method; Applied mathematics; Mathematical optimization; Line search; Computer science; Artificial intelligence; Nonlinear system; Physics; Geometry","score_opus":0.06196056590926636,"score_gpt":0.4028590808849789,"score_spread":0.34089851497571255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412203422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019074898,0.0000140632565,0.9685972,0.025841432,0.00014942343,0.00049556507,0.000013512733,0.00016584249,0.0028154862],"genre_scores_gemma":[0.0006908103,0.00000522346,0.98673123,0.0027268932,0.00013044142,0.000044226344,0.00008117755,0.00004994714,0.009540021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816334,0.0004981098,0.000364833,0.0003658885,0.00031519888,0.0002926135],"domain_scores_gemma":[0.9983046,0.00078963983,0.00011776606,0.0004765128,0.00024242535,0.00006906138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007899222,0.00022858393,0.00028766308,0.00034468583,0.00021824072,0.000120944576,0.00022193916,0.00008138999,0.00037538918],"category_scores_gemma":[0.0003855528,0.00019478763,0.00007735598,0.00092988485,0.00007947198,0.00025090988,0.00006577989,0.00025582482,0.000019211007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090675625,0.00016674511,0.00047893715,0.00010743815,0.00019079448,0.000014322367,0.0008839999,0.9409921,0.0026612142,0.036940463,0.01363777,0.003835506],"study_design_scores_gemma":[0.0016997441,0.0001239117,0.00010773566,0.00016462314,0.00019395835,0.000015313271,0.00019157815,0.97663265,0.008139386,0.003346748,0.008918901,0.0004654253],"about_ca_topic_score_codex":0.000028900173,"about_ca_topic_score_gemma":0.000015329928,"teacher_disagreement_score":0.03564054,"about_ca_system_score_codex":0.00012430763,"about_ca_system_score_gemma":0.000105121144,"threshold_uncertainty_score":0.79432094},"labels":[],"label_agreement":null},{"id":"W4412793654","doi":"10.1007/s11590-025-02221-5","title":"Computing approximate Nash equilibria for integer programming games","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Université de Toulouse; Institut de Valorisation des Données; Princeton University","keywords":"Integer programming; Computational intelligence; Nash equilibrium; Integer (computer science); Computer science; Mathematical optimization; Game theory; Mathematics; Mathematical economics; Artificial intelligence; Programming language","score_opus":0.03253869857474278,"score_gpt":0.36418847203313565,"score_spread":0.33164977345839286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412793654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005011574,0.000026877982,0.99309975,0.0036453442,0.00023710553,0.0012233843,0.0000069447988,0.0003517158,0.0009077013],"genre_scores_gemma":[0.002936557,0.000008246395,0.9942585,0.0010601389,0.000084447965,0.00014731225,0.000076600365,0.00005841553,0.0013697626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983741,0.00009605001,0.00045097995,0.0003964812,0.00024158513,0.00044079515],"domain_scores_gemma":[0.9984887,0.00068080303,0.0001719601,0.00031949556,0.00027506775,0.000063931424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165842,0.00020277876,0.00026494465,0.00029032232,0.00027582093,0.00018373906,0.00026692165,0.00008498023,0.00006797387],"category_scores_gemma":[0.0012112953,0.00020720366,0.00009935184,0.0006433776,0.00009641597,0.00027923135,0.00013745119,0.00019315284,0.000003951225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042555617,0.00008566565,0.00007262857,0.00028978297,0.00007382598,0.0000016870082,0.00031932167,0.9593876,0.00044310212,0.015701598,0.008669013,0.01491324],"study_design_scores_gemma":[0.0008524701,0.000016827942,0.0000023575433,0.000108186956,0.0000242229,0.0000017798594,0.00015933736,0.9929567,0.0005323004,0.0018638383,0.0032817281,0.00020028227],"about_ca_topic_score_codex":0.0000014482981,"about_ca_topic_score_gemma":5.9548057e-7,"teacher_disagreement_score":0.03356909,"about_ca_system_score_codex":0.00013040066,"about_ca_system_score_gemma":0.000056486315,"threshold_uncertainty_score":0.844952},"labels":[],"label_agreement":null}]}