{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":177,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":177,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"35f9454b9ebd","filters":{"venue":"Soft Computing"}},"results":[{"id":"W2123826923","doi":"10.1007/s00500-003-0339-2","title":"A model of granular data: a design problem with the Tchebyschev FCM","year":2003,"lang":"en","type":"article","venue":"Soft Computing","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":450,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Automatic summarization; Cluster analysis; Computer science; Metric (unit); Topology (electrical circuits); Data mining; Theoretical computer science; Artificial intelligence; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07927222401487731,"gpt":0.2500928467966398,"spread":0.1708206227817625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172291,0.0001375215,0.0001765584,0.00003408141,0.0002097315,0.0001094261,0.001563003,0.00003704365,8.78163e-7],"category_scores_gemma":[0.00003960591,0.00008095427,0.00003148457,0.0003777418,0.00007326931,0.0002439413,0.0003988505,0.0001593248,0.000004532027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001087377,"about_ca_system_score_gemma":0.0001484999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001063938,"about_ca_topic_score_gemma":0.000002845384,"domain_scores_codex":[0.9986702,0.0001427776,0.0002063249,0.0004058431,0.0002737795,0.0003010661],"domain_scores_gemma":[0.9984286,0.0001984383,0.0001490171,0.001102882,0.00007398431,0.00004706806],"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.00001712847,0.0001891342,0.0009034666,0.00007950061,0.00007134996,0.00002088137,0.005325572,0.8067821,0.0008246329,0.1377183,0.003530544,0.04453745],"study_design_scores_gemma":[0.0002367184,0.0000630926,0.00003801945,0.00002522778,0.000009437915,0.00001859848,0.00004328427,0.9906017,0.0001945432,0.008105432,0.0005354972,0.0001284259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003328542,0.0001819887,0.9936891,0.0004694258,0.00003992363,0.0002407733,0.000001397075,0.0000913933,0.001957497],"genre_scores_gemma":[0.5125771,0.000001275369,0.4871761,0.0002082431,0.00001314424,0.00000179431,9.379292e-7,0.00000624842,0.00001516545],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5092485,"threshold_uncertainty_score":0.3301219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982970548","doi":"10.1007/s00500-010-0591-1","title":"DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization","year":2010,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":367,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"China University of Geosciences; China Scholarship Council","keywords":"Differential evolution; Benchmark (surveying); Evolutionary algorithm; Computer science; Global optimization; Curse of dimensionality; Mathematical optimization; Convergence (economics); Range (aeronautics); Evolutionary computation; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009130652461568212,"gpt":0.2613821391107193,"spread":0.2522514866491511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004860194,0.0002462537,0.0002461688,0.0002261208,0.000465246,0.0005379159,0.0007465448,0.0001033711,0.00005197942],"category_scores_gemma":[0.0003741694,0.0002316973,0.0001164075,0.001152982,0.0001065128,0.0003059901,0.0001680141,0.0002477765,0.000003946445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206586,"about_ca_system_score_gemma":0.0004029349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000315973,"about_ca_topic_score_gemma":0.000001907122,"domain_scores_codex":[0.997669,0.0001354116,0.0003727297,0.0006515619,0.0005635777,0.0006077197],"domain_scores_gemma":[0.9981539,0.0002595808,0.0002301065,0.0005030737,0.0006171798,0.0002361856],"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.00003386195,0.000119839,0.002481636,0.00002425563,0.0000225641,0.000003479184,0.00002821984,0.9820101,0.00003525448,0.005563052,0.00006451423,0.009613175],"study_design_scores_gemma":[0.001124668,0.000155734,0.0006369616,0.00002249707,0.00001974342,0.00002860678,0.000006366276,0.9972147,0.0001312697,0.0003257791,0.00005986843,0.0002738259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00260591,0.00001296869,0.9953242,0.0003528014,0.0005379639,0.0005837202,0.00001660915,0.0004585114,0.000107335],"genre_scores_gemma":[0.4051571,4.3365e-7,0.5945538,0.00005903709,0.0001296566,0.00002030979,0.00005722384,0.00001630821,0.000006020907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4025513,"threshold_uncertainty_score":0.9448344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2893066337","doi":"10.1007/s00500-018-3536-8","title":"Phasor particle swarm optimization: a simple and efficient variant of PSO","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":262,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Particle swarm optimization; Phasor; Multi-swarm optimization; Benchmark (surveying); Mathematical optimization; Mathematics; Derivative-free optimization; Algorithm; Meta-optimization; Computer science; Electric power system; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02121247710130197,"gpt":0.2948523991375553,"spread":0.2736399220362534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007621873,0.0001048627,0.0001752926,0.00008429066,0.0002258991,0.0001404948,0.0004377567,0.00003480856,0.00005765384],"category_scores_gemma":[0.0004099382,0.00009953604,0.00002858715,0.0007004975,0.0001599997,0.0001029805,0.0005199716,0.00007920048,0.00001822207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001881543,"about_ca_system_score_gemma":0.00008206016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493905,"about_ca_topic_score_gemma":5.205321e-7,"domain_scores_codex":[0.998509,0.0001130077,0.0003358804,0.0003614067,0.0003689574,0.0003117432],"domain_scores_gemma":[0.9986796,0.0002804296,0.0001324447,0.0003992266,0.0003772815,0.0001309727],"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.00001096624,0.0001803549,0.0005413805,0.00004154054,0.00003179891,0.00001599815,0.002063356,0.9280584,0.0002591631,0.01575536,0.0002298913,0.05281173],"study_design_scores_gemma":[0.000426218,0.0001015189,0.0002602759,0.00001539346,0.000004496422,0.00002243134,0.00002573332,0.9965436,0.002143117,0.0001846466,0.0001688199,0.0001037226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02772792,0.00007038524,0.9710366,0.0002564326,0.0001744876,0.0001573186,0.000001479459,0.0001067886,0.0004685814],"genre_scores_gemma":[0.617903,0.000002223623,0.3819096,0.00006703238,0.0000796675,0.000001317649,9.778398e-7,0.000006805094,0.00002933287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5901751,"threshold_uncertainty_score":0.4058962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155370091","doi":"10.1007/s00500-010-0642-7","title":"Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems","year":2010,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Differential evolution; Initialization; Ode; Opposition (politics); Mathematical optimization; Computer science; Population; Mathematics; Evolutionary algorithm; Algorithm; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0106242622329757,"gpt":0.2517901850349561,"spread":0.2411659228019804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006294003,0.0002100497,0.0002547458,0.0002420097,0.0006147508,0.0003896639,0.0006218525,0.0001306433,0.00007702191],"category_scores_gemma":[0.0005322509,0.0002164704,0.00009764831,0.0004273781,0.00007569163,0.0003065992,0.0002230845,0.0003113632,0.00001454742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062022,"about_ca_system_score_gemma":0.0002606733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002186749,"about_ca_topic_score_gemma":0.000005711314,"domain_scores_codex":[0.9977607,0.0000867013,0.0004656521,0.0006194061,0.000560119,0.0005074631],"domain_scores_gemma":[0.9978333,0.0006341396,0.0002560067,0.0004402364,0.0006772426,0.0001590609],"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.00001059858,0.0001182019,0.0000498685,0.00004024757,0.00001740049,0.000001617914,0.00007075597,0.9469119,0.02914473,0.01794834,0.0001160907,0.005570314],"study_design_scores_gemma":[0.001062278,0.00008557779,0.0002040022,0.00004356796,0.000009635037,0.000005769177,0.000003581201,0.9918062,0.005139809,0.001386726,0.00001007547,0.0002427412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081278,0.000009975844,0.9859574,0.0004002738,0.001642844,0.0007332058,0.000007755814,0.0003736646,0.00006203329],"genre_scores_gemma":[0.5531131,1.551829e-7,0.4465085,0.00005446912,0.0001943978,0.00002539061,0.00005447866,0.00001617946,0.00003334867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5423003,"threshold_uncertainty_score":0.8827409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385548388","doi":"10.1007/s00500-023-09011-0","title":"A review on TOPSIS method and its extensions for different applications with recent development","year":2023,"lang":"en","type":"review","venue":"Soft Computing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":206,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"TOPSIS; Multiple-criteria decision analysis; Management science; Computer science; Fuzzy logic; Operations research; Quarter (Canadian coin); Mathematics; Engineering; Artificial intelligence; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.5713732761471263,"gpt":0.5695728295020038,"spread":0.001800446645122467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005868213,0.0006301145,0.002711883,0.0005774675,0.00065993,0.000336671,0.001051937,0.0001790943,0.00005467023],"category_scores_gemma":[0.00590142,0.0003706591,0.000347344,0.001695822,0.00003062974,0.00005643299,0.0008450071,0.0003851788,0.0002883043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001584526,"about_ca_system_score_gemma":0.0003186605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.267071e-7,"about_ca_topic_score_gemma":0.00000496129,"domain_scores_codex":[0.9936809,0.0006551084,0.002237658,0.001659847,0.001256511,0.0005100068],"domain_scores_gemma":[0.978272,0.01823788,0.001370252,0.00107933,0.0007862385,0.000254358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003332641,0.00003241656,4.804352e-7,0.007271009,0.0000609976,0.00000274888,0.00005698586,0.00001059897,2.04687e-7,0.0002569216,0.001994452,0.9903098],"study_design_scores_gemma":[0.0001463789,0.0000319325,0.000009411018,0.07434335,0.0002424534,0.00003571649,0.00002067649,0.001331428,7.810568e-7,0.0004818058,0.9229398,0.0004163221],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000001343252,0.6947595,0.3014183,0.0001558013,0.0002063708,0.003271103,0.00003136678,0.0001101231,0.00004610058],"genre_scores_gemma":[0.000001504779,0.9116825,0.08634186,0.0005143856,0.0001599119,0.0007888249,0.00004477676,0.0000884053,0.000377842],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9898936,"threshold_uncertainty_score":0.9998745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135029437","doi":"10.1007/s00500-021-05669-6","title":"An innovative waste management system in a smart city under stochastic optimization using vehicle routing problem","year":2021,"lang":"en","type":"article","venue":"Soft Computing","topic":"Municipal Solid Waste Management","field":"Environmental Science","cited_by":121,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Implementation; Routing (electronic design automation); Computer science; Metaheuristic; Operations research; Mathematical optimization; Municipal solid waste; Revenue; Engineering; Business; Waste management; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02285365127068973,"gpt":0.2567809350454366,"spread":0.2339272837747469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007733761,0.0001929372,0.0002098099,0.00008702948,0.0002672357,0.0001194189,0.0002575094,0.00005030384,0.00006747965],"category_scores_gemma":[0.00001796991,0.0002195238,0.00002960236,0.001415543,0.00005274138,0.0002441849,0.0009638476,0.0001801944,0.00001766658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008992768,"about_ca_system_score_gemma":0.00001523161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004886898,"about_ca_topic_score_gemma":0.00009826629,"domain_scores_codex":[0.9979148,0.0001974584,0.0004631634,0.0005621008,0.0003830382,0.0004794582],"domain_scores_gemma":[0.9992983,0.00004626292,0.0001946164,0.0003557485,0.00003232909,0.00007275214],"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.000005367996,0.00007743975,0.008746252,0.00005637664,0.00001560207,0.00002691576,0.0009582798,0.9864894,0.000111526,0.0008208124,0.000002790905,0.002689304],"study_design_scores_gemma":[0.0004329577,0.00001905818,0.004977731,0.0002764463,0.00001543654,0.00000630492,0.005519849,0.9884124,0.00005287127,0.00005469539,0.000006134282,0.0002261446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4684899,0.00000628414,0.5279136,0.00002337796,0.00007983688,0.0003029609,6.049182e-7,0.00006255224,0.003120901],"genre_scores_gemma":[0.9443099,2.541748e-7,0.05543258,0.0001299738,0.00003842322,0.000006676217,0.00001074513,0.00002606682,0.00004533789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.47582,"threshold_uncertainty_score":0.895192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2304131403","doi":"10.1007/s00500-016-2116-z","title":"Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"Science Foundation of Ministry of Education of China; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Firefly algorithm; Benchmark (surveying); Swarm intelligence; Convergence (economics); Premature convergence; Computer science; Mathematical optimization; Set (abstract data type); Mechanism (biology); Optimization problem; Algorithm; Particle swarm optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01366166025855101,"gpt":0.261132166591145,"spread":0.247470506332594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009064523,0.0002659193,0.0003423589,0.0002210077,0.0002662818,0.0002741489,0.0007042571,0.00008628694,0.00004395437],"category_scores_gemma":[0.0002120764,0.0001706667,0.00005265009,0.0005262303,0.000117216,0.0003866778,0.0005965613,0.0002387014,0.00005745806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009954532,"about_ca_system_score_gemma":0.0001588864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001972703,"about_ca_topic_score_gemma":0.000002049455,"domain_scores_codex":[0.9970574,0.0002844636,0.0003736203,0.0007850912,0.0008108781,0.0006885416],"domain_scores_gemma":[0.997532,0.001147781,0.0001063452,0.0006165153,0.0003142116,0.00028313],"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.00002661827,0.00008282075,0.0001682607,0.0000235438,0.00008116886,0.00005395758,0.0003682094,0.0003605948,0.0004398255,0.003479761,0.00003055136,0.9948847],"study_design_scores_gemma":[0.002959068,0.0002285072,0.00236548,0.00009657008,0.0000117724,0.00009632597,0.00002130395,0.9918769,0.0004574069,0.001543149,0.00005694795,0.0002865852],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007844065,0.000145607,0.9897575,0.001148697,0.0002226935,0.0004708576,0.000006352987,0.0002825002,0.0001217289],"genre_scores_gemma":[0.4648448,0.0000434841,0.5344332,0.0001576374,0.00006944889,0.0000127857,0.000003444746,0.00002956173,0.0004055677],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9945981,"threshold_uncertainty_score":0.6959586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027615750","doi":"10.1007/s00500-007-0219-2","title":"A systematic approach for solving the wicked problem of software release planning","year":2007,"lang":"en","type":"article","venue":"Soft Computing","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"ELECTRE; Computer science; Process (computing); Set (abstract data type); Relation (database); Class (philosophy); Software; Selection (genetic algorithm); Mathematical optimization; Multiple-criteria decision analysis; Artificial intelligence; Mathematics; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.02038716437432839,"gpt":0.2728017126735683,"spread":0.2524145482992399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003148684,0.0001571137,0.0002724691,0.00009992487,0.0002534689,0.0001083514,0.0009297348,0.00006696895,2.955749e-7],"category_scores_gemma":[0.0008902679,0.0001157395,0.0001099431,0.0003626185,0.00004113589,0.0002362369,0.0002642783,0.0001976259,6.757743e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003149845,"about_ca_system_score_gemma":0.00004377755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000112775,"about_ca_topic_score_gemma":2.492617e-7,"domain_scores_codex":[0.9985375,0.00004730288,0.0005102395,0.0002856247,0.0002492266,0.0003701537],"domain_scores_gemma":[0.9952863,0.003627272,0.0004165783,0.000484976,0.0001300123,0.00005489594],"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.0001949665,0.000787121,0.01241701,0.1454652,0.00114513,0.0001050426,0.09267251,0.3268405,0.002543397,0.1717238,0.004420143,0.2416852],"study_design_scores_gemma":[0.000334054,0.0001426835,0.0002776843,0.003683143,0.00005489204,0.0001007632,0.0007481597,0.9900756,0.001452622,0.00248456,0.0002515449,0.0003942646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002680344,0.0006523438,0.9947929,0.00004719961,0.0001213539,0.0007694334,5.987415e-7,0.0007967193,0.0001391408],"genre_scores_gemma":[0.4010003,5.593629e-7,0.5988552,0.00004772698,0.00005837271,0.0000145459,0.000001173813,0.00001266274,0.00000946131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6632351,"threshold_uncertainty_score":0.4719719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2733507598","doi":"10.1007/s00500-017-2696-2","title":"Vehicle license plate detection using region-based convolutional neural networks","year":2017,"lang":"en","type":"article","venue":"Soft Computing","topic":"Vehicle License Plate Recognition","field":"Engineering","cited_by":91,"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":"Institute for Information and Communications Technology Promotion; Iran Telecommunication Research Center","keywords":"Object detection; Convolutional neural network; Artificial intelligence; Computer science; License; Frame (networking); Computer vision; Pedestrian detection; Pattern recognition (psychology); Focus (optics); Support vector machine; Artificial neural network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02615920356473182,"gpt":0.2346162827338441,"spread":0.2084570791691123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704991,0.0001892665,0.0001745662,0.00007928043,0.0008260644,0.0001939346,0.0001756513,0.0001468733,0.000007401217],"category_scores_gemma":[0.00006549811,0.0002287087,0.00008478983,0.00008403719,0.00006665522,0.0002602104,0.00005442863,0.000349966,0.00002038459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001364682,"about_ca_system_score_gemma":0.00001574927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000681932,"about_ca_topic_score_gemma":0.00002059144,"domain_scores_codex":[0.9989186,0.00003657281,0.0002509506,0.0002334679,0.00014948,0.0004109499],"domain_scores_gemma":[0.9992283,0.0001509596,0.0001408495,0.0003021703,0.00008265913,0.00009504764],"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.00001715803,0.000008617513,0.003866627,0.00002836919,0.00002286329,0.00002477872,0.00003589068,0.9418834,0.003598406,0.000006972997,0.00001432373,0.05049261],"study_design_scores_gemma":[0.0005406649,0.00001514527,0.01599837,0.00008468529,0.00002107528,0.00006168432,0.00001081997,0.9814096,0.00151988,0.00003591387,0.00005389504,0.00024823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7242255,0.00006529989,0.2740997,0.00002971815,0.0008457522,0.0001018481,0.000001639566,0.0004586086,0.0001719276],"genre_scores_gemma":[0.9980704,0.000002391522,0.001133502,0.00006275348,0.0006637528,0.000001983429,0.000009046053,0.0000516464,0.000004512738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2738449,"threshold_uncertainty_score":0.9326468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053454544","doi":"10.1007/s00500-014-1549-5","title":"Gaussian bare-bones artificial bee colony algorithm","year":2014,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Artificial bee colony algorithm; Benchmark (surveying); Mathematical optimization; Computer science; Evolutionary algorithm; Convergence (economics); Algorithm; Gaussian; Evolutionary computation; Inefficiency; Set (abstract data type); Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01978669454969349,"gpt":0.2815864520648099,"spread":0.2617997575151164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001468188,0.0002124021,0.0002976404,0.0002339687,0.0004805364,0.0005189506,0.001228333,0.00013553,0.00006900125],"category_scores_gemma":[0.0006892036,0.0002120709,0.00008689855,0.0008249482,0.00009918514,0.0002536573,0.0007012932,0.000426992,0.0003878083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005396425,"about_ca_system_score_gemma":0.0001198447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003151383,"about_ca_topic_score_gemma":0.000003225275,"domain_scores_codex":[0.9971748,0.0003303396,0.0004790463,0.0006501312,0.0007144031,0.0006513089],"domain_scores_gemma":[0.9982045,0.0005965804,0.000109226,0.0005727539,0.0002634902,0.0002534445],"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.000002701118,0.00008573996,0.0002043623,0.00002116924,0.00002243943,0.00002223286,0.000485691,0.007380506,0.0002670441,0.03987921,0.002039723,0.9495892],"study_design_scores_gemma":[0.0002116797,0.00007014933,0.0006726736,0.0000211581,0.000004203979,0.00002066815,0.00001842025,0.9879001,0.0006311263,0.003380995,0.006823361,0.0002454243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009772249,0.00004070707,0.9930385,0.001681492,0.0007960575,0.0001963826,0.000002092701,0.0004576792,0.00280983],"genre_scores_gemma":[0.1951504,0.000002766433,0.8031446,0.0005999882,0.0007276481,0.000006629431,0.00000706684,0.0000287057,0.0003321824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9805197,"threshold_uncertainty_score":0.8648002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984472815","doi":"10.1007/s00500-014-1361-2","title":"Uncertain random multilevel programming with application to production control problem","year":2014,"lang":"en","type":"article","venue":"Soft Computing","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Mathematical optimization; Computer science; Stochastic programming; Production (economics); Random search; Genetic programming; Control (management); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01407529687584623,"gpt":0.2624798376636632,"spread":0.248404540787817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008877653,0.000136851,0.0002247231,0.00006095337,0.0001912048,0.00006043456,0.00009154864,0.00004837156,0.000001113383],"category_scores_gemma":[0.0003868278,0.0001089966,0.00003015063,0.0001933214,0.0000134365,0.0000685947,0.00002109592,0.00008377669,0.000009174161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004991472,"about_ca_system_score_gemma":0.00002076561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003684175,"about_ca_topic_score_gemma":0.00002378,"domain_scores_codex":[0.99886,0.00008751563,0.0003008496,0.0003177575,0.0002033779,0.0002304764],"domain_scores_gemma":[0.9990655,0.0002277592,0.0002069108,0.0002292906,0.0002079723,0.00006251902],"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.0002751477,0.0002232895,0.003796659,0.0007976312,0.00007797247,8.857398e-7,0.004539859,0.3816773,0.001443384,0.01471861,0.0007334815,0.5917158],"study_design_scores_gemma":[0.002971853,0.0001600388,0.0002519273,0.0004010832,0.00004924871,0.00001558263,0.0002028165,0.9873154,0.0004088908,0.002931569,0.004947687,0.0003439643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03099555,0.000006785474,0.9662158,0.0003096357,0.00008853819,0.001841618,7.888665e-7,0.0002684333,0.0002728027],"genre_scores_gemma":[0.7577671,6.386565e-8,0.2416861,0.00004522717,0.0002938733,0.00008817316,0.000005536017,0.00002524492,0.00008868444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7267716,"threshold_uncertainty_score":0.4444754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2772402907","doi":"10.1007/s00500-017-2945-4","title":"On the value of parameter tuning in heterogeneous ensembles effort estimation","year":2017,"lang":"en","type":"article","venue":"Soft Computing","topic":"Software Engineering Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Particle swarm optimization; Computer science; Software; Hyperparameter optimization; Grid; Machine learning; Data mining; Perceptron; Support vector machine; Estimation; Artificial intelligence; Artificial neural network; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02662789720180282,"gpt":0.2920757530750286,"spread":0.2654478558732258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903742,0.00009537282,0.0001295088,0.00009751026,0.0002326868,0.0001979119,0.001171238,0.00003788949,0.00000141348],"category_scores_gemma":[0.002713283,0.00007497153,0.0000445742,0.0001061799,0.00005137461,0.0001274838,0.0004481194,0.0001859849,0.00001063656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003814142,"about_ca_system_score_gemma":0.00003065888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006034712,"about_ca_topic_score_gemma":0.000002099511,"domain_scores_codex":[0.9989893,0.00004614122,0.000193066,0.0002258159,0.0002891534,0.0002565115],"domain_scores_gemma":[0.9964531,0.002522026,0.0001179417,0.0008353387,0.00003946779,0.00003213741],"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.000006723315,0.00004674713,0.05595786,0.00005769599,0.00002318456,0.00004258601,0.001433526,0.7801859,0.0006408062,0.02091537,0.00004598099,0.1406437],"study_design_scores_gemma":[0.000106279,0.00003760049,0.05237615,0.0001404362,8.86415e-7,0.000008429151,0.000003003848,0.94112,0.003238102,0.002887964,0.000005717992,0.00007547446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5968236,0.00001511323,0.4027291,0.0001267283,0.0001246252,0.00007727312,1.29743e-7,0.00005485293,0.0000485645],"genre_scores_gemma":[0.9676862,5.334523e-7,0.0322306,0.00004160714,0.00002279742,0.000003067255,2.979168e-7,0.00000898655,0.000005884828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3708626,"threshold_uncertainty_score":0.3248249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2892078476","doi":"10.1007/s00500-018-3530-1","title":"Majority voting for discrete population-based optimization algorithms","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Voting; Computer science; Algorithm; Population; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02588868168157974,"gpt":0.3187401715354348,"spread":0.2928514898538551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215683,0.0001979269,0.0002350114,0.0002268631,0.0007828574,0.0004435177,0.0008310103,0.00008721649,0.00003926004],"category_scores_gemma":[0.0011453,0.0002032944,0.0000962034,0.0008327154,0.00006585044,0.0003628947,0.0002813885,0.0001482685,0.00002510099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022989,"about_ca_system_score_gemma":0.0001404291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005674447,"about_ca_topic_score_gemma":0.000003745153,"domain_scores_codex":[0.997654,0.00015103,0.0004836038,0.0006449769,0.0005211764,0.0005451921],"domain_scores_gemma":[0.9976815,0.0007001729,0.0002413355,0.0004897121,0.0007305046,0.0001568008],"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.000009788386,0.00004989668,0.005080122,0.00005390737,0.00002212418,0.000002218914,0.0001972079,0.9175349,0.00001435728,0.009062452,0.0002851829,0.06768784],"study_design_scores_gemma":[0.0005252714,0.00008642911,0.001418389,0.00003457724,0.000006456963,0.00000291272,0.000007820548,0.99687,0.0001717125,0.0004275314,0.0002129058,0.0002359418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000469788,0.00001925169,0.9968631,0.0006163475,0.0008272028,0.0004962788,0.000007192432,0.0004422874,0.0002586126],"genre_scores_gemma":[0.2832342,3.003432e-7,0.7158931,0.0001900862,0.0005166367,0.00001039016,0.00004638233,0.00002179781,0.00008707884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2827645,"threshold_uncertainty_score":0.8290105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3126173653","doi":"10.1007/s00500-021-05607-6","title":"Designing a closed-loop supply chain network considering multi-task sales agencies and multi-mode transportation","year":2021,"lang":"en","type":"article","venue":"Soft Computing","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Supply chain; Supply chain network; Profit (economics); Revenue; Operations research; Network planning and design; Computer science; Order (exchange); Product (mathematics); Supply chain management; Business; Marketing; Economics; Engineering; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.0229872952634562,"gpt":0.2405676752216176,"spread":0.2175803799581615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007445502,0.0003478258,0.0003715095,0.0002096533,0.0006947198,0.0005694047,0.0001870778,0.00009283093,0.00003494915],"category_scores_gemma":[0.0003037337,0.000401434,0.0001035625,0.0006747465,0.00009273501,0.0006205496,0.0002289306,0.0002351351,0.00002685772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008442338,"about_ca_system_score_gemma":0.00006577422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004153111,"about_ca_topic_score_gemma":0.000622823,"domain_scores_codex":[0.9977383,0.00005193821,0.0005126432,0.0006488605,0.0002856243,0.000762634],"domain_scores_gemma":[0.9988933,0.0002677327,0.0002814091,0.0002634637,0.0002607486,0.00003336761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006522904,0.000253793,0.5091414,0.003204997,0.0004011469,0.001707767,0.006320337,0.3921361,0.008479742,0.009764607,0.003110623,0.06541429],"study_design_scores_gemma":[0.002449058,0.00001076153,0.06260828,0.0005263661,0.000181696,0.000009893633,0.01950837,0.9057743,0.0003332862,0.001101747,0.006592805,0.0009034526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5883851,0.001448386,0.4077128,0.0005202684,0.0005297452,0.0005962916,0.000003304124,0.0005660066,0.0002381527],"genre_scores_gemma":[0.9267621,0.00001944772,0.07057942,0.001383063,0.0007697108,0.00001833902,0.0001304693,0.0000707858,0.0002666397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5136382,"threshold_uncertainty_score":0.9998438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2797298759","doi":"10.1007/s00500-018-3182-1","title":"Difference co-occurrence matrix using BP neural network for fingerprint liveness detection","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Liveness; Computer science; Artificial neural network; Artificial intelligence; Preprocessor; Fingerprint (computing); Pattern recognition (psychology); Fingerprint recognition; Spoofing attack; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.05099264613434697,"gpt":0.3298064939482945,"spread":0.2788138478139475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006236777,0.0001453522,0.0001678453,0.0001646927,0.0007194069,0.0003563837,0.0007088459,0.00007607273,0.000004363837],"category_scores_gemma":[0.0001445962,0.0001508564,0.00008062648,0.00106564,0.00008935363,0.0001749549,0.0002598959,0.0001401815,0.0000186881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006926847,"about_ca_system_score_gemma":0.00005892537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004439091,"about_ca_topic_score_gemma":0.000009922058,"domain_scores_codex":[0.9984813,0.00008796905,0.000307189,0.000486642,0.000217553,0.0004193019],"domain_scores_gemma":[0.9987347,0.0003171028,0.0002170562,0.0003875144,0.0002566622,0.00008703906],"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.00003334683,0.0001294696,0.009625178,0.0001586129,0.00003524827,0.000005080772,0.00224927,0.005360885,0.007013146,0.006756854,0.0005041111,0.9681288],"study_design_scores_gemma":[0.0001609699,0.0000542153,0.009599178,0.00003234259,0.000005390092,0.00001877236,0.00001268052,0.9856632,0.002001358,0.001012351,0.001245422,0.0001941242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2684812,0.00006657176,0.7293769,0.00004220796,0.001665519,0.0001646625,0.000005338092,0.0001840201,0.00001359424],"genre_scores_gemma":[0.9514241,9.450506e-7,0.047859,0.0001326512,0.0005516954,0.000003777059,0.000006536594,0.000006460021,0.00001485992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9803023,"threshold_uncertainty_score":0.6151747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1055035554","doi":"10.1007/s00500-015-1812-4","title":"Hierarchical classification in text mining for sentiment analysis of online news","year":2015,"lang":"en","type":"article","venue":"Soft Computing","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Sentiment analysis; Class (philosophy); Task (project management); Artificial intelligence; Binary classification; Polarity (international relations); Tone (literature); Data mining; Information retrieval; Natural language processing; Machine learning; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.07647598286024078,"gpt":0.3373545197430311,"spread":0.2608785368827903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756172,0.0001073121,0.0003493857,0.0006563188,0.00006061768,0.00006732216,0.0004189512,0.0000453402,0.000003788884],"category_scores_gemma":[0.0001324248,0.0001051831,0.0001855515,0.001850053,0.00002406588,0.0001288527,0.0001807183,0.00007334213,0.000002097942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005525522,"about_ca_system_score_gemma":0.00006029174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005503759,"about_ca_topic_score_gemma":0.00008632323,"domain_scores_codex":[0.9984617,0.00008101708,0.0005593232,0.0003774811,0.000288665,0.0002318669],"domain_scores_gemma":[0.9988669,0.000320095,0.0002719043,0.0003243278,0.000130864,0.00008593572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002926411,0.0005574718,0.4438206,0.00002912102,0.0008324428,0.000003640514,0.008712173,0.09120459,0.001131072,0.0138898,0.0007828948,0.439007],"study_design_scores_gemma":[0.0004040714,0.00003729834,0.03967666,0.00002429134,0.00008740885,3.519869e-7,0.0008227239,0.9582358,0.0001128448,0.000163284,0.0003296571,0.0001055901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3984741,0.00006418862,0.6005479,0.0005067243,0.0001245781,0.00008762399,0.000001712418,0.00003290621,0.0001603703],"genre_scores_gemma":[0.8589424,0.000001164691,0.1408278,0.00008542681,0.0000645681,0.000002260037,0.00004011952,0.000005123638,0.00003116769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8670312,"threshold_uncertainty_score":0.4289241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W404655571","doi":"10.1007/s00500-015-1716-3","title":"Novel self-adaptive particle swarm optimization methods","year":2015,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Swarm behaviour; Particle swarm optimization; Multi-swarm optimization; Computer science; Metaheuristic; Mathematical optimization; Premature convergence; Algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09085828163086822,"gpt":0.3700426414815889,"spread":0.2791843598507207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002558371,0.0001678873,0.000219691,0.0001200757,0.0001986522,0.000318599,0.0008602722,0.00006714566,0.00001187237],"category_scores_gemma":[0.0009785998,0.0001671396,0.00005297648,0.001122124,0.00004351838,0.0004598854,0.0007136204,0.0002065959,0.00007654372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001355985,"about_ca_system_score_gemma":0.0002772813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002299194,"about_ca_topic_score_gemma":3.995121e-7,"domain_scores_codex":[0.9976621,0.0003814554,0.0003816796,0.0005133334,0.0005856059,0.0004758533],"domain_scores_gemma":[0.9978116,0.000495189,0.0001586431,0.0005435871,0.0006486795,0.0003422651],"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.000004455328,0.0001239574,0.00008120862,0.000006008128,0.00002741477,0.000005869708,0.001543221,0.940142,0.00007242138,0.01184943,0.0002479945,0.04589605],"study_design_scores_gemma":[0.0005905384,0.00007280706,0.00005826887,0.000009559699,0.000006673997,0.00002384594,0.00008565512,0.996746,0.001251159,0.0004659144,0.0004970732,0.0001925022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002539724,0.0000922502,0.9960355,0.0004074752,0.0005460664,0.0002201288,7.913737e-7,0.0006481591,0.001795658],"genre_scores_gemma":[0.0320798,0.000002338299,0.9674184,0.0002008606,0.0001377536,0.000005736512,0.000002479127,0.00001971384,0.0001328937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05660404,"threshold_uncertainty_score":0.6815755,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075646905","doi":"10.1007/s00500-004-0442-z","title":"A soft computing framework for software effort estimation","year":2005,"lang":"en","type":"article","venue":"Soft Computing","topic":"Software Engineering Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Motorola (Canada); Western University","funders":"","keywords":"Computer science; Interpretability; Soft computing; Machine learning; Data mining; Robustness (evolution); Fuzzy logic; Adaptive neuro fuzzy inference system; Software; Artificial intelligence; Inference; Artificial neural network; Fuzzy control system","retraction":null,"screen_n_in":null,"score":{"opus":0.01964834430935424,"gpt":0.3036117886535374,"spread":0.2839634443441832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001165189,0.0003247877,0.000352163,0.0002608911,0.0005575793,0.0004552384,0.001410144,0.0001932619,0.000007589376],"category_scores_gemma":[0.004239786,0.0003558292,0.0001768411,0.0007598195,0.00005469099,0.000487772,0.0007202676,0.0005326077,0.0001147613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002242283,"about_ca_system_score_gemma":0.0001506816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008998504,"about_ca_topic_score_gemma":0.000001255119,"domain_scores_codex":[0.9970176,0.00004296707,0.0005353016,0.0007872833,0.0006123949,0.001004464],"domain_scores_gemma":[0.9934131,0.00512054,0.0001846488,0.0008021302,0.0002603275,0.0002192398],"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.00000583361,0.00005626372,0.007818379,0.0001327051,0.000033617,0.000006006875,0.001167707,0.3019573,0.0000270293,0.01062461,0.000730971,0.6774396],"study_design_scores_gemma":[0.000385266,0.00007324634,0.006154872,0.0002507615,0.000007151649,0.00003258795,0.00001357734,0.9847903,0.000380955,0.005767874,0.001740197,0.0004031906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03793598,0.0002174339,0.957675,0.000598164,0.0007484001,0.0005117647,0.000002485293,0.002284129,0.00002664014],"genre_scores_gemma":[0.46226,5.140385e-7,0.5369728,0.0002110574,0.0004829494,0.000008955078,0.000006435699,0.00003370982,0.00002365149],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.682833,"threshold_uncertainty_score":0.9998894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060589859","doi":"10.1007/s00500-013-1156-x","title":"Consistency test and weight generation for additive interval fuzzy preference relations","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Preference; Preference relation; Mathematics; Fuzzy logic; Consistency (knowledge bases); Interval (graph theory); Fuzzy set; Relation (database); Mathematical optimization; Computer science; Statistics; Artificial intelligence; Data mining; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.2031896171506752,"gpt":0.3818449829248434,"spread":0.1786553657741682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001378252,0.0001568056,0.000258371,0.0002103996,0.0005318426,0.0007153206,0.0003436822,0.00008405023,0.0004184597],"category_scores_gemma":[0.01397949,0.0001259321,0.00007934448,0.0003161549,0.0001099856,0.0005243324,0.0002854538,0.0001356346,0.0003397083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000352014,"about_ca_system_score_gemma":0.00005953098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001956549,"about_ca_topic_score_gemma":0.00002396867,"domain_scores_codex":[0.9976724,0.0001474496,0.0007865056,0.0006117632,0.0005206189,0.0002612263],"domain_scores_gemma":[0.9893823,0.008808528,0.000357155,0.0003845308,0.0009520875,0.000115445],"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.00001081022,0.00008352024,0.02689021,0.000008485089,0.00002264771,0.000002321672,0.002680555,0.0003588887,0.01035593,0.004911402,0.05497915,0.8996961],"study_design_scores_gemma":[0.0006144127,0.00009941548,0.05481402,0.00008821935,0.0000140179,0.0000185708,0.0006533619,0.9031395,0.0004748961,0.03402751,0.005773156,0.0002828959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6229002,0.0001380073,0.37091,0.0007822823,0.000860328,0.0007469647,0.00005484758,0.0000945166,0.003512846],"genre_scores_gemma":[0.9265305,0.000001532356,0.07207587,0.0002284382,0.000323451,0.00002635603,0.00001508338,0.00001302221,0.0007856877],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9027807,"threshold_uncertainty_score":0.9943262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012399061","doi":"10.1007/s00500-013-1065-z","title":"A Granular Computing approach to the design of optimized graph classification systems","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Benchmarking; Theoretical computer science; Embedding; Graph; Granular computing; Graph rewriting; ENCODE; Graph embedding; Data mining; Artificial intelligence; Rough set","retraction":null,"screen_n_in":null,"score":{"opus":0.03306315459036092,"gpt":0.2313781869481714,"spread":0.1983150323578105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935391,0.0001998138,0.000305398,0.0001776449,0.0004281171,0.000315103,0.001511285,0.00006530007,0.000001116662],"category_scores_gemma":[0.0000867319,0.0001454225,0.0001155191,0.001056835,0.00007794389,0.0002286076,0.0003336038,0.0001983419,0.00003732761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957647,"about_ca_system_score_gemma":0.00003385402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006319295,"about_ca_topic_score_gemma":5.121917e-8,"domain_scores_codex":[0.9976982,0.0005671985,0.0005074422,0.0004745116,0.0003450045,0.000407569],"domain_scores_gemma":[0.998045,0.0005829796,0.0002911343,0.0007411349,0.0002308046,0.0001089245],"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.000006017205,0.0001205918,0.0002457589,0.00006070578,0.0000349291,9.500345e-7,0.00353415,0.8218281,0.001199832,0.142295,0.0004657363,0.03020821],"study_design_scores_gemma":[0.0002644209,0.00004325056,0.001362858,0.0000630684,0.000008013139,0.00001717388,0.0004185479,0.9944523,0.0001244752,0.003017396,0.00004901051,0.0001795048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031798,0.0001438004,0.9871152,0.0002103527,0.0004958877,0.0009758514,6.234123e-7,0.0002327114,0.0005075664],"genre_scores_gemma":[0.7089822,7.184412e-7,0.290785,0.0001097403,0.00008097904,0.00001635207,0.000001620931,0.00001049548,0.00001285832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6986642,"threshold_uncertainty_score":0.5930156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2976312117","doi":"10.1007/s00500-019-04362-z","title":"A distributionally robust optimization model for designing humanitarian relief network with resource reallocation","year":2019,"lang":"en","type":"article","venue":"Soft Computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematical optimization; Robust optimization; Computer science; Ambiguity; Natural disaster; Emergency management; Operations research; Risk measure; Flood myth; Economic shortage; Probability distribution; Mathematics; Economics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.02283398240199376,"gpt":0.2059151824601823,"spread":0.1830812000581885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000667977,0.0001642315,0.0001506079,0.00009154041,0.0004631685,0.0002028958,0.0001933764,0.00005044754,0.00004625546],"category_scores_gemma":[0.00007439219,0.000164531,0.00005135885,0.0003748522,0.00002041457,0.0004553665,0.0001052303,0.00008820115,0.0000548593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006932818,"about_ca_system_score_gemma":0.00003116443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000116581,"about_ca_topic_score_gemma":0.00009355618,"domain_scores_codex":[0.998746,0.00001064875,0.0003136551,0.0003689042,0.0002360733,0.0003246778],"domain_scores_gemma":[0.9992661,0.00004103076,0.000150618,0.0002357694,0.0002934428,0.00001299842],"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.00005356527,0.00003240244,0.001717043,0.000138932,0.00002061479,1.734342e-7,0.00006185981,0.960665,0.000005121848,0.03344912,0.003033349,0.0008227844],"study_design_scores_gemma":[0.0004811588,0.00001548799,0.0006212609,0.00009473896,0.00003680201,2.636154e-7,0.0001405241,0.9929234,6.466705e-7,0.0006990021,0.004767508,0.0002192474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007387662,0.00001988782,0.9863956,0.0006751771,0.0001638105,0.0007224553,0.000001918257,0.0002342247,0.00439927],"genre_scores_gemma":[0.9241854,0.000001160309,0.07208192,0.001289399,0.0007188442,0.00003072691,0.0008161319,0.00003824079,0.0008381601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9167978,"threshold_uncertainty_score":0.6709379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062705997","doi":"10.1007/s00500-008-0337-5","title":"Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem","year":2008,"lang":"en","type":"article","venue":"Soft Computing","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":46,"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":"Benchmark (surveying); Job shop scheduling; Computer science; Crossover; Mathematical optimization; Algorithm; Scheduling (production processes); Schedule; Computational complexity theory; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2173452877011113,"gpt":0.4178145060016266,"spread":0.2004692183005153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.007999549,0.0005389038,0.0008470656,0.001047515,0.001868612,0.0006818376,0.001558667,0.0002839688,0.00005672935],"category_scores_gemma":[0.002160894,0.0004783075,0.0004111284,0.00205235,0.0006318945,0.0006591814,0.0004662751,0.0007085474,0.00004958337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001598993,"about_ca_system_score_gemma":0.001001268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008911913,"about_ca_topic_score_gemma":0.000005558623,"domain_scores_codex":[0.9923077,0.0007257782,0.00170457,0.001780811,0.001970168,0.001510924],"domain_scores_gemma":[0.9939245,0.003141491,0.0006174218,0.001021073,0.0009635146,0.0003320148],"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.000119304,0.000276835,0.002840419,0.00006371739,0.000115529,0.00006933017,0.02292006,0.08767954,0.02829403,0.0001789445,0.000140233,0.8573021],"study_design_scores_gemma":[0.001509466,0.0002273872,0.0001380863,0.0001704135,0.00002427458,0.000449181,0.006291837,0.9800974,0.008815959,0.0008997784,0.0006884695,0.0006878093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4379901,0.00004414081,0.5592026,0.00009918374,0.0001340218,0.001080783,0.00001653307,0.0002330164,0.001199668],"genre_scores_gemma":[0.4837402,5.998334e-7,0.5152292,0.0002165357,0.0006034621,0.00001797142,0.00001328904,0.0000601795,0.000118603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8924178,"threshold_uncertainty_score":0.9997669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012165244","doi":"10.1007/s00500-005-0464-1","title":"Median graph computation for graph clustering","year":2005,"lang":"en","type":"article","venue":"Soft Computing","topic":"Graph Theory and Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Computer science; Clustering coefficient; Graph; Computation; Theoretical computer science; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01566877939288301,"gpt":0.2595915060603086,"spread":0.2439227266674256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000650553,0.0001753846,0.0001851058,0.0002270741,0.0004349917,0.0001849247,0.0006196934,0.00006162553,0.000002327493],"category_scores_gemma":[0.00004415139,0.0001806799,0.0001553841,0.0004325988,0.00005233602,0.0004010158,0.0002060453,0.0001359369,0.00001940554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002295027,"about_ca_system_score_gemma":0.00002476476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003970576,"about_ca_topic_score_gemma":0.000007163326,"domain_scores_codex":[0.99856,0.00006278978,0.00031389,0.0004276307,0.0001960552,0.0004395952],"domain_scores_gemma":[0.9990288,0.000363961,0.0001349229,0.0002567538,0.00009755576,0.0001180266],"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.000007174016,0.0000599361,0.0002157461,0.00004276549,0.00003320437,0.000004449957,0.002118816,0.07527062,0.0003406339,0.05889534,0.0002815327,0.8627298],"study_design_scores_gemma":[0.0004792069,0.00005495918,0.0004057394,0.00003919508,0.000005618825,0.00001933873,0.00003856757,0.8977866,0.0004261849,0.09997844,0.0005307085,0.000235492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02358709,0.00008092105,0.9737293,0.0008004574,0.0008039802,0.0002286338,0.000001982971,0.0004617373,0.0003059167],"genre_scores_gemma":[0.6726243,9.834582e-7,0.326609,0.0004178076,0.0003071013,0.00000523569,0.000005415242,0.0000115598,0.0000185854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8624943,"threshold_uncertainty_score":0.7367913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2269275143","doi":"10.1007/s00500-016-2060-y","title":"Multilevel framework for large-scale global optimization","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Global optimization; Scale (ratio); Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02775923828119252,"gpt":0.3267531708932578,"spread":0.2989939326120653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296614,0.0001527881,0.0001872017,0.00007242602,0.0002959007,0.0001970816,0.000877874,0.0001067154,0.0000578891],"category_scores_gemma":[0.001477071,0.00011866,0.00008231204,0.0004429012,0.00003278162,0.0002907421,0.0004710898,0.00008600081,0.00005898664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001087715,"about_ca_system_score_gemma":0.000108065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002055736,"about_ca_topic_score_gemma":6.243592e-7,"domain_scores_codex":[0.9980791,0.00009337731,0.000328734,0.0005386813,0.0003967416,0.0005633238],"domain_scores_gemma":[0.9978797,0.00090951,0.0001393206,0.0005274384,0.0003854549,0.0001586111],"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.00001871392,0.0001936473,0.002357581,0.00005103002,0.00004499994,0.000006067841,0.0006170537,0.2214788,0.00003251723,0.2775879,0.00174165,0.49587],"study_design_scores_gemma":[0.0006210972,0.00003325201,0.0003372238,0.00006366112,0.000003158927,0.000005183032,0.00001262087,0.9867714,0.0000801868,0.01084652,0.00105338,0.0001722852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001252564,0.00003575584,0.9969348,0.001214668,0.000679963,0.0003398991,0.00002614418,0.0003471318,0.0002963841],"genre_scores_gemma":[0.05442591,0.000004505696,0.9448774,0.0002427429,0.0002260581,0.00001247952,0.000004445028,0.00001501684,0.0001913936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7652926,"threshold_uncertainty_score":0.4838814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977092387","doi":"10.1007/s00500-005-0039-1","title":"A novel fuzzy evidential reasoning paradigm for data fusion with applications in image processing","year":2006,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":37,"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":"Artificial intelligence; Evidential reasoning approach; Fuzzy logic; Probabilistic logic; Computer science; Neuro-fuzzy; Machine learning; Entropy (arrow of time); Fuzzy rule; Fuzzy classification; Fuzzy set operations; Fuzzy set; Data mining; Fuzzy control system; Decision support system","retraction":null,"screen_n_in":null,"score":{"opus":0.01449699550811908,"gpt":0.2784538086114636,"spread":0.2639568131033445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002002558,0.0001606341,0.0001692395,0.0001084524,0.0001655058,0.00009148219,0.0003258289,0.00004718057,0.000001523079],"category_scores_gemma":[0.00004001039,0.0001601136,0.00001976962,0.0003316823,0.00003385312,0.0004244616,0.0001576455,0.0001563239,0.000001460542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006376937,"about_ca_system_score_gemma":0.00002653498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000532539,"about_ca_topic_score_gemma":0.00005335376,"domain_scores_codex":[0.9989593,0.00000638445,0.0002808625,0.0003322336,0.0001241987,0.0002970358],"domain_scores_gemma":[0.9993645,0.0001039593,0.00008050769,0.000376344,0.00004517714,0.00002952108],"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.0000662593,0.0003166235,0.005348393,0.001507452,0.00002915525,0.00001645156,0.0006892335,0.1346019,0.3112454,0.003137027,0.002323097,0.5407191],"study_design_scores_gemma":[0.0005242795,0.00001731171,0.00119053,0.0005735824,0.0000156867,0.00001866214,0.00006556333,0.9876873,0.005685566,0.001346452,0.002541559,0.000333511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009002216,0.000373645,0.9885978,0.00002232762,0.00002807979,0.0005789771,0.00001761244,0.0008679383,0.0005114692],"genre_scores_gemma":[0.4402228,0.000003036002,0.5593845,0.000008810604,0.0001485873,0.0000412304,0.0001375428,0.00004479168,0.000008793577],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8530854,"threshold_uncertainty_score":0.6529243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995911512","doi":"10.1007/s00500-007-0227-2","title":"Building ensemble classifiers using belief functions and OWA operators","year":2007,"lang":"en","type":"article","venue":"Soft Computing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":36,"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":"Artificial intelligence; Cascading classifiers; Dempster–Shafer theory; Classifier (UML); Random subspace method; Computer science; Machine learning; Operator (biology); Flexibility (engineering); Combing; Process (computing); Ensemble learning; Pattern recognition (psychology); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1728347046635952,"gpt":0.4355230489208196,"spread":0.2626883442572243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007484376,0.0002415753,0.0003773219,0.0006784978,0.001099618,0.0008659522,0.0005258762,0.0001376973,0.00009365374],"category_scores_gemma":[0.004248625,0.0002085736,0.0001135415,0.001323187,0.0001439251,0.000413065,0.0006355525,0.0003159668,0.00008217457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001084153,"about_ca_system_score_gemma":0.00008069085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004563233,"about_ca_topic_score_gemma":0.00002339653,"domain_scores_codex":[0.9960843,0.0001774546,0.001052375,0.000841706,0.001195348,0.0006488213],"domain_scores_gemma":[0.9949499,0.00350941,0.0003221722,0.0005555213,0.00038601,0.0002770207],"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.00004130236,0.00005113456,0.04808858,0.000008620317,0.00003046377,0.0000699509,0.00156881,0.01015482,0.0764677,0.002764018,0.001420284,0.8593343],"study_design_scores_gemma":[0.001429107,0.00009288381,0.03672855,0.0002632214,0.00004427835,0.0003251304,0.008495811,0.9040795,0.003819152,0.009997958,0.03368685,0.001037564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5187824,0.0001137838,0.4789748,0.00005208181,0.001000372,0.00008605486,0.000001485886,0.00007261612,0.000916331],"genre_scores_gemma":[0.8763955,8.041581e-7,0.1227224,0.0002874035,0.0003581076,4.032067e-7,5.789166e-7,0.00002642173,0.0002083602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8939247,"threshold_uncertainty_score":0.8505386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4220657974","doi":"10.1007/s00500-022-06802-9","title":"Employing multimodal co-learning to evaluate the robustness of sensor fusion for industry 5.0 tasks","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Chemical Sensor Technologies","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Robustness (evolution); Computer science; Sensor fusion; Artificial intelligence; Machine learning; Data mining; Image fusion; Soft sensor; Fusion; Missing data; Implementation; Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0219420508183054,"gpt":0.2852423666811111,"spread":0.2633003158628057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002432898,0.0001478176,0.0001993319,0.00007146779,0.0003915266,0.00001384578,0.0003183075,0.0001038545,0.00001768116],"category_scores_gemma":[0.0004420912,0.0001339018,0.00006532136,0.0003052593,0.00003899259,0.00002957504,0.0003146064,0.0008791314,0.000001491756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001217173,"about_ca_system_score_gemma":0.000005453134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004610393,"about_ca_topic_score_gemma":3.745841e-7,"domain_scores_codex":[0.9989215,0.00003777082,0.0002649036,0.0002027187,0.0002289885,0.0003441903],"domain_scores_gemma":[0.9991364,0.0005094071,0.00005687435,0.0002072801,0.00005406734,0.00003597825],"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.000009700859,0.000006425854,0.0005789101,0.00003624164,0.00001404719,9.226679e-7,0.0003248095,0.861356,0.1131369,0.00001807204,0.000098597,0.02441932],"study_design_scores_gemma":[0.0003314234,0.00005617677,0.0002595311,0.00003656321,0.00001301619,0.000008652039,0.002593931,0.9069411,0.08727691,0.00006120485,0.002218421,0.0002030258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9201762,0.00005203849,0.07828846,0.0001132139,0.000214139,0.0003169893,0.000008947386,0.0007472606,0.00008274053],"genre_scores_gemma":[0.9859147,7.638129e-7,0.01385542,0.00002793202,0.00009111634,0.00003075017,0.000007458076,0.0000478393,0.00002398802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06573851,"threshold_uncertainty_score":0.5460356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020572503","doi":"10.1007/s00500-013-0983-0","title":"RETRACTED ARTICLE: Experimental and fuzzy modelling analysis on dynamic cutting force in micro milling","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced machining processes and optimization","field":"Engineering","cited_by":32,"is_retracted":true,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Subtractive color; Fuzzy logic; Process (computing); Computer science; Cluster analysis; Machining; Fuzzy clustering; Data mining; Engineering; Mechanical engineering; Machine learning; Artificial intelligence","retraction":{"nature":"Retraction","openalex_flagged":true},"screen_n_in":null,"score":{"opus":0.005624717884446579,"gpt":0.2264216441757648,"spread":0.2207969262913182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009914773,0.0001391894,0.0001768336,0.0001815052,0.0001033421,0.00007280628,0.00005982044,0.00007001271,0.000005856189],"category_scores_gemma":[0.00001878899,0.0001531683,0.0000342036,0.000473293,0.00001267541,0.0001781752,0.00002975516,0.0002428219,0.000003795941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006296309,"about_ca_system_score_gemma":0.000003345973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002705986,"about_ca_topic_score_gemma":0.000002794574,"domain_scores_codex":[0.9991652,0.00001163895,0.0002548475,0.0002193751,0.00008652844,0.0002624477],"domain_scores_gemma":[0.999685,0.00009868231,0.00004847349,0.00009425067,0.00002660879,0.00004700435],"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.000002281621,0.000009825957,0.001892891,0.00002386847,0.00002744682,0.00000115176,0.0007782777,0.9813953,0.01029302,0.00001968653,7.739561e-7,0.00555545],"study_design_scores_gemma":[0.0001886593,0.00001421916,0.0007203627,0.00006755578,0.00001816294,0.000001526572,0.000318886,0.9954571,0.002874444,0.0001727636,0.000001621689,0.0001646933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5654365,0.000340683,0.4338189,0.000005773145,0.00003645141,0.00006230233,3.617293e-7,0.0001255422,0.0001734408],"genre_scores_gemma":[0.9425927,0.00001540926,0.05728371,0.00002950916,0.00002786941,0.000003530885,0.000009697874,0.00002822713,0.000009336466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3771562,"threshold_uncertainty_score":0.624602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3120759692","doi":"10.1007/s00500-020-05460-z","title":"Methods for solving LR-bipolar fuzzy linear systems","year":2021,"lang":"en","type":"article","venue":"Soft Computing","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":32,"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":"Mathematics; Fuzzy logic; System of linear equations; Linear system; Linear equation; Applied mathematics; Fuzzy number; Fuzzy control system; Computer science; Mathematical analysis; Fuzzy set; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06524559022707835,"gpt":0.3833419791827083,"spread":0.31809638895563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483201,0.0001518534,0.0003546547,0.00005082219,0.0002805426,0.0001166475,0.0001242111,0.0001147441,0.000006431198],"category_scores_gemma":[0.001834462,0.0001505767,0.0001306413,0.0002082369,0.00001336326,0.00007355354,0.0001040518,0.0001237702,0.000005902124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005529542,"about_ca_system_score_gemma":0.00007727749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000192628,"about_ca_topic_score_gemma":0.000002848362,"domain_scores_codex":[0.9985993,0.0001725847,0.0004827869,0.0002970602,0.0001362939,0.0003120021],"domain_scores_gemma":[0.9974095,0.001653015,0.0002238981,0.0002986455,0.0003489009,0.00006605259],"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.00005328954,0.0005879683,0.003119535,0.01442888,0.0009614868,0.00007394922,0.01378306,0.1592714,0.02853599,0.5183349,0.01847678,0.2423727],"study_design_scores_gemma":[0.0004377832,0.00002753952,0.00001510555,0.0004087737,0.00005309663,0.00004310059,0.0007315391,0.9672381,0.001682431,0.008651894,0.02044368,0.0002669322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004759517,0.002819606,0.989318,0.00006498278,0.001421032,0.00035575,0.000006978134,0.0002193379,0.00103478],"genre_scores_gemma":[0.06183576,0.000006643646,0.9361371,0.00005322873,0.001015473,0.00001232042,0.00002072685,0.00006250772,0.0008562686],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8079667,"threshold_uncertainty_score":0.6140339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992138932","doi":"10.1007/s00500-014-1246-4","title":"Interval type-2 fuzzy sets to model linguistic label perception in online services satisfaction","year":2014,"lang":"en","type":"article","venue":"Soft Computing","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Perception; Type (biology); Computer science; Fuzzy logic; Fuzzy set; Interval (graph theory); Artificial intelligence; Natural language processing; Mathematics; Linguistics; Psychology; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01985927749125683,"gpt":0.2738904684942293,"spread":0.2540311910029725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004529015,0.0001429809,0.000213871,0.00011992,0.00009948512,0.0001212575,0.000417794,0.00006900141,9.473129e-7],"category_scores_gemma":[0.00009732422,0.0001378721,0.00003340662,0.0003009239,0.000009317665,0.0001324119,0.0002478024,0.0001612691,0.00009011273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008881562,"about_ca_system_score_gemma":0.00002910458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005021851,"about_ca_topic_score_gemma":0.0004513631,"domain_scores_codex":[0.9986974,0.0001028409,0.0003121328,0.0003921782,0.0002063206,0.00028915],"domain_scores_gemma":[0.9993128,0.00009723315,0.00009207703,0.0002948137,0.0001182418,0.00008481918],"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.0000371673,0.0001481942,0.02911348,0.0001910667,0.00001931414,0.000009078056,0.010786,0.2471037,0.00415816,0.01729408,0.000131801,0.691008],"study_design_scores_gemma":[0.0003199355,0.00008586973,0.03209442,0.000127769,0.000002785515,0.000005568015,0.00008483951,0.9606484,0.000002320773,0.00642006,0.00005564504,0.0001524447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6593885,0.00002419091,0.3376334,0.000265064,0.000682263,0.000131449,0.00000103108,0.0001935218,0.001680515],"genre_scores_gemma":[0.9600121,8.514233e-7,0.03877439,0.0008849325,0.0002779343,0.00000218107,0.000004930613,0.000009735308,0.00003296036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7135447,"threshold_uncertainty_score":0.5622261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119670110","doi":"10.1007/s00500-007-0185-8","title":"On some properties of quasi-MV algebras and $$\\sqrt{^{\\prime}}$$ quasi-MV algebras. Part II","year":2007,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Population and Public Health; Generalitat de Catalunya","keywords":"Prime (order theory); Mathematics; Pure mathematics; Non-associative algebra; Representation (politics); Algebra over a field; Combinatorics; Algebra representation","retraction":null,"screen_n_in":null,"score":{"opus":0.0207798165463184,"gpt":0.2446420167734175,"spread":0.2238622002270991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001144476,0.0004146827,0.0005601054,0.0002472476,0.0006060015,0.0001108459,0.0009549976,0.0001632748,0.00001101681],"category_scores_gemma":[0.0003034246,0.0003497499,0.0001373571,0.0005237095,0.0002676951,0.0006046189,0.000933014,0.0004090379,0.00003867449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006369213,"about_ca_system_score_gemma":0.0001015205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003305043,"about_ca_topic_score_gemma":0.00001013098,"domain_scores_codex":[0.9967685,0.0001036057,0.0007743579,0.0008731858,0.0005921355,0.0008881934],"domain_scores_gemma":[0.9980221,0.0004362476,0.0003957981,0.000760584,0.0001359534,0.0002492574],"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.00008221121,0.0009411505,0.002552505,0.0002119765,0.0001046516,0.00007981408,0.005363562,0.0005632113,0.01076965,0.6383995,0.0004199935,0.3405118],"study_design_scores_gemma":[0.006633831,0.007917511,0.01492802,0.00300473,0.0001347205,0.0005006049,0.001844741,0.1596145,0.2952294,0.4956488,0.009125339,0.005417849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7422122,0.001542667,0.2540342,0.0004445818,0.0006506442,0.0002653631,0.000001350389,0.0003900864,0.0004588164],"genre_scores_gemma":[0.9852693,0.00002309033,0.0133467,0.0008805873,0.0002824014,0.000003564051,0.000002623493,0.00003351764,0.0001582352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3350939,"threshold_uncertainty_score":0.9998955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3043202537","doi":"10.1007/s00500-020-05152-8","title":"A load balance multi-scheduling model for OpenCL kernel tasks in an integrated cluster","year":2020,"lang":"en","type":"article","venue":"Soft Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"Høgskulen på Vestlandet","keywords":"Computer science; Feature selection; Naive Bayes classifier; Classifier (UML); Machine learning; Artificial intelligence; Random forest; Multi-core processor; Scheduling (production processes); Parallel computing; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.05515235681134787,"gpt":0.3121857470609684,"spread":0.2570333902496205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006414805,0.0002333676,0.0003092727,0.00008581721,0.0001799056,0.000290882,0.001226616,0.000109439,0.00000138609],"category_scores_gemma":[0.0003440141,0.0002389885,0.00007689583,0.0005298742,0.00003158216,0.0004643664,0.000491707,0.0003010835,0.00001103008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009237178,"about_ca_system_score_gemma":0.0002101798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002194216,"about_ca_topic_score_gemma":0.000009654644,"domain_scores_codex":[0.9980398,0.00009837608,0.0004805728,0.0007260534,0.0002092153,0.0004459435],"domain_scores_gemma":[0.9988886,0.0001676771,0.0001698126,0.000356452,0.0002549898,0.0001624381],"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.0000161044,0.00005585995,0.0009065902,0.00002637504,0.000004857497,0.000003137294,0.00376551,0.9793676,0.0001891089,0.0004413863,0.0002065457,0.015017],"study_design_scores_gemma":[0.000914644,0.00007066191,0.00008091194,0.00008803989,0.000002445576,0.000002705115,0.00004995937,0.9977205,0.0002932386,0.0003774907,0.0001012542,0.0002981364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01843566,0.00007050218,0.9791791,0.000780086,0.0001045102,0.000426048,0.000003114369,0.0009320059,0.00006892654],"genre_scores_gemma":[0.4860818,0.000001306046,0.5123015,0.001521401,0.00004480462,0.000007744933,0.000006321517,0.00001388063,0.00002120167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4676462,"threshold_uncertainty_score":0.9745669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058273670","doi":"10.1007/s00500-002-0163-0","title":"Genetic algorithms-based fuzzy regression analysis","year":2002,"lang":"en","type":"article","venue":"Soft Computing","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Fuzzy logic; Computer science; Regression analysis; Genetic algorithm; Regression; Data mining; Linear regression; Machine learning; Artificial intelligence; Algorithm; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0423688477330448,"gpt":0.2884396446440864,"spread":0.2460707969110416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002188833,0.0001363252,0.0002661042,0.0001846242,0.0001816099,0.00005351982,0.0001263262,0.00007734488,0.0001262739],"category_scores_gemma":[0.0001566654,0.0001157616,0.0001518311,0.0006956339,0.00001795857,0.00003451375,0.00003856514,0.0000915406,0.00002911807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003742074,"about_ca_system_score_gemma":0.000007846097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001786736,"about_ca_topic_score_gemma":0.000005539747,"domain_scores_codex":[0.9988647,0.00008060766,0.0003396656,0.0002470743,0.0002468598,0.0002210599],"domain_scores_gemma":[0.9990755,0.0002665894,0.0001997429,0.0003068457,0.00008773258,0.00006357778],"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.00001638839,0.0006990204,0.08181012,0.0007236117,0.001049562,0.000113866,0.004273181,0.6678507,0.0003013132,0.002603144,0.02182913,0.21873],"study_design_scores_gemma":[0.000254274,0.00001897949,0.001529394,0.00007491086,0.0001588005,0.00000250689,0.0000397703,0.9964825,0.00005660195,0.001048653,0.000183154,0.0001504369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2150488,0.0004660541,0.7795226,0.0001534716,0.0002957271,0.0002333006,0.00000491687,0.0003506385,0.00392449],"genre_scores_gemma":[0.8103207,0.000002239944,0.1890887,0.000060183,0.0001912216,0.000001969069,0.000005242255,0.00002078686,0.0003088901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5952719,"threshold_uncertainty_score":0.472062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4296965579","doi":"10.1007/s00500-022-07462-5","title":"A reliable probabilistic risk-based decision-making method: Bayesian Technique for Order of Preference by Similarity to Ideal Solution (B-TOPSIS)","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Postdoctoral Research Foundation of China; National Natural Science Foundation of China","keywords":"TOPSIS; Ideal solution; Computer science; Multiple-criteria decision analysis; Similarity (geometry); Data mining; Operations research; Mathematics; Mathematical optimization; Artificial intelligence; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.09807207969649798,"gpt":0.4191479461598187,"spread":0.3210758664633208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.02073425,0.0003533131,0.0008025201,0.0007543602,0.001381463,0.0002893295,0.001962549,0.0001474631,0.0003766306],"category_scores_gemma":[0.04809532,0.0003311691,0.0002697969,0.002862841,0.00007796778,0.0002022075,0.001553411,0.0005593562,0.00001019229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003228202,"about_ca_system_score_gemma":0.0004122024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001435933,"about_ca_topic_score_gemma":0.00004301288,"domain_scores_codex":[0.9920812,0.001212807,0.001994704,0.001483612,0.002497306,0.0007303772],"domain_scores_gemma":[0.9739352,0.0218322,0.001346408,0.001319883,0.001370567,0.000195723],"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.0007943194,0.0003700295,0.006609456,0.00007478283,0.00002785086,0.000006792525,0.001018008,0.5464608,0.01286593,0.0006934112,0.02125011,0.4098285],"study_design_scores_gemma":[0.0006269982,0.00029411,0.0008869297,0.0002098893,0.0000296314,0.00001048791,0.000258604,0.9118228,0.001350548,0.07588121,0.008217076,0.0004117129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02394334,0.00006662916,0.9725507,0.0002315165,0.0005630206,0.002102108,0.0002626375,0.0001444722,0.0001355533],"genre_scores_gemma":[0.5066544,1.810721e-7,0.4928811,0.0002353016,0.00003514401,0.0001381376,0.000006754522,0.00002733012,0.00002162408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4827111,"threshold_uncertainty_score":0.9999186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012525336","doi":"10.1007/s00500-020-04842-7","title":"Improving image thresholding by the type II fuzzy entropy and a hybrid optimization algorithm","year":2020,"lang":"en","type":"article","venue":"Soft Computing","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":30,"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":"Thresholding; Computer science; Image segmentation; Algorithm; Entropy (arrow of time); Benchmark (surveying); Artificial intelligence; Fuzzy logic; Segmentation; Pattern recognition (psychology); Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01120368337668539,"gpt":0.2481261040573103,"spread":0.2369224206806249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032761,0.0001235146,0.0001232932,0.00002850671,0.0004070161,0.0003194122,0.0004956797,0.00002576578,0.00001440675],"category_scores_gemma":[0.00026521,0.00009951046,0.0000265697,0.0002862588,0.00007360168,0.0003989491,0.0007643838,0.0001977823,0.000004989132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002446604,"about_ca_system_score_gemma":0.00003368397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001755084,"about_ca_topic_score_gemma":4.436905e-8,"domain_scores_codex":[0.9988432,0.00006903945,0.0002322816,0.0003598083,0.0002607112,0.0002349468],"domain_scores_gemma":[0.9993287,0.0001321523,0.0001376986,0.0001941284,0.00008619936,0.0001211728],"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.000002610369,0.00001950599,0.00004690154,0.00002681232,0.00001344011,0.00001448386,0.001739344,0.0007086163,0.02222128,0.0002984816,0.007599386,0.9673091],"study_design_scores_gemma":[0.0001759262,0.0000775626,0.000007290909,0.0000165261,0.000005172833,0.00001536146,0.00005901336,0.9791321,0.02010706,0.0001537184,0.0001339602,0.00011638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001429165,0.0002289558,0.9951223,0.002289209,0.000135074,0.0001915496,0.000001569179,0.0004805304,0.0001216284],"genre_scores_gemma":[0.08906303,0.00001471128,0.9071226,0.00360574,0.0001565971,0.000002631828,0.000007704946,0.0000137531,0.00001326327],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9784234,"threshold_uncertainty_score":0.4057918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4296347598","doi":"10.1007/s00500-022-07417-w","title":"Application of Coulomb’s and Franklin’s laws algorithm to solve large-scale optimal reactive power dispatch problems","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Power System Optimization and Stability","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":"McMaster University","funders":"","keywords":"Benchmark (surveying); AC power; Mathematical optimization; Scale (ratio); Nonlinear system; Computer science; Power (physics); Electric power system; Algorithm; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.00413135735358549,"gpt":0.2097623373265556,"spread":0.2056309799729701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004402353,0.0001164594,0.0002012693,0.00005672804,0.0001495975,0.00001783535,0.000115749,0.00003681249,0.00004384209],"category_scores_gemma":[0.000011483,0.0001329178,0.00003836062,0.0002377097,0.00001639504,0.0000481456,0.0001647485,0.0001394393,0.000005578045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007981995,"about_ca_system_score_gemma":0.00001330954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003467936,"about_ca_topic_score_gemma":0.00000645257,"domain_scores_codex":[0.9990395,0.00003216537,0.0002831272,0.0002379636,0.000191411,0.000215815],"domain_scores_gemma":[0.9995344,0.00006355451,0.00006293934,0.0002008432,0.00006159529,0.00007665381],"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.00001172382,0.0001420116,0.006915197,0.0001168129,0.00005247247,0.000001200439,0.01738978,0.9634835,0.0006369904,0.0004447133,0.0003683291,0.01043733],"study_design_scores_gemma":[0.0002860113,0.0000501652,0.003392354,0.00001314853,0.00000728767,0.000005015951,0.001802076,0.9889142,0.00009555034,0.00003964293,0.005236813,0.0001577297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05774201,0.0001169242,0.9393184,0.00003616176,0.000244204,0.0004330659,0.00005172492,0.000179436,0.001878044],"genre_scores_gemma":[0.9633345,8.645391e-7,0.0365001,0.00003071148,0.00001680295,0.00004752737,0.00002126713,0.0000234608,0.00002477106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9055925,"threshold_uncertainty_score":0.5420229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2755736673","doi":"10.1007/s00500-017-2833-y","title":"Self-feedback differential evolution adapting to fitness landscape characteristics","year":2017,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Science and Technology Planning Project of Guangdong Province; National Natural Science Foundation of China","keywords":"Fitness landscape; Differential evolution; Mathematical optimization; Benchmark (surveying); Local optimum; Evolutionary algorithm; Computer science; Population; Unimodality; Evolutionary computation; Fitness approximation; Convergence (economics); Suite; Fitness function; Mathematics; Genetic algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02242352596207777,"gpt":0.2862679210519532,"spread":0.2638443950898754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006534946,0.000201288,0.0002816542,0.0001677899,0.001281287,0.001414648,0.00204961,0.00007926062,0.00004686756],"category_scores_gemma":[0.001044159,0.0002038892,0.00006860516,0.0002263582,0.00003959511,0.0003945318,0.001772252,0.0002564496,0.0002263362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006894961,"about_ca_system_score_gemma":0.0001222221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002030673,"about_ca_topic_score_gemma":0.000001977932,"domain_scores_codex":[0.9977438,0.0001208075,0.0003921545,0.0005779194,0.0005912633,0.0005740144],"domain_scores_gemma":[0.9977063,0.0002053873,0.0003148292,0.001160892,0.0003565308,0.0002560842],"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.00006983015,0.0005643179,0.1100046,0.0005499225,0.0002988846,0.0002151351,0.006069361,0.01187428,0.001720657,0.07110577,0.004116042,0.7934111],"study_design_scores_gemma":[0.0003294422,0.00003708668,0.06150926,0.00005087539,0.000006544365,0.00001151141,0.00001944624,0.9370502,0.00007265971,0.0001443166,0.0005342866,0.0002343938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.042493,0.00001439876,0.9535587,0.0005670116,0.00129343,0.0002409105,0.000003867969,0.000359839,0.001468797],"genre_scores_gemma":[0.7651992,0.000001882092,0.2340222,0.00004957537,0.0005014089,0.000004067792,0.00000485575,0.00001716673,0.000199698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9251759,"threshold_uncertainty_score":0.999622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066063175","doi":"10.1007/s00500-013-1064-0","title":"A study in facial regions saliency: a fuzzy measure approach","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Measure (data warehouse); Fuzzy logic; Property (philosophy); Artificial intelligence; Relevance (law); Face (sociological concept); Computer science; Fuzzy measure theory; Pattern recognition (psychology); Identification (biology); Realization (probability); Facial recognition system; Process (computing); Monotonic function; Fuzzy set; Point (geometry); Mathematics; Contrast (vision); Fuzzy classification; Data mining; Statistics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03632649678093972,"gpt":0.2593300288095609,"spread":0.2230035320286212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592759,0.0001316522,0.0001676043,0.0001497198,0.0001879976,0.0001983608,0.0005495141,0.00005821904,0.00000558602],"category_scores_gemma":[0.00007005857,0.000117744,0.00004780786,0.0005373591,0.00002107807,0.0004031628,0.0003231947,0.0002199558,0.0001760982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002900963,"about_ca_system_score_gemma":0.00004950876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001995762,"about_ca_topic_score_gemma":0.00001286895,"domain_scores_codex":[0.9985469,0.0001473417,0.0002555976,0.0004255786,0.0002942039,0.0003304058],"domain_scores_gemma":[0.9993629,0.0000735412,0.00007656834,0.0003296822,0.00007981359,0.00007747362],"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.0000152933,0.003434466,0.1316731,0.00007521952,0.00006687049,0.00009227686,0.08342985,0.005291894,0.002172833,0.007275623,0.01411261,0.7523599],"study_design_scores_gemma":[0.004717624,0.0005618554,0.2147299,0.0004274595,0.00002152358,0.00009828949,0.01514494,0.7293173,0.0003208672,0.03205434,0.0009152523,0.001690594],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6430287,0.0000411723,0.3473207,0.0003601524,0.0002827736,0.0006998002,3.605517e-7,0.0003046043,0.00796172],"genre_scores_gemma":[0.980122,4.877737e-7,0.01953403,0.0001837691,0.00007114329,0.00003295896,0.000001690041,0.000007349754,0.0000465884],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7506694,"threshold_uncertainty_score":0.4801461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019653449","doi":"10.1007/s00500-006-0064-8","title":"Neural Units with Higher-Order Synaptic Operations for Robotic Image Processing Applications","year":2006,"lang":"en","type":"article","venue":"Soft Computing","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Artificial neural network; Image processing; Routing (electronic design automation); Mobile robot; Enhanced Data Rates for GSM Evolution; Hough transform; Artificial intelligence; Process (computing); Edge detection; Robot; Computer vision; Image (mathematics); Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.01579078839412117,"gpt":0.2512396001750783,"spread":0.2354488117809572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009011185,0.0001574989,0.0001432453,0.00005526501,0.0008646007,0.0004293361,0.0005020295,0.00002990618,0.000001849332],"category_scores_gemma":[0.000007368713,0.0001366874,0.00002921936,0.001118938,0.00006797771,0.0003418356,0.0001130418,0.0001254352,0.000009455493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000255757,"about_ca_system_score_gemma":0.00008691465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003177621,"about_ca_topic_score_gemma":0.00002718304,"domain_scores_codex":[0.9988276,0.000020636,0.0002477338,0.0004226182,0.0001353534,0.0003460748],"domain_scores_gemma":[0.9989857,0.0001423425,0.00008466916,0.0003466532,0.000379828,0.00006080862],"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.000002100277,0.0000961859,0.0002107203,0.00004771503,0.00001281931,0.000002066424,0.00008103437,0.8371349,0.001500434,0.1241126,0.0006027722,0.03619659],"study_design_scores_gemma":[0.0002237611,0.00003025456,0.0006952095,0.00002555314,0.00001511144,0.00001730356,0.00001272985,0.9958144,0.0000945626,0.001407806,0.001462386,0.000200881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005471795,0.000133193,0.9908735,0.002042729,0.00006039899,0.0006606841,0.000001561987,0.0003857997,0.0003703047],"genre_scores_gemma":[0.7499238,3.738273e-7,0.2492054,0.0002325836,0.0002757567,0.0001423943,0.0000222229,0.00001701673,0.0001804697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.744452,"threshold_uncertainty_score":0.6649897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283828779","doi":"10.1007/s00500-022-07280-9","title":"Self-adaptive salp swarm algorithm for optimization problems","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Benchmark (surveying); Computer science; Tuner; Convergence (economics); Algorithm; Mathematical optimization; Population; Metaheuristic; Swarm intelligence; Range (aeronautics); Genetic algorithm; Particle swarm optimization; Mathematics; Engineering; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.02447530542027775,"gpt":0.270610781612458,"spread":0.2461354761921802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480896,0.0001922994,0.0002392076,0.0002640536,0.001104827,0.0002632103,0.001233748,0.00004225806,0.00004798352],"category_scores_gemma":[0.0001409972,0.0002165218,0.00009866281,0.001134242,0.00002981986,0.0002795185,0.001287708,0.0003052279,0.00001320958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002379619,"about_ca_system_score_gemma":0.0002625244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000100998,"about_ca_topic_score_gemma":2.326194e-7,"domain_scores_codex":[0.9972916,0.0002767687,0.0004265785,0.000680142,0.0007667417,0.0005581987],"domain_scores_gemma":[0.9982359,0.0005213761,0.0002330275,0.0004752813,0.0003963152,0.0001381321],"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.000002243024,0.0001048224,0.000008981317,0.00001830526,0.00003054919,0.000004622455,0.0007395311,0.8683136,0.00000224152,0.003555591,0.0005014261,0.1267181],"study_design_scores_gemma":[0.0006276915,0.0002163084,0.000007459057,0.000006968133,0.000007855404,0.00002615941,0.00008547997,0.9925337,0.00004261101,0.0008017555,0.005399342,0.0002446601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002033676,0.0001251305,0.9964277,0.00036676,0.0007485374,0.0009940608,0.00001508133,0.0006698435,0.000632513],"genre_scores_gemma":[0.004125965,0.000005434044,0.9949602,0.0002305647,0.0001744531,0.0001337569,0.00003356882,0.00003514132,0.0003009038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1264735,"threshold_uncertainty_score":0.8829503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018626130","doi":"10.1007/s00500-013-1195-3","title":"Enhancing differential evolution with role assignment scheme","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Benchmark (surveying); Differential evolution; A priori and a posteriori; Scheme (mathematics); Evolutionary algorithm; Computer science; Mutation; Evolutionary computation; Range (aeronautics); Process (computing); Population; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008135173854654523,"gpt":0.2314060306980333,"spread":0.2232708568433788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875776,0.0001533933,0.0001677775,0.0001317415,0.0002732273,0.0004289789,0.0006199283,0.00004641475,0.0001633374],"category_scores_gemma":[0.0001062294,0.0001285008,0.00003675884,0.0004321443,0.00004297145,0.0003954474,0.0004600256,0.0002063064,0.0002810523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001274964,"about_ca_system_score_gemma":0.0001097702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007429717,"about_ca_topic_score_gemma":0.00000206348,"domain_scores_codex":[0.9980595,0.0001140162,0.0002734397,0.0004392621,0.0006468953,0.0004668738],"domain_scores_gemma":[0.9988812,0.000155855,0.0001191226,0.0004359955,0.0002497988,0.0001580801],"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.00003620218,0.001181884,0.03496685,0.0003039945,0.0004698465,0.00006785159,0.005567286,0.09919035,0.1408839,0.1291154,0.002262109,0.5859543],"study_design_scores_gemma":[0.0003017471,0.00006042019,0.005642732,0.00003760651,0.000002685691,0.00001000033,0.00005384596,0.9906691,0.002336974,0.0006436457,0.00006894899,0.000172291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03236797,0.00003953873,0.9657285,0.0002144071,0.0001917797,0.0002777336,2.585243e-7,0.0002485912,0.000931272],"genre_scores_gemma":[0.6522681,4.886008e-7,0.347387,0.00003568398,0.0001018783,0.00001007827,0.000001811365,0.00001012579,0.0001848347],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8914788,"threshold_uncertainty_score":0.524011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2463897770","doi":"10.1007/s00500-016-2208-9","title":"A hybrid social spider optimization and genetic algorithm for minimizing molecular potential energy function","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":27,"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":"Population; Computer science; Crossover; Genetic algorithm; Mathematical optimization; Premature convergence; Maxima and minima; Algorithm; Benchmark (surveying); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01040008983217104,"gpt":0.2509893040661957,"spread":0.2405892142340247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653984,0.0001551861,0.0001611775,0.0001150428,0.0002893499,0.0001677103,0.0002332079,0.00004470637,0.000002887233],"category_scores_gemma":[0.00006543421,0.0001405926,0.00008919404,0.0001423535,0.00004321658,0.0002843646,0.0002810902,0.00004152094,0.000001317505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005006694,"about_ca_system_score_gemma":0.00006793599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006487339,"about_ca_topic_score_gemma":1.578135e-7,"domain_scores_codex":[0.998574,0.0001426584,0.0002709616,0.0004888544,0.0002320822,0.0002914105],"domain_scores_gemma":[0.9991652,0.0003307272,0.0001465307,0.0001442341,0.0001504784,0.00006283158],"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.000004871853,0.00001923708,0.000008189378,0.000006967589,0.00002302097,0.000007905503,0.00004758315,0.1977774,0.00123182,0.004117074,0.00006733732,0.7966886],"study_design_scores_gemma":[0.0006036317,0.000064642,0.0004214734,0.0000220903,0.00001667585,0.00004412363,0.000005539433,0.9826228,0.001049642,0.01475499,0.0001972148,0.000197199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01263337,0.0001234076,0.9859384,0.0004579627,0.0005538601,0.0001236325,0.00000402571,0.0001403671,0.00002498981],"genre_scores_gemma":[0.333532,0.000001695918,0.6658792,0.000258802,0.0002885999,0.000006857269,0.000004219148,0.00001529883,0.0000133228],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7964914,"threshold_uncertainty_score":0.5733199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2222736624","doi":"10.1007/s00500-015-1904-1","title":"Design of granular interval-valued information granules with the use of the principle of justifiable granularity and their applications to system modeling of higher type","year":2015,"lang":"en","type":"article","venue":"Soft Computing","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":26,"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":"National Natural Science Foundation of China","keywords":"Granular computing; Granularity; Interval (graph theory); Granular material; Computer science; Data mining; Construct (python library); Process (computing); Type (biology); Algorithm; Theoretical computer science; Mathematics; Rough set; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08329439490425301,"gpt":0.2573714754686704,"spread":0.1740770805644174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006661204,0.00009521036,0.0002230313,0.00005420397,0.00008775863,0.00003328499,0.0005215177,0.00003467158,1.142319e-7],"category_scores_gemma":[0.00003451602,0.00004926533,0.00003491701,0.0004650368,0.00008030685,0.0002297064,0.0003095325,0.00007122277,3.131505e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001587772,"about_ca_system_score_gemma":0.00007125229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001192893,"about_ca_topic_score_gemma":0.000002268442,"domain_scores_codex":[0.9990559,0.0001138826,0.0003801591,0.0001181733,0.0002172038,0.0001146791],"domain_scores_gemma":[0.9985572,0.0001265031,0.0003387148,0.0004870261,0.0004553592,0.00003515767],"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.00003902666,0.00003812072,0.0009247772,0.000308844,0.00002841882,7.220839e-8,0.004490817,0.9509546,0.0003660025,0.03945299,0.00003243303,0.003363928],"study_design_scores_gemma":[0.0001877849,0.00008898455,0.0003807407,0.000142183,0.00001639956,0.000002750915,0.0002211225,0.9973391,0.0008243721,0.0006050204,0.0001311041,0.00006042776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164127,0.00007130887,0.8828813,0.00005965754,0.00005602475,0.0004515646,0.000003938785,0.00002198178,0.00004151988],"genre_scores_gemma":[0.9132159,6.926953e-7,0.08672835,0.00003571094,0.00000814359,0.000004605666,0.000001057771,0.00000389079,0.000001671041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7968032,"threshold_uncertainty_score":0.2008982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081464336","doi":"10.1007/s00500-005-0018-6","title":"Mining fuzzy sequential patterns from quantitative transactions","year":2005,"lang":"en","type":"article","venue":"Soft Computing","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"New York Institute of Technology","funders":"National Science Council","keywords":"Computer science; Fuzzy logic; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03403399933309804,"gpt":0.2933859879958488,"spread":0.2593519886627508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001670271,0.0001300826,0.0001357357,0.00006668896,0.0003525994,0.0002379038,0.0006396514,0.00004257127,0.0000309875],"category_scores_gemma":[0.00001524029,0.000138793,0.00006606442,0.0002183778,0.00002908239,0.0004519509,0.0001006573,0.0001506564,0.0001191227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003825346,"about_ca_system_score_gemma":0.00004456667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002076722,"about_ca_topic_score_gemma":0.00004956394,"domain_scores_codex":[0.9988184,0.00004051132,0.0002550863,0.0004313484,0.0001810641,0.0002736213],"domain_scores_gemma":[0.9991172,0.0002533066,0.0001001277,0.0003913046,0.00005252121,0.00008554253],"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.000001342385,0.00008037643,0.0003344257,0.000004334773,0.00004213544,0.000004972739,0.005522138,0.004697692,0.0006771126,0.008568263,0.000362583,0.9797046],"study_design_scores_gemma":[0.0002385501,0.00002663609,0.00170186,0.00004628017,0.00001185667,0.000008300613,0.0003151171,0.9909936,0.0009480332,0.0006206406,0.0048598,0.0002293437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09914906,0.00005404596,0.898829,0.0008306011,0.0002494612,0.00006814084,0.00004180244,0.0002997681,0.0004780467],"genre_scores_gemma":[0.5320206,0.000001689267,0.4675631,0.0001728991,0.0001703294,0.000003931929,0.00001935369,0.000007478997,0.00004065327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9862959,"threshold_uncertainty_score":0.5659815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2519499874","doi":"10.1007/s00500-016-2347-z","title":"An ant-based QoS-aware routing protocol for heterogeneous wireless sensor networks","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; ANT; Quality of service; Routing protocol; Wireless sensor network; Wireless Routing Protocol; Zone Routing Protocol; Ant colony optimization algorithms; Protocol (science); Dynamic Source Routing; Distributed computing; Routing (electronic design automation); Artificial intelligence; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.02069000309019494,"gpt":0.2863988759902781,"spread":0.2657088729000832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007886968,0.0004752621,0.0004511154,0.000144166,0.0006807941,0.0003772216,0.001570515,0.0002411981,0.000006120984],"category_scores_gemma":[0.00007475579,0.0003731884,0.0002256417,0.0004764044,0.0001083221,0.0003248325,0.0003170011,0.0002215654,0.00001124772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001567704,"about_ca_system_score_gemma":0.0001201837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000125486,"about_ca_topic_score_gemma":0.0000105666,"domain_scores_codex":[0.99602,0.0002846616,0.000698933,0.001234362,0.000443867,0.001318161],"domain_scores_gemma":[0.9964293,0.001250067,0.0004675289,0.001222247,0.0003278142,0.0003030468],"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.00004416303,0.0001364173,0.001294889,0.00004019474,0.00001913798,0.00003260351,0.00008987606,0.8773236,0.001390512,0.001014941,0.0001279744,0.1184857],"study_design_scores_gemma":[0.001818667,0.0002652481,0.0001194157,0.0004391146,0.000006327742,0.00002983012,0.00001199925,0.9907393,0.005109036,0.00002947912,0.000842747,0.000588814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01711372,0.000004497538,0.9561867,0.000227109,0.000696734,0.02446507,0.000003690178,0.0012624,0.00004010334],"genre_scores_gemma":[0.9156485,1.665637e-7,0.07353341,0.0004885639,0.001312968,0.008887432,0.000006110041,0.00009061677,0.00003229703],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8985347,"threshold_uncertainty_score":0.999872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090150751","doi":"10.1007/s00500-005-0022-x","title":"The equivalence between fuzzy Mealy and fuzzy Moore machines","year":2005,"lang":"en","type":"article","venue":"Soft Computing","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":25,"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":"Fuzzy logic; Monoid; Lattice (music); Equivalence (formal languages); Computer science; Mathematics; Algebra over a field; Algorithm; Theoretical computer science; Artificial intelligence; Discrete mathematics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01615646491679636,"gpt":0.2471840537327711,"spread":0.2310275888159747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009549005,0.0001943799,0.0002419615,0.00004273502,0.0007912302,0.0004250386,0.001125977,0.00006643552,5.096705e-7],"category_scores_gemma":[0.0001043949,0.000130767,0.00006978514,0.0002416058,0.0001032691,0.0002692908,0.0006281491,0.0002194777,0.00004750139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003366771,"about_ca_system_score_gemma":0.00004009428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006420627,"about_ca_topic_score_gemma":0.00001828108,"domain_scores_codex":[0.9982169,0.0001404593,0.0003625835,0.0004440779,0.0003334001,0.0005026273],"domain_scores_gemma":[0.9983817,0.0007541229,0.0001620058,0.000502947,0.00007338868,0.000125876],"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.000003118731,0.00001004623,0.02178803,0.00001875312,0.00003031184,0.000005078377,0.00079094,0.0005142219,0.00008760196,0.08154789,0.0005362546,0.8946677],"study_design_scores_gemma":[0.002366487,0.0003338838,0.1797092,0.0003108907,0.00006407526,0.0001921961,0.000366431,0.6028193,0.0001331348,0.1794773,0.03261978,0.001607331],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3886686,0.01521673,0.454716,0.02344751,0.001829514,0.0009918287,0.000007294197,0.001695647,0.1134269],"genre_scores_gemma":[0.9909726,0.00001736431,0.007401444,0.0003570988,0.000977824,0.000004042127,7.501815e-7,0.00001010745,0.0002587556],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8930604,"threshold_uncertainty_score":0.6085583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4223541767","doi":"10.1007/s00500-022-07025-8","title":"An effective spatiotemporal deep learning framework model for short-term passenger flow prediction","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"State Key Laboratory of Rail Traffic Control and Safety; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Term (time); Beijing; Graph; Data mining; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.008982711657997097,"gpt":0.2410361557264893,"spread":0.2320534440684922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351309,0.0001454959,0.0001384839,0.0001198001,0.0004640619,0.00004890818,0.0001420223,0.00006648649,0.000007973843],"category_scores_gemma":[0.00002433666,0.0001808489,0.00007095357,0.0001354043,0.00001237485,0.0001402442,0.00007783424,0.0004491762,0.000001051189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000141443,"about_ca_system_score_gemma":0.000005376399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001756463,"about_ca_topic_score_gemma":0.000002255519,"domain_scores_codex":[0.9990849,0.0000552457,0.0001991611,0.0002429268,0.0001719322,0.000245805],"domain_scores_gemma":[0.9996368,0.00009463652,0.00003178984,0.0001539604,0.00002716544,0.00005567843],"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.000007880779,0.00002106016,0.001203692,0.0000371253,0.00002737785,0.000001007801,0.0009368508,0.7503148,0.0001914262,0.0002227753,0.0005177757,0.2465182],"study_design_scores_gemma":[0.0001449675,0.0001285371,0.002433775,0.00002130447,0.00002143593,0.000002183404,0.0001520888,0.9958522,0.00008586747,0.0002623388,0.0007324858,0.0001628292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08147664,0.00004672675,0.909601,0.00001268266,0.0005491053,0.0005370515,0.00001206612,0.007563036,0.000201713],"genre_scores_gemma":[0.9566526,0.00000410833,0.04272708,0.00003812534,0.0002331338,0.0001784325,0.0001043517,0.000052351,0.000009754121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.875176,"threshold_uncertainty_score":0.7374803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965742778","doi":"10.1007/s00500-004-0366-7","title":"Relational image compression: optimizations through the design of fuzzy coders and YUV color space","year":2004,"lang":"en","type":"article","venue":"Soft Computing","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":24,"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":"Artificial intelligence; RGB color model; RGB color space; Color space; Computer vision; Mathematics; Peak signal-to-noise ratio; Image compression; Data compression; Fuzzy logic; Computer science; Color image; Image (mathematics); Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.04014978400168424,"gpt":0.2567879225419983,"spread":0.2166381385403141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813564,0.0001166311,0.0001466321,0.00003091417,0.0004842455,0.0001021926,0.0004108466,0.00004939351,0.000004226934],"category_scores_gemma":[0.00007726417,0.00008239604,0.00003806162,0.0003148736,0.0001892344,0.0002938446,0.0003156244,0.0001391614,0.000005791531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002321638,"about_ca_system_score_gemma":0.00008728545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003236124,"about_ca_topic_score_gemma":0.000001033533,"domain_scores_codex":[0.9989904,0.00009329765,0.0002349134,0.0002623511,0.0002190649,0.0001999876],"domain_scores_gemma":[0.9989096,0.0005072664,0.0001619277,0.0002834707,0.00009724071,0.00004047584],"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.000005016409,0.00003431392,0.0000931924,0.000008192751,0.0000126259,0.000004044016,0.002532719,0.8213486,0.000124904,0.1742464,0.0005475738,0.001042397],"study_design_scores_gemma":[0.0006827122,0.00008568377,0.001381383,0.00007693972,0.00001114565,0.00005018873,0.0002283365,0.9485901,0.0002269557,0.04802832,0.0004581941,0.0001800655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001803967,0.0002599354,0.9912348,0.003568143,0.0001613925,0.000217645,0.000002179811,0.00008668944,0.002665227],"genre_scores_gemma":[0.4222082,0.00001089136,0.5774907,0.0002343089,0.00003611603,0.000001678809,0.000002187084,0.000005040323,0.00001087448],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4204042,"threshold_uncertainty_score":0.3724474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2807510164","doi":"10.1007/s00500-018-3287-6","title":"Hierarchical clustering of unequal-length time series with area-based shape distance","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":24,"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":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Cluster analysis; Series (stratigraphy); Hierarchical clustering; Measure (data warehouse); Computer science; Distance measures; Time series; Similarity measure; Similarity (geometry); Data mining; Pattern recognition (psychology); Artificial intelligence; Mathematics; Algorithm; Machine learning; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01169409314917352,"gpt":0.2163273858147028,"spread":0.2046332926655293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697114,0.0001974482,0.000338032,0.00009671009,0.0003223555,0.0001373214,0.0006522333,0.00004721408,0.00005086438],"category_scores_gemma":[0.00006253881,0.0001626031,0.00008872874,0.0006591637,0.0002691782,0.0002940783,0.0003681594,0.0001509846,0.00001874174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002775774,"about_ca_system_score_gemma":0.00007533442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001895692,"about_ca_topic_score_gemma":0.00003180876,"domain_scores_codex":[0.9983596,0.00006018876,0.0003887573,0.000452749,0.0003286585,0.0004100665],"domain_scores_gemma":[0.9987671,0.0001876526,0.0002668143,0.0004876024,0.0001950406,0.00009583306],"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.0005797268,0.0004039728,0.0282391,0.0004670295,0.0004138764,0.0001336658,0.009333484,0.234908,0.004752548,0.02825011,0.0003933834,0.6921251],"study_design_scores_gemma":[0.0002590925,0.0003440602,0.001122304,0.0001821511,0.00001097092,0.000009797042,0.00003986435,0.9963971,0.0007868676,0.000146967,0.0004833296,0.0002175032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1461039,0.00003358107,0.8517714,0.0002151645,0.00008054979,0.00006950762,0.000002514824,0.0001795951,0.001543808],"genre_scores_gemma":[0.826461,2.825629e-7,0.1732189,0.00008365266,0.0001289297,9.878311e-7,0.0000031785,0.00001459665,0.00008842475],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7614892,"threshold_uncertainty_score":0.6630764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4284881389","doi":"10.1007/s00500-022-07276-5","title":"A CEEMD-ARIMA-SVM model with structural breaks to forecast the crude oil prices linked with extreme events","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","cited_by":24,"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":"Autoregressive integrated moving average; Support vector machine; Crude oil; Econometrics; Computer science; Statistics; Artificial intelligence; Mathematics; Time series; Machine learning; Engineering; Petroleum engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03400990653379853,"gpt":0.2145152706184789,"spread":0.1805053640846804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071516,0.0002066613,0.0003197034,0.0001103332,0.0007335519,0.00009824721,0.0004864881,0.00003562703,0.00009980091],"category_scores_gemma":[0.00003374126,0.0001625044,0.00007243427,0.0003904961,0.0000385228,0.0001042969,0.0004169272,0.0003465454,0.00000518712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528042,"about_ca_system_score_gemma":0.00005185676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004178103,"about_ca_topic_score_gemma":0.0001881751,"domain_scores_codex":[0.9985032,0.00002613284,0.0004187808,0.0005209488,0.0001142372,0.0004166955],"domain_scores_gemma":[0.9990022,0.00009946632,0.0003436123,0.0004189348,0.00004548905,0.0000903169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003801131,0.0001054546,0.717278,0.00008902815,0.0001834979,0.000009390511,0.00450287,0.2267796,0.00001025602,0.02093383,0.0001724526,0.02955554],"study_design_scores_gemma":[0.0004583138,0.0001090335,0.05195896,0.00001541735,0.000007401244,0.00001651104,0.0001437395,0.9401481,5.467631e-7,0.005554222,0.00133014,0.0002576375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9398068,0.000125608,0.05375807,0.0006125858,0.0001566925,0.0002151328,0.0001052355,0.00005604452,0.005163799],"genre_scores_gemma":[0.9909285,0.000001776647,0.00784834,0.0004307285,0.00007397604,0.00002386692,0.00001905924,0.00003483424,0.0006389327],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7133685,"threshold_uncertainty_score":0.6626738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}