{"meta":{"query_hash":"40da2e1ae72f","filters":{"venue":"International Journal of Computational Intelligence and Applications"},"cohort_total":28,"direct_labels_cover":0,"predictions_cover":28,"exported":28,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/40da2e1ae72f","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Computational+Intelligence+and+Applications"},"results":[{"id":"W1963955771","doi":"10.1142/s146902680300080x","title":"MAPPING REFERENCE CODE TO IRREGULAR DSPS WITHIN THE RETARGETABLE, OPTIMIZING COMPILER COGEN(T)","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Unreachable code; Dead code; Compiler; Parallel computing; Code generation; Programming language; Code (set theory); Object code; Redundant code; Set (abstract data type); Schedule; Abstraction; Dead code elimination; Operating system","score_opus":0.041280316975775395,"score_gpt":0.30289987243902566,"score_spread":0.2616195554632503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963955771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020058,0.0004564524,0.98956126,0.006161309,0.00024523662,0.00028668862,0.000019502266,0.000030218316,0.0012335348],"genre_scores_gemma":[0.6318509,0.00009693958,0.36641598,0.0012257618,0.00017867188,0.00007958747,0.000012729985,0.000009825909,0.00012960266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997993,0.00008774608,0.0007693459,0.00030368892,0.000665873,0.00018034854],"domain_scores_gemma":[0.9973167,0.00041999304,0.0004577429,0.00027912995,0.0013558591,0.000170561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073249143,0.00016501472,0.00018153542,0.00024889616,0.00036350178,0.00027460905,0.0014339392,0.00005088123,0.000028562423],"category_scores_gemma":[0.000083468214,0.00013199328,0.00008646372,0.00061214244,0.00012940497,0.0004848761,0.00016155672,0.00028288364,0.000055175948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046153637,0.00009435235,0.00010367248,0.0000027551516,0.00007029041,0.0000034027973,0.0004838975,0.25516263,0.00016716757,0.73311627,0.00049476937,0.010296211],"study_design_scores_gemma":[0.00032867462,0.00011585153,0.002542392,0.00011328595,0.000026584285,0.001173061,0.0012723624,0.16803034,0.002159324,0.5890368,0.23471971,0.00048159657],"about_ca_topic_score_codex":0.0000067768697,"about_ca_topic_score_gemma":0.0000027380743,"teacher_disagreement_score":0.6298451,"about_ca_system_score_codex":0.000074105556,"about_ca_system_score_gemma":0.00023363293,"threshold_uncertainty_score":0.53825295},"labels":[],"label_agreement":null},{"id":"W1972768104","doi":"10.1142/s1469026811003148","title":"VIRTUAL INSTRUMENTATION BASED SYSTEMS FOR REAL-TIME PATH PLANNING OF MOBILE ROBOTS USING BIO-INSPIRED NEURAL NETWORKS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Artificial neural network; Instrumentation (computer programming); Motion planning; Robot; Path (computing); Software; Mobile robot; Artificial intelligence; Trajectory; Controller (irrigation); Real-time computing; Computer network","score_opus":0.05692463903864865,"score_gpt":0.32222581622429425,"score_spread":0.2653011771856456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972768104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021971995,0.00016925066,0.9770185,0.000040687595,0.00039564967,0.00031773947,0.000020922882,0.000025029545,0.00004023323],"genre_scores_gemma":[0.73089135,0.000020027146,0.2688088,0.00004131839,0.00016007808,0.00003890004,0.000025758833,0.000008713204,0.000005073519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983556,0.000052295643,0.0008074746,0.0002078497,0.0004329652,0.00014381319],"domain_scores_gemma":[0.99747384,0.0004116783,0.00086748716,0.0001247306,0.0010306638,0.00009162161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037725666,0.00013683384,0.00022486826,0.00029816615,0.000100706275,0.00009756452,0.0006898997,0.000060062186,0.000004457365],"category_scores_gemma":[0.000027010634,0.00013385512,0.00009297256,0.00023334373,0.0000874441,0.00048194942,0.00006401927,0.00010497691,0.0000014417102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000326924,0.00010442349,0.00059152616,0.000007678219,0.00006548126,0.0000047098147,0.0003761243,0.9725938,0.00024326067,0.009044764,0.00001964685,0.016915929],"study_design_scores_gemma":[0.00023592447,0.00024496778,0.0010278055,0.00010809217,0.000021231024,0.00010575943,0.00016377802,0.994163,0.00057996524,0.0032035795,0.00002636118,0.00011955114],"about_ca_topic_score_codex":0.000031136973,"about_ca_topic_score_gemma":6.9081466e-8,"teacher_disagreement_score":0.70891935,"about_ca_system_score_codex":0.00006406219,"about_ca_system_score_gemma":0.00014239673,"threshold_uncertainty_score":0.5458453},"labels":[],"label_agreement":null},{"id":"W1977565676","doi":"10.1142/s1469026813500065","title":"COMPARISON OF PARALLEL PARTICLE SWARM OPTIMIZERS FOR GRAPHICAL PROCESSING UNITS AND MULTICORE PROCESSORS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Microgrid Control and Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"CUDA; Computer science; Parallel computing; Speedup; Multi-core processor; Particle swarm optimization; Central processing unit; General-purpose computing on graphics processing units; Algorithm; Graphics; Computer hardware; Operating system","score_opus":0.029010985900588315,"score_gpt":0.3121473107673336,"score_spread":0.2831363248667453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977565676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089514695,0.0013955616,0.90838075,0.00036741,0.0000439801,0.00025056093,0.000008814527,0.000015332793,0.000022873148],"genre_scores_gemma":[0.95436704,0.0002796676,0.045152567,0.000038923503,0.00006992644,0.000063941865,0.000015339121,0.000008440694,0.0000041709677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991997,0.000007256198,0.00046337728,0.000079889134,0.00016923207,0.00008056614],"domain_scores_gemma":[0.9984418,0.00015917138,0.0001753888,0.00003092447,0.0011276567,0.00006505933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008040945,0.00008144335,0.00014933685,0.00009621655,0.00004798743,0.00006403195,0.0001374575,0.000036512294,0.000008747744],"category_scores_gemma":[0.00003038597,0.00007438414,0.000031565516,0.00013353916,0.00008478768,0.0002391595,0.000014274654,0.000079945436,0.0000011149399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025742516,0.000058403817,0.0011373657,0.00003643334,0.000059467053,1.4206393e-7,0.0003548474,0.8793135,0.00025477543,0.0032272441,0.00006502749,0.115467004],"study_design_scores_gemma":[0.00027483003,0.00004614942,0.0016133313,0.000044039327,0.000023413408,0.000017583998,0.00038089714,0.98387796,0.0015171868,0.011707239,0.00041652983,0.00008084701],"about_ca_topic_score_codex":0.0000033063648,"about_ca_topic_score_gemma":8.700023e-7,"teacher_disagreement_score":0.8648523,"about_ca_system_score_codex":0.000012894325,"about_ca_system_score_gemma":0.000031814325,"threshold_uncertainty_score":0.3033297},"labels":[],"label_agreement":null},{"id":"W1980383049","doi":"10.1142/s1469026804001410","title":"ROTATIONAL MATCHING PROBLEMS","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Geomagnetism and Paleomagnetism Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Guelph","funders":"","keywords":"Rotation (mathematics); Computer science; Algorithm; Fourier transform; Orientation (vector space); Function (biology); Matching (statistics); Fourier series; Mathematics; Mathematical analysis; Artificial intelligence; Geometry; Statistics","score_opus":0.014184139110601311,"score_gpt":0.28348237055719466,"score_spread":0.2692982314465934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980383049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1270257,0.0015755967,0.8682972,0.0019085247,0.00018647511,0.00014967409,0.000023729894,0.00000627742,0.0008267773],"genre_scores_gemma":[0.98166466,0.00054434733,0.016839191,0.00030940183,0.00048541647,0.000023585279,0.000054779717,0.0000073740675,0.00007122826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991546,0.000012524825,0.00033670303,0.00013270022,0.0002780937,0.000085322856],"domain_scores_gemma":[0.9990941,0.000033245182,0.00019200305,0.000057887213,0.0005640762,0.00005864573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012496041,0.00009052869,0.00008568016,0.00008954291,0.000081980856,0.000049027552,0.00023870835,0.000038756953,0.0000176261],"category_scores_gemma":[0.000022165603,0.000085727166,0.00006148027,0.00006608183,0.00009768489,0.000017902677,0.00006058172,0.00007758713,0.000012611789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000662531,0.00025687332,0.0016190268,0.000015797328,0.00025087906,0.000009220951,0.00052118587,0.83932203,0.00662711,0.087619506,0.00030508614,0.06338706],"study_design_scores_gemma":[0.0011426889,0.0007109151,0.02730546,0.00012282966,0.000050775456,0.0013406476,0.00079298764,0.0003034118,0.0072299116,0.9090199,0.05152998,0.00045047645],"about_ca_topic_score_codex":0.000009538862,"about_ca_topic_score_gemma":0.000009197084,"teacher_disagreement_score":0.854639,"about_ca_system_score_codex":0.000012433936,"about_ca_system_score_gemma":0.00009687593,"threshold_uncertainty_score":0.34958524},"labels":[],"label_agreement":null},{"id":"W1980452543","doi":"10.1142/s1469026804001409","title":"FINDING CONSERVED WELL-ORDERED RNA STRUCTURES IN GENOMIC SEQUENCES","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; U.S. Department of Health and Human Services","keywords":"Computational biology; RNA; Genome; Nucleic acid structure; Base pair; Gene; Ribozyme; Biology; Genetics; Nucleic acid secondary structure; Conserved sequence; Caenorhabditis elegans; Computer science; Base sequence","score_opus":0.022605372933047513,"score_gpt":0.30504287729074364,"score_spread":0.2824375043576961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980452543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5610201,0.0006818088,0.43683264,0.0009295503,0.00012149489,0.00013519387,0.000011396292,0.0000031904005,0.00026467317],"genre_scores_gemma":[0.98502374,0.0003581351,0.014065513,0.00025808497,0.00022660695,0.000015332007,0.000022899547,0.0000069087264,0.000022788028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00002447609,0.00036783313,0.00013934371,0.00019494361,0.000086561755],"domain_scores_gemma":[0.9993743,0.000046657522,0.00021632588,0.000061443076,0.00025232576,0.00004895479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017119455,0.00008806127,0.000099256744,0.00012917638,0.000049594833,0.000050279436,0.00029859802,0.00005611697,0.000030141722],"category_scores_gemma":[0.000034941946,0.00008307584,0.00005508947,0.00007054877,0.00007549248,0.000015143845,0.000042969124,0.00008013404,0.0000067445826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019303607,0.0001726087,0.0019156405,0.000014023836,0.00021547043,0.00002437076,0.00027345077,0.5303525,0.29939863,0.11013216,0.000055788907,0.057252374],"study_design_scores_gemma":[0.0006278915,0.000202673,0.0071043693,0.00008472683,0.000017273684,0.00044670384,0.0004938761,0.00041037693,0.3243211,0.6594865,0.006533382,0.00027116993],"about_ca_topic_score_codex":0.00002078095,"about_ca_topic_score_gemma":0.000015463256,"teacher_disagreement_score":0.5493543,"about_ca_system_score_codex":0.000030599313,"about_ca_system_score_gemma":0.00014824698,"threshold_uncertainty_score":0.33877346},"labels":[],"label_agreement":null},{"id":"W1991109541","doi":"10.1142/s1469026802000476","title":"STABILITY OF INFORMATION GRANULATION AND INFORMATION GRANULES","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; University of Alberta","funders":"","keywords":"Computer science; Stability (learning theory); Granulation; Inference; Artificial intelligence; Machine learning","score_opus":0.022794193225933925,"score_gpt":0.26571925445287364,"score_spread":0.24292506122693971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991109541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009174338,0.00019942259,0.9867248,0.0030982667,0.00009548317,0.0001780966,0.000020829173,0.000018249919,0.000490516],"genre_scores_gemma":[0.9648753,0.00055268704,0.03412699,0.00032181854,0.000084520325,0.000017894368,0.000016642853,0.0000021345722,0.0000020245816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986281,0.000026810256,0.0007490139,0.000090065376,0.00042043775,0.00008559506],"domain_scores_gemma":[0.99784434,0.00024368563,0.00059618556,0.00012406916,0.0011156221,0.00007611716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002453449,0.00009403662,0.00014343092,0.00025286598,0.00008809265,0.00017703182,0.0004584558,0.000041446976,0.000020682235],"category_scores_gemma":[0.000045183566,0.00008669896,0.000053283264,0.0002788799,0.000112258764,0.0035541586,0.00009146055,0.00011449478,0.000010910505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008284805,0.000062906314,0.00046942622,0.000014399939,0.000027841166,2.2736194e-7,0.00045178153,0.010525548,0.000032769072,0.6057215,0.0001602842,0.38252503],"study_design_scores_gemma":[0.0005788425,0.00017304564,0.014634507,0.00007733673,0.000031541935,0.00027062927,0.0003289429,0.46897835,0.0019438599,0.46747434,0.04520329,0.00030531836],"about_ca_topic_score_codex":0.000006978995,"about_ca_topic_score_gemma":7.819318e-7,"teacher_disagreement_score":0.95570093,"about_ca_system_score_codex":0.000023471062,"about_ca_system_score_gemma":0.000025920452,"threshold_uncertainty_score":0.35354808},"labels":[],"label_agreement":null},{"id":"W2000038675","doi":"10.1142/s1469026808002193","title":"SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Satisfiability; Computer science; Completeness (order theory); Propositional calculus; Boolean satisfiability problem; Mathematical optimization; Range (aeronautics); Approximation algorithm; Conjunctive normal form; Local search (optimization); Set (abstract data type); Mathematics; Theoretical computer science; Algorithm","score_opus":0.07812007125231435,"score_gpt":0.3857766504357405,"score_spread":0.30765657918342615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000038675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004602219,0.00032503568,0.9939065,0.0004643671,0.00017740461,0.00038412423,0.000008773223,0.000025925247,0.000105644096],"genre_scores_gemma":[0.5950691,0.0001480472,0.40448388,0.00009638286,0.000116131276,0.00006404561,0.0000065240392,0.000004681652,0.000011180023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986306,0.000055259618,0.0005657523,0.00017320795,0.00047048318,0.00010473016],"domain_scores_gemma":[0.9980317,0.0005709378,0.00024876295,0.000114232185,0.0009503658,0.00008402335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057848386,0.000100757126,0.00016786593,0.00023105992,0.00015716297,0.00009745694,0.00062062347,0.000043264914,0.0000030249475],"category_scores_gemma":[0.00009031058,0.00009208632,0.00006172388,0.0001510448,0.00019899149,0.0005313532,0.00011694295,0.00011640825,0.000005340468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015012272,0.00019644384,0.00014748063,0.00036169303,0.00024384969,0.000009045664,0.0010147677,0.01777983,0.0002591395,0.87388504,0.0001283013,0.105824284],"study_design_scores_gemma":[0.0010411988,0.0009223342,0.0020964232,0.0009003542,0.00007223891,0.0030509422,0.0010673543,0.8307506,0.018385414,0.13898517,0.0021874586,0.00054053124],"about_ca_topic_score_codex":0.0000057601574,"about_ca_topic_score_gemma":8.11282e-7,"teacher_disagreement_score":0.81297076,"about_ca_system_score_codex":0.00008179002,"about_ca_system_score_gemma":0.000105790896,"threshold_uncertainty_score":0.3755171},"labels":[],"label_agreement":null},{"id":"W2005599223","doi":"10.1142/s1469026814500138","title":"SOFTWARE DEVELOPMENT EFFORT ESTIMATION USING CLASSICAL AND FUZZY ANALOGY: A CROSS-VALIDATION COMPARATIVE STUDY","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Software Engineering Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Analogy; Computer science; Software; Benchmarking; Software development; Estimation; Fuzzy logic; Software sizing; Data mining; Artificial intelligence; Software engineering; Machine learning; Software construction; Systems engineering; Programming language; Linguistics","score_opus":0.0587535365511344,"score_gpt":0.39425473157658364,"score_spread":0.33550119502544923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005599223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3023415,0.000041005296,0.6971757,0.0001549731,0.000089963236,0.00015627132,0.0000015223353,0.000024892186,0.0000141816],"genre_scores_gemma":[0.78463197,0.000004863285,0.2151657,0.000033494634,0.00012242017,0.000020286661,0.000008175662,0.0000052141286,0.000007853926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833643,0.0000528108,0.00056202005,0.00024526092,0.0006779632,0.00012552577],"domain_scores_gemma":[0.9975655,0.0008770136,0.00027061475,0.00011684862,0.0010530011,0.00011701827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060896704,0.0001283781,0.00017987232,0.0003391191,0.00016750983,0.0003553483,0.00053931115,0.000041569012,0.0000042128104],"category_scores_gemma":[0.00018947643,0.0001226092,0.000034920115,0.00025213583,0.00010484256,0.0006009383,0.00017485787,0.00018456216,0.000008391209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024738927,0.00027999765,0.041421242,0.000013987627,0.00017451799,0.0000060833518,0.0016818423,0.724195,0.00003947685,0.034287512,0.000022216995,0.19785337],"study_design_scores_gemma":[0.0005199395,0.00025231118,0.18890409,0.00007294584,0.000021988173,0.0003493568,0.00019177575,0.7455424,0.0009821599,0.061523367,0.0013471062,0.00029254192],"about_ca_topic_score_codex":0.000004806838,"about_ca_topic_score_gemma":0.0000015212458,"teacher_disagreement_score":0.4822905,"about_ca_system_score_codex":0.00009697939,"about_ca_system_score_gemma":0.00015559806,"threshold_uncertainty_score":0.49998578},"labels":[],"label_agreement":null},{"id":"W2016189525","doi":"10.1142/s1469026801000068","title":"LEARNING OF FUZZY AUTOMATA","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Fuzzy logic; Generalization; Artificial intelligence; Fuzzy electronics; State (computer science); Theoretical computer science; Finite-state machine; Automaton; Neuro-fuzzy; Fuzzy control system; Algorithm; Mathematics","score_opus":0.024432313043924996,"score_gpt":0.3143575538523547,"score_spread":0.2899252408084297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016189525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010561643,0.00019262833,0.9845153,0.0032023282,0.0001101632,0.0000904919,0.0000028377794,0.000024558805,0.0013000262],"genre_scores_gemma":[0.9623243,0.00058336864,0.03663572,0.00016113117,0.00020465933,0.000013036595,0.000005866599,0.000004916087,0.00006697616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878466,0.000026361624,0.0005386537,0.00014465352,0.0004114039,0.00009425726],"domain_scores_gemma":[0.9982194,0.00028512313,0.00045464252,0.00011273204,0.0008513399,0.0000767667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021055959,0.00008600433,0.000135373,0.00018782746,0.000080444566,0.0000876847,0.0008697155,0.000031691794,0.0000138829255],"category_scores_gemma":[0.000026227557,0.000078914105,0.00007725825,0.00033102726,0.000082900464,0.00039018935,0.00012429796,0.00015725364,0.00001226091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009853564,0.0001319597,0.0007056288,0.000003342315,0.000051826708,0.0000061622222,0.00012866114,0.14623012,0.00022750821,0.5217116,0.00019044481,0.3306029],"study_design_scores_gemma":[0.00034216463,0.0002393508,0.0058176955,0.0000864897,0.000022872626,0.001122177,0.00020585884,0.2418758,0.0017908612,0.6783983,0.06984344,0.0002549501],"about_ca_topic_score_codex":0.0000056662498,"about_ca_topic_score_gemma":6.62324e-7,"teacher_disagreement_score":0.9517627,"about_ca_system_score_codex":0.000019770687,"about_ca_system_score_gemma":0.000068288384,"threshold_uncertainty_score":0.32180238},"labels":[],"label_agreement":null},{"id":"W2017351056","doi":"10.1142/s1469026815500029","title":"Collaborative Parallel Hybrid Metaheuristics on Graphics Processing Unit","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Parallel computing; Metaheuristic; Speedup; Graphics processing unit; CUDA; Parallel metaheuristic; Asynchronous communication; Simulated annealing; Instruction set; Multi-core processor; Algorithm","score_opus":0.06856806425648525,"score_gpt":0.3758262417399429,"score_spread":0.30725817748345763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017351056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023237636,0.0003827498,0.9948708,0.0029579476,0.00020811641,0.00018191617,0.00001919379,0.000026484913,0.0011204534],"genre_scores_gemma":[0.5268899,0.00034373195,0.471307,0.0008750308,0.00036475374,0.000039491268,0.000028340204,0.000014662791,0.00013706447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976573,0.000101322585,0.0006297067,0.00023166323,0.0012365682,0.00014342518],"domain_scores_gemma":[0.99286616,0.00044701938,0.00047591873,0.0001562706,0.0058021476,0.00025250463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000677082,0.00014216428,0.00018988254,0.0004839206,0.00011431213,0.00043117083,0.0011061502,0.00003614532,0.000011667683],"category_scores_gemma":[0.00035845183,0.0001275848,0.0000561303,0.0006270946,0.0001519021,0.0005800615,0.00013965904,0.00025825127,0.000034165354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003502887,0.000208121,0.000076878794,0.0000048979264,0.00008631688,0.000028945067,0.00026876858,0.40406165,0.000002017166,0.4944473,0.0008258965,0.09995418],"study_design_scores_gemma":[0.00033585928,0.00018628135,0.00022912968,0.000039075574,0.000015681422,0.00027226927,0.00019189295,0.63186616,0.00021173623,0.34113508,0.025339872,0.0001769278],"about_ca_topic_score_codex":0.0000028854631,"about_ca_topic_score_gemma":4.9057587e-7,"teacher_disagreement_score":0.5266575,"about_ca_system_score_codex":0.000059673814,"about_ca_system_score_gemma":0.00061885,"threshold_uncertainty_score":0.5202757},"labels":[],"label_agreement":null},{"id":"W2025187426","doi":"10.1142/s1469026801000044","title":"AN ENHANCED GENETIC ALGORITHM FOR SOLVING THE HIGH-LEVEL SYNTHESIS PROBLEMS OF SCHEDULING, ALLOCATION, AND BINDING","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Crossover; Scheduling (production processes); High-level synthesis; Job shop scheduling; Mathematical optimization; Parallel computing; Theoretical computer science; Algorithm; Field-programmable gate array; Routing (electronic design automation); Mathematics","score_opus":0.039363285547367025,"score_gpt":0.32164975456987827,"score_spread":0.28228646902251125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025187426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011698958,0.00028691132,0.9866822,0.0008479324,0.00009021596,0.0003360016,0.000017433447,0.000021561847,0.000018804416],"genre_scores_gemma":[0.58853287,0.00020644112,0.41098946,0.00005146652,0.00011783577,0.00008639454,0.0000036904557,0.000005529064,0.000006305049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986028,0.000043547465,0.0006534044,0.00019942965,0.00039340864,0.00010741105],"domain_scores_gemma":[0.99695915,0.00076688867,0.00059456174,0.00015826308,0.0014553573,0.000065754044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789332,0.00010916834,0.00016078234,0.00022895267,0.00014029103,0.0001701904,0.000897087,0.00004586618,0.00000365079],"category_scores_gemma":[0.00007061625,0.00008844619,0.000053289517,0.00020828661,0.00011873675,0.00046514813,0.000064920074,0.00009508737,0.0000011373882],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087314465,0.000144288,0.00016312253,0.00002090916,0.00013078924,0.0000014199915,0.0007490546,0.0678735,0.004987844,0.1435743,0.00003050466,0.78231555],"study_design_scores_gemma":[0.00017648684,0.00019850464,0.0016023335,0.00023444335,0.000035795492,0.0004048176,0.000345066,0.675431,0.039710756,0.28104922,0.00059345935,0.00021811425],"about_ca_topic_score_codex":0.00002075484,"about_ca_topic_score_gemma":0.000003421668,"teacher_disagreement_score":0.7820974,"about_ca_system_score_codex":0.000035783425,"about_ca_system_score_gemma":0.000105975516,"threshold_uncertainty_score":0.3606731},"labels":[],"label_agreement":null},{"id":"W2025201938","doi":"10.1142/s1469026805001441","title":"USING COMPETITIVE CO-EVOLUTION TO EVOLVE BETTER PATTERN RECOGNISERS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Task (project management); Software; Binary number; Artificial intelligence; Reliability (semiconductor); Base (topology); Pattern recognition (psychology); Arithmetic","score_opus":0.03700165440096965,"score_gpt":0.3397540574526187,"score_spread":0.3027524030516491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025201938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055589573,0.00014518603,0.9845346,0.0086260615,0.00015265634,0.00017667741,0.000034792414,0.000030922663,0.0007400977],"genre_scores_gemma":[0.6940048,0.000034484867,0.3038094,0.0013602438,0.0006947556,0.00003343711,0.000016389882,0.0000086991595,0.000037817248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982958,0.00003913846,0.00062947813,0.00028277028,0.0005808673,0.00017196075],"domain_scores_gemma":[0.99780977,0.00022071468,0.0003491388,0.0001643221,0.0012684506,0.00018759539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026651702,0.00015181546,0.00016532977,0.0003788958,0.00018476571,0.00017570032,0.0009162451,0.000051577365,0.00004208509],"category_scores_gemma":[0.00002207783,0.0001532097,0.00010111426,0.0003435769,0.000090408896,0.0007750137,0.00013720727,0.00018681263,0.00011547045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013851871,0.00031696114,0.0009020627,0.00000464168,0.00013140446,0.00000585731,0.0005132271,0.20971791,0.0004085762,0.28099915,0.0007552872,0.50623107],"study_design_scores_gemma":[0.0006282615,0.00023086235,0.011204345,0.00016823622,0.00005232821,0.0011410104,0.00065990334,0.6292372,0.002199264,0.20465837,0.14908978,0.00073045195],"about_ca_topic_score_codex":0.000014200531,"about_ca_topic_score_gemma":0.000004192669,"teacher_disagreement_score":0.6884458,"about_ca_system_score_codex":0.00022201326,"about_ca_system_score_gemma":0.00016896875,"threshold_uncertainty_score":0.624771},"labels":[],"label_agreement":null},{"id":"W2062972627","doi":"10.1142/s1469026806002039","title":"A MEMETIC ALGORITHM FOR PERFORMING MEMORY ASSIGNMENT IN DUAL-BANK DSPS","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Memetic algorithm; Digital signal processing; Compiler; Memory bandwidth; Digital signal processor; Interleaved memory; Computer memory; Semiconductor memory; Algorithm; Computer hardware; Local search (optimization); Programming language","score_opus":0.01913398475210874,"score_gpt":0.30741256709045095,"score_spread":0.2882785823383422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062972627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007212806,0.00027415782,0.9970271,0.0011642037,0.00014947135,0.00022918159,0.0000066255757,0.00003358709,0.00039437183],"genre_scores_gemma":[0.46969378,0.000053005853,0.5296625,0.00018767593,0.00025514295,0.000057566987,0.000013494899,0.0000062385125,0.00007060946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985678,0.0000322513,0.00065267674,0.00019787993,0.00041481375,0.00013453947],"domain_scores_gemma":[0.9984037,0.0003772958,0.0003489853,0.00009717296,0.0007229509,0.00004988847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051299174,0.00011263226,0.00015457645,0.00038533699,0.00008973962,0.0001530955,0.00046142662,0.00004367614,0.000006255248],"category_scores_gemma":[0.000025004429,0.00010973485,0.000079325444,0.00023380698,0.000052733183,0.0003587442,0.00008402054,0.00012205035,0.0000033678161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069298776,0.00019243968,0.00010584271,0.000005532167,0.000029275092,0.000008737379,0.00012669318,0.5015359,0.00003947881,0.11137165,0.00033320163,0.3862443],"study_design_scores_gemma":[0.00023497274,0.00006925826,0.0004588329,0.000045891593,0.000006239246,0.00018397724,0.000046042467,0.7528172,0.0014218867,0.24160136,0.0029832614,0.00013104221],"about_ca_topic_score_codex":0.000017354763,"about_ca_topic_score_gemma":0.0000023577434,"teacher_disagreement_score":0.4689725,"about_ca_system_score_codex":0.000087744884,"about_ca_system_score_gemma":0.00011431076,"threshold_uncertainty_score":0.44748572},"labels":[],"label_agreement":null},{"id":"W2072651133","doi":"10.1142/s1469026802000567","title":"AN INTELLIGENT HYBRID APPROACH FOR CONTENT-BASED IMAGE RETRIEVAL","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Feature extraction; Multilayer perceptron; Image retrieval; Benchmark (surveying); Feature (linguistics); Content-based image retrieval; Image (mathematics); Perceptron; Data mining","score_opus":0.07467256335619954,"score_gpt":0.32671286339339284,"score_spread":0.2520403000371933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072651133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039340212,0.00028095738,0.9967009,0.0019014856,0.00012736215,0.00034695328,0.000031795094,0.00006528835,0.00015190028],"genre_scores_gemma":[0.47495347,0.000124795,0.5240055,0.00053871976,0.00023284914,0.000044550627,0.000037017704,0.000010136591,0.000052994223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982629,0.000045772238,0.00068747473,0.00028698132,0.0005632395,0.000153665],"domain_scores_gemma":[0.99663854,0.00028976004,0.00046808092,0.0002166862,0.0022336685,0.00015328728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004179786,0.00015195832,0.00018507217,0.0002970808,0.00013373923,0.00035212998,0.0010808021,0.000046925536,0.00003171958],"category_scores_gemma":[0.00007881841,0.00013835439,0.00014639647,0.00023291215,0.00014829404,0.00079771015,0.00005217646,0.00015760015,0.0000098681685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015995021,0.0021469444,0.00011289645,0.00004900317,0.00022045267,0.000017144945,0.00037976642,0.011678162,0.010707209,0.5407203,0.0006706703,0.4331375],"study_design_scores_gemma":[0.00031591608,0.0003354295,0.00010382334,0.00002600563,0.000021624048,0.00027134747,0.00014872788,0.78740114,0.13908088,0.06520926,0.006828621,0.0002572285],"about_ca_topic_score_codex":0.000001956364,"about_ca_topic_score_gemma":8.426508e-8,"teacher_disagreement_score":0.775723,"about_ca_system_score_codex":0.00007269493,"about_ca_system_score_gemma":0.0000741318,"threshold_uncertainty_score":0.5641928},"labels":[],"label_agreement":null},{"id":"W2073912270","doi":"10.1142/s1469026814500084","title":"PARALLEL HYBRID METAHEURISTIC ON SHARED MEMORY SYSTEM FOR REAL-TIME UAV PATH PLANNING","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Parallel computing; Particle swarm optimization; Metaheuristic; Multi-core processor; Parallel algorithm; Genetic algorithm; Speedup; Path (computing); Shared memory; Mathematical optimization; Algorithm","score_opus":0.031873828696133574,"score_gpt":0.3112131873067623,"score_spread":0.2793393586106287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073912270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071710185,0.000071237766,0.9967227,0.0009102572,0.0003616483,0.00023196598,0.000032543976,0.000062018014,0.0008905342],"genre_scores_gemma":[0.53639877,0.000016221904,0.46240798,0.00028526288,0.00067533914,0.0000720922,0.000044865305,0.000014160321,0.00008534599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982256,0.00006479574,0.0006572719,0.00028486742,0.0005999901,0.00016742315],"domain_scores_gemma":[0.99689066,0.0013246742,0.0005614402,0.00018295647,0.000906462,0.00013379831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006217584,0.00016078632,0.00024664457,0.0002706192,0.00015354947,0.00023011929,0.0010362965,0.000038934573,0.000004128552],"category_scores_gemma":[0.00012644238,0.00014784507,0.00011409021,0.00013105929,0.000055749955,0.0003167157,0.000081066195,0.00014668524,0.000045641467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035434394,0.00008956249,0.000037110214,0.000017962813,0.00011617093,0.000015811484,0.00018468649,0.8339019,0.000059022375,0.12623441,0.0013643312,0.03794363],"study_design_scores_gemma":[0.0003005247,0.00019337957,0.0005111257,0.00019743398,0.000023911765,0.00035738156,0.00005728295,0.94076467,0.00031962385,0.054893702,0.0022008806,0.00018009436],"about_ca_topic_score_codex":0.0000041605854,"about_ca_topic_score_gemma":2.9711293e-8,"teacher_disagreement_score":0.53568166,"about_ca_system_score_codex":0.000085705484,"about_ca_system_score_gemma":0.00010431961,"threshold_uncertainty_score":0.6028947},"labels":[],"label_agreement":null},{"id":"W2076906193","doi":"10.1142/s1469026805001611","title":"A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Bounded function; Genetic algorithm; Algorithm; Mathematical optimization; Network planning and design; Constraint (computer-aided design); Ring (chemistry); Enhanced Data Rates for GSM Evolution; Mathematics; Artificial intelligence; Machine learning; Computer network","score_opus":0.01981469221337038,"score_gpt":0.28029369089475836,"score_spread":0.26047899868138796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076906193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078458106,0.0007221306,0.99772453,0.00023054013,0.000053332526,0.00040186796,0.0000157124,0.000027062983,0.0000402311],"genre_scores_gemma":[0.6695532,0.00028544586,0.32963264,0.000076863,0.0003192764,0.000106730324,0.000005762072,0.000012206894,0.000007842713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991878,0.000012517319,0.0004069629,0.00008117067,0.00021905899,0.000092492126],"domain_scores_gemma":[0.9984161,0.0006395021,0.00017361913,0.00006579153,0.0006623922,0.000042558884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017048598,0.000098887125,0.00012290056,0.00011506641,0.00005963759,0.000054060434,0.0003095524,0.00003204492,0.000012619855],"category_scores_gemma":[0.00001012414,0.00007290301,0.000051938838,0.00012267996,0.000091588256,0.00012035452,0.000013249106,0.00010919543,0.0000013327331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015711015,0.000025864683,0.000018742856,0.0000024932087,0.0001090668,5.4589185e-7,0.00006048413,0.69899005,0.000072701645,0.0022810595,0.00013359921,0.2982897],"study_design_scores_gemma":[0.00020834892,0.0000749222,0.00024665226,0.00003558572,0.00003703747,0.00013946427,0.000052298703,0.98225725,0.0021066992,0.011959791,0.0027948127,0.000087127395],"about_ca_topic_score_codex":0.0000033381634,"about_ca_topic_score_gemma":0.0000019746694,"teacher_disagreement_score":0.66876864,"about_ca_system_score_codex":0.000037153968,"about_ca_system_score_gemma":0.000043469354,"threshold_uncertainty_score":0.29728982},"labels":[],"label_agreement":null},{"id":"W2131490916","doi":"10.1142/s1469026801000251","title":"BOOK REVIEW: \"PATTERN CLASSIFICATION\", R. O. DUDA, P. E. HART and D. G. STORK, Second Edition","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":147,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Stork; Computer science; Library science; Artificial intelligence; Ecology","score_opus":0.020080835731399176,"score_gpt":0.2923169523086721,"score_spread":0.2722361165772729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131490916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005331901,0.021351593,0.94037044,0.025691018,0.00026298247,0.00048658438,0.000036761994,0.000035948815,0.006432769],"genre_scores_gemma":[0.88288814,0.06272142,0.010489256,0.03749378,0.0014701815,0.00007955291,0.00017982622,0.00004629484,0.004631564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986183,0.000035447683,0.0005344432,0.00022233061,0.00047764162,0.000111820525],"domain_scores_gemma":[0.9989509,0.00017776298,0.00036979007,0.0001241101,0.0002478554,0.00012959761],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025656197,0.0001273257,0.00015299922,0.00009374467,0.00014181378,0.00007626991,0.00027611124,0.000046094985,0.0019024562],"category_scores_gemma":[0.000029977988,0.000117511656,0.000062937856,0.00017677908,0.00022118076,0.00037607265,0.000071366434,0.000175312,0.00015813792],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025391259,0.00027485102,0.002851349,0.000035945395,0.00011034974,0.000012554422,0.0002545245,0.005345212,0.0005005653,0.002727434,0.3892542,0.5986076],"study_design_scores_gemma":[0.00011298643,0.000036916168,0.015803779,0.00012050326,0.000029981731,0.0006833656,0.00007151137,0.0063790544,0.00012092807,0.008579985,0.96791613,0.00014484258],"about_ca_topic_score_codex":0.000013569742,"about_ca_topic_score_gemma":0.000007062787,"teacher_disagreement_score":0.9298812,"about_ca_system_score_codex":0.00007717824,"about_ca_system_score_gemma":0.000029301378,"threshold_uncertainty_score":0.99900997},"labels":[],"label_agreement":null},{"id":"W2146234362","doi":"10.1142/s146902680400129x","title":"EVALUATION OF SELECTING INTERVAL VALUES OF INPUT VARIABLES IN CONNECTIONIST NETWORKS","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Connectionism; Variable (mathematics); Selection (genetic algorithm); Interval (graph theory); Artificial neural network; Feature selection; Entropy (arrow of time); Value (mathematics); Artificial intelligence; Principle of maximum entropy; Backpropagation; Data mining; Machine learning; Mathematics","score_opus":0.03888642290138364,"score_gpt":0.3370188435194664,"score_spread":0.29813242061808276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146234362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04697128,0.00042341833,0.95116234,0.00078401587,0.00016302054,0.00020125658,0.0000044301523,0.0000091767415,0.0002810453],"genre_scores_gemma":[0.9703013,0.00014859573,0.02929617,0.00006169781,0.00015048454,0.00002657849,0.0000063569364,0.0000054050333,0.00000343917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979519,0.00007974334,0.0009051235,0.00018130473,0.0007764081,0.00010549997],"domain_scores_gemma":[0.9961526,0.00036958288,0.00074108574,0.00012668253,0.0025584942,0.00005159298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012594281,0.000103390375,0.0002046276,0.00030425115,0.00006334494,0.00006546191,0.00065549917,0.000049837032,0.00000886431],"category_scores_gemma":[0.00010015355,0.00010087254,0.00008313436,0.00056293455,0.00011674098,0.00041017155,0.00009806797,0.00017255564,0.0000011183057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073635515,0.00017996645,0.0003587013,0.0000043375694,0.000052342133,6.052613e-7,0.00017271236,0.76968604,0.00014794011,0.17739815,0.000010197075,0.051981617],"study_design_scores_gemma":[0.00040557105,0.00010566298,0.003591923,0.0001601275,0.000035572546,0.00011208538,0.0001474324,0.4641647,0.002751064,0.52829874,0.000121827885,0.00010526489],"about_ca_topic_score_codex":0.00005405191,"about_ca_topic_score_gemma":0.000016409806,"teacher_disagreement_score":0.92333,"about_ca_system_score_codex":0.00010944827,"about_ca_system_score_gemma":0.00028354215,"threshold_uncertainty_score":0.41134626},"labels":[],"label_agreement":null},{"id":"W2182089961","doi":"10.1142/s1469026816500231","title":"A Multi-Phase Hybrid Metaheuristics Approach for the Exam Timetabling","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Metaheuristic; Tabu search; Simulated annealing; Hill climbing; Benchmarking; Benchmark (surveying); Heuristic; Mathematical optimization; Phase (matter); Algorithm; Artificial intelligence; Mathematics","score_opus":0.22335092826562866,"score_gpt":0.46226281228403093,"score_spread":0.23891188401840227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182089961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014375981,0.00064205896,0.99345964,0.003699779,0.0003021772,0.00024436248,0.00012357204,0.000012549204,0.00007826622],"genre_scores_gemma":[0.7184071,0.000136233,0.28029555,0.00021946084,0.0005111721,0.00005883926,0.000008868072,0.000008791813,0.00035400342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976112,0.00006680163,0.0009516991,0.00024866094,0.0009686971,0.00015290431],"domain_scores_gemma":[0.9894255,0.0065944064,0.0006446794,0.00020010318,0.003025019,0.000110340865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024487118,0.00011959802,0.00020437324,0.00033412044,0.00028077132,0.0002762821,0.0010932048,0.00003251413,0.000058701695],"category_scores_gemma":[0.0023510347,0.000062369254,0.0002035277,0.0002997335,0.00023278933,0.000299443,0.000079326186,0.000119965865,0.000036161804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012405832,0.0006878806,0.00027847194,0.0000029156106,0.000447408,0.0000027995839,0.00015408108,0.14866105,0.00043799248,0.08432412,0.0017893878,0.76308984],"study_design_scores_gemma":[0.0014262178,0.00013946163,0.0013648564,0.000037240054,0.00018753916,0.00055901957,0.000555074,0.5415437,0.001359015,0.35652775,0.09604318,0.00025696828],"about_ca_topic_score_codex":0.0000032863084,"about_ca_topic_score_gemma":5.832017e-7,"teacher_disagreement_score":0.7628329,"about_ca_system_score_codex":0.000034972272,"about_ca_system_score_gemma":0.0001582206,"threshold_uncertainty_score":0.28145778},"labels":[],"label_agreement":null},{"id":"W2198849238","doi":"10.1142/s1469026815500248","title":"A Soft Sensor Based on the Integration of Tikhonov Extreme Learning Machine and Accelerated Kernels for Real-Time Estimation of Automotive Catalyst Temperatures","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automotive industry; Computer science; Automotive engine; Tikhonov regularization; Mechatronics; Soft sensor; Artificial neural network; Transient (computer programming); Generalization; Artificial intelligence; Automotive engineering; Inverse problem; Process (computing)","score_opus":0.05362392772180808,"score_gpt":0.33251914412235045,"score_spread":0.2788952164005424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198849238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033559512,0.000058086647,0.9631632,0.0027858294,0.00005329187,0.00019627722,0.000019493338,0.000016031156,0.00014826712],"genre_scores_gemma":[0.9538346,0.000017735536,0.045843855,0.00011449436,0.000059725564,0.000018179664,0.000046956702,0.000006175216,0.000058296046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879456,0.00008597767,0.0004929278,0.00015127791,0.000402626,0.000072634146],"domain_scores_gemma":[0.9965033,0.0010302451,0.0005927807,0.00009600225,0.0017168281,0.00006085559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435182,0.00010736741,0.00016893014,0.00022289797,0.00008702291,0.00009544797,0.00037124348,0.00003612931,0.000006287095],"category_scores_gemma":[0.00042747273,0.000078061625,0.00005892079,0.00020974874,0.0000957837,0.000224031,0.000044641165,0.00014164232,0.0000021277062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008531103,0.00013309241,0.0002146348,0.000011422734,0.000063435844,8.8697493e-7,0.0008631169,0.9014744,0.00087793666,0.03788863,0.00013518236,0.058251955],"study_design_scores_gemma":[0.00022921844,0.00022554329,0.00096182653,0.00007986905,0.00001482613,0.000033372366,0.00016303777,0.97415257,0.0038689726,0.019974643,0.00022437949,0.00007174626],"about_ca_topic_score_codex":0.00004228882,"about_ca_topic_score_gemma":0.000001140253,"teacher_disagreement_score":0.9202751,"about_ca_system_score_codex":0.00003214887,"about_ca_system_score_gemma":0.0001499569,"threshold_uncertainty_score":0.31832606},"labels":[],"label_agreement":null},{"id":"W2322038820","doi":"10.1142/s1469026816500012","title":"A PSO-Based Approach with Fuzzy Obstacle Avoidance for Cooperative Multi-Robots in Unknown Environments","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Obstacle avoidance; Computer science; Robot; Smoothness; Fuzzy logic; Trajectory; Task (project management); Artificial intelligence; Obstacle; Field (mathematics); Motion planning; Robotics; Key (lock); Collision avoidance; Mobile robot; Engineering; Mathematics","score_opus":0.030939680617800957,"score_gpt":0.2919958861651228,"score_spread":0.26105620554732184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322038820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001815118,0.00014475077,0.99558926,0.0017586643,0.00009138188,0.00047294796,0.00004916147,0.00001311151,0.00006558168],"genre_scores_gemma":[0.8586276,0.000021107197,0.14077206,0.00019457705,0.000082238315,0.00019931886,0.000015579253,0.000008444219,0.00007907054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846286,0.00005401024,0.00056626933,0.00029464735,0.00045664705,0.00016556651],"domain_scores_gemma":[0.99826574,0.00054044934,0.00040532512,0.00014638262,0.0005449577,0.00009716875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029713503,0.00014992904,0.00019644678,0.00021300909,0.00007359619,0.000121508325,0.00081081194,0.00004447983,0.0000031482293],"category_scores_gemma":[0.00005529314,0.00010534477,0.00006467896,0.00019952934,0.00011554099,0.0005293344,0.000050954895,0.00009666561,0.000009519743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012941907,0.00080075004,0.0015949367,0.000012617488,0.00015233202,0.000009992104,0.0002613658,0.71920127,0.00083976047,0.1817451,0.00005860664,0.09519388],"study_design_scores_gemma":[0.0059923707,0.00049188366,0.011184434,0.00046226566,0.0000351333,0.00027810043,0.00025795298,0.92774147,0.0046107434,0.034338433,0.01393007,0.0006771182],"about_ca_topic_score_codex":0.000004990398,"about_ca_topic_score_gemma":0.0000052128844,"teacher_disagreement_score":0.8568125,"about_ca_system_score_codex":0.00014764897,"about_ca_system_score_gemma":0.00017009822,"threshold_uncertainty_score":0.42958352},"labels":[],"label_agreement":null},{"id":"W2512972094","doi":"10.1142/s1469026816500176","title":"A New Parallel GA-Based Method for Constraint Satisfaction Problems","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Crossover; Computer science; Heuristic; Mathematical optimization; Solver; Constraint satisfaction; Computation; Constraint (computer-aided design); Constraint programming; Local consistency; Genetic algorithm; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.030263103537537,"score_gpt":0.3294731553865745,"score_spread":0.2992100518490375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512972094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062285435,0.00006152311,0.9878145,0.011316883,0.00026487088,0.00030662652,0.00001980777,0.000036666384,0.000116839656],"genre_scores_gemma":[0.2513592,0.00006230406,0.747825,0.00043626997,0.00020006677,0.000043257915,0.000006082777,0.0000066778753,0.000061115315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986451,0.000037979644,0.00058114604,0.0002233389,0.00039044092,0.00012198488],"domain_scores_gemma":[0.99741304,0.0007929339,0.00045813873,0.00011133714,0.0010831947,0.00014133197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033205698,0.00012342277,0.00014791681,0.00027804973,0.000090659276,0.00015239375,0.0004148277,0.000053493568,0.00007144955],"category_scores_gemma":[0.00007808574,0.000095332216,0.000114453236,0.00016371129,0.00006405139,0.00053063536,0.00003696722,0.00007785618,0.0000110485225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017512075,0.000024767034,0.00030490372,0.0000035321154,0.00004569429,7.1974324e-7,0.000048520877,0.09940838,0.00019169648,0.2588877,0.00027498047,0.6407916],"study_design_scores_gemma":[0.0014547075,0.00022749143,0.005298041,0.00015831283,0.00003397352,0.00041816384,0.00006720078,0.30280516,0.0015518639,0.65965223,0.027987855,0.0003449992],"about_ca_topic_score_codex":0.000011670292,"about_ca_topic_score_gemma":0.000009942204,"teacher_disagreement_score":0.6404466,"about_ca_system_score_codex":0.00008406737,"about_ca_system_score_gemma":0.00039116605,"threshold_uncertainty_score":0.38875347},"labels":[],"label_agreement":null},{"id":"W2791361378","doi":"10.1142/s1469026818500025","title":"Focus Group: An Optimization Algorithm Inspired by Human Behavior","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Shahid Rajaee Teacher Training University","keywords":"Computer science; Benchmark (surveying); Evolutionary algorithm; Genetic algorithm; Focus (optics); Mathematical optimization; Algorithm; Optimization problem; Optimization algorithm; Meta-optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03366772749157315,"score_gpt":0.3608316276317359,"score_spread":0.3271639001401627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791361378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040299175,0.00012210068,0.9978684,0.00074422685,0.0002327199,0.00024149299,0.000032288215,0.000044228404,0.00031156148],"genre_scores_gemma":[0.2451136,0.00010231126,0.7535673,0.00028466733,0.00065415294,0.00006692931,0.00011365341,0.000017115475,0.00008029005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977195,0.0000946395,0.0007449507,0.00032068853,0.0009438733,0.0001763082],"domain_scores_gemma":[0.99626964,0.00015267324,0.00045577277,0.00022668768,0.0026696548,0.00022554626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048578143,0.00015485346,0.0001762852,0.00040350188,0.00025895808,0.0004548098,0.0014244854,0.00006951829,0.00015151208],"category_scores_gemma":[0.000049900664,0.00015246039,0.000064790336,0.00044008487,0.00024984367,0.0011476581,0.00017650115,0.00018838194,0.000024679961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012662276,0.00077253295,0.0001322849,0.0000031138356,0.000100023266,0.000014114351,0.0002885039,0.071022965,0.00024037683,0.112478726,0.00076283264,0.81417185],"study_design_scores_gemma":[0.00033195267,0.0004376253,0.00039967953,0.000019057587,0.000020598214,0.00026507687,0.00007176557,0.9452462,0.0011784087,0.045512956,0.0062802825,0.00023638963],"about_ca_topic_score_codex":0.000021860658,"about_ca_topic_score_gemma":0.0000027564045,"teacher_disagreement_score":0.87422323,"about_ca_system_score_codex":0.00007687769,"about_ca_system_score_gemma":0.00011206957,"threshold_uncertainty_score":0.6217154},"labels":[],"label_agreement":null},{"id":"W2808950187","doi":"10.1142/s1469026818500104","title":"A Strength Pareto Evolutionary Algorithm for Optimizing System-On-Chip Test Schedules","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Pareto principle; Evolutionary algorithm; System on a chip; Chip; Pareto optimal; Scheduling (production processes); Embedded system; Parallel computing; Multi-objective optimization; Mathematical optimization; Artificial intelligence; Machine learning","score_opus":0.03092966379209095,"score_gpt":0.3078852919468777,"score_spread":0.27695562815478675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808950187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011793217,0.0001840262,0.99674904,0.0008242757,0.00031400376,0.00017250149,0.000046551908,0.000049874103,0.00048039173],"genre_scores_gemma":[0.72091216,0.000022305629,0.27772126,0.00024032613,0.0010309349,0.000037073278,0.000013672082,0.000007901956,0.000014380785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851936,0.000024364625,0.00056286197,0.00025569697,0.00047416342,0.00016357681],"domain_scores_gemma":[0.9965138,0.0010925826,0.00040980542,0.00013369194,0.0017333702,0.00011678755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029934535,0.0001388113,0.00016140747,0.0002820945,0.00027232603,0.00021223119,0.00087328255,0.000046707013,0.0000053459858],"category_scores_gemma":[0.00013111395,0.00012913329,0.00010342398,0.00023514451,0.00013475318,0.00041187843,0.00008625209,0.00013713774,0.000023838018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025936943,0.00017771163,0.0002464786,0.000010016583,0.00008179376,0.0000061426913,0.00014132734,0.0136192925,0.000048438695,0.37020662,0.00018666242,0.61527294],"study_design_scores_gemma":[0.0002616851,0.0003679535,0.0009736349,0.00022990105,0.000018855744,0.0004397432,0.00038119542,0.9033441,0.00078171655,0.089810275,0.0031822186,0.00020875434],"about_ca_topic_score_codex":0.0000037272935,"about_ca_topic_score_gemma":8.5081825e-7,"teacher_disagreement_score":0.8897248,"about_ca_system_score_codex":0.000094382565,"about_ca_system_score_gemma":0.00017798795,"threshold_uncertainty_score":0.5265902},"labels":[],"label_agreement":null},{"id":"W2904101610","doi":"10.1142/s1469026818500220","title":"Multidirectional Grey Wolf Optimizer Algorithm for Solving Global Optimization Problems","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Minimax; Heuristics; Algorithm; Integer programming; Integer (computer science); Local search (optimization); Convergence (economics); Search algorithm; Mathematics","score_opus":0.035359440985362985,"score_gpt":0.348958549445557,"score_spread":0.313599108460194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904101610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032418407,0.00018676551,0.9966131,0.0015818635,0.00065710925,0.00043328924,0.000055376422,0.000047542668,0.0003925452],"genre_scores_gemma":[0.0232558,0.00016640394,0.975031,0.00030307533,0.0009824737,0.00010021997,0.000041762927,0.000012937127,0.00010632749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770695,0.000047202935,0.0008085579,0.00035250277,0.0008636136,0.00022119649],"domain_scores_gemma":[0.9927086,0.000463635,0.0005189104,0.00016823043,0.005961633,0.00017894946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006516859,0.00017314598,0.0002094386,0.0003128351,0.00027098734,0.00045433655,0.0010812962,0.00007596822,0.00008126048],"category_scores_gemma":[0.00021950074,0.00016780214,0.0001206548,0.0005230321,0.00021985552,0.0008732214,0.00018486929,0.00014310451,0.00002082251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138815785,0.00013866692,0.000050666036,0.0000050844224,0.00011154623,0.0000018071311,0.000094404924,0.63715214,0.0000066414573,0.04286236,0.00035644768,0.31920636],"study_design_scores_gemma":[0.00034275436,0.0001350696,0.00012426267,0.000032574913,0.000013738204,0.00023291842,0.000037933747,0.94282,0.00019973543,0.050624415,0.0052823946,0.00015416628],"about_ca_topic_score_codex":0.000008366419,"about_ca_topic_score_gemma":0.0000016499152,"teacher_disagreement_score":0.3190522,"about_ca_system_score_codex":0.00014924863,"about_ca_system_score_gemma":0.00032171584,"threshold_uncertainty_score":0.68427724},"labels":[],"label_agreement":null},{"id":"W3043139694","doi":"10.1142/s1469026820500108","title":"A Novel Nature-Inspired Technique Based on Mushroom Reproduction for Constraint Solving and Optimization","year":2020,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Reproduction; Optimization problem; Set (abstract data type); Computation; Process (computing); Mushroom; Algorithm; Mathematics; Ecology; Biology","score_opus":0.02621352050204756,"score_gpt":0.2998587408069799,"score_spread":0.2736452203049323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043139694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008643018,0.00007428039,0.984416,0.014653201,0.00016362006,0.00042954803,0.000020861062,0.00004416869,0.00011190898],"genre_scores_gemma":[0.4945905,0.000044422934,0.50369036,0.0014102951,0.00018919073,0.00004826007,0.000018398874,0.000006203023,0.0000023634875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987608,0.000022379747,0.00048307446,0.00030863026,0.0003360868,0.00008901817],"domain_scores_gemma":[0.9980929,0.00032170519,0.00039210435,0.00009877568,0.0009817642,0.00011278225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028692576,0.000121587036,0.00014126125,0.00022513031,0.00012800674,0.0001943059,0.00031181882,0.00008101869,0.00001196868],"category_scores_gemma":[0.00022803388,0.0001217707,0.00006593945,0.00022619597,0.00009245372,0.0003991787,0.00004467658,0.000202921,0.0000011328668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034907614,0.000059419835,0.000046968285,0.000010281259,0.000026888983,9.795048e-7,0.00010251543,0.83112574,0.00034550353,0.08379485,0.00004676351,0.08440518],"study_design_scores_gemma":[0.00032456897,0.00014894031,0.00022738737,0.00004848078,0.000011685935,0.00013091558,0.00006359536,0.98606926,0.0016359858,0.009266056,0.0019452424,0.00012789898],"about_ca_topic_score_codex":0.0000014584496,"about_ca_topic_score_gemma":4.4548182e-7,"teacher_disagreement_score":0.49450406,"about_ca_system_score_codex":0.000045907855,"about_ca_system_score_gemma":0.00015185522,"threshold_uncertainty_score":0.4965665},"labels":[],"label_agreement":null},{"id":"W3208450211","doi":"10.1142/s1469026821500218","title":"FUSIONET: A Hybrid Model Towards Image Classification","year":2021,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Classifier (UML); Contextual image classification; Pattern recognition (psychology); Image (mathematics); Pixel; Feature (linguistics); Representation (politics); Object (grammar); Computer vision","score_opus":0.043508501505956886,"score_gpt":0.35739888948820725,"score_spread":0.3138903879822504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208450211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007095236,0.00046773517,0.99358475,0.0038829995,0.00010770866,0.000089614674,0.000014591332,0.00004281388,0.0011002822],"genre_scores_gemma":[0.5318788,0.0008565689,0.4662978,0.00066370174,0.00016054446,0.000017119812,0.000019396144,0.00000704992,0.000098974844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985429,0.000031136966,0.0005376572,0.0002333692,0.00054378214,0.0001111457],"domain_scores_gemma":[0.9967996,0.00014150477,0.000340054,0.00018014322,0.0024395538,0.000099145545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002197129,0.00011314647,0.00014634406,0.00018256891,0.000095739815,0.00023939283,0.0007447438,0.000033810025,0.000019889258],"category_scores_gemma":[0.00009776904,0.00010870837,0.0000975081,0.00026411092,0.0000839912,0.00093970227,0.00019071136,0.0001766366,0.000015471856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012386836,0.00018450047,0.000026915282,0.0000064391247,0.000054295913,0.00004097878,0.00013155185,0.017013507,0.0029046983,0.36265102,0.00056564994,0.61640805],"study_design_scores_gemma":[0.000114430375,0.00003789762,0.0004240433,0.000034840956,0.000010197193,0.0007041946,0.00006852962,0.30588418,0.037715305,0.6464106,0.008452693,0.00014309568],"about_ca_topic_score_codex":0.0000014543585,"about_ca_topic_score_gemma":3.5611035e-7,"teacher_disagreement_score":0.61626494,"about_ca_system_score_codex":0.000062558975,"about_ca_system_score_gemma":0.00033290018,"threshold_uncertainty_score":0.44329986},"labels":[],"label_agreement":null},{"id":"W4395455684","doi":"10.1142/s1469026824500081","title":"A Hybrid Method for Multiple Sclerosis Lesion Segmentation Using Wavelet and Dense U-Net","year":2024,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Pattern recognition (psychology); Wavelet; Deep learning; Lesion; Image segmentation; Computer vision; Medicine; Pathology","score_opus":0.15564298600911705,"score_gpt":0.3883873247729894,"score_spread":0.23274433876387232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395455684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054480817,0.00020138569,0.9433222,0.0013232034,0.00027026967,0.00027307592,0.00006942723,0.000026900136,0.00003274334],"genre_scores_gemma":[0.9244742,0.00030947282,0.07445876,0.00041214257,0.00022963164,0.00004876121,0.000015005452,0.000013703911,0.000038348368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883646,0.000057796005,0.00044215246,0.00024991645,0.00032119875,0.000092503105],"domain_scores_gemma":[0.99814236,0.0011679382,0.00020889974,0.000053413405,0.00035133725,0.00007605684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003230372,0.00010527348,0.000110147594,0.00028123817,0.00015644745,0.00025730138,0.000159009,0.000031839616,0.000016145901],"category_scores_gemma":[0.00016507847,0.000098863326,0.00007150846,0.00015157825,0.00008819565,0.0003538701,0.000032727374,0.000121380675,0.0000058906176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010945951,0.00010997996,0.000036926387,0.00004590498,0.000058537258,0.0000076039105,0.00035616715,0.029295085,0.20711577,0.06085784,0.00024959483,0.70175713],"study_design_scores_gemma":[0.0002378778,0.0000766508,0.000410059,0.00010891129,0.00003888656,0.0009693208,0.00020439866,0.7824937,0.11773161,0.090494916,0.0070918803,0.00014179618],"about_ca_topic_score_codex":0.0000065884856,"about_ca_topic_score_gemma":0.0000011812302,"teacher_disagreement_score":0.8699933,"about_ca_system_score_codex":0.0000740619,"about_ca_system_score_gemma":0.000080711914,"threshold_uncertainty_score":0.40315294},"labels":[],"label_agreement":null}]}