{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Mark A. Abramson","is_ca":false},{"name":"Charles Audet","is_ca":true},{"name":"James W. Chrissis","is_ca":false},{"name":"Jennifer G. Walston","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223174,0.000764899,0.0009776424,0.0007214831,0.0004365897,0.000891683,0.001323662,0.001491499,0.004979472],"category_scores_gemma":[0.00487436,0.0005448836,0.0005453954,0.001039878,0.0006807603,0.001006483,0.001450167,0.001704527,0.0008951297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004938229,"about_ca_system_score_gemma":0.0005200109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002294822,"about_ca_topic_score_gemma":0.002751891,"domain_scores_codex":[0.9996264,0.000182054,0.00001409523,0.00002860726,0.0001268351,0.00002205357],"domain_scores_gemma":[0.9988441,0.0008223177,0.00006386678,0.00008942289,0.0001503265,0.00002999889],"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.0001117778,0.0000495522,0.0003365754,0.0001399698,0.00008034515,0.00004526441,0.00006102412,0.8044745,0.001497344,0.05795414,0.004506757,0.1307427],"study_design_scores_gemma":[0.00001337025,0.000009456747,0.00003032911,0.000006277308,0.000004079217,0.000006450817,0.000003668841,0.9884343,0.0001401868,0.01016759,0.001181414,0.000002841251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004479685,0.0008708935,0.9883153,0.0001777229,0.000152246,0.0000301686,0.00003343017,0.0001766491,0.005763876],"genre_scores_gemma":[0.2298672,0.001054511,0.7548122,0.0002431503,0.000239434,0.000510974,0.0001753535,0.0002983017,0.01279889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004979472,"threshold_uncertainty_score":0.01665795,"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","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Antonino Sgalambro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329035,0.001903902,0.001770902,0.001354749,0.000858622,0.002982406,0.00245958,0.002725404,0.01038697],"category_scores_gemma":[0.003617936,0.001151525,0.00167367,0.002553482,0.001169861,0.002219831,0.001688033,0.001510301,0.001195672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005023564,"about_ca_system_score_gemma":0.00268628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03176045,"about_ca_topic_score_gemma":0.02975987,"domain_scores_codex":[0.9986836,0.0005173061,0.0000404511,0.0001705535,0.0002180481,0.0003698811],"domain_scores_gemma":[0.9985671,0.0007354906,0.0001518676,0.00005224565,0.0003384065,0.0001547629],"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.00002823717,0.00001538917,0.0001229156,0.00002473612,0.00001175572,0.0000236878,0.00001720805,0.9867125,0.0001813482,0.01015849,0.0006045971,0.002099223],"study_design_scores_gemma":[0.000004788896,0.000009568356,0.000037995,0.000002808505,0.000005044118,0.000005847223,0.00001199369,0.9957991,0.00003385299,0.003801033,0.0002839942,0.000003995122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04549858,0.0007202856,0.9332287,0.0009303609,0.000117548,0.000172627,0.0008215281,0.0002709197,0.0182394],"genre_scores_gemma":[0.8654961,0.001450959,0.0897883,0.0002839062,0.0001100674,0.0004088748,0.0008327295,0.0002036306,0.04142547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03176045,"threshold_uncertainty_score":0.06315118,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Jean Haddad","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497407,0.001452218,0.001862818,0.001114312,0.0008230382,0.003253435,0.002223808,0.001743192,0.006783388],"category_scores_gemma":[0.01085009,0.001534578,0.00108616,0.001805843,0.002282993,0.003757755,0.00290828,0.007048244,0.0007293087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001761192,"about_ca_system_score_gemma":0.001054904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002296203,"about_ca_topic_score_gemma":0.002778632,"domain_scores_codex":[0.998162,0.0007120977,0.00008676333,0.0003157098,0.0005889607,0.0001345341],"domain_scores_gemma":[0.9961091,0.002936443,0.0001760461,0.000226223,0.0003835169,0.0001686214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002399794,0.0001395796,0.0003154601,0.0004587796,0.00009607083,0.00009451268,0.0002449602,0.2001276,0.001895289,0.6764548,0.006601195,0.1133318],"study_design_scores_gemma":[0.00003929277,0.00004309652,0.0001044579,0.00005330751,0.00002279661,0.00003767055,0.00003614704,0.4817083,0.000473349,0.5135915,0.0038752,0.00001484186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004780984,0.0005554502,0.9894339,0.0002472463,0.00006184967,0.00003886335,0.00009754307,0.00009597387,0.004688151],"genre_scores_gemma":[0.195906,0.001116255,0.7905862,0.0002950886,0.000237282,0.0004680306,0.0008000635,0.000390322,0.0102008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006783388,"threshold_uncertainty_score":0.02269274,"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","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"Raca Todosijević","is_ca":false},{"name":"Dragan Urošević","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120544,0.0006072373,0.001225505,0.0006243393,0.0004385689,0.0009287657,0.001407117,0.001117202,0.004385641],"category_scores_gemma":[0.003090608,0.0004996167,0.000511189,0.0008914049,0.0006639758,0.001129002,0.0009970659,0.0009074892,0.0002995641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030226,"about_ca_system_score_gemma":0.00125823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00553575,"about_ca_topic_score_gemma":0.00567307,"domain_scores_codex":[0.9997126,0.0001484234,0.000005877934,0.00005154153,0.00004779248,0.00003371709],"domain_scores_gemma":[0.9990706,0.0006956417,0.00007276035,0.00003260496,0.0000849847,0.0000433996],"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.00004684342,0.0000316882,0.0001729113,0.00004508739,0.00002107552,0.00002445538,0.00001699875,0.959724,0.0001672856,0.02926344,0.001805487,0.008680658],"study_design_scores_gemma":[0.000007003337,0.000005856102,0.00002594048,0.000002620757,0.000001988545,0.000003279576,0.00000460744,0.9934108,0.00002717948,0.006289639,0.0002196788,0.000001469573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03106746,0.0006131753,0.9556617,0.0006340762,0.0000794858,0.00006935208,0.0001333514,0.0001058747,0.01163553],"genre_scores_gemma":[0.6880848,0.0007434869,0.2877783,0.0002731826,0.0001271517,0.0004661845,0.0004015957,0.000226139,0.02189919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00553575,"threshold_uncertainty_score":0.01467144,"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","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"Raca Todosijević","is_ca":false},{"name":"Dragan Urošević","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005980141,0.0004890705,0.0009571969,0.0005693099,0.0004796352,0.0005934719,0.001416582,0.0009396927,0.004524682],"category_scores_gemma":[0.001524281,0.0003612302,0.0004487098,0.0009150159,0.000430338,0.0008390257,0.0007236487,0.000694835,0.0004328982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007298545,"about_ca_system_score_gemma":0.001111333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004383552,"about_ca_topic_score_gemma":0.005481663,"domain_scores_codex":[0.9997453,0.0001062884,0.000006315228,0.00003900509,0.00006418598,0.00003883761],"domain_scores_gemma":[0.9996493,0.0002088692,0.00002931995,0.0000262236,0.00006111204,0.00002522639],"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.00008707742,0.00005891729,0.0001466397,0.0000454749,0.00001782836,0.0000316514,0.00002493095,0.9318715,0.0007136066,0.01917415,0.002849672,0.04497852],"study_design_scores_gemma":[0.00001250756,0.00001919087,0.00003388991,0.000004193845,0.000003382258,0.000008033478,0.000005828616,0.9962483,0.0001298563,0.002940977,0.0005910306,0.000002862164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01901876,0.0003123075,0.9709842,0.0001840394,0.00009321766,0.00009127214,0.00007663482,0.0002280782,0.009011541],"genre_scores_gemma":[0.4202371,0.0002976932,0.5705297,0.0001547474,0.00007534366,0.0002975683,0.0002207842,0.0001905356,0.00799654],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004524682,"threshold_uncertainty_score":0.01513654,"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","authors":[{"name":"Raca Todosijević","is_ca":false},{"name":"Anis Mjirda","is_ca":false},{"name":"Marko Mladenović","is_ca":false},{"name":"Saı̈d Hanafi","is_ca":false},{"name":"Bernard Gendron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001964245,0.0007054389,0.001129164,0.0006703541,0.0005333259,0.001616187,0.002412167,0.001671933,0.004967948],"category_scores_gemma":[0.005123065,0.0005109186,0.001147146,0.001140883,0.001037619,0.002507144,0.001637098,0.00186857,0.0005376007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009987711,"about_ca_system_score_gemma":0.001135204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004137387,"about_ca_topic_score_gemma":0.003088613,"domain_scores_codex":[0.9992315,0.0003900217,0.00002391037,0.0001322507,0.0001581988,0.00006415085],"domain_scores_gemma":[0.9987697,0.0007178618,0.0001064131,0.0001194135,0.000201557,0.00008499857],"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.00008122796,0.00007299422,0.0003805505,0.0001084572,0.00004464644,0.000122739,0.00008022277,0.6408227,0.0009176825,0.3284853,0.004887786,0.02399582],"study_design_scores_gemma":[0.000009532207,0.00002295535,0.00005530544,0.000008139345,0.000006031769,0.00002622866,0.00001130024,0.9648449,0.00009626526,0.03291005,0.002003288,0.000006052622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01811799,0.0008594999,0.9665614,0.0005997244,0.000186154,0.00005611125,0.0001043702,0.0000598033,0.01345486],"genre_scores_gemma":[0.4666399,0.001835817,0.4842966,0.0003593227,0.0003765328,0.0003986512,0.0005028224,0.0003345752,0.0452558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004967948,"threshold_uncertainty_score":0.0166195,"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","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Stefana Janićijević","is_ca":false},{"name":"Nenad Mladenović","is_ca":false},{"name":"Dragan Urošević","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001439002,0.000957009,0.001367101,0.000776633,0.0009703688,0.001417844,0.002098734,0.002244577,0.006015467],"category_scores_gemma":[0.003836863,0.0007587665,0.001002057,0.001502014,0.0008417596,0.002183801,0.001817526,0.001572864,0.0006730555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007884578,"about_ca_system_score_gemma":0.001023211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002736155,"about_ca_topic_score_gemma":0.003993266,"domain_scores_codex":[0.9988889,0.0005767278,0.00002514435,0.0002520897,0.0001542007,0.0001030017],"domain_scores_gemma":[0.9985613,0.0009745777,0.00008924893,0.0001554514,0.0001324509,0.0000868922],"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.000113708,0.0001525658,0.0006301986,0.0002386172,0.0001047188,0.0001548266,0.0001889484,0.8136861,0.00282081,0.1068839,0.01014225,0.06488337],"study_design_scores_gemma":[0.00002674887,0.00003189888,0.0001685113,0.00001435335,0.00001432402,0.00004702342,0.00007649035,0.9321026,0.0004723676,0.0646105,0.002426038,0.000009202169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02614155,0.0002082745,0.965548,0.0005333492,0.00005071337,0.00008742519,0.0001551018,0.0001167453,0.007158713],"genre_scores_gemma":[0.2975282,0.00034664,0.6900005,0.0003399374,0.000157546,0.0003781906,0.0008919052,0.0002835206,0.01007345],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006015467,"threshold_uncertainty_score":0.02012378,"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","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Manuel V.C. Vieira","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547295,0.001240187,0.00120345,0.001281474,0.0005744483,0.002048156,0.001734889,0.001320325,0.006625358],"category_scores_gemma":[0.002733542,0.001058789,0.00183694,0.001844358,0.001037465,0.00153116,0.001157068,0.002135461,0.0009537057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002193207,"about_ca_system_score_gemma":0.001782959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005143377,"about_ca_topic_score_gemma":0.004246254,"domain_scores_codex":[0.999127,0.0003276054,0.00003545921,0.0002019216,0.0001967361,0.0001112892],"domain_scores_gemma":[0.9986933,0.0008915302,0.0001622852,0.00006166962,0.0001440553,0.00004717393],"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.00002333211,0.00004110341,0.0001971654,0.0001108864,0.00003491719,0.00008758413,0.00002551397,0.9473989,0.0006500428,0.04354633,0.001103928,0.006780304],"study_design_scores_gemma":[0.000007880785,0.00001711549,0.00005561807,0.000009950652,0.000007918454,0.00001304725,0.000007526973,0.9893951,0.0001805463,0.009246287,0.001054293,0.000004696471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009286528,0.000495589,0.980053,0.000476397,0.0000606775,0.00008657997,0.0002631509,0.0001363187,0.009141786],"genre_scores_gemma":[0.3165835,0.001319088,0.666359,0.0003648656,0.0002230147,0.0005837346,0.0005045081,0.0001800552,0.01388222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006625358,"threshold_uncertainty_score":0.02216405,"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","authors":[{"name":"Monali S. Malvankar‐Mehta","is_ca":true},{"name":"S. S. Mehta","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001617344,0.0007799523,0.001398553,0.0006616827,0.0006169019,0.001243559,0.0007971298,0.001085493,0.003515938],"category_scores_gemma":[0.007844636,0.0008927908,0.0004411242,0.0005779882,0.00109466,0.001487308,0.001680624,0.0007861003,0.0003148639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009201138,"about_ca_system_score_gemma":0.001314106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003520617,"about_ca_topic_score_gemma":0.002128291,"domain_scores_codex":[0.9986873,0.0007684117,0.00005079538,0.0001517982,0.0001464623,0.0001952357],"domain_scores_gemma":[0.9966525,0.002540019,0.0002197675,0.0001408789,0.0002414013,0.0002054059],"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.0006250428,0.000244267,0.001086766,0.0001313596,0.000128719,0.00008434224,0.000285788,0.9130154,0.004775532,0.03703968,0.001321281,0.04126189],"study_design_scores_gemma":[0.00003931769,0.0001030242,0.001055004,0.000008469338,0.00001264269,0.00001317736,0.00008602667,0.9580163,0.0004652602,0.03990737,0.0002806388,0.00001294288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1594942,0.0003766996,0.8293243,0.0009742869,0.00009181463,0.0001171077,0.00004808942,0.0001480823,0.009425389],"genre_scores_gemma":[0.9489658,0.0001536167,0.04756513,0.00008468413,0.00003504706,0.0001513612,0.00002506703,0.00005534708,0.00296393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003520617,"threshold_uncertainty_score":0.01176196,"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","authors":[{"name":"Serhat Keçici","is_ca":false},{"name":"Necati Aras","is_ca":false},{"name":"Vedat Verter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001741068,0.00102887,0.001231385,0.0006369896,0.0006404308,0.001741405,0.001171789,0.001850606,0.00327558],"category_scores_gemma":[0.006598437,0.001034562,0.0005960768,0.0007672438,0.0009470775,0.001807972,0.00108023,0.00133541,0.0002343605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002245193,"about_ca_system_score_gemma":0.00182885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009769261,"about_ca_topic_score_gemma":0.01048997,"domain_scores_codex":[0.9988875,0.0006431554,0.00002127573,0.00008540856,0.0001495529,0.0002131303],"domain_scores_gemma":[0.9974943,0.001704019,0.0002998858,0.00006868582,0.0002923943,0.000140727],"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.00001139546,0.000003666649,0.00008445302,0.000005912417,0.000005346112,0.000008830967,0.000005043422,0.9977254,0.00005067309,0.001128791,0.00008049684,0.000889905],"study_design_scores_gemma":[0.000003997628,0.00001525705,0.00004914759,0.000002252886,0.000004466798,0.000004009575,0.000008657436,0.998625,0.00003907286,0.001093618,0.0001521883,0.000002406948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1674863,0.000707968,0.8073288,0.001879787,0.0001405496,0.0001064143,0.0001391081,0.0001887111,0.02202239],"genre_scores_gemma":[0.9777932,0.0002176324,0.01957247,0.00007473157,0.00003527603,0.00004066349,0.00003110181,0.00004097538,0.002193957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009769261,"threshold_uncertainty_score":0.0194248,"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)","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Amina Ihaddadene","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true},{"name":"Christophe Tribes","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093057,0.001052669,0.002105774,0.0006091889,0.0004170746,0.001247115,0.001401733,0.001876823,0.002598727],"category_scores_gemma":[0.006659062,0.00070929,0.000794177,0.0005878183,0.001237324,0.001399548,0.002071691,0.001317874,0.0004392597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005849392,"about_ca_system_score_gemma":0.0009916291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001907773,"about_ca_topic_score_gemma":0.00143055,"domain_scores_codex":[0.9993118,0.0003422905,0.00002613863,0.00008586488,0.0001956565,0.00003832575],"domain_scores_gemma":[0.998054,0.001406745,0.0001567825,0.0001294984,0.0001894219,0.00006348453],"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.0001333644,0.0000261637,0.0001602122,0.00009642666,0.00005855102,0.00004785066,0.00002932566,0.9613442,0.001519096,0.02071129,0.0007261102,0.01514736],"study_design_scores_gemma":[0.000006615142,0.000005642937,0.00001190547,0.00000327872,0.000001843478,0.000002690197,0.000001134955,0.9972972,0.0001588023,0.002387419,0.0001212965,0.000002142146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004953342,0.0001512674,0.9930953,0.0001000037,0.00005014718,0.00001805992,0.00001984123,0.000112891,0.001498938],"genre_scores_gemma":[0.4004136,0.000360968,0.5924959,0.0001703855,0.0001298558,0.0003682786,0.0001558427,0.0003449497,0.005560293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002598727,"threshold_uncertainty_score":0.0110693,"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","authors":[{"name":"Mustapha Ratli","is_ca":false},{"name":"Dragan Urošević","is_ca":false},{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"Raca Todosijević","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008821679,0.001051732,0.00126156,0.001322853,0.000736331,0.001264142,0.001511671,0.002063117,0.006253571],"category_scores_gemma":[0.002451234,0.0007517014,0.0009265684,0.001488786,0.0007357173,0.00106001,0.001096298,0.001143681,0.0006639504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001294087,"about_ca_system_score_gemma":0.00189193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005159768,"about_ca_topic_score_gemma":0.00686917,"domain_scores_codex":[0.9995291,0.0001804551,0.00001682656,0.00006506974,0.0001234532,0.00008516222],"domain_scores_gemma":[0.9992562,0.0004770397,0.00005554615,0.00006174611,0.000101203,0.00004821687],"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.00009312381,0.000112902,0.0001548342,0.0001087641,0.00002886591,0.00009035549,0.00004280071,0.9215695,0.001428551,0.0176473,0.003174298,0.0555488],"study_design_scores_gemma":[0.00003972618,0.0000312822,0.00005563168,0.00001275921,0.00001219194,0.00002217443,0.00001724907,0.9924206,0.0002460203,0.005930768,0.001205125,0.000006393298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02394206,0.000485884,0.9588479,0.0003571433,0.0002126871,0.0002292043,0.00017672,0.0003844707,0.01536403],"genre_scores_gemma":[0.2733777,0.0004496345,0.7183431,0.0002057656,0.0001002812,0.0004511634,0.0003052714,0.0001784929,0.006588561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006253571,"threshold_uncertainty_score":0.02092028,"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","authors":[{"name":"Alberto Costa","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001884066,0.001202866,0.001745539,0.001825927,0.001140361,0.001163233,0.003823681,0.002824208,0.006380002],"category_scores_gemma":[0.006791431,0.001059543,0.001081473,0.001515783,0.00133532,0.001930739,0.002555365,0.001578898,0.00109941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778989,"about_ca_system_score_gemma":0.00247619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007638071,"about_ca_topic_score_gemma":0.01599508,"domain_scores_codex":[0.9991832,0.0003080687,0.00003452637,0.0001851539,0.0001843389,0.0001045488],"domain_scores_gemma":[0.9972874,0.001718068,0.0001490052,0.0002817525,0.0003750576,0.0001887657],"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.0002294739,0.0002205554,0.0005663594,0.0001857194,0.00008684491,0.00008629177,0.0001709314,0.8013068,0.004302572,0.02448686,0.005962858,0.1623948],"study_design_scores_gemma":[0.0000241108,0.00001617599,0.00004377279,0.000007354661,0.000007649337,0.00001162278,0.00001215263,0.9921497,0.000386313,0.007038165,0.0002974271,0.000005564093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01484572,0.0001688568,0.981492,0.0002232007,0.00004609874,0.0001420209,0.00008629051,0.0005859266,0.002409876],"genre_scores_gemma":[0.1850401,0.00009936142,0.8093056,0.0003128226,0.00008073967,0.0003965707,0.0002935604,0.0004099587,0.004061298],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007638071,"threshold_uncertainty_score":0.02134317,"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","authors":[{"name":"Yongxi Cheng","is_ca":true},{"name":"Ding‐Zhu Du","is_ca":false},{"name":"Guohui Lin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005021131,0.00333202,0.002457016,0.002453914,0.001542724,0.006034311,0.004284478,0.002577212,0.01500184],"category_scores_gemma":[0.04671358,0.001879127,0.001354515,0.002824569,0.003680874,0.0102214,0.004046392,0.007103232,0.002744615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002245002,"about_ca_system_score_gemma":0.001928991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001186739,"about_ca_topic_score_gemma":0.002678571,"domain_scores_codex":[0.9944555,0.001732718,0.0002489805,0.001051439,0.001643888,0.0008674592],"domain_scores_gemma":[0.9299904,0.05834629,0.002309821,0.004563676,0.003191205,0.001598603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001974727,0.0004658012,0.002115272,0.001261533,0.0002436807,0.0003688631,0.0005988189,0.3466372,0.02585592,0.49253,0.02294691,0.1050013],"study_design_scores_gemma":[0.00008952892,0.0002118866,0.0009698547,0.0002223345,0.00006582362,0.0002974577,0.0001454928,0.5695942,0.00836858,0.4147731,0.005185296,0.0000764328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.087843,0.006487411,0.8324038,0.00557408,0.000681903,0.0001660041,0.002180686,0.0007993861,0.06386385],"genre_scores_gemma":[0.614494,0.005629332,0.3574716,0.001729568,0.001338871,0.0006848186,0.002435938,0.0009957099,0.01522022],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01500184,"threshold_uncertainty_score":0.05018616,"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","authors":[{"name":"Zhen Yang","is_ca":true},{"name":"Anthony Vannelli","is_ca":true},{"name":"Shawki Areibi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900013,0.0004544281,0.0003395068,0.000396895,0.0003240943,0.0004992716,0.0008899112,0.0003147418,0.003547034],"category_scores_gemma":[0.0002739284,0.0002796575,0.0003583053,0.0004664584,0.0002248872,0.0005712323,0.0004877179,0.0004851512,0.0005728907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004227179,"about_ca_system_score_gemma":0.0005266879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009655769,"about_ca_topic_score_gemma":0.004026482,"domain_scores_codex":[0.99988,0.00002970163,0.000006141962,0.00001755696,0.00004885756,0.0000176659],"domain_scores_gemma":[0.9998933,0.00002400142,0.00001255204,0.00003251469,0.000031834,0.000005780349],"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.0001385074,0.00009436577,0.0004252336,0.0003238209,0.00007693988,0.0001954742,0.0001394529,0.4535854,0.09320746,0.03579788,0.009956916,0.4060586],"study_design_scores_gemma":[0.00003226888,0.0002535867,0.0002744403,0.00002514968,0.0000505184,0.0001441367,0.00003364532,0.9481602,0.02250548,0.01821206,0.01029282,0.00001568415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01223411,0.0003616102,0.9770887,0.0001282043,0.0000489883,0.00004884485,0.00006419837,0.001293021,0.008732256],"genre_scores_gemma":[0.3647583,0.0004631842,0.6266767,0.0002133184,0.00005670311,0.0001476102,0.0002636832,0.000241629,0.007178849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003547034,"threshold_uncertainty_score":0.01186603,"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","authors":[{"name":"Ahmed Saif","is_ca":true},{"name":"Samir Elhedhli","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818459,0.0009531094,0.001747312,0.001180475,0.0007041874,0.001784467,0.002176739,0.002630188,0.006214733],"category_scores_gemma":[0.004405913,0.0008787057,0.001006442,0.001850516,0.001182476,0.001584137,0.001538874,0.001738266,0.0006471043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001965055,"about_ca_system_score_gemma":0.003391274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009209069,"about_ca_topic_score_gemma":0.01066293,"domain_scores_codex":[0.9990371,0.0005367567,0.00002488532,0.0001023591,0.0001537504,0.0001451319],"domain_scores_gemma":[0.9979195,0.00155569,0.0001179072,0.00008895295,0.0001760409,0.0001419339],"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.0001007973,0.0001039979,0.0002226176,0.000102234,0.00002548262,0.00008766243,0.00004789164,0.945067,0.0003969466,0.02384244,0.004603372,0.02539941],"study_design_scores_gemma":[0.00004635601,0.00003007375,0.00006261569,0.0000156389,0.000008216368,0.00001940399,0.00002204181,0.9908288,0.0001195557,0.007818725,0.001021747,0.000006891915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01956839,0.000508382,0.966265,0.0009105065,0.0001143646,0.0001567517,0.0002163213,0.000230894,0.01202943],"genre_scores_gemma":[0.3525205,0.000579764,0.6361476,0.0004074029,0.0001260347,0.0003763453,0.0004561657,0.0002321582,0.009154157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009209069,"threshold_uncertainty_score":0.0207904,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01015825,0.001427089,0.0021363,0.001091883,0.001311898,0.00353265,0.00368032,0.005122691,0.0081795],"category_scores_gemma":[0.1117232,0.001181989,0.001226409,0.001028963,0.005151281,0.02075031,0.003881704,0.01051111,0.001703485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724258,"about_ca_system_score_gemma":0.001982787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00204419,"about_ca_topic_score_gemma":0.00212816,"domain_scores_codex":[0.9959248,0.002054063,0.0002113502,0.0006854078,0.0009101357,0.0002142635],"domain_scores_gemma":[0.9211064,0.06655272,0.001879405,0.004776336,0.004135028,0.00155015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005050176,0.0001902679,0.002533799,0.0009109496,0.0002109312,0.000234455,0.000472936,0.1713699,0.002653813,0.6522068,0.02601769,0.1426934],"study_design_scores_gemma":[0.00003568189,0.00006075681,0.0003633334,0.0001189397,0.0000281918,0.00007715318,0.00006298465,0.6321417,0.00124648,0.3631821,0.002639679,0.00004300914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01321941,0.002727503,0.9640458,0.01236803,0.0007192717,0.00007041004,0.0002040772,0.0005038152,0.006141669],"genre_scores_gemma":[0.491231,0.004540231,0.4774145,0.004850826,0.003506433,0.0006585491,0.0008368465,0.001919561,0.01504209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01015825,"threshold_uncertainty_score":0.05372262,"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","authors":[{"name":"Lu Han","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Chenchen Wu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994019,0.001535224,0.002243921,0.001454863,0.001649539,0.003035317,0.005070372,0.002760439,0.01745135],"category_scores_gemma":[0.006316232,0.0007650272,0.002041907,0.003362641,0.0008903485,0.004544004,0.003120228,0.003086336,0.003196048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003479318,"about_ca_system_score_gemma":0.005496836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004473695,"about_ca_topic_score_gemma":0.008048987,"domain_scores_codex":[0.9979289,0.0005233692,0.0001488823,0.0003729787,0.000469022,0.0005567725],"domain_scores_gemma":[0.9972042,0.001221294,0.0002315647,0.0006130203,0.0003389912,0.0003907616],"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.002984661,0.001612394,0.00291048,0.001045969,0.0002803758,0.0003071336,0.000520489,0.3339286,0.006775417,0.08716663,0.06531628,0.4971515],"study_design_scores_gemma":[0.0004842681,0.0003134187,0.001103725,0.00008044823,0.0001270964,0.0003762531,0.0002681032,0.8841546,0.002569603,0.09960035,0.01087049,0.00005164107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1496562,0.001920666,0.7920925,0.005147332,0.0007411355,0.0008541351,0.002874658,0.004628459,0.04208492],"genre_scores_gemma":[0.2796259,0.0005354402,0.704816,0.0005983192,0.0001982376,0.0005452657,0.003145938,0.0004652135,0.01006975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01745135,"threshold_uncertainty_score":0.05838054,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nikolaj van Omme","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007288708,0.001384632,0.002661586,0.003476971,0.002819609,0.004036137,0.003294778,0.002417821,0.004789009],"category_scores_gemma":[0.05751175,0.001344846,0.001160762,0.0070275,0.004176221,0.01331789,0.005559639,0.004248525,0.001089318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002484037,"about_ca_system_score_gemma":0.002245737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01169521,"about_ca_topic_score_gemma":0.01685907,"domain_scores_codex":[0.9929072,0.003341052,0.000436987,0.001047937,0.001800334,0.0004665624],"domain_scores_gemma":[0.956863,0.03276382,0.001316747,0.006401699,0.001913929,0.0007406445],"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.001200142,0.0001890608,0.007457885,0.0003426337,0.0001771922,0.0002743557,0.0005293478,0.5308233,0.002238716,0.2015782,0.01867175,0.2365175],"study_design_scores_gemma":[0.000056449,0.00005856951,0.0005865515,0.00003907413,0.00002808377,0.00008551529,0.0001043517,0.7396979,0.001186568,0.2557708,0.002362349,0.00002366634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1101713,0.003610578,0.8673785,0.007332401,0.0006277123,0.0001258999,0.0006143494,0.001862113,0.008277087],"genre_scores_gemma":[0.502406,0.001637907,0.488871,0.00095919,0.0006516591,0.0001671396,0.0008437979,0.000777366,0.003685913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01169521,"threshold_uncertainty_score":0.03854686,"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","authors":[{"name":"G. Isac","is_ca":true},{"name":"S. Z. Németh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001947993,0.0009036874,0.001491794,0.002768985,0.00276772,0.003996632,0.001300024,0.001213489,0.003654477],"category_scores_gemma":[0.004940266,0.00060794,0.001035622,0.001218108,0.00431125,0.003981232,0.002747108,0.00352363,0.0002892563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001540448,"about_ca_system_score_gemma":0.001078354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001146463,"about_ca_topic_score_gemma":0.001177955,"domain_scores_codex":[0.9990857,0.0002270574,0.00004015621,0.000143373,0.0003056359,0.0001981337],"domain_scores_gemma":[0.9967553,0.0009879774,0.0003094821,0.0001682721,0.0005908866,0.00118799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004785092,0.00002534492,0.0003333982,0.00001846771,0.00001289513,0.0001049037,0.0001528081,0.001263522,0.0006724043,0.9950894,0.0004963626,0.001782618],"study_design_scores_gemma":[0.00001446628,0.00002433928,0.0003337314,0.00001300829,0.000008255112,0.0001705459,0.000136574,0.01514834,0.0004324858,0.9825883,0.001114976,0.00001496983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6336613,0.0007996089,0.3109462,0.001601033,0.0002751655,0.00007154566,0.0002963756,0.0002883392,0.05206044],"genre_scores_gemma":[0.9609333,0.0004570512,0.02420416,0.0001985839,0.0002639729,0.00009529351,0.0003475758,0.0001441627,0.013356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003996632,"threshold_uncertainty_score":0.01222545,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008390945,0.0008866684,0.001071424,0.001285034,0.001400312,0.002693183,0.001869353,0.001992389,0.006277263],"category_scores_gemma":[0.02605661,0.0006704985,0.0007305089,0.001053052,0.003423363,0.004229241,0.002092642,0.004240013,0.001168674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001955445,"about_ca_system_score_gemma":0.003085795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005853076,"about_ca_topic_score_gemma":0.007146609,"domain_scores_codex":[0.9975615,0.001364767,0.00009074742,0.0001657243,0.0005594928,0.0002578338],"domain_scores_gemma":[0.9851642,0.01039078,0.0004847372,0.001395038,0.001783222,0.0007820266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002813592,0.00008225798,0.0009503427,0.0001045779,0.00001776048,0.00005893116,0.0001983545,0.06332318,0.002225262,0.90386,0.003196656,0.02570134],"study_design_scores_gemma":[0.0000532811,0.00009561163,0.0003555874,0.00005744069,0.00001517469,0.00004891722,0.00005952518,0.5572391,0.002054223,0.4361112,0.003873936,0.00003611494],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06024291,0.001312814,0.9080439,0.002024126,0.0004826272,0.00009142506,0.0001243856,0.0002461936,0.02743155],"genre_scores_gemma":[0.54382,0.001611955,0.4193262,0.000997106,0.0004987139,0.0001873862,0.0003376775,0.001079798,0.03214115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008390945,"threshold_uncertainty_score":0.04437613,"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","authors":[{"name":"Denys Yemshanov","is_ca":true},{"name":"Robert G. Haight","is_ca":false},{"name":"Ning Liu","is_ca":true},{"name":"Robert S. Rempel","is_ca":false},{"name":"Frank Koch","is_ca":false},{"name":"Art Rodgers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001816594,0.001518121,0.002159206,0.001720199,0.0007106704,0.004320895,0.002272453,0.002843928,0.01079628],"category_scores_gemma":[0.006190842,0.001182232,0.001633502,0.002479533,0.001832482,0.004556287,0.002313921,0.002321801,0.0004767224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001873379,"about_ca_system_score_gemma":0.001755606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008102233,"about_ca_topic_score_gemma":0.009737884,"domain_scores_codex":[0.9989962,0.0005453259,0.00003521605,0.0001699213,0.0001367036,0.0001166357],"domain_scores_gemma":[0.9948168,0.004467278,0.0002468849,0.0001311463,0.0001669952,0.0001708262],"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.00008758774,0.0001603563,0.001168528,0.0001634604,0.0002108526,0.0001051318,0.00008807448,0.8721235,0.0003671969,0.09771673,0.003440136,0.02436836],"study_design_scores_gemma":[0.00003994958,0.00005756938,0.0003919305,0.00002890698,0.0000434165,0.0000296792,0.00008468012,0.8764072,0.00006272856,0.120462,0.002373833,0.00001806944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04945887,0.002533782,0.9098381,0.00426695,0.0002298837,0.00008618946,0.0003924632,0.0000974012,0.03309638],"genre_scores_gemma":[0.6401233,0.003986991,0.3199624,0.001354454,0.001061573,0.0004665056,0.0004059094,0.000293858,0.03234503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01079628,"threshold_uncertainty_score":0.03611714,"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","authors":[{"name":"Luc Adjengue","is_ca":true},{"name":"Charles Audet","is_ca":true},{"name":"Imen Ben Yahia","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331946,0.0007724157,0.0009380307,0.0007929364,0.0004214513,0.0009130338,0.001273846,0.001022056,0.004657988],"category_scores_gemma":[0.005195783,0.0005157327,0.0006147783,0.0007386936,0.0005677528,0.0008509539,0.001079412,0.001592485,0.001356753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003160781,"about_ca_system_score_gemma":0.00136105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002225643,"about_ca_topic_score_gemma":0.003226915,"domain_scores_codex":[0.9992182,0.0002853275,0.00003484845,0.00007402197,0.0003500342,0.00003741915],"domain_scores_gemma":[0.9987941,0.0005528812,0.00005657848,0.0001266981,0.0004329399,0.00003684066],"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.0002785883,0.0001340058,0.0006788806,0.0002582913,0.0001304148,0.00008728816,0.00007500237,0.4840768,0.01763326,0.06531556,0.006011309,0.4253207],"study_design_scores_gemma":[0.00001206397,0.00001942858,0.00006089758,0.000006617488,0.00000581359,0.00001304668,0.000002818995,0.9951755,0.001136384,0.002551541,0.001007768,0.000008260428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009379436,0.00006060594,0.9981109,0.00002886564,0.00004197082,0.00001446081,0.00001295013,0.0001098276,0.0006824665],"genre_scores_gemma":[0.07069675,0.0001512397,0.9248469,0.00009344589,0.00009262864,0.0002369421,0.0001279833,0.0002606983,0.003493467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004657988,"threshold_uncertainty_score":0.0155825,"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","authors":[{"name":"Long Zhang","is_ca":false},{"name":"Yuzhong Zhang","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Qingguo Bai","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118484,0.001854512,0.003726615,0.001594003,0.001177883,0.003740787,0.005281732,0.004030812,0.0176603],"category_scores_gemma":[0.02343596,0.001141335,0.0016764,0.001521,0.0027814,0.007192773,0.002975493,0.005614161,0.00104014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003560835,"about_ca_system_score_gemma":0.003057762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314306,"about_ca_topic_score_gemma":0.001421727,"domain_scores_codex":[0.9964129,0.001827715,0.0001436548,0.0004252105,0.0007005076,0.0004901413],"domain_scores_gemma":[0.9814477,0.01417814,0.0008364793,0.001581857,0.0008317446,0.001124005],"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.0005847801,0.0003424953,0.0003792433,0.0003948625,0.0001280564,0.0002147975,0.0001714175,0.2643419,0.002624134,0.6971195,0.008892019,0.02480684],"study_design_scores_gemma":[0.0001673226,0.0001794153,0.0001951731,0.00003498029,0.00004712413,0.00008595084,0.00003789456,0.6353971,0.0003529993,0.3618098,0.001652469,0.0000397221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105614,0.001271673,0.8285958,0.002874966,0.0008651637,0.0003698589,0.0003679709,0.000636345,0.05940433],"genre_scores_gemma":[0.8840207,0.0006903204,0.09517037,0.0005535688,0.0005835167,0.0004234171,0.0001568497,0.0003299243,0.0180713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0176603,"threshold_uncertainty_score":0.05907953,"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","authors":[{"name":"Dimitris Souravlias","is_ca":false},{"name":"Konstantinos E. Parsopoulos","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002174836,0.00110956,0.00157529,0.0006027633,0.001065231,0.0020252,0.001596705,0.002032398,0.005706497],"category_scores_gemma":[0.01260775,0.0007782091,0.0005754662,0.001422585,0.0009917425,0.002896379,0.001588782,0.003112921,0.001746621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000755989,"about_ca_system_score_gemma":0.002177564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003964734,"about_ca_topic_score_gemma":0.00701598,"domain_scores_codex":[0.9990545,0.0003817574,0.00003903028,0.0001133775,0.0003461982,0.00006508557],"domain_scores_gemma":[0.9957587,0.002526052,0.0002178522,0.0005540648,0.0008021969,0.0001411551],"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.0001386943,0.0001818872,0.0004089347,0.0003788668,0.0001214205,0.0001348705,0.00008956093,0.5759858,0.004823837,0.1880624,0.02379761,0.2058761],"study_design_scores_gemma":[0.00002629418,0.00002518106,0.00006028104,0.00001671653,0.0000129392,0.00002540863,0.00001950385,0.9175806,0.0007292664,0.07719849,0.004293317,0.0000120964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007009864,0.0006764082,0.9823608,0.001563058,0.0003049139,0.00005683678,0.00009426004,0.00035524,0.007578617],"genre_scores_gemma":[0.1540828,0.001416392,0.8329489,0.0009458996,0.0007382723,0.0002883777,0.0002709045,0.000644602,0.008663898],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005706497,"threshold_uncertainty_score":0.01909012,"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","authors":[{"name":"Mauricio Díaz","is_ca":true},{"name":"Roy H. Kwon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056297,0.000990994,0.001225479,0.0006019042,0.0003386564,0.002486794,0.000935245,0.001963853,0.005798009],"category_scores_gemma":[0.006098198,0.0007968271,0.0005697097,0.0006481996,0.0009045303,0.001458388,0.001307719,0.001125749,0.0006215146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001296926,"about_ca_system_score_gemma":0.0009798543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001500741,"about_ca_topic_score_gemma":0.001027468,"domain_scores_codex":[0.9992844,0.0003357755,0.00002149958,0.000080322,0.000136302,0.000141759],"domain_scores_gemma":[0.9978479,0.001541729,0.0001325455,0.00008675026,0.0001792298,0.000211787],"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.0002856761,0.00008431558,0.0004740412,0.0001048392,0.00007520884,0.0001828137,0.00007112283,0.8966776,0.003022123,0.08108111,0.003516371,0.01442481],"study_design_scores_gemma":[0.00001880026,0.00002591409,0.0001699915,0.000008372956,0.000008731758,0.00002175544,0.00001252078,0.9827345,0.0002741333,0.01630899,0.0004103685,0.000005903951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2727325,0.001594127,0.6734693,0.002459508,0.0002386158,0.000109671,0.0003876863,0.0003966625,0.04861195],"genre_scores_gemma":[0.9653273,0.0003843508,0.01897036,0.0001473886,0.00009560736,0.00008272596,0.0001800619,0.0001370717,0.01467504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005798009,"threshold_uncertainty_score":0.01939631,"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","authors":[{"name":"Isaac F. Fernandes","is_ca":false},{"name":"Daniel Aloise","is_ca":false},{"name":"Dário José Aloise","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001854552,0.00130102,0.002413529,0.001516268,0.0008673696,0.003037579,0.001805767,0.002839576,0.0144645],"category_scores_gemma":[0.01081604,0.0009173515,0.0009929158,0.002624641,0.00236947,0.004067954,0.002504417,0.002092595,0.0005351632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003334399,"about_ca_system_score_gemma":0.001783331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01129769,"about_ca_topic_score_gemma":0.007959525,"domain_scores_codex":[0.9991717,0.0004556596,0.00002755702,0.0001130026,0.0001021029,0.000130059],"domain_scores_gemma":[0.9946684,0.004504463,0.0003103941,0.0001018903,0.0001713046,0.0002434079],"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.0002365196,0.00008227783,0.0005759637,0.000257524,0.00005538653,0.0002862298,0.0001019797,0.6030493,0.0002816513,0.375256,0.007988972,0.01182819],"study_design_scores_gemma":[0.0000800544,0.00005317213,0.0003793429,0.0000810346,0.00002933418,0.00007493918,0.000171925,0.696769,0.0001329462,0.2981056,0.004083378,0.00003943373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1688087,0.005998788,0.6681808,0.01293215,0.0007135305,0.0002474992,0.001468314,0.0001965863,0.1414536],"genre_scores_gemma":[0.8686177,0.004997974,0.07622323,0.0008614067,0.0005998636,0.0002912704,0.0006673591,0.0002482843,0.04749303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0144645,"threshold_uncertainty_score":0.04838854,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Jonathan M. Borwein","is_ca":false},{"name":"Xianfu Wang","is_ca":true},{"name":"Liangjin Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577394,0.0008995506,0.001097209,0.001434577,0.001995614,0.002052711,0.001387651,0.001997169,0.009915958],"category_scores_gemma":[0.00415698,0.0006060849,0.0009698749,0.0009413908,0.003697192,0.005614694,0.003293227,0.003421762,0.0006969201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007067601,"about_ca_system_score_gemma":0.0007882573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005559839,"about_ca_topic_score_gemma":0.000464215,"domain_scores_codex":[0.9989898,0.0001944804,0.00004614286,0.0002530293,0.0002803208,0.0002362986],"domain_scores_gemma":[0.9980189,0.0007462588,0.000187406,0.0002234061,0.0004508118,0.0003733533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003662159,0.0000179878,0.0001063764,0.0000530418,0.00001284671,0.00007411103,0.0001108911,0.0003058058,0.002686654,0.9903941,0.001201512,0.005000115],"study_design_scores_gemma":[0.00002024087,0.00004342288,0.0002572199,0.00001544992,0.000007104874,0.0003916638,0.0001287067,0.006046682,0.001603026,0.9876272,0.003837339,0.00002190004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1787419,0.0006211392,0.7114796,0.003991883,0.001014973,0.0001147328,0.0005195889,0.0004415248,0.1030746],"genre_scores_gemma":[0.8240342,0.000692332,0.1260034,0.002149895,0.0009132074,0.0002719373,0.0004483463,0.0003403622,0.04514635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009915958,"threshold_uncertainty_score":0.03317213,"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","authors":[{"name":"Eissa Nematollahi","is_ca":true},{"name":"Tamás Terlaky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473371,0.001102712,0.001675137,0.001599594,0.002031792,0.001969148,0.002570654,0.001753397,0.03159206],"category_scores_gemma":[0.00507063,0.0009760402,0.001787983,0.001180113,0.002259023,0.005156912,0.00585865,0.006557281,0.007542499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006848717,"about_ca_system_score_gemma":0.0009854485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003954749,"about_ca_topic_score_gemma":0.0008189291,"domain_scores_codex":[0.9984016,0.0003086393,0.00007974949,0.000336785,0.0006836399,0.0001896466],"domain_scores_gemma":[0.9986464,0.0002690386,0.00005822541,0.0007363678,0.0001759889,0.0001140011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000230205,0.000165384,0.0002474182,0.0003263163,0.00005249058,0.0001785641,0.0002929809,0.01187382,0.01920947,0.8444011,0.01633804,0.1066841],"study_design_scores_gemma":[0.0001232546,0.0001916364,0.0004568,0.00008568819,0.00006921706,0.0005325011,0.0001333147,0.05423347,0.01771924,0.8484285,0.07793057,0.00009574508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01724134,0.0002913176,0.9294783,0.00114115,0.0007316112,0.0001109509,0.0003001543,0.0009989687,0.04970623],"genre_scores_gemma":[0.2775179,0.0004484662,0.6616796,0.001230092,0.0003866345,0.0004200442,0.0009213854,0.002544133,0.05485181],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03159206,"threshold_uncertainty_score":0.105686,"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","authors":[{"name":"Mohamed A. Tawhid","is_ca":true},{"name":"Saeed Rahmati","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013158,0.001314629,0.001036177,0.001611953,0.0008104174,0.003439843,0.001203008,0.001650698,0.006365021],"category_scores_gemma":[0.004798811,0.0005019177,0.0007911911,0.002151582,0.002330204,0.004168247,0.00264544,0.00288273,0.0008481612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044632,"about_ca_system_score_gemma":0.001204662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00150456,"about_ca_topic_score_gemma":0.001800667,"domain_scores_codex":[0.9987254,0.0005156117,0.00006627234,0.0002090586,0.0003772239,0.0001064342],"domain_scores_gemma":[0.9966938,0.00192147,0.0003635196,0.0002746333,0.0004410874,0.0003053887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002869613,0.00005117234,0.0001803353,0.0001309586,0.00003651136,0.0001183349,0.00008900942,0.04226353,0.002043895,0.937409,0.003301729,0.01434683],"study_design_scores_gemma":[0.000009749054,0.00003674661,0.000162345,0.00002710724,0.00001747398,0.0001126259,0.00007656255,0.2291458,0.0009371189,0.7651761,0.004274433,0.00002392966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02645716,0.0005791443,0.9480051,0.001593292,0.0002487394,0.0000598222,0.0003833314,0.0001253418,0.02254801],"genre_scores_gemma":[0.5709037,0.002978282,0.3651173,0.0009757541,0.001201492,0.0005869655,0.0007943536,0.0004401802,0.05700208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006365021,"threshold_uncertainty_score":0.02129316,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003525476,0.0008343093,0.001531939,0.0008358243,0.0004672011,0.002487272,0.001300325,0.001482571,0.004825639],"category_scores_gemma":[0.01478039,0.0005534769,0.001322745,0.0005394202,0.001780712,0.002888644,0.002767797,0.002599897,0.0002701748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001635468,"about_ca_system_score_gemma":0.0008882711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262586,"about_ca_topic_score_gemma":0.0007517393,"domain_scores_codex":[0.9977224,0.0009432557,0.000112018,0.0003583854,0.0005898855,0.0002739155],"domain_scores_gemma":[0.9883974,0.008680068,0.001351068,0.0005926177,0.0005892679,0.0003895179],"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.0001368758,0.000070373,0.0009195805,0.0001318128,0.00007695467,0.0001975661,0.00008365325,0.7492483,0.001394493,0.2379477,0.001186263,0.008606453],"study_design_scores_gemma":[0.00001207017,0.00003029965,0.0002160714,0.000008733476,0.000006070718,0.00002034535,0.00001610563,0.8959658,0.000216769,0.1033155,0.0001835499,0.000008702596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2101734,0.0005447398,0.7763365,0.001667751,0.00005541499,0.0001127992,0.00036299,0.0001599835,0.01058646],"genre_scores_gemma":[0.9482031,0.0002969206,0.04699524,0.0001766402,0.0001068809,0.0001678413,0.0003733803,0.00009644622,0.003583453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004825639,"threshold_uncertainty_score":0.01864475,"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","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"Christos Koukouvinos","is_ca":false},{"name":"Pãnos M. Pardalos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000685555,0.001275167,0.001173788,0.001751845,0.001067394,0.001711445,0.00164931,0.00126277,0.01046703],"category_scores_gemma":[0.004411879,0.0005743032,0.0007280224,0.00419124,0.0005420361,0.002363683,0.001981417,0.001452051,0.004501879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008025438,"about_ca_system_score_gemma":0.001755969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002106943,"about_ca_topic_score_gemma":0.004241917,"domain_scores_codex":[0.9988824,0.0001420375,0.0001077262,0.0001714813,0.0005930642,0.0001032905],"domain_scores_gemma":[0.9983578,0.0005715194,0.0001076384,0.0003668721,0.0005149047,0.00008128294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003193792,0.0001615986,0.0003648541,0.0001765471,0.00003966698,0.0001165346,0.0001064298,0.02533659,0.03140592,0.03134058,0.01361236,0.8970195],"study_design_scores_gemma":[0.000250395,0.0003557632,0.0007381053,0.00006055531,0.00006295507,0.0006236245,0.0001705475,0.7871998,0.05389024,0.1276663,0.02888482,0.00009689297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01140579,0.0001729347,0.9829434,0.0001768061,0.0001662306,0.0001426315,0.0002106088,0.002015281,0.002766316],"genre_scores_gemma":[0.04062585,0.0001290942,0.9527642,0.0001252345,0.0000804476,0.0001810458,0.0005507653,0.0002367142,0.005306697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01046703,"threshold_uncertainty_score":0.0350157,"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","authors":[{"name":"Roberto Tadei","is_ca":false},{"name":"Guido Perboli","is_ca":true},{"name":"Daniele Manerba","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005311293,0.001370667,0.002361953,0.001058645,0.0009401655,0.003099517,0.002707268,0.0024454,0.003914156],"category_scores_gemma":[0.007936713,0.001075671,0.001991918,0.001657406,0.002826859,0.003252997,0.002045464,0.002499576,0.0004196605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002707872,"about_ca_system_score_gemma":0.001787468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00529689,"about_ca_topic_score_gemma":0.002978357,"domain_scores_codex":[0.9943604,0.002687532,0.0001802732,0.001264683,0.0008095332,0.000697631],"domain_scores_gemma":[0.994993,0.003540131,0.0005726372,0.0001754667,0.0003813324,0.0003373439],"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.0001718956,0.00009391458,0.001542791,0.0002053792,0.0001231885,0.0007455199,0.0002224257,0.7822441,0.001565188,0.2040781,0.0004700492,0.008537413],"study_design_scores_gemma":[0.00003422219,0.00008125929,0.0003918904,0.00001838131,0.00003527974,0.00008952897,0.00003532748,0.9413658,0.0003539201,0.0570844,0.0004764982,0.00003351617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07779295,0.0006272352,0.9149951,0.0009781629,0.00005794293,0.0001336161,0.0002016552,0.00007034173,0.005143007],"genre_scores_gemma":[0.9079719,0.0009138038,0.07984845,0.0001502797,0.00008679292,0.000391465,0.0002053982,0.00003202154,0.01039985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005311293,"threshold_uncertainty_score":0.02808917,"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","authors":[{"name":"Qin Linxia","is_ca":false},{"name":"Lingchen Kong","is_ca":true},{"name":"Jiye Han","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002992337,0.0009413711,0.001370772,0.002391227,0.001497092,0.002855579,0.001599426,0.001544612,0.01051044],"category_scores_gemma":[0.01316532,0.0009343553,0.001059723,0.001493708,0.003516411,0.005682905,0.003483164,0.00331579,0.001676978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006630673,"about_ca_system_score_gemma":0.0008596698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003833303,"about_ca_topic_score_gemma":0.0004239223,"domain_scores_codex":[0.9973717,0.001126703,0.000167074,0.0003766538,0.0005866861,0.0003713062],"domain_scores_gemma":[0.9899095,0.00636957,0.0007911461,0.0007814702,0.001397885,0.000750426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008976678,0.00003106905,0.0002758837,0.00008150667,0.00001620831,0.00009189484,0.000132712,0.001644769,0.001100328,0.9889426,0.001993643,0.005599543],"study_design_scores_gemma":[0.00002456664,0.00003355039,0.0002054804,0.00002067127,0.000008385116,0.0001099258,0.00007404764,0.0086637,0.0009285251,0.9881748,0.001743275,0.00001297719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2642779,0.002562604,0.5659728,0.00371428,0.0004742837,0.0001398913,0.0009299087,0.0006110183,0.1613173],"genre_scores_gemma":[0.9451768,0.001150321,0.03248974,0.001238274,0.0004886501,0.0001781779,0.0009413908,0.0002584833,0.01807802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051044,"threshold_uncertainty_score":0.03516096,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Alejandro Karam","is_ca":true},{"name":"C.T. Ng","is_ca":false},{"name":"Sylvain Perron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009752598,0.001094566,0.0009999493,0.0006409764,0.0005150373,0.002389883,0.001019954,0.001654314,0.01131512],"category_scores_gemma":[0.002864401,0.0005272444,0.0005366062,0.001107842,0.0008073162,0.003671534,0.003327228,0.002229906,0.003783403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004962279,"about_ca_system_score_gemma":0.0009482535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007999357,"about_ca_topic_score_gemma":0.001139581,"domain_scores_codex":[0.9990165,0.0002596847,0.00004726856,0.0001628986,0.0003963788,0.000117319],"domain_scores_gemma":[0.9994229,0.0001491919,0.00003871476,0.0002170021,0.0001350413,0.00003721586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001023123,0.0001450573,0.0006278278,0.0002664833,0.0001587827,0.00021398,0.0001436788,0.1842022,0.02156677,0.2757366,0.03030032,0.4856151],"study_design_scores_gemma":[0.00008604718,0.0000625203,0.0002452119,0.00002879308,0.00002587102,0.0002873195,0.00006646707,0.753341,0.01346908,0.214604,0.01774488,0.00003886704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004933454,0.0002786938,0.9832656,0.000404434,0.0001694791,0.0000137556,0.0001492006,0.0004601301,0.01032523],"genre_scores_gemma":[0.2310664,0.0005693326,0.7477355,0.0006684224,0.0002679475,0.00008035451,0.0007176415,0.0005621841,0.01833228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01131512,"threshold_uncertainty_score":0.03785282,"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","authors":[{"name":"Holger H. Hoos","is_ca":true},{"name":"Thomas Stützle","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01440096,0.001907617,0.002599883,0.002824843,0.001598694,0.004003251,0.00437913,0.003522263,0.01142604],"category_scores_gemma":[0.1498153,0.001364261,0.002161084,0.004853383,0.00363943,0.009169211,0.003290903,0.005791498,0.001213276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004611815,"about_ca_system_score_gemma":0.006127188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01130089,"about_ca_topic_score_gemma":0.01440077,"domain_scores_codex":[0.9833129,0.008427324,0.001320763,0.002569763,0.002863918,0.001505373],"domain_scores_gemma":[0.6414585,0.3358505,0.004548404,0.0117564,0.00369008,0.002696077],"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.004362902,0.001520179,0.0306827,0.00154561,0.0006556922,0.0003701971,0.0004294333,0.7593332,0.002474235,0.03252139,0.03302695,0.1330776],"study_design_scores_gemma":[0.0003555145,0.0002833943,0.004393812,0.00007196223,0.000116993,0.000263611,0.0002839254,0.9676138,0.001120007,0.02425292,0.001210679,0.00003333752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7444499,0.01291261,0.1803985,0.02128839,0.001313579,0.000517686,0.008749088,0.004772059,0.02559821],"genre_scores_gemma":[0.9007234,0.001476565,0.08411177,0.001230419,0.0006298213,0.0002784849,0.006553142,0.001252168,0.003744205],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01440096,"threshold_uncertainty_score":0.07616049,"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","authors":[{"name":"Warren Hare","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002852144,0.00173924,0.001427112,0.001115386,0.001002228,0.002680332,0.00169356,0.001527305,0.009009792],"category_scores_gemma":[0.01064064,0.001226356,0.001723104,0.001013839,0.002656898,0.005834335,0.00388442,0.003553049,0.001684074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001448055,"about_ca_system_score_gemma":0.001172109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001358164,"about_ca_topic_score_gemma":0.001426203,"domain_scores_codex":[0.9978606,0.0009600976,0.0001095137,0.0003228699,0.0005361471,0.0002107161],"domain_scores_gemma":[0.9967229,0.00173166,0.0004106902,0.0004038629,0.0004207644,0.0003102945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004739452,0.00002652455,0.0001739368,0.00004677775,0.00002959081,0.00007329952,0.00008200276,0.02389746,0.0005873505,0.9649848,0.001542157,0.008508719],"study_design_scores_gemma":[0.000009283983,0.00002193286,0.00006645986,0.00001237078,0.00001033203,0.00005074142,0.00002781939,0.1179528,0.0003478275,0.879554,0.001936524,0.000009917436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03357645,0.000542566,0.9444206,0.0009416343,0.000140856,0.00003414167,0.0002242129,0.0003214579,0.01979801],"genre_scores_gemma":[0.6530815,0.001612153,0.2778306,0.000887468,0.0005345542,0.0003398444,0.00135774,0.0009432675,0.06341286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009009792,"threshold_uncertainty_score":0.0301407,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Cong Kien Dang","is_ca":true},{"name":"Dominique Orban","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083182,0.0006567727,0.0007070492,0.0006584916,0.0008030821,0.0009967487,0.001226615,0.0005877889,0.002373333],"category_scores_gemma":[0.005746832,0.0004513491,0.0005026655,0.001273445,0.0008062526,0.001844594,0.00185739,0.001135825,0.0007062986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004359556,"about_ca_system_score_gemma":0.001137856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009756795,"about_ca_topic_score_gemma":0.002197882,"domain_scores_codex":[0.9989531,0.00040268,0.00006131319,0.0001239736,0.0003391635,0.0001197279],"domain_scores_gemma":[0.9979466,0.0009518127,0.0001150232,0.000690126,0.0002295753,0.0000668795],"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.0007826369,0.000313369,0.00247136,0.0001928218,0.0001014819,0.000332519,0.000257657,0.4929834,0.02797012,0.1237721,0.005942143,0.3448805],"study_design_scores_gemma":[0.00004857643,0.00007570852,0.0002448072,0.00001174689,0.00001619882,0.00006702211,0.00002631486,0.8866212,0.007053346,0.1027542,0.003069494,0.00001140007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192847,0.00102832,0.8588762,0.0007102246,0.0001354687,0.00008521061,0.0001048014,0.0009252114,0.01884978],"genre_scores_gemma":[0.775928,0.0003557249,0.2196226,0.0001333163,0.00007999013,0.0001073287,0.0001336771,0.000229749,0.003409534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002373333,"threshold_uncertainty_score":0.007939577,"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","authors":[{"name":"Etienne de Klerk","is_ca":false},{"name":"Monique Laurent","is_ca":false},{"name":"Zhao Sun","is_ca":true},{"name":"Juan C. Vera","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01685531,0.001443379,0.002141742,0.002167169,0.001217601,0.002238818,0.002637144,0.002054859,0.006780728],"category_scores_gemma":[0.1124763,0.0007346019,0.001308494,0.002309583,0.004321899,0.00457665,0.004388747,0.005203626,0.001189674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001766366,"about_ca_system_score_gemma":0.002545691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006687081,"about_ca_topic_score_gemma":0.004055249,"domain_scores_codex":[0.9934742,0.00403697,0.0002221172,0.0004763075,0.001173351,0.0006172034],"domain_scores_gemma":[0.9004463,0.08822175,0.001631127,0.004375123,0.004196539,0.001129108],"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.001897303,0.0001673527,0.005461625,0.0006869177,0.0001842228,0.0001858551,0.0004501481,0.6186938,0.002998773,0.2844934,0.01055729,0.07422327],"study_design_scores_gemma":[0.00005584204,0.00007871408,0.0003822726,0.00008977308,0.00002375648,0.00004999398,0.00006068039,0.948267,0.0008135525,0.04916079,0.001001318,0.00001640479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07996948,0.006368462,0.8782924,0.003225729,0.0005926723,0.0002097407,0.0004054756,0.0009014768,0.03003443],"genre_scores_gemma":[0.7627598,0.003600207,0.2201892,0.000970509,0.000340049,0.0005650432,0.0007000698,0.00158762,0.009287437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01685531,"threshold_uncertainty_score":0.08914047,"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","authors":[{"name":"Martin Frohn","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165117,0.0007802054,0.001210726,0.0006610076,0.0006590795,0.001652128,0.001720526,0.001716767,0.005752365],"category_scores_gemma":[0.01973006,0.000391075,0.0008466165,0.0008897447,0.001459,0.002952081,0.00166274,0.002724568,0.0005178778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001423984,"about_ca_system_score_gemma":0.001238396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003879679,"about_ca_topic_score_gemma":0.003486657,"domain_scores_codex":[0.9992466,0.0003362604,0.0000264343,0.0001332872,0.0001372197,0.0001202224],"domain_scores_gemma":[0.991102,0.007910261,0.000249662,0.0003432731,0.0002461028,0.0001487539],"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.0005094811,0.0001172315,0.00147455,0.000233934,0.00005786138,0.00008646087,0.0002449511,0.7505394,0.001650344,0.1911269,0.004528695,0.0494303],"study_design_scores_gemma":[0.00003866202,0.00002928368,0.000165004,0.00002514495,0.00001278841,0.00002729769,0.00002883414,0.8937876,0.0002739936,0.1049352,0.0006715868,0.000004515708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2002312,0.001474993,0.7712464,0.002893841,0.0001743352,0.00007126945,0.000287616,0.0005823019,0.02303805],"genre_scores_gemma":[0.7739822,0.0008742462,0.2166634,0.0005155731,0.0001426976,0.0001641955,0.0006314031,0.0003898433,0.006636497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005752365,"threshold_uncertainty_score":0.01924354,"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","authors":[{"name":"Tamás Terlaky","is_ca":true},{"name":"Jiaping Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009102315,0.00135447,0.001604895,0.001185913,0.00385227,0.003483854,0.004955034,0.02725276,0.007902927],"category_scores_gemma":[0.05993832,0.0008663206,0.002174128,0.001511347,0.005240815,0.004870319,0.002382003,0.02726775,0.004193708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003728097,"about_ca_system_score_gemma":0.003534616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01348288,"about_ca_topic_score_gemma":0.01067741,"domain_scores_codex":[0.9906351,0.002967863,0.0008522786,0.001161014,0.003640999,0.0007426433],"domain_scores_gemma":[0.9637933,0.02379602,0.001656792,0.0009950099,0.009025402,0.0007335421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008380992,0.00001855098,0.0001182754,0.0001336078,0.00002553137,0.0001829734,0.0001436403,0.0007877923,0.0002917277,0.03031002,0.963511,0.004393027],"study_design_scores_gemma":[0.0001693397,0.00005253153,0.001053901,0.000447576,0.00006714869,0.0002665549,0.000251372,0.007618049,0.001749628,0.08201235,0.9060923,0.0002193761],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.0006184373,0.002583191,0.008209842,0.9092518,0.07104598,0.00004089658,0.0003217654,0.0001063446,0.007821748],"genre_scores_gemma":[0.01226804,0.002190573,0.005896083,0.8836567,0.07935019,0.0001741242,0.0001254651,0.0001836948,0.01615513],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.02725276,"threshold_uncertainty_score":0.0481382,"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","authors":[{"name":"Dionne M. Aleman","is_ca":true},{"name":"Johan Wallgren","is_ca":false},{"name":"H. Edwin Romeijn","is_ca":false},{"name":"James F. Dempsey","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267238,0.0005463116,0.0007769872,0.000392318,0.0003834235,0.001007081,0.001195458,0.001422616,0.003172253],"category_scores_gemma":[0.00190444,0.0007187297,0.0006788229,0.0006992569,0.0004274297,0.0007679731,0.000617982,0.0008573225,0.0004305704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001427958,"about_ca_system_score_gemma":0.001329711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02005583,"about_ca_topic_score_gemma":0.01029447,"domain_scores_codex":[0.9998304,0.00005355361,0.000007076128,0.00002767239,0.00006008116,0.00002129998],"domain_scores_gemma":[0.9996862,0.0001743166,0.00002944744,0.00002301632,0.00006858029,0.00001851661],"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.000007527108,0.000003270445,0.00003116405,0.000006486576,0.000002679556,0.000006249905,0.000005215471,0.9971187,0.0001126017,0.001081538,0.0001523099,0.00147224],"study_design_scores_gemma":[0.000001903756,0.000002385705,0.00001956786,0.000001606046,0.000001553824,0.000002822526,0.000001077218,0.999255,0.0000643415,0.0004740751,0.0001741158,0.000001498456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02263349,0.0006196641,0.9620535,0.0005738375,0.00008212085,0.00008050753,0.0003202022,0.0006457174,0.01299095],"genre_scores_gemma":[0.8371823,0.0004759151,0.1484051,0.0002487503,0.00006798225,0.0002116029,0.0003181227,0.000546048,0.01254415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02005583,"threshold_uncertainty_score":0.03987819,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01514035,0.005495414,0.003015834,0.004016856,0.001450557,0.005108344,0.00477062,0.005194474,0.008076945],"category_scores_gemma":[0.06723038,0.001729554,0.00227958,0.002156062,0.00687944,0.009018012,0.01063839,0.01138736,0.001143664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004376694,"about_ca_system_score_gemma":0.002768486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003851918,"about_ca_topic_score_gemma":0.002631011,"domain_scores_codex":[0.9937231,0.002522954,0.0003355159,0.0008107328,0.001933879,0.000673866],"domain_scores_gemma":[0.9340242,0.05277646,0.002065685,0.002246313,0.00674092,0.002146423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007614641,0.0002140175,0.001388666,0.0009841998,0.0002470283,0.0002711055,0.0006611292,0.1937689,0.006837805,0.7464794,0.005466385,0.04291981],"study_design_scores_gemma":[0.00003825442,0.0001348339,0.0004032769,0.0001661812,0.00005910846,0.00009033822,0.0001035084,0.7549878,0.001659133,0.2399669,0.002342786,0.00004780922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02360355,0.005545159,0.9481743,0.002770411,0.0008365361,0.0001164669,0.0002159474,0.0002749143,0.01846273],"genre_scores_gemma":[0.6767276,0.00824735,0.263501,0.002107661,0.002381102,0.0009076429,0.001208582,0.001391425,0.0435277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01514035,"threshold_uncertainty_score":0.08007073,"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","authors":[{"name":"Chun-Hua Guo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01289224,0.001541845,0.001526292,0.001801035,0.002902259,0.003012442,0.004801099,0.006830386,0.01826885],"category_scores_gemma":[0.06725521,0.0005818934,0.002436644,0.001301888,0.009803423,0.009036953,0.00263291,0.01754137,0.006392893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003575033,"about_ca_system_score_gemma":0.001798634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005796308,"about_ca_topic_score_gemma":0.002365324,"domain_scores_codex":[0.9899836,0.003542791,0.0006921583,0.001078069,0.004188732,0.0005147448],"domain_scores_gemma":[0.9379423,0.04606204,0.001905718,0.003179574,0.0101832,0.0007271068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002493731,0.00002973049,0.0002158893,0.0004250637,0.00003941784,0.0005146884,0.000617551,0.004813966,0.001007968,0.6906381,0.2805432,0.02090507],"study_design_scores_gemma":[0.00009444366,0.00005935947,0.000441658,0.0005751691,0.00003511322,0.0002557736,0.0001618953,0.01768645,0.002349721,0.6469062,0.3313192,0.0001149847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.005135654,0.009368744,0.3370189,0.4330684,0.0879451,0.0001363395,0.0007501896,0.001546256,0.1250305],"genre_scores_gemma":[0.2050188,0.01088722,0.2074787,0.2808343,0.1396036,0.001007474,0.0007804004,0.005850967,0.1485386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01826885,"threshold_uncertainty_score":0.06818151,"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","authors":[{"name":"Roy H. Kwon","is_ca":true},{"name":"Georgios Vasileiou Dalakouras","is_ca":false},{"name":"Cheng Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007143022,0.001659963,0.002363025,0.001551538,0.001127427,0.002794575,0.002667218,0.002750943,0.01331558],"category_scores_gemma":[0.02926182,0.001099964,0.001310403,0.001759729,0.002252026,0.004111235,0.00386298,0.003101827,0.001678334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002122851,"about_ca_system_score_gemma":0.003129181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005488798,"about_ca_topic_score_gemma":0.007758,"domain_scores_codex":[0.9953073,0.002304514,0.0001627065,0.0003906713,0.001502016,0.0003328894],"domain_scores_gemma":[0.9841728,0.01226973,0.0003470292,0.001158303,0.001611278,0.0004407652],"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.001398747,0.000255142,0.001530207,0.0004523439,0.0001718553,0.0001463657,0.0001982304,0.536321,0.005994132,0.1571186,0.01494552,0.2814677],"study_design_scores_gemma":[0.00004053775,0.00005131552,0.0001672049,0.00002653573,0.00001737702,0.00004349601,0.00001413504,0.9705574,0.0008141797,0.02739308,0.0008601687,0.00001469986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01191701,0.0003949759,0.9812527,0.0004762116,0.0001422079,0.000102209,0.00008696036,0.0005490291,0.005078699],"genre_scores_gemma":[0.2245509,0.0004728496,0.7626917,0.0004626407,0.000400724,0.0003753444,0.0004758216,0.0008873001,0.00968255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01331558,"threshold_uncertainty_score":0.04454505,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Xavier Fournier","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Frédéric Messine","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006080493,0.002111882,0.003928999,0.005142055,0.003786976,0.005579674,0.004938114,0.003338764,0.009499334],"category_scores_gemma":[0.04135765,0.001988568,0.003566494,0.00505791,0.009789906,0.02000507,0.009434712,0.01437971,0.00200914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003760326,"about_ca_system_score_gemma":0.0009579541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002079655,"about_ca_topic_score_gemma":0.001343178,"domain_scores_codex":[0.994919,0.001536145,0.0004237538,0.00126001,0.001445228,0.0004159077],"domain_scores_gemma":[0.9522831,0.03886301,0.001326351,0.002892392,0.002398174,0.002236904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006597575,0.000009791953,0.0003923385,0.0001528195,0.00001539845,0.00009402727,0.0002804051,0.00200135,0.0007125143,0.9745612,0.01032922,0.01138502],"study_design_scores_gemma":[0.00002102094,0.00005829285,0.0008189435,0.00008636234,0.00003461295,0.0003295125,0.0001485354,0.009487843,0.0006958896,0.9402856,0.04798936,0.00004391719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04912096,0.04366953,0.6525732,0.03922561,0.01630398,0.0001446268,0.001805806,0.0007126671,0.1964437],"genre_scores_gemma":[0.5028355,0.04340504,0.3369209,0.01117043,0.03065366,0.0007616662,0.001653357,0.002050209,0.07054926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009499334,"threshold_uncertainty_score":0.03215712,"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","authors":[{"name":"Sana Frifita","is_ca":false},{"name":"Ines Mathlouthi","is_ca":true},{"name":"Malek Masmoudi","is_ca":false},{"name":"Abdelaziz Dammak","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212499,0.0006711668,0.001026484,0.0007448796,0.0005295534,0.0006607478,0.001533416,0.001366834,0.002899569],"category_scores_gemma":[0.003309021,0.0005221616,0.0007565067,0.000887892,0.0007444301,0.001022162,0.001021094,0.001132338,0.0003427044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006885194,"about_ca_system_score_gemma":0.0007973915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005721902,"about_ca_topic_score_gemma":0.006142343,"domain_scores_codex":[0.9996891,0.0001534503,0.00001378421,0.00004846588,0.00006267526,0.00003246437],"domain_scores_gemma":[0.9988753,0.000852941,0.00008048132,0.00004584519,0.0001088838,0.00003649685],"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.00004023739,0.00003462569,0.0001846739,0.00005089715,0.00003049418,0.00002416615,0.00003343661,0.9626682,0.0003199885,0.01764668,0.001074475,0.01789219],"study_design_scores_gemma":[0.000005897879,0.00001142692,0.00002751216,0.0000031457,0.00000334625,0.000004509283,0.000005047861,0.9969108,0.00005096501,0.002712238,0.0002629951,0.000002026768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02321796,0.0004680719,0.9703586,0.000184822,0.00008466748,0.00005165589,0.00004704902,0.0001156263,0.005471592],"genre_scores_gemma":[0.4656701,0.0005239177,0.5194028,0.0001557655,0.000087864,0.0003455276,0.0002195618,0.0001797292,0.01341473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005721902,"threshold_uncertainty_score":0.01137716,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Manish Krishan Lal","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003378558,0.001033273,0.0009355458,0.002951898,0.001014572,0.00194058,0.001535969,0.001795199,0.008998857],"category_scores_gemma":[0.02049122,0.0006701071,0.0006597611,0.0009385761,0.002693275,0.00371951,0.002309382,0.002615463,0.00101636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001814737,"about_ca_system_score_gemma":0.0009245437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002134649,"about_ca_topic_score_gemma":0.001699862,"domain_scores_codex":[0.9991007,0.000361154,0.00003218424,0.0001143588,0.0002564382,0.0001351913],"domain_scores_gemma":[0.991028,0.004976466,0.0007850326,0.0004451739,0.001732052,0.001033268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006068449,0.00003709611,0.0005764367,0.00006640404,0.00001211743,0.00008050929,0.0001417295,0.01218888,0.002144295,0.9761155,0.001579123,0.00699711],"study_design_scores_gemma":[0.00002522432,0.00006482013,0.001116135,0.00006593992,0.00001204068,0.0002179302,0.0001569959,0.232972,0.001025256,0.7611154,0.003194931,0.0000333626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2983904,0.003088122,0.5861007,0.004107683,0.000540802,0.00007017844,0.000347631,0.0004917217,0.1068628],"genre_scores_gemma":[0.8850886,0.002448104,0.05722647,0.0008173471,0.000608523,0.0001807091,0.0005275942,0.0004136291,0.05268908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008998857,"threshold_uncertainty_score":0.03010422,"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","authors":[{"name":"Warren Hare","is_ca":true},{"name":"Hua Song","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009367866,0.001758123,0.002816951,0.003193741,0.002612594,0.005850199,0.004273257,0.002128312,0.008167682],"category_scores_gemma":[0.06310712,0.001668742,0.001572894,0.003021474,0.008754755,0.01112103,0.006656195,0.007673147,0.0008226411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002404565,"about_ca_system_score_gemma":0.001660364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008791914,"about_ca_topic_score_gemma":0.0005817513,"domain_scores_codex":[0.9918814,0.003940468,0.0003573248,0.0008802263,0.001994517,0.0009460144],"domain_scores_gemma":[0.8482083,0.1320811,0.006461258,0.004553702,0.004484326,0.004211315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001059065,0.0001526011,0.004684569,0.0003166268,0.0001417461,0.0002566838,0.0005898856,0.03406417,0.002064991,0.9389548,0.006609727,0.01110519],"study_design_scores_gemma":[0.00009895243,0.0000728435,0.001892525,0.0001517508,0.00004838726,0.0002452553,0.0002540985,0.09354014,0.001210633,0.9006888,0.001739801,0.00005696493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5751716,0.002679752,0.3132027,0.01487138,0.0006082866,0.0001728231,0.003568608,0.0002971408,0.08942764],"genre_scores_gemma":[0.9445992,0.002735308,0.03762277,0.00108092,0.001734917,0.0004938946,0.002282007,0.00030221,0.009148809],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009367866,"threshold_uncertainty_score":0.04954261,"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","authors":[{"name":"Antoine Deza","is_ca":true},{"name":"Gabriel Indik","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053478,0.0006263171,0.001976847,0.001948972,0.003044254,0.005812157,0.002738503,0.004121541,0.008215978],"category_scores_gemma":[0.01753473,0.0008173855,0.001024606,0.003342003,0.005584147,0.01132506,0.005194084,0.004877345,0.0009735637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933558,"about_ca_system_score_gemma":0.0008740791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007984795,"about_ca_topic_score_gemma":0.0007340824,"domain_scores_codex":[0.99738,0.0007471176,0.0001079081,0.0006615565,0.0008170901,0.000286359],"domain_scores_gemma":[0.9795961,0.01659751,0.0007168641,0.001491227,0.0007251914,0.0008730269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001026545,0.00004117605,0.0003596033,0.00007719472,0.00001532103,0.0001213407,0.0001750823,0.001846339,0.0004278679,0.9795952,0.01093375,0.006304405],"study_design_scores_gemma":[0.00003364124,0.00001000762,0.0001134317,0.00001645177,0.000008253171,0.0001536212,0.00004963524,0.005907878,0.0002105264,0.9894882,0.004000933,0.000007412488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3681382,0.005524606,0.2120363,0.1153738,0.002516852,0.0001144475,0.001904917,0.001195418,0.2931957],"genre_scores_gemma":[0.940448,0.002294534,0.02666421,0.007351812,0.002155785,0.0001656639,0.0008956592,0.0002279099,0.01979654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008215978,"threshold_uncertainty_score":0.02748513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}