{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":79,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":79,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a8563e9b44bc","filters":{"venue":"Optimization Letters"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04295862349070323,"gpt":0.27375931317915,"spread":0.2308006896884468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009378234,0.0003511006,0.0004192199,0.0005550673,0.0007636373,0.0003078737,0.001142434,0.0001533027,0.0002964882],"category_scores_gemma":[0.0004603338,0.0003688647,0.000136359,0.001901655,0.0001771741,0.001312945,0.0002729751,0.0002312876,0.00004229836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002081657,"about_ca_system_score_gemma":0.0003145038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003078246,"about_ca_topic_score_gemma":3.923437e-7,"domain_scores_codex":[0.9962648,0.0003762438,0.0006043286,0.0009888214,0.0009927396,0.000773062],"domain_scores_gemma":[0.9971781,0.0005180081,0.0002055929,0.0008711414,0.0009300998,0.0002970991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002764283,0.00009446137,0.00001934159,0.00001529855,0.00005818002,0.00001309492,0.0002375154,0.9854199,0.00007876186,0.002514956,0.01042361,0.001097296],"study_design_scores_gemma":[0.001162342,0.00011312,0.00001794212,0.00001610343,0.00001592556,0.00003387282,0.00001886136,0.9962445,0.0006609765,0.00002363076,0.001283788,0.0004089548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001965063,0.00005090545,0.9925301,0.002534506,0.0006793573,0.00116897,0.00004015586,0.0004330638,0.002543306],"genre_scores_gemma":[0.00109384,0.000163106,0.9951981,0.001236069,0.000205173,0.0002720343,0.0002043698,0.0000683692,0.001558914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01082464,"threshold_uncertainty_score":0.9998763,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04759172000207915,"gpt":0.1971315001747639,"spread":0.1495397801726847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007248982,0.0001516608,0.0001367479,0.0000342181,0.00007060794,0.00005598611,0.0001241362,0.00006913037,0.0001573702],"category_scores_gemma":[0.000006711759,0.0001572566,0.00003737391,0.0001696907,0.00002683753,0.0001948971,0.000006230769,0.00008177795,0.0000219116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004113292,"about_ca_system_score_gemma":0.000007414304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002077116,"about_ca_topic_score_gemma":0.000004392159,"domain_scores_codex":[0.9992678,0.00001254079,0.0002018522,0.0001433113,0.00008827282,0.0002862792],"domain_scores_gemma":[0.9995613,0.00007120119,0.00002834806,0.0001750654,0.00009265278,0.00007149766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004137531,0.000006388878,0.00003055486,0.0000249121,0.00002375385,7.767767e-7,0.0000477543,0.9543192,0.00007700614,0.0006670877,0.04468507,0.0001133502],"study_design_scores_gemma":[0.0003107355,0.000008156818,0.0000146377,0.000008485737,0.00003114037,6.363965e-7,0.000003735767,0.9979182,0.00005110665,0.0006933622,0.0007627883,0.0001969933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007832557,0.00005863128,0.9974089,0.0005327532,0.0003874417,0.000458787,0.00001565949,0.0002877224,0.0007717367],"genre_scores_gemma":[0.1514141,0.00003001974,0.843575,0.004214822,0.0003342351,0.0001205114,0.0001737351,0.00006613055,0.00007150375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1538339,"threshold_uncertainty_score":0.6412736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007874505805032505,"gpt":0.2197209345693394,"spread":0.2118464287643069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001448446,0.000130638,0.0001467932,0.0001599981,0.0001980038,0.0001985422,0.0002733372,0.00004537308,0.00003122581],"category_scores_gemma":[0.00004810189,0.0001241829,0.0001037517,0.0005675593,0.00002651876,0.0005174412,0.00004473297,0.00004437486,0.00001318201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004682952,"about_ca_system_score_gemma":0.00003087759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003092802,"about_ca_topic_score_gemma":0.000003148117,"domain_scores_codex":[0.9989371,0.00003592757,0.0002655485,0.0003401515,0.0002072112,0.0002140328],"domain_scores_gemma":[0.9992583,0.00008261966,0.0001579461,0.0002152261,0.0002397463,0.00004612519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005674904,0.00005409207,0.0002807659,0.000004144234,0.00002057138,7.825616e-7,0.00004696726,0.978547,0.0000879849,0.01617088,0.003069193,0.001711934],"study_design_scores_gemma":[0.0004481697,0.00002448188,0.0001985745,0.000004955953,0.00001936312,0.000001570703,0.00000621181,0.9903423,0.00009727223,0.0001637066,0.008522673,0.0001706823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001189097,0.00001022764,0.9900535,0.00874201,0.0001803772,0.0003183567,0.000008104034,0.0001893299,0.0003791424],"genre_scores_gemma":[0.01626399,0.000002632409,0.9800341,0.002266871,0.0001924068,0.00009582654,0.0002068242,0.00001584939,0.0009215666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01614508,"threshold_uncertainty_score":0.5064034,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01857606022099673,"gpt":0.2341072590814079,"spread":0.2155311988604112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004492581,0.0001763036,0.0001300519,0.00009829743,0.000170321,0.000106683,0.000206495,0.0000819216,0.000155591],"category_scores_gemma":[0.00007049205,0.0001217132,0.00005235573,0.0003802471,0.00005075719,0.0003210506,0.0000237299,0.00008088529,0.0000112602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001692105,"about_ca_system_score_gemma":0.00001994299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003533419,"about_ca_topic_score_gemma":5.135687e-7,"domain_scores_codex":[0.9988111,0.00009831277,0.0003020363,0.0002351665,0.0001917946,0.0003615487],"domain_scores_gemma":[0.9991283,0.0002902089,0.00005594852,0.0002917994,0.0001721012,0.00006158414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001053485,0.00002052011,0.0001875345,0.00002184551,0.00004931185,1.657926e-7,0.0001184129,0.9490151,0.04303877,0.0009936837,0.003344067,0.003200022],"study_design_scores_gemma":[0.0008989245,0.00002185071,0.00004671655,0.00003493279,0.00002320981,0.000003259925,0.00001404753,0.9893632,0.005893303,0.00002790513,0.003474146,0.0001985022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009149132,0.0000231403,0.9911734,0.005460791,0.0003540411,0.0005888964,0.00002884822,0.0003816265,0.001074385],"genre_scores_gemma":[0.06470676,0.00004968205,0.9326487,0.001307384,0.0002898573,0.0001810539,0.0001119628,0.0001267362,0.0005778266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06379184,"threshold_uncertainty_score":0.4963322,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02975607368458899,"gpt":0.2471288211645561,"spread":0.2173727474799671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007924789,0.0001992899,0.0001619138,0.0001164245,0.0001639051,0.0001478028,0.00023167,0.00008549941,0.00004450261],"category_scores_gemma":[0.0003595997,0.0001758965,0.0000487817,0.0005736817,0.00004655318,0.0002761166,0.00002880291,0.000164625,0.00001856435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001803183,"about_ca_system_score_gemma":0.00004900172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001463927,"about_ca_topic_score_gemma":0.000001559071,"domain_scores_codex":[0.9986454,0.0001377037,0.0003389238,0.0002501851,0.0002616798,0.000366059],"domain_scores_gemma":[0.9987938,0.0004048255,0.00006352654,0.0003256424,0.0002962103,0.0001160222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002148834,0.00002521133,0.000442333,0.0000447397,0.00005222034,3.81886e-7,0.0005821455,0.9908091,0.0006109492,0.0002792799,0.006528344,0.0006037669],"study_design_scores_gemma":[0.001332238,0.00002289567,0.00004028446,0.00002408642,0.00003391103,0.000004502927,0.0001163927,0.9959961,0.0003254668,0.00003263624,0.0018683,0.0002031613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006452331,0.00004640879,0.9946702,0.002033998,0.0004301074,0.0008896425,0.00002975659,0.0004352851,0.0008194272],"genre_scores_gemma":[0.1722277,0.00002275323,0.8255587,0.001115131,0.0001952855,0.000258659,0.0003256839,0.000126488,0.0001695737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1715825,"threshold_uncertainty_score":0.717285,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01278262418791783,"gpt":0.225733239364,"spread":0.2129506151760822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428374,0.0002236,0.0001940331,0.00010385,0.00028708,0.0001840939,0.0002563543,0.00008929081,0.00005591437],"category_scores_gemma":[0.00005358359,0.0001773663,0.00004485674,0.0004669531,0.00004568898,0.0002179491,0.00001640934,0.0001879922,0.00000571686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006033482,"about_ca_system_score_gemma":0.00002999087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006734333,"about_ca_topic_score_gemma":0.000001303336,"domain_scores_codex":[0.998647,0.0001228274,0.0002858521,0.0002867313,0.0002303913,0.0004271822],"domain_scores_gemma":[0.999034,0.0003703136,0.00006036071,0.0003327555,0.0001185058,0.00008403919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001630301,0.00001214893,0.0001445841,0.00005069359,0.0000691245,4.030077e-7,0.0002682467,0.9932187,0.002138766,0.002044151,0.0004376511,0.001599179],"study_design_scores_gemma":[0.0008023037,0.00003905276,0.0001043141,0.00003581919,0.00005534663,0.000007610108,0.0000168727,0.9972998,0.0005616079,0.00002692202,0.0008006974,0.0002496254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008112057,0.00001931623,0.9947014,0.001411834,0.0001794175,0.0006356611,0.00000781512,0.0003451718,0.001888149],"genre_scores_gemma":[0.05407461,0.00002279312,0.9441194,0.001002055,0.0002942733,0.0001187126,0.000054929,0.000126123,0.0001871241],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0532634,"threshold_uncertainty_score":0.7232786,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02134978858238772,"gpt":0.2425588380450419,"spread":0.2212090494626542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089159,0.000228101,0.000176561,0.0001360988,0.0002651015,0.0002621095,0.0002578586,0.00009320794,0.00008887528],"category_scores_gemma":[0.0001501463,0.0002096598,0.00006453193,0.0005488124,0.00006668286,0.0005725059,0.00007942282,0.0002668563,0.00006373005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001989107,"about_ca_system_score_gemma":0.00004688548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003412622,"about_ca_topic_score_gemma":0.000004923193,"domain_scores_codex":[0.9984651,0.0001916229,0.0003997835,0.000230115,0.0003161139,0.0003972621],"domain_scores_gemma":[0.999212,0.0000969419,0.000117798,0.0002868251,0.000144906,0.0001414827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006757909,0.000009420481,0.0004535528,0.00002747821,0.00003091565,0.000005046744,0.001798749,0.9930032,0.0004960313,0.0009239972,0.002627791,0.0006170052],"study_design_scores_gemma":[0.0004943563,0.00002170253,0.00004265819,0.00007748095,0.00003116651,0.00002589847,0.0004291177,0.9962184,0.0003668297,0.0001641562,0.001824352,0.0003038721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005696145,0.00004460406,0.9805627,0.003028943,0.000272399,0.0004605179,0.000002559861,0.0008300917,0.009101986],"genre_scores_gemma":[0.1205873,0.00004926907,0.8763456,0.002394625,0.0002187614,0.0001234177,0.00005307517,0.0001149499,0.0001129263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1148912,"threshold_uncertainty_score":0.854968,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02077779743648529,"gpt":0.2077353779526046,"spread":0.1869575805161193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007135089,0.0002204838,0.0002060419,0.00005738673,0.000101854,0.00006566163,0.0001244416,0.00009672807,0.0001064806],"category_scores_gemma":[0.0001282404,0.0002289008,0.00006988248,0.0001437604,0.00003401283,0.0001901362,0.00001578408,0.000133541,0.00001407097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006996624,"about_ca_system_score_gemma":0.000006705915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.185024e-7,"about_ca_topic_score_gemma":3.078321e-8,"domain_scores_codex":[0.9989898,0.00002291728,0.0002799636,0.0002980993,0.000164877,0.0002442939],"domain_scores_gemma":[0.999545,0.00006109706,0.0000525222,0.0001775764,0.00004541005,0.0001183278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003525193,0.00002391228,0.000003122907,0.000113267,0.00002027415,5.079921e-7,0.0001743179,0.996463,0.00002747323,0.0002404843,0.002741263,0.0001571156],"study_design_scores_gemma":[0.0004941211,0.00003705906,0.000002267477,0.000006221293,0.00002055982,9.731265e-7,0.00002444648,0.9986123,0.0002626747,0.0000182028,0.0002723367,0.0002488026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001057612,0.000006597456,0.9954299,0.0009689317,0.0001012345,0.0004978595,0.00007329798,0.0006157866,0.002200685],"genre_scores_gemma":[0.06771033,0.0000104141,0.9289822,0.002076126,0.0001361482,0.00008768945,0.0009075205,0.00005239278,0.0000371736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06760457,"threshold_uncertainty_score":0.9334303,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07855689840505382,"gpt":0.3867542891530454,"spread":0.3081973907479916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003564251,0.0002027251,0.0001908205,0.0004451595,0.0001075653,0.00009176694,0.0001689006,0.0001349913,0.002198032],"category_scores_gemma":[0.0000876188,0.000226594,0.00006758478,0.0003169638,0.00005415204,0.0006149121,0.00003043711,0.0002797481,0.0008723073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000330953,"about_ca_system_score_gemma":0.00002515993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002551558,"about_ca_topic_score_gemma":0.00009957872,"domain_scores_codex":[0.9982424,0.0002913878,0.000579324,0.0004091318,0.0002090245,0.000268777],"domain_scores_gemma":[0.9990887,0.00004474909,0.0002584852,0.0003145054,0.0001586872,0.0001348598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007107581,0.0003662386,0.001704557,0.000004960326,0.00003081312,0.00001056589,0.006274229,0.9778256,0.00235633,0.0003185993,0.01052633,0.0005107003],"study_design_scores_gemma":[0.006375644,0.00009154881,0.02036803,0.0000542345,0.00002589157,0.00005084958,0.003345444,0.9544109,0.0001866217,0.000002645797,0.01453923,0.0005489649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05313841,0.0000151965,0.936878,0.003718782,0.002070922,0.0004298138,0.000005872005,0.0002720569,0.003471003],"genre_scores_gemma":[0.9159642,0.000003568033,0.07638547,0.003567496,0.0001616299,0.0001581724,0.0003984744,0.00005465411,0.003306337],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8628258,"threshold_uncertainty_score":0.9999056,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09519457258726062,"gpt":0.2239190677047913,"spread":0.1287244951175306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319168,0.0001092113,0.0001216556,0.0001105263,0.0001054077,0.00005038397,0.0004248978,0.00003295873,0.0002420854],"category_scores_gemma":[0.00007162557,0.00007174905,0.00003848862,0.000927265,0.00008003601,0.0005531344,0.0000857218,0.00008568066,0.00001164501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001427822,"about_ca_system_score_gemma":0.000008519693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639975,"about_ca_topic_score_gemma":0.0003573649,"domain_scores_codex":[0.99899,0.00009076147,0.0004085039,0.0001552606,0.0002108185,0.0001446823],"domain_scores_gemma":[0.9992537,0.00003426796,0.0002086474,0.0003468304,0.0001517227,0.000004828009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001434528,0.00006778018,0.01718855,0.00007102229,0.00001349701,3.528047e-7,0.0005600862,0.9787564,0.00002042444,0.001480206,0.00116931,0.000658039],"study_design_scores_gemma":[0.0002409081,0.000005510066,0.01524031,0.00001608937,0.00002661496,1.559549e-7,0.001454331,0.9823998,0.000008860663,0.00007982797,0.0004164195,0.0001111949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03324005,0.00002056259,0.951379,0.01171321,0.0001931785,0.0006436466,0.000002200481,0.00003276587,0.002775397],"genre_scores_gemma":[0.9921589,0.000006672778,0.001931961,0.005758965,0.00004616597,0.00003432399,0.00004693423,0.000006031614,0.000009996589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9589189,"threshold_uncertainty_score":0.2925841,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Algorithm; Noise (video); Computational intelligence; Mathematical optimization; Optimization problem; Resampling; Function (biology); Mathematics; Artificial intelligence; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0369056004540894,"gpt":0.2605318215021814,"spread":0.223626221048092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005681703,0.0003423818,0.0003383557,0.0003485496,0.000529771,0.0002023125,0.0009928836,0.0001171373,0.0001063294],"category_scores_gemma":[0.0001076533,0.0002916119,0.0001138463,0.002056412,0.0005414493,0.001476504,0.0003379775,0.0002244877,0.00001244016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002330979,"about_ca_system_score_gemma":0.0001388341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005404594,"about_ca_topic_score_gemma":0.000002824435,"domain_scores_codex":[0.9970726,0.0003598656,0.0005869003,0.0007654988,0.000708094,0.0005070461],"domain_scores_gemma":[0.997258,0.000176783,0.0004547052,0.0008523475,0.001137351,0.0001208173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001107173,0.00006563395,0.00002297061,0.000007647155,0.00005160614,0.000002505327,0.001439728,0.9951242,0.0003457227,0.0002779248,0.0001392385,0.002511769],"study_design_scores_gemma":[0.0006198631,0.0001086947,0.00001663591,0.00004845812,0.00002531451,0.00001650091,0.0001199851,0.9961774,0.002451603,0.00001193887,0.00007417619,0.0003294715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006953047,0.00003750229,0.9963858,0.001125941,0.0004863792,0.0008404861,0.0000169122,0.000224945,0.0008125438],"genre_scores_gemma":[0.005655868,0.00005149283,0.9929317,0.0008939611,0.0002235928,0.00003559658,0.00002892007,0.00005993984,0.0001188854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005586337,"threshold_uncertainty_score":0.9999536,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01530435585602781,"gpt":0.2460698501192866,"spread":0.2307654942632588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002446265,0.0001639061,0.0001526096,0.00006893175,0.0001230731,0.0001039245,0.000150955,0.00006313209,0.00003108054],"category_scores_gemma":[0.0001640215,0.0001927377,0.0000397154,0.0004711122,0.00002046205,0.0001570355,0.00001262303,0.0000956138,0.0000101878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007429956,"about_ca_system_score_gemma":0.00001660457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001451958,"about_ca_topic_score_gemma":1.527438e-7,"domain_scores_codex":[0.9989409,0.00006591852,0.0003229573,0.0002717607,0.0001479403,0.0002505041],"domain_scores_gemma":[0.999434,0.00007531116,0.00007432701,0.000170094,0.0001152743,0.0001309977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008654978,0.00001228652,0.00006245812,0.00008638911,0.00001204248,4.773777e-7,0.0008193405,0.9950904,0.002406928,0.0001567977,0.0005070711,0.0008371192],"study_design_scores_gemma":[0.0004177975,0.00003205914,0.00003029428,0.00002041067,0.00002250852,0.000001221065,0.00005939345,0.9982708,0.0007586983,0.000002628854,0.0001687064,0.0002154834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003948621,0.0000171275,0.9924178,0.001920117,0.0001433957,0.0005250445,0.000008060215,0.0008359788,0.0001839095],"genre_scores_gemma":[0.3934738,0.000002419831,0.6048815,0.00128414,0.0001460699,0.0000521448,0.00009328855,0.00006292391,0.000003750394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3895252,"threshold_uncertainty_score":0.7859616,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007227211670618004,"gpt":0.2288604314752646,"spread":0.2216332198046465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009900757,0.0001777938,0.0002102533,0.0001128691,0.0001755853,0.0001739955,0.0001758252,0.00003912908,0.000982434],"category_scores_gemma":[0.00001861875,0.0001823783,0.0001422723,0.0002654709,0.00006673807,0.0002728987,0.00006124392,0.0001131473,0.00002683411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003376734,"about_ca_system_score_gemma":0.00001915209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007874285,"about_ca_topic_score_gemma":8.148852e-7,"domain_scores_codex":[0.9988544,0.00006236179,0.0003080199,0.0003261246,0.0001594086,0.0002897056],"domain_scores_gemma":[0.9992453,0.00008551021,0.00013947,0.0002574739,0.0001786199,0.00009360701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001039029,0.00006461961,0.002734651,0.0000062697,0.00006246234,2.479512e-7,0.00005648236,0.9808543,0.0003056899,0.003316537,0.009189495,0.003398868],"study_design_scores_gemma":[0.0003425922,0.00002830896,0.0006081867,0.00001208668,0.00004857238,3.03444e-7,0.00001316297,0.9964663,0.0002081387,0.001455185,0.0006036331,0.000213578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01771396,0.000005668547,0.9788524,0.002257572,0.000050214,0.0006698633,0.00001815513,0.0001166198,0.0003155462],"genre_scores_gemma":[0.7037154,0.000001616018,0.294266,0.0007312426,0.0002613324,0.0003709048,0.0005103049,0.00003298802,0.0001102021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6860015,"threshold_uncertainty_score":0.9999308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005580011362657026,"gpt":0.1764967835750236,"spread":0.1709167722123665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009502671,0.00007129686,0.0001125854,0.0000324584,0.00004262697,0.000003620224,0.0001528368,0.00003057425,0.0001492703],"category_scores_gemma":[0.00001693084,0.00004231566,0.00008293911,0.0002335796,0.00009829839,0.0000492449,0.0000106048,0.00004827432,0.000003752042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007233428,"about_ca_system_score_gemma":0.000004315953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006616439,"about_ca_topic_score_gemma":3.480895e-7,"domain_scores_codex":[0.9994694,0.0000529446,0.0002090166,0.00005491391,0.0001412962,0.00007245704],"domain_scores_gemma":[0.999563,0.00008780546,0.0000918115,0.0002235439,0.00002371878,0.00001013066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001012418,0.00001636018,0.004216289,0.00004995397,0.00003981538,2.489959e-7,0.0006901121,0.9814302,0.004501031,0.003162664,0.005870314,0.00001292609],"study_design_scores_gemma":[0.003483469,0.0001971822,0.03874171,0.001216533,0.0003679486,0.000101165,0.002101355,0.7341002,0.2103496,0.001365868,0.006472086,0.001502806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876629,0.00003567542,0.006580151,0.000357463,0.000243291,0.0001179139,0.000008957823,0.00001797993,0.00497568],"genre_scores_gemma":[0.9994324,0.0000176254,0.0002927209,0.0001333392,0.00001647784,0.000005668863,0.000002147923,0.00001241798,0.00008723149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2473299,"threshold_uncertainty_score":0.1725582,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01055912270077184,"gpt":0.2121934698872361,"spread":0.2016343471864643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001739577,0.0001530045,0.0001284106,0.00006164554,0.0000861494,0.00008576271,0.000138352,0.00009287765,0.00001339311],"category_scores_gemma":[0.00001361185,0.0001649625,0.00005451816,0.0001915314,0.00002707264,0.0001784852,0.000004905507,0.00007589785,0.000001350472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009848738,"about_ca_system_score_gemma":0.00001187774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007276853,"about_ca_topic_score_gemma":2.824707e-7,"domain_scores_codex":[0.9991796,0.00004871812,0.0001965484,0.0002017101,0.0001163891,0.0002570339],"domain_scores_gemma":[0.9996724,0.00004667157,0.00002937029,0.0001738488,0.00002657892,0.00005115728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008630382,0.00002810539,0.0001571031,0.00001753364,0.000006028411,0.000001021514,0.000009990979,0.9894998,0.004252863,0.0003443162,0.004470121,0.001204487],"study_design_scores_gemma":[0.0003099189,0.00003232947,0.00008414179,0.000006723505,0.000013604,0.000002098317,0.000003645634,0.9958299,0.003341221,0.00005416615,0.0001234811,0.0001988072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006359447,0.00001347574,0.9967877,0.0001707232,0.00005666956,0.0004172149,0.00001518869,0.0009509785,0.000952163],"genre_scores_gemma":[0.3493838,7.751414e-7,0.64978,0.0004178539,0.0001208982,0.00007681213,0.0001847021,0.00003042603,0.000004687129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3487479,"threshold_uncertainty_score":0.6726977,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01575863942459743,"gpt":0.2026103310353574,"spread":0.18685169161076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000406117,0.0001541256,0.0001170021,0.0002215442,0.0003049817,0.0001319504,0.0001493917,0.00006559728,0.00008852848],"category_scores_gemma":[0.0001411452,0.0001047335,0.0000246465,0.0006261392,0.0001335765,0.0006348,0.00005598513,0.00004466147,0.00007411507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006938241,"about_ca_system_score_gemma":0.00001504606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009014824,"about_ca_topic_score_gemma":0.0001052314,"domain_scores_codex":[0.9989594,0.00001788133,0.0003138818,0.000331768,0.0001593822,0.000217656],"domain_scores_gemma":[0.9991723,0.00003796659,0.0001359999,0.0002441911,0.0003974959,0.00001209377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002140927,0.0002538998,0.005927473,0.002174533,0.0001553572,0.000001264615,0.0005009479,0.8095557,0.003148794,0.08444327,0.04633105,0.04729359],"study_design_scores_gemma":[0.003638635,0.00005744592,0.004793165,0.0003690461,0.0002507477,0.000004413234,0.0007725253,0.8454506,0.0001921334,0.002373691,0.1412063,0.000891258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003605347,0.00004057867,0.9110377,0.08280866,0.0001799384,0.001910129,0.00002787305,0.0001846158,0.0002052038],"genre_scores_gemma":[0.9921136,0.00004273469,0.001556834,0.004654923,0.0001566244,0.000778974,0.0004714431,0.00001720056,0.0002075886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9885083,"threshold_uncertainty_score":0.4270908,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0346326266348508,"gpt":0.2504175384860194,"spread":0.2157849118511687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600189,0.000210105,0.0002104216,0.0002260757,0.0002772507,0.0001958238,0.001098386,0.00005642973,0.00008881811],"category_scores_gemma":[0.0001133842,0.0001525489,0.00007254673,0.0007613869,0.0004034216,0.0005101622,0.0003252211,0.0001139243,0.00001362957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000736001,"about_ca_system_score_gemma":0.00002778008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003877901,"about_ca_topic_score_gemma":0.00002393422,"domain_scores_codex":[0.998348,0.0001159898,0.0002805003,0.0004851774,0.0004389688,0.0003313852],"domain_scores_gemma":[0.9984865,0.00008567516,0.0002718521,0.0007491958,0.0003009145,0.0001058497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002091848,0.0007016918,0.01369844,0.0001596954,0.0003699553,0.00003349399,0.03635349,0.7820023,0.004780303,0.04380357,0.09725877,0.02062914],"study_design_scores_gemma":[0.0006488523,0.0003473501,0.01159826,0.000100521,0.00003437568,0.00001877449,0.0001548665,0.9619675,0.02311936,0.0003225895,0.001115443,0.0005720878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0086319,0.000002274317,0.9408438,0.04910377,0.0003891351,0.0006619159,0.00002682938,0.0001724348,0.000167909],"genre_scores_gemma":[0.624999,0.000003199375,0.3658255,0.008712905,0.0001527937,0.00006344044,0.00003561095,0.00002585881,0.0001816539],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6163672,"threshold_uncertainty_score":0.6220763,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02933868493811216,"gpt":0.2610525395029371,"spread":0.2317138545648249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004040211,0.0001282187,0.0001140691,0.00007847576,0.001866155,0.00105393,0.001183605,0.00003926728,0.00001091514],"category_scores_gemma":[0.00008778035,0.00009874089,0.00009230833,0.0001795496,0.00008690159,0.0008417541,0.0001976322,0.00009672679,0.000003848621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003402993,"about_ca_system_score_gemma":0.00002672594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002449041,"about_ca_topic_score_gemma":0.000006111174,"domain_scores_codex":[0.9989992,0.0000365105,0.0002040278,0.0003115073,0.0002125842,0.0002361911],"domain_scores_gemma":[0.9986514,0.000180171,0.0002596448,0.0007681518,0.0001031936,0.00003742468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005932884,0.00005005961,0.00005719185,0.00001980613,0.00006013246,0.000002101015,0.0008116362,0.2206896,0.0002599428,0.01226593,0.00628665,0.759491],"study_design_scores_gemma":[0.0005098505,0.00002326643,0.0001380133,0.00001527688,0.00001074998,0.000004930417,0.00001528619,0.9954375,0.0002240886,0.0009309984,0.002548387,0.0001416614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004056281,0.00001909896,0.9782392,0.01965279,0.0004623346,0.000591476,0.000003890566,0.0001189249,0.0008717738],"genre_scores_gemma":[0.001990433,0.000009340039,0.9959106,0.001318486,0.0001995981,0.0001707578,0.00000815148,0.00001327454,0.000379394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7747479,"threshold_uncertainty_score":0.9999831,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004860542944742337,"gpt":0.2094886417888088,"spread":0.2046280988440664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636247,0.00006167956,0.00006460737,0.00007783655,0.00004282991,0.00008131315,0.0004169516,0.00001206606,0.00001412614],"category_scores_gemma":[0.000007095338,0.00004796421,0.00002415738,0.0004371035,0.00002896672,0.0002207322,0.00009089047,0.00004805891,0.00001279858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001061589,"about_ca_system_score_gemma":0.000003385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006606783,"about_ca_topic_score_gemma":0.000002846268,"domain_scores_codex":[0.9993763,0.00004061386,0.0001573885,0.0001535141,0.0001532992,0.0001189161],"domain_scores_gemma":[0.9995872,0.00006004706,0.00007513414,0.0002558504,0.00001337326,0.000008390064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.798445e-7,0.00002880931,0.0009446251,0.000003241857,0.000002494927,0.000002820469,0.00005285962,0.9620091,0.00001955309,0.03258109,0.003229653,0.001124896],"study_design_scores_gemma":[0.0002481298,0.000006373775,0.003086531,0.00001902043,0.000002200362,9.349871e-7,0.000005497984,0.9955676,0.00004340141,0.000758026,0.0001834203,0.00007885257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01621657,0.000003460833,0.9775623,0.003838014,0.0001123479,0.0000943032,8.530564e-7,0.00003134581,0.002140783],"genre_scores_gemma":[0.7604529,0.000004994732,0.2347372,0.00458586,0.00005542908,0.000005080447,0.00002589861,0.000009735303,0.0001229583],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7442363,"threshold_uncertainty_score":0.1955924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0203606626991976,"gpt":0.2319711701308088,"spread":0.2116105074316112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000201674,0.0001154628,0.0001680486,0.0003568933,0.0001231364,0.00005198137,0.0001536483,0.00002539965,0.00004562771],"category_scores_gemma":[0.00001579104,0.0001068634,0.00002297724,0.0008899721,0.00005455294,0.0004722243,0.00006492041,0.00004980957,0.000002170765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006258069,"about_ca_system_score_gemma":0.00004391021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002762674,"about_ca_topic_score_gemma":0.0001012331,"domain_scores_codex":[0.9987658,0.00007692979,0.0003367422,0.0003212546,0.0003596701,0.000139622],"domain_scores_gemma":[0.9994389,0.000029439,0.0001665313,0.0001668067,0.000146287,0.00005206508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002979479,0.00009313448,0.051331,0.000011632,0.00003309427,0.000002099127,0.0008889363,0.9433731,0.0009981034,0.002437071,0.0006971532,0.0001048398],"study_design_scores_gemma":[0.00140715,0.0001605059,0.1056301,0.00004462619,0.00001482945,0.00001511072,0.00007952589,0.8912841,0.0002342494,0.00005395872,0.0008141309,0.0002617241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1099535,0.000009545336,0.8808051,0.008644335,0.0000320547,0.00036984,0.000005640428,0.00003221536,0.000147763],"genre_scores_gemma":[0.3500615,0.00004914015,0.6470425,0.002542896,0.00002468893,0.00005690488,0.00008188216,0.00001052099,0.0001300011],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.240108,"threshold_uncertainty_score":0.4357765,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01530367194972653,"gpt":0.2183698183920847,"spread":0.2030661464423582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062334,0.00009085961,0.00008535181,0.00007895735,0.0001344651,0.0001364478,0.0009738491,0.0000293279,0.00004690794],"category_scores_gemma":[0.0001859806,0.00004204351,0.00005337752,0.001576223,0.00005115751,0.0002411771,0.00008981628,0.0001123891,0.00001165939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003354041,"about_ca_system_score_gemma":0.00006286975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004035372,"about_ca_topic_score_gemma":0.000005432504,"domain_scores_codex":[0.9987572,0.0003031422,0.0002179318,0.0001623187,0.0004467505,0.0001126622],"domain_scores_gemma":[0.9990365,0.0001727448,0.0001199859,0.0004858679,0.0001604031,0.00002450488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001390148,0.00003123147,0.0001630549,5.085161e-7,0.000008925209,3.261435e-7,0.0009442056,0.9585282,0.000002898452,0.03390107,0.006141094,0.0002771432],"study_design_scores_gemma":[0.0002231976,0.00001137627,0.0002898301,0.00000533371,0.000006580849,0.000001329182,0.0001132417,0.9977142,0.00002836422,0.0002128291,0.001330368,0.0000633626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008715554,0.000007027891,0.9103059,0.08730723,0.000244048,0.00017192,0.00000206161,0.00001558908,0.001074699],"genre_scores_gemma":[0.3545214,0.00003230464,0.4857263,0.1584175,0.0002699778,0.0001267369,0.00004132124,0.0000353187,0.0008291625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4245796,"threshold_uncertainty_score":0.180967,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04625657783203736,"gpt":0.2185802058504023,"spread":0.1723236280183649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009121933,0.000107238,0.00008086891,0.00002554828,0.0002256128,0.0001420868,0.0001019351,0.00002515427,0.0004108594],"category_scores_gemma":[0.00004331372,0.00008958708,0.00003394023,0.0002650266,0.00009101976,0.0007811254,0.00006458774,0.0001157794,0.0000236755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005374834,"about_ca_system_score_gemma":0.00001157507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002794723,"about_ca_topic_score_gemma":0.00002633558,"domain_scores_codex":[0.9991938,0.00005280417,0.0001613875,0.0002641804,0.0001739661,0.0001538857],"domain_scores_gemma":[0.999604,0.00004147888,0.00007264656,0.0002015358,0.000006714117,0.00007364029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004948262,0.00001611232,0.09701474,0.000001899101,0.000008767382,0.000003213001,0.0007633909,0.855432,0.0001612896,0.0000202633,0.04573022,0.0008431503],"study_design_scores_gemma":[0.0003892131,0.00001432891,0.3003223,0.00003280646,0.00003234039,0.00004465752,0.0007838528,0.6646977,0.0001027655,0.00001050296,0.03332324,0.0002463071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7764187,0.0000131026,0.2067108,0.01273958,0.0002125462,0.0001518165,0.000001217886,0.00004762561,0.003704533],"genre_scores_gemma":[0.9265759,0.00008706468,0.04286808,0.02653973,0.0003424616,0.0001328698,0.0001224819,0.00004910562,0.003282314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2033075,"threshold_uncertainty_score":0.4498622,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0123203119839367,"gpt":0.2532120154452678,"spread":0.2408917034613312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005281156,0.0002683807,0.0003224055,0.0002732349,0.0002337692,0.0001628276,0.001118903,0.00008554129,0.0001490239],"category_scores_gemma":[0.0001728905,0.0002190563,0.0001168617,0.002078773,0.00009987484,0.0008582681,0.0003172772,0.0001929797,0.00003257735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001747671,"about_ca_system_score_gemma":0.0001658541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001437789,"about_ca_topic_score_gemma":0.000001039829,"domain_scores_codex":[0.9973146,0.0006000544,0.0004240486,0.0006547432,0.0005946286,0.0004119678],"domain_scores_gemma":[0.9976881,0.0004178619,0.0002354459,0.000854341,0.0006510319,0.0001532075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007017637,0.00005610789,0.00002242967,0.000005844693,0.00003204085,0.000001264734,0.0003746543,0.978817,0.00123542,0.0007176812,0.0007076225,0.0180229],"study_design_scores_gemma":[0.0006985439,0.00004725179,0.0001953579,0.00003941981,0.00001196623,0.000003247412,0.00002530844,0.9900033,0.008413416,0.0000658188,0.0002409763,0.0002553562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001221294,0.00001136957,0.9907425,0.006746741,0.0003368526,0.001142807,0.00001686695,0.0001558861,0.0008347566],"genre_scores_gemma":[0.001843588,0.000004141057,0.9918812,0.005731988,0.00005624897,0.0001915058,0.000007949321,0.00003576869,0.000247609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01776755,"threshold_uncertainty_score":0.8932856,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03089811488666547,"gpt":0.3182612825802636,"spread":0.2873631676935982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009707422,0.00009045724,0.0001429743,0.000179298,0.0001694639,0.00006961911,0.0002958807,0.00003411323,0.0001972842],"category_scores_gemma":[0.0004116308,0.0000675963,0.00004189985,0.00065031,0.0001484594,0.0002539514,0.00002929226,0.00004025555,0.000009786816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001580142,"about_ca_system_score_gemma":0.00002408183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000460892,"about_ca_topic_score_gemma":0.000003634217,"domain_scores_codex":[0.9989004,0.00006161897,0.000320382,0.0002820124,0.0002995849,0.0001360758],"domain_scores_gemma":[0.9984396,0.0003704091,0.000314554,0.0003186986,0.0005118266,0.0000449657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003213277,0.0001065669,0.000168504,0.00001435827,0.0000413044,2.330433e-7,0.0007999407,0.7347412,0.1922725,0.06159624,0.001014007,0.00892386],"study_design_scores_gemma":[0.0006344971,0.0001937605,0.0000763332,0.00001131976,0.00001859138,0.000001589142,0.0002146206,0.9603597,0.03168796,0.005833223,0.0008415266,0.0001269016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02998865,0.000004444049,0.9634992,0.005640648,0.00005995739,0.0003869655,0.00001957881,0.00003210486,0.0003684379],"genre_scores_gemma":[0.624825,6.4285e-7,0.3741679,0.0007027719,0.00003756729,0.00004101027,0.00001790029,0.00000962259,0.000197555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5948363,"threshold_uncertainty_score":0.2756497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02370323162680671,"gpt":0.2113079361100319,"spread":0.1876047044832252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000164376,0.0001685583,0.0002273749,0.0001843863,0.00007116972,0.00004482603,0.0001282823,0.0001257602,0.00001531809],"category_scores_gemma":[0.00002475824,0.0001765805,0.00005923208,0.0001961082,0.00001876662,0.0001954008,0.000009073357,0.0000858661,0.000005663917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009095693,"about_ca_system_score_gemma":0.00001085999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006567553,"about_ca_topic_score_gemma":0.000002439712,"domain_scores_codex":[0.9990841,0.00001376316,0.00031653,0.0001952505,0.0001366545,0.0002536582],"domain_scores_gemma":[0.9995702,0.00003146365,0.00007344995,0.0001807164,0.00006242876,0.00008172467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006019549,0.00001008978,0.00006966338,0.00008458234,0.00005099898,0.000005512872,0.0002045914,0.9969703,0.00005408454,0.001131584,0.001275422,0.0001371826],"study_design_scores_gemma":[0.000683242,0.00002009466,0.000004221947,0.00003028415,0.00005303253,0.000006908487,0.00006616854,0.9939824,0.00002706875,0.00004229867,0.004869739,0.0002144864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006453067,0.0004481041,0.996043,0.0006669127,0.0006360234,0.0003846591,0.00001497731,0.0006752843,0.0004857171],"genre_scores_gemma":[0.335437,0.0003302713,0.6632367,0.0001943575,0.000242151,0.0001779422,0.0002500804,0.0001072006,0.00002434591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3347917,"threshold_uncertainty_score":0.7200745,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01439077911248898,"gpt":0.1989296180876849,"spread":0.1845388389751959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008655517,0.00008674581,0.0001737873,0.0001116228,0.00005229068,0.00002776087,0.0001305439,0.00005247924,0.000256954],"category_scores_gemma":[0.00007290142,0.0000806348,0.00004587982,0.0002371887,0.0000653726,0.0003106967,0.00001989325,0.00002583417,0.00005262626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003913711,"about_ca_system_score_gemma":0.00001945417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003495609,"about_ca_topic_score_gemma":0.000001157888,"domain_scores_codex":[0.9992271,0.000002435167,0.0003937409,0.0002145416,0.00003145017,0.0001307266],"domain_scores_gemma":[0.9993802,0.0000362138,0.0003124403,0.0001847466,0.00005363824,0.00003280359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007490375,0.00002238927,0.0002743546,0.000008885316,0.000009256052,1.459742e-7,0.00004037334,0.602543,0.0002319724,0.3964277,0.000257977,0.0001764915],"study_design_scores_gemma":[0.005544087,0.0002640449,0.005334785,0.0002074684,0.00005232428,0.00001036046,0.0001529429,0.8602762,0.001363962,0.1094487,0.01555634,0.001788713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004659549,0.00008208639,0.9924272,0.002322022,0.0001057892,0.0001382479,0.0001085457,0.00003372571,0.004316486],"genre_scores_gemma":[0.7860658,0.0001685301,0.2122948,0.0008948275,0.0001162142,0.00007981532,0.000057648,0.0000374359,0.0002850305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7855998,"threshold_uncertainty_score":0.3288192,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01500831844130287,"gpt":0.1907641087370884,"spread":0.1757557902957855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898644,0.000120603,0.0000737988,0.00007160729,0.0002071085,0.0001419185,0.00007940335,0.00002183614,0.0003670229],"category_scores_gemma":[0.00006169196,0.00008089281,0.00001500027,0.0003321988,0.0001445176,0.0007599341,0.00002882631,0.00006073827,0.0001116669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002211949,"about_ca_system_score_gemma":0.000004535617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007271044,"about_ca_topic_score_gemma":0.00004140288,"domain_scores_codex":[0.999285,0.00001808634,0.0001556651,0.0001697856,0.0001911403,0.0001803531],"domain_scores_gemma":[0.9996358,0.00002752386,0.00006584622,0.0001697956,0.00008783086,0.00001320646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008619116,0.0001683831,0.01405274,0.0002242098,0.00006472688,5.845838e-7,0.0003405878,0.8917881,0.00007429021,0.07124305,0.0157504,0.006206704],"study_design_scores_gemma":[0.003550894,0.00006792437,0.1116567,0.0003594475,0.0003912947,0.000004602884,0.004136726,0.7235281,0.0001630078,0.0007647813,0.1531137,0.002262735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2906815,0.00007203487,0.5781562,0.09109657,0.0004638452,0.001651412,0.00001210308,0.0003153732,0.03755095],"genre_scores_gemma":[0.9878522,0.000006702852,0.001003884,0.01081353,0.00007872691,0.00004827172,0.00008033768,0.000007192634,0.0001091345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6971707,"threshold_uncertainty_score":0.4018643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02388372694920832,"gpt":0.2162120690726145,"spread":0.1923283421234062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000160401,0.0001294659,0.000223348,0.0002814331,0.0000521169,0.00003189043,0.0004454163,0.00006493965,0.0008656502],"category_scores_gemma":[0.00008803404,0.0001249446,0.00008133004,0.001326113,0.00004026437,0.0004800637,0.00009610775,0.0000553494,0.00003552831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002565005,"about_ca_system_score_gemma":0.0001071414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004403854,"about_ca_topic_score_gemma":9.758194e-7,"domain_scores_codex":[0.9988104,0.00006481739,0.0004301616,0.000262568,0.0002939847,0.0001381338],"domain_scores_gemma":[0.9985713,0.0000403886,0.0002937645,0.0003868864,0.0006431126,0.00006452762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001048211,0.000251072,0.003262362,0.00004147306,0.0002219682,0.000005835615,0.003530345,0.9777937,0.004516626,0.005321377,0.004332548,0.0006178709],"study_design_scores_gemma":[0.0005399269,0.000144691,0.002318743,0.0000241807,0.00007220033,0.000004338248,0.0000372097,0.9869082,0.009317121,0.00005045104,0.0002942569,0.0002886972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01436183,0.0000411995,0.9833597,0.0008925631,0.0001945555,0.0001234035,0.00000686057,0.00004695889,0.0009729264],"genre_scores_gemma":[0.4059565,0.0001465483,0.590695,0.002886034,0.00002688492,0.000003325913,0.00002193001,0.00001597084,0.0002478245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3926647,"threshold_uncertainty_score":0.9478263,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005691616447204602,"gpt":0.2121185819234936,"spread":0.2064269654762891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002486603,0.00008355136,0.00006839843,0.000162275,0.0001383308,0.000134686,0.0001017104,0.00003463195,0.00003337986],"category_scores_gemma":[0.00002017555,0.00008343908,0.00002130795,0.0003332428,0.00004440901,0.0004738312,0.00004868396,0.0000545925,0.000008367421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949493,"about_ca_system_score_gemma":0.00001699889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003332308,"about_ca_topic_score_gemma":0.000001432382,"domain_scores_codex":[0.9992454,0.00002631627,0.0001795089,0.0002400407,0.0001631203,0.0001455938],"domain_scores_gemma":[0.9996004,0.00005595546,0.00007122597,0.000139668,0.00006731725,0.00006545301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002592619,0.00003548408,0.0007651667,0.00001221752,0.0000253736,0.00001469784,0.0005971046,0.8615282,0.007271673,0.04090071,0.003895094,0.08492833],"study_design_scores_gemma":[0.000569113,0.00005312425,0.004018317,0.00001122773,0.000009352347,0.0001366041,0.00002561902,0.9801278,0.00360339,0.000574223,0.01058792,0.0002832775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02808207,0.00002113501,0.9671413,0.003715311,0.0003726301,0.00009202369,8.180734e-7,0.00007934862,0.0004953282],"genre_scores_gemma":[0.285268,0.00001183677,0.7112542,0.003211707,0.000147945,0.000003545128,0.00002396644,0.000006306757,0.00007243989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.257186,"threshold_uncertainty_score":0.3402547,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05394148092549266,"gpt":0.3275216063849041,"spread":0.2735801254594115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001043695,0.0001231359,0.0001304848,0.00007393767,0.0002285111,0.00006623318,0.0001409893,0.00003859844,0.002458395],"category_scores_gemma":[0.00002089442,0.0001224755,0.0000542925,0.0002133201,0.00009309551,0.0001344561,0.00003792213,0.00007662866,0.0001628735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165607,"about_ca_system_score_gemma":0.000009185561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001795584,"about_ca_topic_score_gemma":0.00001003699,"domain_scores_codex":[0.9991001,0.00004509606,0.0002717787,0.0002136222,0.0001807115,0.000188614],"domain_scores_gemma":[0.9993584,0.00006265315,0.0001190243,0.0002962513,0.00009697192,0.000066676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003504265,0.0004723418,0.00472441,0.00009091735,0.0001478549,0.000004482497,0.002729537,0.03122141,0.01756753,0.06668806,0.875852,0.0004663808],"study_design_scores_gemma":[0.007546978,0.0002672338,0.007937697,0.0001748022,0.000390765,0.000133832,0.00047016,0.5460317,0.004998457,0.02563336,0.4040844,0.002330654],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1611282,0.0000048234,0.8178345,0.0151881,0.0001774611,0.0007413275,0.0001134459,0.0004090365,0.004403121],"genre_scores_gemma":[0.4185528,0.000008531799,0.5614703,0.01814882,0.0004699872,0.0001411755,0.0003912183,0.00007111994,0.0007460312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5148102,"threshold_uncertainty_score":0.9984535,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1304710976955263,"gpt":0.3247271779096579,"spread":0.1942560802141315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000857632,0.0002240613,0.0005090913,0.0003254809,0.0002385824,0.0001507186,0.0004715097,0.000143057,0.001917307],"category_scores_gemma":[0.001231202,0.0002117058,0.0002137282,0.001762582,0.0004791626,0.0006953422,0.0001582555,0.000139028,0.0000196879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004633596,"about_ca_system_score_gemma":0.0002107438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005131184,"about_ca_topic_score_gemma":0.000007093722,"domain_scores_codex":[0.9962645,0.0003301735,0.001325437,0.0005666764,0.001234149,0.0002790302],"domain_scores_gemma":[0.9962114,0.0003746884,0.0009897588,0.0007467265,0.001548122,0.0001293113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003452367,0.000151079,0.002572998,0.00001215889,0.00002993841,0.000003547426,0.0005624138,0.9912583,0.0008575991,0.0003790972,0.003230482,0.0009078197],"study_design_scores_gemma":[0.0007854441,0.00003864365,0.001068593,0.00003832996,0.00003984064,0.000008613058,0.0002396995,0.9946185,0.002121008,0.00006364546,0.0007719967,0.0002056626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01927915,0.00006226371,0.9764829,0.002037895,0.0003693704,0.0002864297,0.00009395942,0.00004481608,0.001343252],"genre_scores_gemma":[0.182188,0.0002477564,0.8162504,0.0004244767,0.00004702607,0.00001103007,0.0003863698,0.00003368502,0.0004112521],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1629089,"threshold_uncertainty_score":0.9989951,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009961612166301382,"gpt":0.2369741017125232,"spread":0.2270124895462218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002338052,0.0001147418,0.0001390588,0.0001384807,0.0001664348,0.0001417971,0.0005250122,0.0000384693,0.000004617693],"category_scores_gemma":[0.00001343317,0.0001063251,0.00004999296,0.0002743997,0.00001289018,0.0004979385,0.000059718,0.00005683701,7.826337e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002444888,"about_ca_system_score_gemma":0.00001724544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007452914,"about_ca_topic_score_gemma":1.143673e-7,"domain_scores_codex":[0.9989474,0.00003161823,0.0003008131,0.0003183604,0.0001847665,0.0002169808],"domain_scores_gemma":[0.9992163,0.00005310514,0.0002422713,0.0003448177,0.00007941986,0.00006410787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002088753,0.00004683755,0.00001333409,0.000005787189,0.00000366063,0.000001348053,0.0001459146,0.8120863,0.001310747,0.001085165,0.000090569,0.1852082],"study_design_scores_gemma":[0.0002970364,0.00006203746,0.00006952175,0.00003486544,0.000006357813,0.000001730732,0.00001134181,0.9965792,0.00258557,0.0000517645,0.0001694091,0.000131171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003342717,0.00004986071,0.9953879,0.0006351386,0.0002452998,0.0001838485,0.000006563409,0.0001111335,0.0000375369],"genre_scores_gemma":[0.01546803,0.000009877189,0.9838041,0.0005447183,0.0001225149,0.000005515372,0.00003304438,0.000007834597,0.00000436928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.185077,"threshold_uncertainty_score":0.4335814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04098725591223491,"gpt":0.3520951852068939,"spread":0.311107929294659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051482,0.0002233826,0.000325855,0.000127724,0.0004684837,0.0004488009,0.001264887,0.00007332174,0.0002487322],"category_scores_gemma":[0.003483831,0.0001045245,0.000138514,0.001101865,0.0003317682,0.0004773054,0.0001803548,0.0001822248,0.00004921552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008536286,"about_ca_system_score_gemma":0.00008817941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008366469,"about_ca_topic_score_gemma":0.00003229366,"domain_scores_codex":[0.9959853,0.0003491308,0.0008722465,0.0005270023,0.001960848,0.0003055142],"domain_scores_gemma":[0.9940894,0.003362998,0.0006974582,0.001147153,0.0006424746,0.00006055595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003911452,0.00002663959,0.001212086,0.000005827507,0.00001152932,5.814734e-7,0.0003296793,0.993887,0.0002741234,0.0001436209,0.0002481894,0.003469565],"study_design_scores_gemma":[0.002328297,0.00002784884,0.004320887,0.0001078541,0.00001567201,0.000005143563,0.000800226,0.990898,0.0001076031,0.000143589,0.001083377,0.0001615272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.319063,0.00003519364,0.6785399,0.001103423,0.0005161737,0.0006365362,0.00004169254,0.00002364391,0.00004050694],"genre_scores_gemma":[0.9912953,0.000005073262,0.007156929,0.0002964822,0.00001721929,0.00002940147,0.0000200395,0.00002357792,0.001155952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6722323,"threshold_uncertainty_score":0.4327797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01178637397763147,"gpt":0.2171413483300108,"spread":0.2053549743523794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001399245,0.00008520259,0.00009853097,0.0001809071,0.0001803102,0.00001743827,0.0003809793,0.00002266727,0.00004849412],"category_scores_gemma":[0.0000274682,0.00008118804,0.00004952385,0.000571907,0.00003894692,0.0003118918,0.00002417285,0.00005998379,0.00005016118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001384596,"about_ca_system_score_gemma":0.0000222179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003008152,"about_ca_topic_score_gemma":1.624936e-7,"domain_scores_codex":[0.9992145,0.00004901241,0.0002247062,0.00016664,0.0002024874,0.0001426097],"domain_scores_gemma":[0.9994978,0.00004858814,0.00006228298,0.0002755183,0.00004758854,0.00006816335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004131627,0.00005775434,0.00001523792,0.000004796135,0.000003921732,0.000003552741,0.001596757,0.9512744,0.0003796408,0.0450497,0.0007413328,0.0008687594],"study_design_scores_gemma":[0.0004214821,0.0001743142,0.0001673951,0.00002419151,0.000004840798,0.00002210037,0.00002647199,0.9880897,0.008323072,0.0002284462,0.002268453,0.0002495557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03075979,0.000003289899,0.9622222,0.004654781,0.0001396423,0.0001314783,0.000004196955,0.00007837942,0.00200631],"genre_scores_gemma":[0.5318216,0.0000157888,0.4630181,0.004924461,0.00005827218,0.000009588843,0.00001078887,0.0000108069,0.0001305108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5010619,"threshold_uncertainty_score":0.3310752,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04749946845357306,"gpt":0.3420442142460877,"spread":0.2945447457925147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001580148,0.000175323,0.0001885924,0.0002011253,0.000291522,0.00003801366,0.0001709689,0.00007883593,0.001066887],"category_scores_gemma":[0.0003071207,0.0001788794,0.00005481203,0.0004414064,0.00009955849,0.0004856837,0.00004056907,0.0001635825,0.0001127539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001195088,"about_ca_system_score_gemma":0.00004452751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000456201,"about_ca_topic_score_gemma":0.000001408151,"domain_scores_codex":[0.9985077,0.0000836664,0.0003367811,0.0002928074,0.0004775711,0.0003014874],"domain_scores_gemma":[0.9990652,0.0001946727,0.0001463971,0.000335435,0.000148992,0.0001092993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002369627,0.000063549,0.000202984,0.00001520699,0.00001981224,0.00002834097,0.0003294832,0.9742158,0.0004447281,0.0009177786,0.02349741,0.0002411825],"study_design_scores_gemma":[0.001574251,0.00006609525,0.0001817929,0.00002609492,0.00002155117,0.0001675262,0.00006738335,0.9891018,0.002160606,0.0006146943,0.005442529,0.0005756312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005261724,0.00001425221,0.9881669,0.001999102,0.0001322621,0.0003530605,0.000008815787,0.0002679737,0.003795956],"genre_scores_gemma":[0.02122328,0.0001718495,0.9730252,0.001437726,0.0002184102,0.00006563323,0.0002279938,0.00008435198,0.003545529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01805488,"threshold_uncertainty_score":0.9998463,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computational intelligence; Euclidean geometry; Mathematical optimization; Mathematics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1034845285315682,"gpt":0.2886102378094453,"spread":0.1851257092778771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007851807,0.0001697378,0.000210136,0.0001391672,0.0005220009,0.0001386977,0.0004606718,0.00006139755,0.0001594937],"category_scores_gemma":[0.0004428769,0.000141202,0.0001198493,0.0004081276,0.0002547044,0.0004602297,0.0001001213,0.0001284276,0.00001178116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007733026,"about_ca_system_score_gemma":0.0000557331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000629441,"about_ca_topic_score_gemma":0.000003174045,"domain_scores_codex":[0.9984058,0.0002151725,0.0004261091,0.0003756727,0.0002875071,0.0002897501],"domain_scores_gemma":[0.9984177,0.0006240058,0.0003160051,0.0004229198,0.0001525475,0.00006680866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002101281,0.00003761205,0.0001807728,0.00001167745,0.00001496064,1.04332e-7,0.0002835051,0.9287043,0.0002541658,0.06650166,0.003194901,0.0007953268],"study_design_scores_gemma":[0.0003563478,0.00008203961,0.0007122887,0.00002831266,0.00001066827,0.000002054321,0.00002125568,0.9974992,0.0002697782,0.0003839213,0.0004688007,0.0001653171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007454974,0.00000248268,0.9680938,0.02233171,0.0002186329,0.0004702686,0.00001456465,0.000139045,0.001274544],"genre_scores_gemma":[0.3891044,0.000003128288,0.6072199,0.003401222,0.0000721105,0.00005331335,0.00004243936,0.00001783361,0.0000856284],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3816495,"threshold_uncertainty_score":0.5758051,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06278987189070842,"gpt":0.346609635309974,"spread":0.2838197634192656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001382633,0.0001133593,0.0001897028,0.0001249467,0.000522094,0.00007582128,0.0001898792,0.00005640454,0.0001629646],"category_scores_gemma":[0.0002398715,0.0001180676,0.0000415231,0.00008616071,0.0002784404,0.0005684795,0.0001009069,0.000115055,0.000005643145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002692633,"about_ca_system_score_gemma":0.00002451896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009275339,"about_ca_topic_score_gemma":0.000002060149,"domain_scores_codex":[0.9990978,0.00004334657,0.0002653871,0.0002011476,0.0002309679,0.0001613395],"domain_scores_gemma":[0.9987851,0.0001345164,0.0002519901,0.0005005479,0.0002460054,0.00008180575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001466288,0.00005189775,0.00008690196,0.00003168276,0.00002988188,0.000001804186,0.0001207411,0.9899375,0.0005154738,0.007634386,0.001301322,0.0002737729],"study_design_scores_gemma":[0.0005986841,0.00002268622,0.00004489722,0.00002753852,0.00002537919,0.000006441413,0.00006411796,0.9966655,0.0002651307,0.002037208,0.0001175747,0.0001248803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002338813,0.00001265671,0.9900341,0.004252988,0.00008005369,0.0002603361,0.00004102772,0.00005855967,0.002921468],"genre_scores_gemma":[0.07551537,0.0000844708,0.922833,0.0002729985,0.00006633341,0.00003383314,0.00005661511,0.00004245366,0.001094949],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07317656,"threshold_uncertainty_score":0.4814658,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08854811697420045,"gpt":0.3140632591551065,"spread":0.225515142180906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002862757,0.0002337539,0.000322412,0.0005565243,0.00008254001,0.00003774872,0.0002688456,0.0001267846,0.0005671156],"category_scores_gemma":[0.0004368831,0.0002457018,0.00008619164,0.001049832,0.0001608276,0.000284517,0.00008458309,0.0002010644,0.00001153822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001278858,"about_ca_system_score_gemma":0.00004270649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003157962,"about_ca_topic_score_gemma":0.000002879023,"domain_scores_codex":[0.9978374,0.0001667406,0.000769098,0.000428485,0.00042948,0.0003687618],"domain_scores_gemma":[0.9983127,0.0003947097,0.0003487896,0.0005600959,0.0002791881,0.0001044865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000305946,0.0002778195,0.0002227131,0.0000335308,0.00001937561,0.000003688537,0.0004863208,0.9962749,0.00005748489,0.001755143,0.0001485696,0.0006898377],"study_design_scores_gemma":[0.0006999265,0.00002372595,0.00008474058,0.00003297343,0.00001886679,0.000004358287,0.00005396239,0.9980872,0.000285243,0.0003749692,0.00009231674,0.000241688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001914169,0.00001615275,0.9961039,0.0002486654,0.00006300561,0.001203497,0.00001903684,0.0001096252,0.0003218851],"genre_scores_gemma":[0.008239286,0.00005800025,0.9908102,0.0002537712,0.00002958692,0.0003438047,0.00006551522,0.00006809888,0.000131746],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006325117,"threshold_uncertainty_score":0.9999995,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04872328661789242,"gpt":0.333099539714014,"spread":0.2843762530961215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009686311,0.0002048981,0.0002109518,0.000135489,0.0003301698,0.00005651552,0.0004951764,0.00007739697,0.001584824],"category_scores_gemma":[0.001515973,0.0001052266,0.0001164491,0.0004600729,0.0003189708,0.0002651276,0.00009023164,0.0001301113,0.00001302333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137667,"about_ca_system_score_gemma":0.00007506653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006438524,"about_ca_topic_score_gemma":0.000001220645,"domain_scores_codex":[0.9980634,0.0003341384,0.0004654901,0.0003275687,0.0004296226,0.0003798093],"domain_scores_gemma":[0.9946975,0.003987058,0.0002701036,0.0006004032,0.000377823,0.00006715567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000133988,0.00004052469,0.00002098918,0.00001918219,0.00003819634,4.247765e-7,0.0001304037,0.9561598,0.0008732291,0.01314725,0.02904768,0.0003882709],"study_design_scores_gemma":[0.001417269,0.00008448915,0.00002534103,0.00005371228,0.00002554726,0.000001535793,0.00007116646,0.989193,0.006723287,0.0009411703,0.001242706,0.0002207475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002657399,0.000005648791,0.9719941,0.02350127,0.0002516075,0.001266409,0.0000994944,0.00005739745,0.0001666893],"genre_scores_gemma":[0.1501822,0.0005061429,0.8277182,0.01518685,0.001261682,0.001135276,0.000207647,0.0004578906,0.003344105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1475248,"threshold_uncertainty_score":0.9993278,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005297643925768434,"gpt":0.1898256018034393,"spread":0.1845279578776709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001347391,0.00008006208,0.0000662727,0.00001107249,0.00007125012,0.000012815,0.0001552131,0.00004842204,0.00004856223],"category_scores_gemma":[0.0001021042,0.00005221727,0.00007318216,0.00015365,0.00007385388,0.000002494002,0.00007212792,0.00005324589,0.000002421878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002336769,"about_ca_system_score_gemma":0.00003799767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002110538,"about_ca_topic_score_gemma":0.00000331238,"domain_scores_codex":[0.9992934,0.0001180063,0.0001361673,0.0002018666,0.000140752,0.0001097379],"domain_scores_gemma":[0.999371,0.00001694405,0.00008754001,0.0004241984,0.00008520091,0.00001514677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003241981,0.00008767973,0.002455442,0.00002351078,0.00005208323,3.448172e-7,0.00005767019,0.2974935,0.6933588,0.0003671993,0.005803979,0.0002673861],"study_design_scores_gemma":[0.003068727,0.000340809,0.02553862,0.00010717,0.0001373401,0.00001225226,0.0004218747,0.0932933,0.8686973,0.0006582232,0.006944876,0.0007794737],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7527906,0.0001216063,0.222461,0.02039162,0.0002808287,0.0007380476,0.00002315945,0.00001601952,0.003177063],"genre_scores_gemma":[0.9878645,0.00001463428,0.01007598,0.001471707,0.00006603252,0.00003832688,0.00008117874,0.00001375592,0.000373857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2350739,"threshold_uncertainty_score":0.2129358,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01678444587763,"gpt":0.2727120001533115,"spread":0.2559275542756815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001738002,0.0002595534,0.0003571487,0.000217054,0.000140106,0.0000232894,0.0001383491,0.0001257668,0.0000489623],"category_scores_gemma":[0.00007091351,0.0002904178,0.00008553027,0.000374733,0.00007587283,0.0002885056,0.00001908555,0.0001177684,0.00000328977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001565394,"about_ca_system_score_gemma":0.00001474752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000290252,"about_ca_topic_score_gemma":1.756173e-7,"domain_scores_codex":[0.9985954,0.00009632308,0.0005347735,0.0002704667,0.0001917544,0.0003113131],"domain_scores_gemma":[0.9990571,0.0002458268,0.0001779533,0.0003269759,0.0001060558,0.00008605275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003863825,0.00003147944,0.00007082755,0.00006855976,0.00005725562,0.000001355909,0.0001479152,0.9968805,0.0004975481,0.0001409098,0.001759617,0.000305395],"study_design_scores_gemma":[0.001008837,0.00004941411,0.00001611079,0.00005696895,0.00002938501,0.00000675389,0.00002201633,0.9955044,0.002437065,0.000002973346,0.0005968055,0.0002692059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007745863,0.00008541365,0.996471,0.0002825389,0.0008491141,0.0008418464,0.00003015452,0.0002859281,0.0003794062],"genre_scores_gemma":[0.06383274,0.0002697341,0.9346568,0.0003969663,0.000182776,0.0001540264,0.0003208121,0.0001297998,0.00005634062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06305816,"threshold_uncertainty_score":0.9999548,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02898946503373397,"gpt":0.2778612898883049,"spread":0.2488718248545709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004784992,0.000134203,0.000111963,0.0001431788,0.0001109838,0.00005292431,0.00006306628,0.00003498582,0.0002024516],"category_scores_gemma":[0.00000438882,0.0001433139,0.00004634031,0.0001120774,0.00001889553,0.0007846047,0.000004436664,0.00005599602,0.000001349725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002624603,"about_ca_system_score_gemma":0.0000262222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004834252,"about_ca_topic_score_gemma":2.73369e-7,"domain_scores_codex":[0.9992644,0.00001813519,0.0002133039,0.0002294713,0.0001110281,0.0001636303],"domain_scores_gemma":[0.9996197,0.00005579334,0.0001185363,0.0001113154,0.00006053041,0.0000340877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001059458,0.00005686175,0.001810614,0.000003193127,0.00001416728,1.318276e-7,0.0002261986,0.9947433,0.00102765,0.0008028915,0.0004614503,0.0008429678],"study_design_scores_gemma":[0.000541673,0.00002417692,0.0001269582,0.00002208555,0.000005733586,2.842374e-7,0.00002169042,0.9981921,0.0003149901,0.0004831079,0.0001234616,0.0001437937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003526506,0.00001237002,0.9942744,0.001216936,0.00007486661,0.0006414458,0.0000190948,0.0000752312,0.0001590869],"genre_scores_gemma":[0.1108058,0.000005463481,0.887009,0.0003251779,0.0001837487,0.001033743,0.0004446694,0.00003252785,0.0001599417],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1072793,"threshold_uncertainty_score":0.5844172,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02108588286250277,"gpt":0.2638243931238473,"spread":0.2427385102613445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003409774,0.0001357666,0.0001756595,0.000126002,0.0008221215,0.001077578,0.0004533251,0.0000586059,0.00005462862],"category_scores_gemma":[0.0002416733,0.0001378095,0.00005795174,0.00008424801,0.00006749504,0.001202744,0.0001171983,0.00005773224,0.000004598187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002993815,"about_ca_system_score_gemma":0.00004733939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004343304,"about_ca_topic_score_gemma":0.000005398631,"domain_scores_codex":[0.9989445,0.00005548491,0.0002666302,0.0003320137,0.0002199687,0.0001813647],"domain_scores_gemma":[0.9988731,0.0001340138,0.0003160074,0.0004143314,0.0001863005,0.00007628991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001195398,0.0000315109,0.001315112,0.000008859265,0.00006215255,6.384339e-7,0.0002985492,0.7897018,0.00007031491,0.2065562,0.001401713,0.0005411467],"study_design_scores_gemma":[0.0006992703,0.00002238357,0.003120591,0.0000056094,0.00002264542,0.00000211388,0.00001951642,0.9935927,0.00001730297,0.0004989124,0.001822683,0.0001763042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009387768,0.00001297644,0.9750841,0.02297349,0.0002329028,0.0001977179,0.00003011277,0.000075269,0.0004545995],"genre_scores_gemma":[0.2027991,0.000018653,0.7925643,0.002975281,0.0002160247,0.00008687643,0.0001846269,0.00001846272,0.001136669],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2060573,"threshold_uncertainty_score":0.9999594,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08917482597135298,"gpt":0.4120335905499375,"spread":0.3228587645785845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007824961,0.0001446441,0.0001699188,0.0001860289,0.0001846999,0.00007690608,0.0001695316,0.00005937049,0.00005850927],"category_scores_gemma":[0.00130008,0.0001110158,0.0001707794,0.0004147803,0.00004096913,0.0001577248,0.00003267167,0.000106558,0.000004545342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009230477,"about_ca_system_score_gemma":0.00003877892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007306209,"about_ca_topic_score_gemma":0.000002362272,"domain_scores_codex":[0.9985728,0.0004104107,0.0004042494,0.0002172353,0.0002511949,0.0001440627],"domain_scores_gemma":[0.9965401,0.002814861,0.0001818031,0.000313875,0.0001243542,0.00002499447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001585868,0.00007580877,0.00000475418,0.0001095897,0.00007983929,3.353512e-7,0.0009466338,0.7990683,0.005221903,0.1821543,0.009990263,0.002332391],"study_design_scores_gemma":[0.0003873358,0.00003289953,0.000009473466,0.0001130912,0.0001080993,6.84853e-7,0.00001417125,0.9737671,0.005095999,0.01665177,0.003705962,0.0001134167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004748411,0.00001045438,0.9784597,0.01911843,0.0005636349,0.0008343861,0.0001261342,0.0000729536,0.0003394706],"genre_scores_gemma":[0.001975022,0.000002955393,0.9936074,0.001813124,0.0001338784,0.0001538939,0.0001510423,0.00004998839,0.00211268],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1746988,"threshold_uncertainty_score":0.4527093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04883040661566376,"gpt":0.2983069939448683,"spread":0.2494765873292046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004099752,0.0001290271,0.0001578638,0.0001646467,0.00008160668,0.0000178427,0.00007631887,0.00005909,0.0001860234],"category_scores_gemma":[0.0000983754,0.0001387926,0.00006418573,0.0002317258,0.00001940713,0.0001326012,0.000007906264,0.0000544521,0.000004638245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006564155,"about_ca_system_score_gemma":0.00001998886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005007127,"about_ca_topic_score_gemma":0.00000192307,"domain_scores_codex":[0.9990788,0.00007203167,0.0002656768,0.0001527666,0.0002757547,0.0001550337],"domain_scores_gemma":[0.9994174,0.0001094905,0.00008359153,0.0001727712,0.0001784855,0.00003828573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001462573,0.00001013308,0.00007859829,0.00003538449,0.00002651382,2.937884e-7,0.0005423995,0.9930232,0.001875679,0.00006335241,0.002782199,0.001547646],"study_design_scores_gemma":[0.0009116404,0.00003882946,0.00008106905,0.0000259635,0.0000373968,0.00000699419,0.00001636747,0.9966922,0.001644166,0.00003907544,0.0003595704,0.0001467733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0234649,0.00001889248,0.9746751,0.0003057939,0.0001989282,0.0005331555,0.00003351172,0.0001437064,0.0006260549],"genre_scores_gemma":[0.6091647,0.0000215557,0.3889181,0.001212386,0.00007085023,0.0001263702,0.0003708962,0.0000802572,0.00003490403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.585757,"threshold_uncertainty_score":0.5659797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02137641183819937,"gpt":0.2896799265772811,"spread":0.2683035147390817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002275789,0.0001088779,0.0001580841,0.0001069325,0.00003738164,0.0000239221,0.0001009444,0.00006406898,0.001035639],"category_scores_gemma":[0.000744433,0.00008851464,0.00006967744,0.000138162,0.00005408526,0.0001229923,0.00001267911,0.0001486449,0.00003266819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001534302,"about_ca_system_score_gemma":0.000009743768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002092633,"about_ca_topic_score_gemma":0.000002363095,"domain_scores_codex":[0.9991722,0.00003482727,0.0003208598,0.0001388468,0.0002248556,0.0001084032],"domain_scores_gemma":[0.9991773,0.000262305,0.0001793766,0.0002623715,0.00007014156,0.00004844952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007145775,0.0006027385,0.00004538119,0.0002783256,0.00004577689,0.000002308789,0.002533894,0.01511366,0.07224589,0.8786492,0.02657121,0.003840209],"study_design_scores_gemma":[0.001218455,0.0001563976,0.00006233523,0.0001441037,0.00005707388,0.000009746072,0.0001140398,0.86365,0.06791808,0.06522556,0.0009631744,0.0004810697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09935022,3.4033e-7,0.884642,0.005698002,0.0002078996,0.0003020345,0.000007047495,0.00008698789,0.009705447],"genre_scores_gemma":[0.1657766,0.000001235991,0.831818,0.002159326,0.0000379734,0.00002513638,0.00002120728,0.0000261094,0.0001344004],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8485363,"threshold_uncertainty_score":0.9998776,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01777942290356581,"gpt":0.2336952618307448,"spread":0.215915838927179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004539648,0.0002603634,0.0002573144,0.0001712165,0.0001357707,0.0001580633,0.0002631652,0.0001089882,0.0002920447],"category_scores_gemma":[0.0001078752,0.0003052755,0.00005835114,0.001410479,0.0000194688,0.0002321243,0.00004840354,0.0002654282,0.00007731949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001270979,"about_ca_system_score_gemma":0.00005370779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006589738,"about_ca_topic_score_gemma":1.444392e-7,"domain_scores_codex":[0.9981951,0.00008886819,0.0004257166,0.0004474349,0.0003571635,0.0004857093],"domain_scores_gemma":[0.9991161,0.0001111468,0.0000498558,0.0002815571,0.0001286068,0.0003127773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001188063,0.00001553814,0.0001455563,0.00008029894,0.00003424865,0.000005371056,0.0007722203,0.9916572,0.004522469,0.0001276824,0.001994651,0.0006328668],"study_design_scores_gemma":[0.0004990207,0.00004528738,0.00001700931,0.00003653425,0.00002279851,0.000001822599,0.00004738383,0.995916,0.002420877,0.000005461528,0.0006428609,0.0003449578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004093055,0.00001441693,0.9899719,0.005796299,0.0001456264,0.0005522373,0.00001417914,0.001117397,0.0019786],"genre_scores_gemma":[0.007476388,0.000005810082,0.9848762,0.007155467,0.0002089047,0.00005370272,0.00007117856,0.0001268986,0.00002552163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007067083,"threshold_uncertainty_score":0.9999399,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00684713335480327,"gpt":0.2003724991156269,"spread":0.1935253657608236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002060137,0.00008077994,0.0001151232,0.0002215586,0.0002747097,0.00005202172,0.000399828,0.00001592141,0.000722953],"category_scores_gemma":[0.00002770767,0.00008777573,0.00007150925,0.001007857,0.00002997868,0.0003417762,0.0001544699,0.00007360557,0.00000489772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007355172,"about_ca_system_score_gemma":0.0000563972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000220698,"about_ca_topic_score_gemma":5.506996e-7,"domain_scores_codex":[0.9988439,0.0001101269,0.0002557912,0.0002268903,0.0004530635,0.0001102467],"domain_scores_gemma":[0.9993958,0.00006080053,0.0001921243,0.0002068176,0.000105257,0.0000391452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002712657,0.00004538241,0.0005673812,0.000001929925,0.00002743243,9.556636e-7,0.0001322706,0.9748887,0.0004106089,0.02278025,0.0009898409,0.0001524656],"study_design_scores_gemma":[0.0001683388,0.00002092668,0.0003177941,0.000001294818,0.00001034226,0.000005721699,0.00002186007,0.9976785,0.0002662538,0.0001508633,0.001253757,0.0001043646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007308174,0.00001556275,0.9885098,0.009243885,0.0002494922,0.00007236673,0.00001080084,0.00007561713,0.001091699],"genre_scores_gemma":[0.318768,0.00002248509,0.6759861,0.004445403,0.00005482631,0.00004610439,0.0001110054,0.00001199132,0.0005541278],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3180372,"threshold_uncertainty_score":0.7915828,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09613552248103259,"gpt":0.3543299633767361,"spread":0.2581944408957035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006900628,0.0001313491,0.0001798562,0.0001046615,0.00008095398,0.00004005191,0.0002349229,0.00005769585,0.000136295],"category_scores_gemma":[0.001336281,0.00009788637,0.00006258032,0.0003536271,0.0001072562,0.0001589466,0.00006927999,0.0001889498,0.00001957472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001242262,"about_ca_system_score_gemma":0.00006279872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001231533,"about_ca_topic_score_gemma":8.873083e-7,"domain_scores_codex":[0.9983342,0.0002541678,0.0002974424,0.0002040511,0.0007180851,0.0001920943],"domain_scores_gemma":[0.9984369,0.0004899288,0.0001881638,0.0003658529,0.0004206368,0.00009857101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000545699,0.00007466869,0.0001237542,0.00001127381,0.00003839535,0.000004695797,0.0005021491,0.9824646,0.00009270963,0.009513677,0.006940876,0.0001786504],"study_design_scores_gemma":[0.002518392,0.0002777704,0.0003844753,0.0001048276,0.00006630347,0.00001933211,0.0008057949,0.9784907,0.005141804,0.01118094,0.0004594399,0.0005501905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01995827,0.000008582262,0.9696264,0.007197876,0.0001025469,0.0004438036,0.0000247677,0.00005978979,0.002578014],"genre_scores_gemma":[0.3835363,0.00001594715,0.6121388,0.003245712,0.0001096744,0.0000790562,0.00005912913,0.00009200184,0.0007234229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.363578,"threshold_uncertainty_score":0.399169,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01634827198320641,"gpt":0.2627674421359366,"spread":0.2464191701527302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002354279,0.0001174226,0.0001104062,0.00005492792,0.000322281,0.00007252862,0.0001952197,0.00004210572,0.0002038566],"category_scores_gemma":[0.00008784896,0.00007646812,0.00005044154,0.0001794091,0.00004305829,0.00005978477,0.00005728133,0.00009529805,0.000005918879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002799887,"about_ca_system_score_gemma":0.000005719877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002677783,"about_ca_topic_score_gemma":0.00001546198,"domain_scores_codex":[0.9992338,0.00007065936,0.0001897984,0.0001595397,0.0001716537,0.0001745526],"domain_scores_gemma":[0.9993342,0.0002426806,0.00008595595,0.0002738787,0.00003779806,0.00002550779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001842839,0.00001511831,0.0002232548,0.00002313563,0.00002668478,0.000005034341,0.001813972,0.65032,0.0004809477,0.1727448,0.1740695,0.0002590819],"study_design_scores_gemma":[0.006748023,0.0003125441,0.003538822,0.0003961891,0.0005399094,0.0003269051,0.003152089,0.3424392,0.005854913,0.3537476,0.2791435,0.003800315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2010806,0.00002070195,0.781974,0.01234015,0.0004498152,0.0004728068,0.00003279517,0.000127524,0.003501623],"genre_scores_gemma":[0.8792127,0.000001267126,0.1094921,0.010389,0.0004245891,0.0000319317,0.00003271339,0.00003835836,0.0003773368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6781321,"threshold_uncertainty_score":0.311828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}